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:2011.07084 · Physical Review A

Entanglement purification by counting and locating errors with entangling measurements

Ferran Riera-Sàbat, Pavel Sekatski, Alexander Pirker, Wolfgang Dür

Published Jul 21, 2021• 28 citations
arXivHTMLPDF

Abstract

We consider entanglement purification protocols for multiple copies of qubit states. We use high-dimensional auxiliary entangled systems to learn about the number and positions of errors in the noisy ensemble in an explicit and controlled way, thereby reducing the amount of noise in the ensemble and purifying the remaining states. This allows us to design entanglement purification protocols for any number of copies that work particularly well for a small number of expected errors, i.e., high fidelity of initial states. The main tool is a counter gate with which the required nonlocal information can be transferred into the high-dimensional entangled qudit auxiliary states. We compare our schemes to standard recurrence protocols that operate on pairs of copies, and hashing and breeding protocols that operate on a (asymptotically) large number of copies. Our protocols interpolate between these two regimes, leading to higher achievable fidelity and yield. We illustrate our approach for bipartite qubit states and generalize it to purify multiparty GHZ states.

DOI
10.1103/physreva.104.012419

Related papers

Entanglement-Assisted Entanglement Purification

Ferran Riera-Sàbat, Pavel Sekatski, Alexander Pirker +1 more

The efficient generation of high-fidelity entangled states is the key element for long-distance quantum communication, quantum computation, and other quantum technologies, and at the same time the most resource-consuming part in many schemes. We present a class of entanglement-assisted entanglement purification protocols that can generate high-fidelity entanglement from noisy, finite-size ensembles with improved yield and fidelity as compared to previous approaches. The scheme utilizes high-dimensional auxiliary entanglement to perform entangling nonlocal measurements and determine the number and positions of errors in an ensemble in a controlled and efficient way, without disturbing the entanglement of good pairs. Our protocols can deal with arbitrary errors, but are best suited for few errors, and work particularly well for decay noise. Our methods are applicable to moderately sized ensembles, as will be important for near term quantum devices.

arXiv:2011.07078•Physical Review Letters•Jul 21, 2021•55 citations

Efficient entanglement purification protocols for d -level systems

Jorge Miguel-Ramiro, Wolfgang Dür

We introduce entanglement purification protocols for $d$-level systems (qudits) with improved efficiency as compared to previous protocols. While we focus on protocols for bipartite systems, we also propose generalizations to multipartite qudit systems. The schemes we introduce include recurrence protocols that operate on two copies, as well as hashing protocols that operate on large ensembles. We analyze properties of the protocols with respect to minimal required fidelity and yield, and study their performance in the presence of noise and imperfections. We determine error thresholds and study the dependence on local dimension. We find that our schemes do not only outperform previous approaches, but also show an improved robustness and better efficiency with increasing dimension. While error thresholds for different system sizes are not directly comparable, our results nevertheless suggest that quantum information processing using qudits, in particular for long-distance quantum communication, may offer an advantage over approaches based on qubit systems.

arXiv:1806.10162•Physical Review A•Oct 8, 2018•48 citations

Arbitrary high-dimensional entanglement purification with the superposition of paths

Zi-Han Zheng, Wen-Qiang Liu, Chen-Ming Bai +1 more

High-dimensional quantum entanglement offers significant advantages over its two-dimensional counterparts in various quantum information processing tasks. We propose a scalable method for implementing an arbitrary high-dimensional entanglement purification protocol (HDEPP) using path superposition. By selecting appropriate single-qudit gates, qudit-flip errors and phase-flip errors can be purified. Counterintuitively, the HDEPP becomes more robust for higher-dimensional systems and exhibits enhanced purification fidelity as the dimension increases. Our HDEPP not only requires fewer operational resources but also in principle can achieve unity fidelity through multiple rounds of iteration. Furthermore, we develop feasible optical schemes to purify the frequency degree of freedom of photons suffering from qudit-flip and phase-flip errors using hyperentanglement. This work paves the way toward high-dimensional quantum communication and quantum networks.

quant-pharXiv:2609.37136•Optics Express•Sep 30, 2026•0 citations

Efficient entanglement purification based on noise guessing decoding

André Roque, Diogo Cruz, Francisco A. Monteiro +1 more

