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/0510041 · Journal of Physics A Mathematical and General

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

Kedar S. Ranade, G. Alber

Published Feb 1, 2006• 14 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1088/0305-4470/39/7/014

Related papers

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

Kedar S Ranade, Gernot Alber

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.

arXiv:quant-ph/0609196•Journal of Physics A Mathematical and Theoretical•Dec 6, 2006•5 citations

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

Ranade, K S, Alber, G

The concept of asymptotic correctability of Bell-diagonal quantum states is generalised 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.

•Sep 26, 2006•3 citations

Key rates for quantum key distribution protocols with asymmetric noise

Gláucia Murta, Filip Rozpędek, Jérémy Ribeiro +2 more

We consider the asymptotic key rates achieved in the simplest quantum key distribution protocols, namely, the BB84 and the six-state protocols when nonuniform noise is present in the system. We first observe that higher qubit error rates do not necessarily imply lower key rates. Second, we consider protocols with advantage distillation and show that it can be advantageous to use the basis with higher quantum bit error rate for the key generation. We then discuss the relation between advantage distillation and entanglement distillation protocols. We show that applying advantage distillation to a string of bits formed by the outcomes of measurements in the basis with a higher quantum bit error rate is closely connected to the two-to-one entanglement distillation protocol of Deutsch-Ekert-Jozsa-Macchiavello-Popescu-Sanpera [Phys. Rev. Lett. 77, 2818 (1996)]. Finally, we discuss the implications of these results for implementations of quantum key distribution.

arXiv:2002.07305•Physical Review A•Jun 11, 2020•28 citations

Conditions for entanglement purification with general two-qubit states

Juan Mauricio Torres, József Zsolt Bernád

We present the convergence study of a recurrence entanglement purification protocol using arbitrary two-qubit initial states. The protocol is based on a rank 2 projector in the Bell basis which serves as a two-qubit operation replacing the usual controlled-not gate. We show that the whole space of two-qubit density matrices is mapped onto an invariant subspace characterized by seven real parameters. By analyzing this type of density matrices we are able to find general conditions for entanglement purification in the form of two inequalities between pairs of diagonal elements and pairs of coherences. We show that purifiable initial states do not necessary require a fidelity larger than one half with respect to any maximally entangled pure state. Furthermore, we find a family of states parametrized by their concurrence that can be perfectly converted into a Bell state in just one step of the protocol with probability proportional to the square of the concurrence.

arXiv:1608.08585•Physical Review A•Nov 21, 2016•12 citations

Bounding fault-tolerant thresholds for purification and quantum computation

Alastair Kay

In this paper, we place bounds on when it is impossible to purify a noisy two-qubit state if all the gates used in the purification protocol are subject to adversarial, local, independent noise. It is found that the gate operations must be subject to less than 5.3% error. An existing proof that purification is equivalent to error correction is used to show that this bound can also be applied to concatenated error correcting codes in the presence of noisy gates, and hence gives a limit to the tolerable error rate for a fault-tolerant quantum computer formed by concatenation. This is shown to apply also to the case where error detection and postselection, as proposed by Knill, is used to enhance the threshold. We demonstrate the trade-off between gate and environmentally induced faulty rotations and qubit loss errors.

arXiv:0705.4360•Physical Review A•May 19, 2008•6 citations

Entanglement purification of any stabilizer state

Scott Glancy, Emanuel H. Knill, H. M. Vasconcelos

We present a method for multipartite entanglement purification of any stabilizer state shared by several parties. In our protocol each party measures the stabilizer operators of a quantum error-correcting code on his or her qubits. The parties exchange their measurement results, detect or correct errors, and decode the desired purified state. We give sufficient conditions on the stabilizer codes that may be used in this procedure and find that Steane's seven-qubit code is the smallest error-correcting code sufficient to purify any stabilizer state. An error-detecting code that encodes two qubits in six can also be used to purify any stabilizer state. We further specify which classes of stabilizer codes can purify which classes of stabilizer states.

arXiv:quant-ph/0606125•Physical Review A•Sep 19, 2006•45 citations
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.
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 concept of asymptotic correctability of Bell-diagonal quantum states is generalised 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 BBB-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.
We consider the asymptotic key rates achieved in the simplest quantum key distribution protocols, namely, the BB84 and the six-state protocols when nonuniform noise is present in the system. We first observe that higher qubit error rates do not necessarily imply lower key rates. Second, we consider protocols with advantage distillation and show that it can be advantageous to use the basis with higher quantum bit error rate for the key generation. We then discuss the relation between advantage distillation and entanglement distillation protocols. We show that applying advantage distillation to a string of bits formed by the outcomes of measurements in the basis with a higher quantum bit error rate is closely connected to the two-to-one entanglement distillation protocol of Deutsch-Ekert-Jozsa-Macchiavello-Popescu-Sanpera [Phys. Rev. Lett. 77, 2818 (1996)]. Finally, we discuss the implications of these results for implementations of quantum key distribution.
We present the convergence study of a recurrence entanglement purification protocol using arbitrary two-qubit initial states. The protocol is based on a rank 2 projector in the Bell basis which serves as a two-qubit operation replacing the usual controlled-not gate. We show that the whole space of two-qubit density matrices is mapped onto an invariant subspace characterized by seven real parameters. By analyzing this type of density matrices we are able to find general conditions for entanglement purification in the form of two inequalities between pairs of diagonal elements and pairs of coherences. We show that purifiable initial states do not necessary require a fidelity larger than one half with respect to any maximally entangled pure state. Furthermore, we find a family of states parametrized by their concurrence that can be perfectly converted into a Bell state in just one step of the protocol with probability proportional to the square of the concurrence.
In this paper, we place bounds on when it is impossible to purify a noisy two-qubit state if all the gates used in the purification protocol are subject to adversarial, local, independent noise. It is found that the gate operations must be subject to less than 5.3% error. An existing proof that purification is equivalent to error correction is used to show that this bound can also be applied to concatenated error correcting codes in the presence of noisy gates, and hence gives a limit to the tolerable error rate for a fault-tolerant quantum computer formed by concatenation. This is shown to apply also to the case where error detection and postselection, as proposed by Knill, is used to enhance the threshold. We demonstrate the trade-off between gate and environmentally induced faulty rotations and qubit loss errors.
We present a method for multipartite entanglement purification of any stabilizer state shared by several parties. In our protocol each party measures the stabilizer operators of a quantum error-correcting code on his or her qubits. The parties exchange their measurement results, detect or correct errors, and decode the desired purified state. We give sufficient conditions on the stabilizer codes that may be used in this procedure and find that Steane's seven-qubit code is the smallest error-correcting code sufficient to purify any stabilizer state. An error-detecting code that encodes two qubits in six can also be used to purify any stabilizer state. We further specify which classes of stabilizer codes can purify which classes of stabilizer states.