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

arXiv:quant-ph/0609196 · Journal of Physics A Mathematical and Theoretical

Asymptotic correctability of Bell-diagonal qudit states and lower bounds on tolerable error probabilities in quantum cryptography

Kedar S Ranade, G. Alber

Published Dec 6, 2006• 6 citations
arXivHTMLPDF

Abstract

The concept of asymptotic correctability of Bell-diagonal quantum states is generalized to elementary quantum systems of higher dimensions. Based on these results basic properties of quantum state purification protocols are investigated which are capable of purifying tensor products of Bell-diagonal states and which are based on B -steps of the Gottesman-Lo-type with the subsequent application of a Calderbank–Shor–Steane quantum code. Consequences for maximum tolerable error rates of quantum cryptographic protocols are discussed.

DOI
10.1088/1751-8113/40/1/008

Related papers

Asymptotic correctability of Bell-diagonal quantum states and maximum tolerable bit-error rates

Kedar S. Ranade, G. Alber

The general conditions are discussed which quantum state purification protocols have to fulfil in order to be capable of purifying Bell-diagonal qubit-pair states, provided they consist of steps that map Bell-diagonal states to Bell-diagonal states and they finally apply a suitably chosen Calderbank–Shor–Steane code to the outcome of such steps. As a main result a condition on asymptotic correctability is presented, which relates this problem to the magnitude of a characteristic exponent governing the relation between bit and phase errors under the purification steps. This condition allows a straightforward determination of maximum tolerable bit-error rates of quantum key distribution protocols whose security analysis can be reduced to the purification of Bell-diagonal states.

arXiv:quant-ph/0510041•Journal of Physics A Mathematical and General•Feb 1, 2006•15 citations

Symmetric extendibility for qudits and tolerable error rates in quantum cryptography

Kedar S. Ranade

Symmetric extendibility of quantum states has recently drawn attention in the context of quantum cryptography to judge whether quantum states shared between two distant parties can be purified by means of one-way error correction protocols. In this paper we study the symmetric extendibility in a specific class of two-qudit states, i.e., states composed of two $d$-level systems, in order to find upper bounds on tolerable error rates for a wide class of qudit-based quantum cryptographic protocols using two-way error correction. In important cases these bounds coincide with previously known lower bounds, thereby proving sharpness of these bounds in arbitrary finite-dimensional systems.

arXiv:0906.0163•Physical Review A•Aug 3, 2009•9 citations

Quantum Error Correction

Ping Dong, Jinsoo Kim

We consider quantum error-correcting codes over alphabets of arbitrary size. We generalize quantum stabilizer codes and develop Calderbank-Shor-Steane construction over quantum systems of arbitrary dimensions using the group structure of alphabets. We also develop a methodology systematically conjoining error-correcting codes into a new class of error-correcting codes. With the help of these methods we give several ways to construct quantum maximum distance separable (MDS) codes and present many families of quantum MDS codes.

•Jul 6, 2005•0 citations

Fault-Tolerant Quantum Computation with Constant Error Rate

Dorit Aharonov, Michael Ben-Or

This paper shows that quantum computation can be made fault-tolerant against errors and inaccuracies when $\eta$, the probability for an error in a qubit or a gate, is smaller than a constant threshold $\eta_c$. This result improves on Shor's result [Proceedings of the 37th Symposium on the Foundations of Computer Science, IEEE, Los Alamitos, CA, 1996, pp. 56–65], which shows how to perform fault-tolerant quantum computation when the error rate $\eta$ decays polylogarithmically with the size of the computation, an assumption which is physically unreasonable. The cost of making the quantum circuit fault-tolerant in our construction is polylogarithmic in time and space. Our result holds for a very general local noise model, which includes probabilistic errors, decoherence, amplitude damping, depolarization, and systematic inaccuracies in the gates. Moreover, we allow exponentially decaying correlations between the errors both in space and in time. Fault-tolerant computation can be performed with any universal set of gates. The result also holds for quantum particles with $p>2$ states, namely, p-qudits, and is also generalized to one-dimensional quantum computers with only nearest-neighbor interactions. No measurements, or classical operations, are required during the quantum computation. We estimate the threshold of our construction to be $\eta_c\simeq 10^{-6}$, in the best case. By this we show that local noise is in principle not an obstacle for scalable quantum computation. The main ingredient of our proof is the computation on states encoded by a quantum error correcting code (QECC). To this end we introduce a special class of Calderbank–Shor–Steane (CSS) codes, called polynomial codes (the quantum analogue of Reed–Solomon codes). Their nice algebraic structure allows all of the encoded gates to be transversal. We also provide another version of the proof which uses more general CSS codes, but its encoded gates are slightly less elegant. To achieve fault tolerance, we encode the quantum circuit by another circuit by using one of these QECCs. This step is repeated polyloglog many times, each step slightly improving the effective error rate, to achieve the desired reliability. The resulting circuit exhibits a hierarchical structure, and for the analysis of its robustness we borrow terminology from Khalfin and Tsirelson [Found. Phys., 22 (1992), pp. 879–948] and Gács [Advances in Computing Research: A Research Annual: Randomness and Computation, JAI Press, Greenwich, CT, 1989]. The paper is to a large extent self-contained. In particular, we provide simpler proofs for many of the known results we use, such as the fact that it suffices to correct for bit-flips and phase-flips, the correctness of CSS codes, and the fact that two-qubit gates are universal, together with their extensions to higher-dimensional particles. We also provide full proofs of the universality of the sets of gates we use (the proof of universality was missing in Shor's paper). This paper thus provides a self-contained and complete proof of universal fault-tolerant quantum computation in the presence of local noise.

