Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEJ Transactions on Electronics Information and Systems

Quantum Backup Protocol by Using Quantum Error Correcting Code for Specific Position Errors

Hiroyuki Nanjo, Tadashi Oohashi, Tsuyoshi Sasaki Usuda, Ichi Takumi

Published Jan 1, 2006• 0 citations
Publisher

Abstract

A class of protocols for output with keeping an operation of a quantum channel is considered as an application of quantum error correcting codes for specific position errors.
DOI
10.1541/ieejeiss.126.1535

Related papers

Construction of Quantum Error Correcting Code for Specific Position Errors

Shogo Usami

Quantum error correcting codes for specific position errors, which are a different type from ordinary quantum error correcting codes, are proposed. The quantum Hamming bound is modified to apply to such codes. Furthermore, an example of the code which breaks the modified quantum Hamming bound is shown.

AIP conference proceedings•Jan 1, 2004•0 citations

Stabilizer Codes and Quantum Error Correction

Daniel Gottesman

Controlling operational errors and decoherence is one of the major challenges facing the field of quantum computation and other attempts to create specified many-particle entangled states. The field of quantum error correction has developed to meet this challenge. A group-theoretical structure and associated subclass of quantum codes, the stabilizer codes, has proved particularly fruitful in producing codes and in understanding the structure of both specific codes and classes of codes. I will give an overview of the field of quantum error correction and the formalism of stabilizer codes. In the context of stabilizer codes, I will discuss a number of known codes, the capacity of a quantum channel, bounds on quantum codes, and fault-tolerant quantum computation.

arXiv:quant-ph/9705052•May 28, 1997•753 citations

Stabilizer Codes and Quantum Error Correction

Daniel Gottesman

Controlling operational errors and decoherence is one of the major challenges facing the field of quantum computation and other attempts to create specified many-particle entangled states. The field of quantum error correction has developed to meet this challenge. A group-theoretical structure and associated subclass of quantum codes, the stabilizer codes, has proved particularly fruitful in producing codes and in understanding the structure of both specific codes and classes of codes. I will give an overview of the field of quantum error correction and the formalism of stabilizer codes. In the context of stabilizer codes, I will discuss a number of known codes, the capacity of a quantum channel, bounds on quantum codes, and fault-tolerant quantum computation.

•May 28, 1997•1,237 citations

Quantum error-correcting codes and devices

Daniel Gottesman

A method of forming quantum error-correcting codes by first forming a stabilizer for a Hilbert space. A quantum information processing device can be formed to implement such quantum codes.

•Jan 23, 2023•0 citations

Sufficient conditions and constraints for reversing general quantum errors

Alvin Gonzales, Daniel Dilley, Mark Byrd

Reversing the effects of a quantum evolution, for example, as is done in error correction, is an important task for controlling quantum systems in order to produce reliable quantum devices. When the evolution is governed by a completely positive map, there exist reversibility conditions, known as the quantum error correcting code conditions, which are necessary and sufficient conditions for the reversibility of a quantum operation on a subspace, the code space. However, if we suppose that the evolution is not described by a completely positive map, necessary and sufficient conditions are not known. Here we consider evolutions that do not necessarily correspond to a completely positive map. We prove that the completely positive map error correcting code conditions can lead to a code space that is not in the domain of the map, meaning that the output of the map is not positive. A corollary to our theorem provides a class of relevant examples. Finally, we provide a set of sufficient conditions that will enable the use of quantum error correcting code conditions while ensuring positivity.

arXiv:2007.11083•Physical Review A•Dec 21, 2020•3 citations

Turbo codes for quantum key distribution (QKD) applications

F. Vatta, Raffaele Romano, Maria Teresa Delgado Alizo

This paper investigates further on Quantum Key Distribution (QKD) protocols based on classical error-correcting codes, previously proposed by the authors. In [1], the classic channel coding techniques were shown to be suitable, in particular conditions, instead of quantum error-correcting codes, for correcting errors that occur during the exchange of a cryptographic key between two authorized users. To this end, systematic parallel concatenated codes, also known as turbo codes, were proposed in [1]. In this paper we address the properties that the systematic parallel concatenated codes must have in order to be successfully used in a QKD protocol. In particular, we address the problem, not considered in [1], that the constituent codes used in the parallel concatenation scheme must be such that the information sequence cannot be easily recovered from the encoder output sequences. In fact, the parallel classical channel on which to transmit only the redundancy bits is highly reliable but also public, i.e., very vulnerable as far as the attack attempts of a possible attacker are concerned.

International Symposium on Applied Sciences in Biomedical and Communication Technologies•Oct 26, 2011•3 citations
Controlling operational errors and decoherence is one of the major challenges facing the field of quantum computation and other attempts to create specified many-particle entangled states. The field of quantum error correction has developed to meet this challenge. A group-theoretical structure and associated subclass of quantum codes, the stabilizer codes, has proved particularly fruitful in producing codes and in understanding the structure of both specific codes and classes of codes. I will give an overview of the field of quantum error correction and the formalism of stabilizer codes. In the context of stabilizer codes, I will discuss a number of known codes, the capacity of a quantum channel, bounds on quantum codes, and fault-tolerant quantum computation.
Controlling operational errors and decoherence is one of the major challenges facing the field of quantum computation and other attempts to create specified many-particle entangled states. The field of quantum error correction has developed to meet this challenge. A group-theoretical structure and associated subclass of quantum codes, the stabilizer codes, has proved particularly fruitful in producing codes and in understanding the structure of both specific codes and classes of codes. I will give an overview of the field of quantum error correction and the formalism of stabilizer codes. In the context of stabilizer codes, I will discuss a number of known codes, the capacity of a quantum channel, bounds on quantum codes, and fault-tolerant quantum computation.
Reversing the effects of a quantum evolution, for example, as is done in error correction, is an important task for controlling quantum systems in order to produce reliable quantum devices. When the evolution is governed by a completely positive map, there exist reversibility conditions, known as the quantum error correcting code conditions, which are necessary and sufficient conditions for the reversibility of a quantum operation on a subspace, the code space. However, if we suppose that the evolution is not described by a completely positive map, necessary and sufficient conditions are not known. Here we consider evolutions that do not necessarily correspond to a completely positive map. We prove that the completely positive map error correcting code conditions can lead to a code space that is not in the domain of the map, meaning that the output of the map is not positive. A corollary to our theorem provides a class of relevant examples. Finally, we provide a set of sufficient conditions that will enable the use of quantum error correcting code conditions while ensuring positivity.
This paper investigates further on Quantum Key Distribution (QKD) protocols based on classical error-correcting codes, previously proposed by the authors. In [1], the classic channel coding techniques were shown to be suitable, in particular conditions, instead of quantum error-correcting codes, for correcting errors that occur during the exchange of a cryptographic key between two authorized users. To this end, systematic parallel concatenated codes, also known as turbo codes, were proposed in [1]. In this paper we address the properties that the systematic parallel concatenated codes must have in order to be successfully used in a QKD protocol. In particular, we address the problem, not considered in [1], that the constituent codes used in the parallel concatenation scheme must be such that the information sequence cannot be easily recovered from the encoder output sequences. In fact, the parallel classical channel on which to transmit only the redundancy bits is highly reliable but also public, i.e., very vulnerable as far as the attack attempts of a possible attacker are concerned.