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

Wiley eBooks

Purification

Rodney Van Meter

Published Apr 14, 2014• 0 citations
Publisher

Abstract

Purification gives us an interim tool for improving the fidelity of quantum states. This chapter discusses purification from the practical point of view of the procedures themselves, with an eye toward actual implementations in software with the accompanying classical communication protocols. A complete purification protocol can be described in terms of: (i) the number and type of input states; (ii) the test procedure for certain propositions; and (iii) the scheduling algorithm used to select states for participation in purification. Most commonly, the required input states are two imperfect Bell pairs; with the goal being to produce one output Bell pair of higher fidelity. The chapter focuses on density matrix representation of the system state, rather than the state vector. It describes a framework for the classical network protocols required to control the operation of purification in a distributed fashion. The experiments to demonstrate purification are also discussed in detail.

DOI
10.1002/9781118648919.ch9

Related papers

Design of an Entanglement Purification Protocol Selection Module

Yue Shi, Chenxu Liu, Samuel Stein +3 more

Entanglement purification protocols, designed to improve the fidelity of Bell states over quantum networks for inter-node communications, have attracted significant attention over the last few decades. These protocols have great potential to resolve a core challenge in quantum networking of generating high-fidelity Bell states. However, previous studies focused on the theoretical discussion with limited consideration of realistic errors. Studies of dynamically selecting the right purification protocol under various realistic errors that occur in practice have yet to be performed. In this work, we study the performance of various purification protocols under realistic errors by conducting density matrix simulations over a large suite of error models. Based on our findings of how specific error channels affect the performance of purification protocols, we propose a module that can be embedded in the quantum network. This module determines and selects the appropriate purification protocol, considering not only expected specifications from the network layer but also the capabilities of the physical layer. Finally, the performance of our proposed module is verified using two benchmark categories. Compared with the default approach and exhaustive search approach, we show a success rate approaching 90% in identifying the optimal purification protocol for our target applications.

arXiv:2405.02555•IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•6 citations

Purification and Entanglement Swapping‐Based Repeaters

Rodney Van Meter

This chapter begins by asking why the most obvious technique fails: why can't we simply send our qubit via hop-by-hop teleportation, just as we would send an IP packet over the Internet? It covers the original proposal of Dür and Briegel, with a few more modern extensions. The chapter emphasizes the protocol state machine approach, and discusses the impact of purification scheduling on performance. It examines the most obvious approach to sharing quantum data across a network: hop-by-hop teleportation of the data, as in a classical network. The value of entanglement swapping becomes clear when we recognize that purification can be done over multi-hop Bell pairs, independent of the distance and requiring only classical communication. This chapter discusses reality in detail after analyzing some of the logic problems that can occur, and the software state machines used to provide robust operation.

Wiley eBooks•Apr 14, 2014•2 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•3 citations

Purification of genuine multipartite entanglement

Marcus Huber, Martin Plesch

In tasks where multipartite entanglement plays a central role, state purification is, due to inevitable noise, a crucial part of the procedure. We consider a scenario exploiting the multipartite entanglement in a straightforward multipartite purification algorithm and compare it to bipartite purification procedures combined with state teleportation. While complete purification requires an infinite amount of input states in both cases, we show that for an imperfect output fidelity the multipartite procedure exhibits a major advantage in terms of input states used.

arXiv:1103.4294•Physical Review A•Jun 14, 2011•62 citations

Optimized Entanglement Purification

Stefan Krastanov, Victor V. Albert, Liang Jiang

We investigate novel protocols for entanglement purification of qubit Bell pairs. Employing genetic algorithms for the design of the purification circuit, we obtain shorter circuits achieving higher success rates and better final fidelities than what is currently available in the literature. We provide a software tool for analytical and numerical study of the generated purification circuits, under customizable error models. These new purification protocols pave the way to practical implementations of modular quantum computers and quantum repeaters. Our approach is particularly attentive to the effects of finite resources and imperfect local operations - phenomena neglected in the usual asymptotic approach to the problem. The choice of the building blocks permitted in the construction of the circuits is based on a thorough enumeration of the local Clifford operations that act as permutations on the basis of Bell states.

arXiv:1712.09762•Quantum•Feb 18, 2019•115 citations

Streaming quantum state purification

Andrew M. Childs, Honghao Fu, Debbie Leung +3 more