arXiv:quant-ph/9906129•SIAM Journal on Computing•Jan 1, 2008•806 citations

Geometrical Constructions of Purity Testing Protocols and Their Applications to Quantum Communication

Róbert Trényi, Simeon Ball, David G. Glynn +1 more

Purity testing protocols (PTPs), also known as Bell state testing protocols, i.e., protocols that decide with high probability whether or not a distributed bipartite quantum state is a tensor product of Bell states, have been proven to be a useful tool in many quantum communication applications. In this paper, we provide geometrical constructions for such protocols that originate directly from classical linear error correcting codes (LECCs), in a way that the properties of the resulting PTP are completely determined from those of the LECC used in the construction. We investigate the implications of our results in various quantum communication tasks, including error detection, entanglement purification for general quantum error models and quantum message authentication.

arXiv:2503.14003•IEEE Transactions on Information Theory•Mar 27, 2026•2 citations

Calderbank-Shor-Steane codes on group-valued qudits

Ben T. McDonough, Jian-Hao Zhang, Victor V. Albert +1 more

Calderbank-Shor-Steane (CSS) codes are a versatile quantum error-correcting family built out of commuting $X$- and $Z$-type checks. We introduce CSS-like codes on $G$-valued qudits for any finite group $G$ that reduce to qubit CSS codes for $G = \mathbb{Z}_2$ yet generalize the Kitaev quantum double model for general groups. The $X$-checks of our group-CSS codes correspond to left and/or right multiplication by group elements, while $Z$-checks project onto solutions to group word equations. We describe quantum-double models on oriented two-dimensional CW complexes (which need not cellulate a manifold) and prove that, when $G$ is non-Abelian and simple, every $G$-covariant group-CSS code with suitably upper-bounded $Z$-check weight and lower-bounded $Z$-distance reduces to a CW quantum double. We describe the codespace and logical operators of CW quantum doubles via the same intuition used to obtain logical structure of surface codes. We obtain distance bounds for codes on non-Abelian simple groups from the graph underlying the CW complex, and construct intrinsically non-Abelian code families with asymptotically optimal rate and distances. Adding "ghost vertices" to the CW complex generalizes quantum double models with defects and rough boundary conditions whose logical structure can be understood without reference to non-Abelian anyons or defects. Several non-invertible symmetry-protected topological states, both with ordinary and higher-form symmetries, are the unique codewords of simply-connected CW quantum doubles with a single ghost vertex.

