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:2503.14003 · IEEE Transactions on Information Theory

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

Róbert Trényi, Simeon Ball, David G. Glynn, Marcos Curty

Published Mar 27, 2026• 2 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1109/tit.2026.3678348

Related papers

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

Kedar S Ranade, G. 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•6 citations

Entanglement purification and quantum error correction

Wolfgang Dür, Hans J. Briegel

We give a review on entanglement purification for bipartite and multipartite quantum states, with the main focus on the theoretical work carried out by our group in the last couple of years. We discuss entanglement purification in the context of quantum communication, where we emphasize its close relation to quantum error correction. Various bipartite and multipartite entanglement purification protocols are discussed, and their performance under idealized and realistic conditions is studied. Several applications of entanglement purification in quantum communication and computation are presented, which highlights the fact that entanglement purification is a fundamental tool in quantum information processing.

arXiv:0705.4165•Reports on Progress in Physics•Jul 17, 2007•347 citations

A New Error Correction Intuitive Approach in Quantum Communications Protocols

Skander Aris, Merabtine Nadjim, Malek Benslama

Abstract: Quantum Error Correction will be necessary for preserving coherent states against noise and other unwanted interactions in quantum computation and communication. We develop a general theory of quantum error correction based on encoding states into larger Hilbert spaces subject to known interactions. We obtain necessary and sufficient conditions for the perfect recovery of an encoded state after its degradation by an interaction. The conditions depend only on the behavior of the logical states. We use them to give a recovery operator independent definition of error-correcting codes. We relate this definition to four others: The existence of a left inverse of the interaction, an explicit representation of the error syndrome using tensor products, perfect recovery of the completely entangled state and an information theoretic identity. Two notions of fidelity and error for imperfect recovery are introduced, one for pure and the other for entangled states. The latter is more appropriate when using codes in a quantum memory or in applications of quantum teleportation to communication. We show that the error for entangled states is bounded linearly by the error for pure states. A formal definition of independent interactions for qubits is given. This leads to lower bounds on the number of qubits required to correct errors and a formal proof that the classical bounds on the probability of errorcorrecting codes applies to error correcting quantum codes, provided that the interaction is dominated by an identity component.

American Journal of Applied Sciences•Aug 1, 2007•3 citations

Purifying entanglement with joint measurements: principles and applications

Kai Wen, Gui‐Lu Long

In this article, we present a novel idea for entanglement purification with joint measurements, the joint entanglement purification protocol(joint-EPP). In some quantum communication tasks using entangled pairs, one party holds the whole entangled pairs at the final stage, he or she is able to perform joint measurements on the pairs. In this situation the proposed joint-EPP can improve the entanglement purification by allowing a higher tolerated error rate, faster convergence which uses less steps to achieve a high fidelity, and higher production rate which produces more number of good entangled pairs from a given number of bad entangled pairs. We have established the general correspondence between linear classical codes and the joint-EPP. It has been shown that the joint-EPP can correct errors as long as the error threshod is no larger than 0.5. The joint-EPP works even for fidelity less than 0.5 as long as it is larger than 0.25. We give several concrete examples, definitions and applications of the joint-EPP.

•Sep 27, 2006•0 citations

Extracting quantum entanglement (general entanglement purification protocols)

Andris Ambainis, Adam Smith, Ke Yang

We study the problem of extracting Einstein-Podolsky-Rosen (EPR) pairs from a general source of entanglement. Suppose Alice and Bob share a bipartite state /spl rho/ which is "reasonably close" to perfect EPR pairs. The only information Alice and Bob possess is a lower bound on the fidelity of /spl rho/ and a maximally entangled state. They wish to "purify" /spl rho/ using local operations and classical communication, and output a state that is arbitrarily close to EPR pairs. We prove that, on average, Alice and Bob cannot increase the fidelity of the input state significantly. On the other hand, there exist protocols that may fail with a small probability, and otherwise will output states arbitrarily close to EPR pairs with very high probability. These protocols come from the "purity-testing protocols" of H. Barnum et al. (2001).

arXiv:quant-ph/0110011•IEEE Conference on Computational Complexity (CCC)•Jun 25, 2003•13 citations

Breeding quantum error-correcting codes

Ying Dong, Dan Mei Hu, Sixia Yu