In this paper, we propose a novel bipartite entanglement purification protocol built upon hashing and upon the guessing random additive noise decoding (GRAND) approach recently devised for classical error correction codes. Our protocol offers substantial advantages over existing hashing protocols, requiring fewer qubits for purification, achieving higher fidelities, and delivering better yields with reduced computational costs. We provide numerical and semi-analytical results to corroborate our findings and provide a detailed comparison with the hashing protocol of Bennet et al. Although that pioneering work devised performance bounds, it did not offer an explicit construction for implementation. The present work fills that gap, offering both an explicit and more efficient purification method. We demonstrate that our protocol is capable of purifying states with noise on the order of 10% per Bell pair even with a small ensemble of 16 pairs. The work explores a measurement-based implementation of the protocol to address practical setups with noise. This work opens the path to practical and efficient entanglement purification using hashing-based methods with feasible computational costs. Compared to the original hashing protocol, the proposed method can achieve some desired fidelity with a number of initial resources up to one hundred times smaller. Therefore, the proposed method seems well-fit for future quantum networks with a limited number of resources and entails a relatively low computational overhead.

arXiv:2310.19914•Quantum•Sep 19, 2024•4 citations

Measurement-based entanglement purification for entangled coherent states

Peishun Yan, Lan Zhou, Wei Zhong +1 more

The entangled coherent states (ECSs) have been widely used to realize quantum information processing tasks. However, the ECSs may suffer from photon loss and decoherence due to the inherent noise in quantum channel, which may degrade the fidelity of ECSs. To overcome these obstacles, we present a measurement-based entanglement purification protocol (MBEPP) for ECSs to distill some high-quality ECSs from a large number of low-quality copies. We first show the principle of this MBEPP without considering the photon loss. After that, we prove that this MBEPP is feasible to correct the error resulted from the photon loss. Additionally, this MBEPP only requires to operate the Bell state measurement without performing local two-qubit gates on the noisy pairs and the purified high-quality ECSs can be preserved for other applications. This MBEPP may have application potential in the implementation of long-distance quantum communication.

Frontiers of Physics•Aug 11, 2021•35 citations

Optimal Interpolation of Entanglement Purification Protocols

Matthew Barber, Stefano Pirandola

Bipartite entanglement purification is the conversion of copies of weakly entangled pairs shared between two separated parties into a smaller number of strongly entangled shared pairs using only local operations and classical communication. Choosing between different entanglement purification protocols generally involves weighing up a trade-off between the ratio of strongly entangled pairs produced to weakly entangled pairs consumed, which we call the rate of the protocol, and the degree of the entanglement of the strongly entangled pairs, typically measured by the fidelity of those pairs to maximally entangled states. By randomly choosing a protocol according to a probability distribution over a list of protocols for each pair we want to produce, we can achieve rates and fidelities not achieved by any of the original protocols. Here, we show how to choose this distribution to maximize the rate at which we produce qubit pairs with a given fidelity to a Bell state or, equivalently, to maximize the fidelity to a Bell state of the qubit pairs produced at a given rate. We investigate both the asymptotic case, where the number of initial pairs goes to infinity, and the finite-size regime, where protocols are restricted to a finite number of weakly entangled pairs.