quant-pharXiv:2602.19558•Feb 24, 2026•4 citations
The concept of asymptotic correctability of Bell-diagonal quantum states is generalized to elementary quantum systems of higher dimensions. Based on these results basic properties of quantum state purification protocols are investigated which are capable of purifying tensor products of Bell-diagonal states and which are based on B -steps of the Gottesman-Lo-type with the subsequent application of a Calderbank–Shor–Steane quantum code. Consequences for maximum tolerable error rates of quantum cryptographic protocols are discussed.
The general conditions are discussed which quantum state purification protocols have to fulfil in order to be capable of purifying Bell-diagonal qubit-pair states, provided they consist of steps that map Bell-diagonal states to Bell-diagonal states and they finally apply a suitably chosen Calderbank–Shor–Steane code to the outcome of such steps. As a main result a condition on asymptotic correctability is presented, which relates this problem to the magnitude of a characteristic exponent governing the relation between bit and phase errors under the purification steps. This condition allows a straightforward determination of maximum tolerable bit-error rates of quantum key distribution protocols whose security analysis can be reduced to the purification of Bell-diagonal states.
Symmetric extendibility of quantum states has recently drawn attention in the context of quantum cryptography to judge whether quantum states shared between two distant parties can be purified by means of one-way error correction protocols. In this paper we study the symmetric extendibility in a specific class of two-qudit states, i.e., states composed of two ddd-level systems, in order to find upper bounds on tolerable error rates for a wide class of qudit-based quantum cryptographic protocols using two-way error correction. In important cases these bounds coincide with previously known lower bounds, thereby proving sharpness of these bounds in arbitrary finite-dimensional systems.
We consider quantum error-correcting codes over alphabets of arbitrary size. We generalize quantum stabilizer codes and develop Calderbank-Shor-Steane construction over quantum systems of arbitrary dimensions using the group structure of alphabets. We also develop a methodology systematically conjoining error-correcting codes into a new class of error-correcting codes. With the help of these methods we give several ways to construct quantum maximum distance separable (MDS) codes and present many families of quantum MDS codes.
This paper shows that quantum computation can be made fault-tolerant against errors and inaccuracies when η\etaη, the probability for an error in a qubit or a gate, is smaller than a constant threshold ηc\eta_cηc​. This result improves on Shor's result [Proceedings of the 37th Symposium on the Foundations of Computer Science, IEEE, Los Alamitos, CA, 1996, pp. 56–65], which shows how to perform fault-tolerant quantum computation when the error rate η\etaη decays polylogarithmically with the size of the computation, an assumption which is physically unreasonable. The cost of making the quantum circuit fault-tolerant in our construction is polylogarithmic in time and space. Our result holds for a very general local noise model, which includes probabilistic errors, decoherence, amplitude damping, depolarization, and systematic inaccuracies in the gates. Moreover, we allow exponentially decaying correlations between the errors both in space and in time. Fault-tolerant computation can be performed with any universal set of gates. The result also holds for quantum particles with p>2p>2p>2 states, namely, p-qudits, and is also generalized to one-dimensional quantum computers with only nearest-neighbor interactions. No measurements, or classical operations, are required during the quantum computation. We estimate the threshold of our construction to be ηc≃10−6\eta_c\simeq 10^{-6}ηc​≃10−6, in the best case. By this we show that local noise is in principle not an obstacle for scalable quantum computation. The main ingredient of our proof is the computation on states encoded by a quantum error correcting code (QECC). To this end we introduce a special class of Calderbank–Shor–Steane (CSS) codes, called polynomial codes (the quantum analogue of Reed–Solomon codes). Their nice algebraic structure allows all of the encoded gates to be transversal. We also provide another version of the proof which uses more general CSS codes, but its encoded gates are slightly less elegant. To achieve fault tolerance, we encode the quantum circuit by another circuit by using one of these QECCs. This step is repeated polyloglog many times, each step slightly improving the effective error rate, to achieve the desired reliability. The resulting circuit exhibits a hierarchical structure, and for the analysis of its robustness we borrow terminology from Khalfin and Tsirelson [Found. Phys., 22 (1992), pp. 879–948] and Gács [Advances in Computing Research: A Research Annual: Randomness and Computation, JAI Press, Greenwich, CT, 1989]. The paper is to a large extent self-contained. In particular, we provide simpler proofs for many of the known results we use, such as the fact that it suffices to correct for bit-flips and phase-flips, the correctness of CSS codes, and the fact that two-qubit gates are universal, together with their extensions to higher-dimensional particles. We also provide full proofs of the universality of the sets of gates we use (the proof of universality was missing in Shor's paper). This paper thus provides a self-contained and complete proof of universal fault-tolerant quantum computation in the presence of local noise.
Purity testing protocols (PTPs), also known as Bell state testing protocols, i.e., protocols that decide with high probability whether or not a distributed bipartite quantum state is a tensor product of Bell states, have been proven to be a useful tool in many quantum communication applications. In this paper, we provide geometrical constructions for such protocols that originate directly from classical linear error correcting codes (LECCs), in a way that the properties of the resulting PTP are completely determined from those of the LECC used in the construction. We investigate the implications of our results in various quantum communication tasks, including error detection, entanglement purification for general quantum error models and quantum message authentication.
Calderbank-Shor-Steane (CSS) codes are a versatile quantum error-correcting family built out of commuting XXX- and ZZZ-type checks. We introduce CSS-like codes on GGG-valued qudits for any finite group GGG that reduce to qubit CSS codes for G=Z2G = \mathbb{Z}_2G=Z2​ yet generalize the Kitaev quantum double model for general groups. The XXX-checks of our group-CSS codes correspond to left and/or right multiplication by group elements, while ZZZ-checks project onto solutions to group word equations. We describe quantum-double models on oriented two-dimensional CW complexes (which need not cellulate a manifold) and prove that, when GGG is non-Abelian and simple, every GGG-covariant group-CSS code with suitably upper-bounded ZZZ-check weight and lower-bounded ZZZ-distance reduces to a CW quantum double. We describe the codespace and logical operators of CW quantum doubles via the same intuition used to obtain logical structure of surface codes. We obtain distance bounds for codes on non-Abelian simple groups from the graph underlying the CW complex, and construct intrinsically non-Abelian code families with asymptotically optimal rate and distances. Adding "ghost vertices" to the CW complex generalizes quantum double models with defects and rough boundary conditions whose logical structure can be understood without reference to non-Abelian anyons or defects. Several non-invertible symmetry-protected topological states, both with ordinary and higher-form symmetries, are the unique codewords of simply-connected CW quantum doubles with a single ghost vertex.