Quantum state purification is the task of recovering a nearly pure copy of an unknown pure quantum state using multiple noisy copies of the state. This basic task has applications to quantum communication over noisy channels and quantum computation with imperfect devices, but has only been studied previously for the case of qubits. We derive an efficient purification procedure based on the swap test for qudits of any dimension, starting with any initial error parameter. Treating the initial error parameter and the dimension as constants, we show that our procedure has sample complexity asymptotically optimal in the final error parameter. Our protocol has a simple recursive structure that can be applied when the states are provided one at a time in a streaming fashion, requiring only a small quantum memory to implement.

arXiv:2309.16387•Quantum•Jan 21, 2025•28 citations
Purification gives us an interim tool for improving the fidelity of quantum states. This chapter discusses purification from the practical point of view of the procedures themselves, with an eye toward actual implementations in software with the accompanying classical communication protocols. A complete purification protocol can be described in terms of: (i) the number and type of input states; (ii) the test procedure for certain propositions; and (iii) the scheduling algorithm used to select states for participation in purification. Most commonly, the required input states are two imperfect Bell pairs; with the goal being to produce one output Bell pair of higher fidelity. The chapter focuses on density matrix representation of the system state, rather than the state vector. It describes a framework for the classical network protocols required to control the operation of purification in a distributed fashion. The experiments to demonstrate purification are also discussed in detail.
Entanglement purification protocols, designed to improve the fidelity of Bell states over quantum networks for inter-node communications, have attracted significant attention over the last few decades. These protocols have great potential to resolve a core challenge in quantum networking of generating high-fidelity Bell states. However, previous studies focused on the theoretical discussion with limited consideration of realistic errors. Studies of dynamically selecting the right purification protocol under various realistic errors that occur in practice have yet to be performed. In this work, we study the performance of various purification protocols under realistic errors by conducting density matrix simulations over a large suite of error models. Based on our findings of how specific error channels affect the performance of purification protocols, we propose a module that can be embedded in the quantum network. This module determines and selects the appropriate purification protocol, considering not only expected specifications from the network layer but also the capabilities of the physical layer. Finally, the performance of our proposed module is verified using two benchmark categories. Compared with the default approach and exhaustive search approach, we show a success rate approaching 90% in identifying the optimal purification protocol for our target applications.
This chapter begins by asking why the most obvious technique fails: why can't we simply send our qubit via hop-by-hop teleportation, just as we would send an IP packet over the Internet? It covers the original proposal of Dür and Briegel, with a few more modern extensions. The chapter emphasizes the protocol state machine approach, and discusses the impact of purification scheduling on performance. It examines the most obvious approach to sharing quantum data across a network: hop-by-hop teleportation of the data, as in a classical network. The value of entanglement swapping becomes clear when we recognize that purification can be done over multi-hop Bell pairs, independent of the distance and requiring only classical communication. This chapter discusses reality in detail after analyzing some of the logic problems that can occur, and the software state machines used to provide robust operation.
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.
In tasks where multipartite entanglement plays a central role, state purification is, due to inevitable noise, a crucial part of the procedure. We consider a scenario exploiting the multipartite entanglement in a straightforward multipartite purification algorithm and compare it to bipartite purification procedures combined with state teleportation. While complete purification requires an infinite amount of input states in both cases, we show that for an imperfect output fidelity the multipartite procedure exhibits a major advantage in terms of input states used.
We investigate novel protocols for entanglement purification of qubit Bell pairs. Employing genetic algorithms for the design of the purification circuit, we obtain shorter circuits achieving higher success rates and better final fidelities than what is currently available in the literature. We provide a software tool for analytical and numerical study of the generated purification circuits, under customizable error models. These new purification protocols pave the way to practical implementations of modular quantum computers and quantum repeaters. Our approach is particularly attentive to the effects of finite resources and imperfect local operations - phenomena neglected in the usual asymptotic approach to the problem. The choice of the building blocks permitted in the construction of the circuits is based on a thorough enumeration of the local Clifford operations that act as permutations on the basis of Bell states.
Quantum state purification is the task of recovering a nearly pure copy of an unknown pure quantum state using multiple noisy copies of the state. This basic task has applications to quantum communication over noisy channels and quantum computation with imperfect devices, but has only been studied previously for the case of qubits. We derive an efficient purification procedure based on the swap test for qudits of any dimension, starting with any initial error parameter. Treating the initial error parameter and the dimension as constants, we show that our procedure has sample complexity asymptotically optimal in the final error parameter. Our protocol has a simple recursive structure that can be applied when the states are provided one at a time in a streaming fashion, requiring only a small quantum memory to implement.