The stabilizer code, one major family of quantum error-correcting codes (QECC), is specified by the joint eigenspace of a commuting set of Pauli observables. It turns out that noncommuting sets of Pauli observables can be used to construct more efficient QECCs, such as the entanglement-assisted QECCs, which are built directly from any linear classical codes whose detailed properties are needed to determine the parameters of the resulting quantum codes. Here we propose another family of QECCs, namely, the breeding QECCs, that also employ noncommuting sets of Pauli observables and can be built from any classical additive codes, either linear or nonlinear, with the advantage that their parameters can be read off directly from the corresponding classical codes. Besides, since nonlinear codes are generally more efficient than linear codes, our breeding codes have better parameters than those codes built from linear codes. The terminology is justified by the fact that our QECCs are related to the ordinary QECCs in exactly the same way that the breeding protocols are related to the hashing protocols in the entanglement purification.

Physical Review A•Feb 22, 2010•5 citations
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.
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.
We give a review on entanglement purification for bipartite and multipartite quantum states, with the main focus on the theoretical work carried out by our group in the last couple of years. We discuss entanglement purification in the context of quantum communication, where we emphasize its close relation to quantum error correction. Various bipartite and multipartite entanglement purification protocols are discussed, and their performance under idealized and realistic conditions is studied. Several applications of entanglement purification in quantum communication and computation are presented, which highlights the fact that entanglement purification is a fundamental tool in quantum information processing.
Abstract: Quantum Error Correction will be necessary for preserving coherent states against noise and other unwanted interactions in quantum computation and communication. We develop a general theory of quantum error correction based on encoding states into larger Hilbert spaces subject to known interactions. We obtain necessary and sufficient conditions for the perfect recovery of an encoded state after its degradation by an interaction. The conditions depend only on the behavior of the logical states. We use them to give a recovery operator independent definition of error-correcting codes. We relate this definition to four others: The existence of a left inverse of the interaction, an explicit representation of the error syndrome using tensor products, perfect recovery of the completely entangled state and an information theoretic identity. Two notions of fidelity and error for imperfect recovery are introduced, one for pure and the other for entangled states. The latter is more appropriate when using codes in a quantum memory or in applications of quantum teleportation to communication. We show that the error for entangled states is bounded linearly by the error for pure states. A formal definition of independent interactions for qubits is given. This leads to lower bounds on the number of qubits required to correct errors and a formal proof that the classical bounds on the probability of errorcorrecting codes applies to error correcting quantum codes, provided that the interaction is dominated by an identity component.
In this article, we present a novel idea for entanglement purification with joint measurements, the joint entanglement purification protocol(joint-EPP). In some quantum communication tasks using entangled pairs, one party holds the whole entangled pairs at the final stage, he or she is able to perform joint measurements on the pairs. In this situation the proposed joint-EPP can improve the entanglement purification by allowing a higher tolerated error rate, faster convergence which uses less steps to achieve a high fidelity, and higher production rate which produces more number of good entangled pairs from a given number of bad entangled pairs. We have established the general correspondence between linear classical codes and the joint-EPP. It has been shown that the joint-EPP can correct errors as long as the error threshod is no larger than 0.5. The joint-EPP works even for fidelity less than 0.5 as long as it is larger than 0.25. We give several concrete examples, definitions and applications of the joint-EPP.
We study the problem of extracting Einstein-Podolsky-Rosen (EPR) pairs from a general source of entanglement. Suppose Alice and Bob share a bipartite state /spl rho/ which is "reasonably close" to perfect EPR pairs. The only information Alice and Bob possess is a lower bound on the fidelity of /spl rho/ and a maximally entangled state. They wish to "purify" /spl rho/ using local operations and classical communication, and output a state that is arbitrarily close to EPR pairs. We prove that, on average, Alice and Bob cannot increase the fidelity of the input state significantly. On the other hand, there exist protocols that may fail with a small probability, and otherwise will output states arbitrarily close to EPR pairs with very high probability. These protocols come from the "purity-testing protocols" of H. Barnum et al. (2001).
The stabilizer code, one major family of quantum error-correcting codes (QECC), is specified by the joint eigenspace of a commuting set of Pauli observables. It turns out that noncommuting sets of Pauli observables can be used to construct more efficient QECCs, such as the entanglement-assisted QECCs, which are built directly from any linear classical codes whose detailed properties are needed to determine the parameters of the resulting quantum codes. Here we propose another family of QECCs, namely, the breeding QECCs, that also employ noncommuting sets of Pauli observables and can be built from any classical additive codes, either linear or nonlinear, with the advantage that their parameters can be read off directly from the corresponding classical codes. Besides, since nonlinear codes are generally more efficient than linear codes, our breeding codes have better parameters than those codes built from linear codes. The terminology is justified by the fact that our QECCs are related to the ordinary QECCs in exactly the same way that the breeding protocols are related to the hashing protocols in the entanglement purification.