2020/04/02 by Ayumu Nakayama, Nakayama, Ayumu, Manabu Hagiwara +1 · 2 citations
Computer Science · #FOS: Computer and information sciences #FOS: Physical sciences #Information Theory (cs.IT) #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Physics (quant-ph) #Quantum-Dot Cellular Automata
paper · pdf · doi:10.48550/arxiv.2004.00814
openalex publication_date 2020/04/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, we discuss a construction method of quantum deletion error-correcting codes. First of all, we define deletion errors for quantum states, an encoder, a decoder, and two conditions which is expressed by only the combinatorial language. Then, we prove that quantum deletion error-correcting codes can be constructed by two sets that satisfy the conditions. In other words, problems that correct the deletion errors for quantum states are reduced to problems that find the sets satisfying the condition by this paper. Also, we performed experiment of the codes over IBM Quantum Experience.