quant-pharXiv:2511.09657•Physical Review A•Nov 14, 2025•0 citations
We consider entanglement purification protocols for multiple copies of qubit states. We use high-dimensional auxiliary entangled systems to learn about the number and positions of errors in the noisy ensemble in an explicit and controlled way, thereby reducing the amount of noise in the ensemble and purifying the remaining states. This allows us to design entanglement purification protocols for any number of copies that work particularly well for a small number of expected errors, i.e., high fidelity of initial states. The main tool is a counter gate with which the required nonlocal information can be transferred into the high-dimensional entangled qudit auxiliary states. We compare our schemes to standard recurrence protocols that operate on pairs of copies, and hashing and breeding protocols that operate on a (asymptotically) large number of copies. Our protocols interpolate between these two regimes, leading to higher achievable fidelity and yield. We illustrate our approach for bipartite qubit states and generalize it to purify multiparty GHZ states.
The efficient generation of high-fidelity entangled states is the key element for long-distance quantum communication, quantum computation, and other quantum technologies, and at the same time the most resource-consuming part in many schemes. We present a class of entanglement-assisted entanglement purification protocols that can generate high-fidelity entanglement from noisy, finite-size ensembles with improved yield and fidelity as compared to previous approaches. The scheme utilizes high-dimensional auxiliary entanglement to perform entangling nonlocal measurements and determine the number and positions of errors in an ensemble in a controlled and efficient way, without disturbing the entanglement of good pairs. Our protocols can deal with arbitrary errors, but are best suited for few errors, and work particularly well for decay noise. Our methods are applicable to moderately sized ensembles, as will be important for near term quantum devices.
We introduce entanglement purification protocols for ddd-level systems (qudits) with improved efficiency as compared to previous protocols. While we focus on protocols for bipartite systems, we also propose generalizations to multipartite qudit systems. The schemes we introduce include recurrence protocols that operate on two copies, as well as hashing protocols that operate on large ensembles. We analyze properties of the protocols with respect to minimal required fidelity and yield, and study their performance in the presence of noise and imperfections. We determine error thresholds and study the dependence on local dimension. We find that our schemes do not only outperform previous approaches, but also show an improved robustness and better efficiency with increasing dimension. While error thresholds for different system sizes are not directly comparable, our results nevertheless suggest that quantum information processing using qudits, in particular for long-distance quantum communication, may offer an advantage over approaches based on qubit systems.
High-dimensional quantum entanglement offers significant advantages over its two-dimensional counterparts in various quantum information processing tasks. We propose a scalable method for implementing an arbitrary high-dimensional entanglement purification protocol (HDEPP) using path superposition. By selecting appropriate single-qudit gates, qudit-flip errors and phase-flip errors can be purified. Counterintuitively, the HDEPP becomes more robust for higher-dimensional systems and exhibits enhanced purification fidelity as the dimension increases. Our HDEPP not only requires fewer operational resources but also in principle can achieve unity fidelity through multiple rounds of iteration. Furthermore, we develop feasible optical schemes to purify the frequency degree of freedom of photons suffering from qudit-flip and phase-flip errors using hyperentanglement. This work paves the way toward high-dimensional quantum communication and quantum networks.
In this paper, we propose a novel bipartite entanglement purification protocol built upon hashing and upon the guessing random additive noise decoding (GRAND) approach recently devised for classical error correction codes. Our protocol offers substantial advantages over existing hashing protocols, requiring fewer qubits for purification, achieving higher fidelities, and delivering better yields with reduced computational costs. We provide numerical and semi-analytical results to corroborate our findings and provide a detailed comparison with the hashing protocol of Bennet et al. Although that pioneering work devised performance bounds, it did not offer an explicit construction for implementation. The present work fills that gap, offering both an explicit and more efficient purification method. We demonstrate that our protocol is capable of purifying states with noise on the order of 10% per Bell pair even with a small ensemble of 16 pairs. The work explores a measurement-based implementation of the protocol to address practical setups with noise. This work opens the path to practical and efficient entanglement purification using hashing-based methods with feasible computational costs. Compared to the original hashing protocol, the proposed method can achieve some desired fidelity with a number of initial resources up to one hundred times smaller. Therefore, the proposed method seems well-fit for future quantum networks with a limited number of resources and entails a relatively low computational overhead.
The entangled coherent states (ECSs) have been widely used to realize quantum information processing tasks. However, the ECSs may suffer from photon loss and decoherence due to the inherent noise in quantum channel, which may degrade the fidelity of ECSs. To overcome these obstacles, we present a measurement-based entanglement purification protocol (MBEPP) for ECSs to distill some high-quality ECSs from a large number of low-quality copies. We first show the principle of this MBEPP without considering the photon loss. After that, we prove that this MBEPP is feasible to correct the error resulted from the photon loss. Additionally, this MBEPP only requires to operate the Bell state measurement without performing local two-qubit gates on the noisy pairs and the purified high-quality ECSs can be preserved for other applications. This MBEPP may have application potential in the implementation of long-distance quantum communication.
Bipartite entanglement purification is the conversion of copies of weakly entangled pairs shared between two separated parties into a smaller number of strongly entangled shared pairs using only local operations and classical communication. Choosing between different entanglement purification protocols generally involves weighing up a trade-off between the ratio of strongly entangled pairs produced to weakly entangled pairs consumed, which we call the rate of the protocol, and the degree of the entanglement of the strongly entangled pairs, typically measured by the fidelity of those pairs to maximally entangled states. By randomly choosing a protocol according to a probability distribution over a list of protocols for each pair we want to produce, we can achieve rates and fidelities not achieved by any of the original protocols. Here, we show how to choose this distribution to maximize the rate at which we produce qubit pairs with a given fidelity to a Bell state or, equivalently, to maximize the fidelity to a Bell state of the qubit pairs produced at a given rate. We investigate both the asymptotic case, where the number of initial pairs goes to infinity, and the finite-size regime, where protocols are restricted to a finite number of weakly entangled pairs.