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 and Entanglement Swapping‐Based Repeaters

Rodney Van Meter

Published Apr 14, 2014• 2 citations
Publisher

Abstract

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.

DOI
10.1002/9781118648919.ch10

Related papers

Design and Evaluation of Communication Protocols for Quantum Repeater Networks

Luciano Aparicio

When built, quantum repeater networks will require classical network protocols to control the quantum operations. However, existing work on repeaters has focused on the quantum operations themselves, with less attention paid to the contents, semantics, ordering and reliability of the classical control messages. In this work we define and describe our implementation of the classical control protocols. The state machines and packet sequences for the three protocol layers are presented, and operation confirmed by running the protocols over simulations of the physical network. We also show that proper management of the resources in a bottleneck link allows the aggregate throughput of two end-to-end flows to substantially exceed that of a single flow. Our layered architectural framework will support independent evolution of the separate protocol layers. Networks of quantum repeaters utilize three concepts to execute a distributed algorithm that creates entangled quantum states between nodes that are far apart: a basic entanglement mechanism which depends on the physical implementation, error management (in this work, we study a method known as purification), and finally a quantum state propagation layer (here we implement entanglement swapping, which builds multi-hop connections from single-hop connections). Some researchers are investigating approaches that are substantially different from entanglement swapping [30, 24, 19]. Here we focus on swapping, but the layered architecture approach is broadly applicable, allowing other implementations to replace only a single layer in the protocol stack. Previous work primarily focused on the physical and mathematical tools for building repeaters. Classical information is also needed to enable teleportation and swapping, as many quantum operations are not deterministic, and results of quantum measurements need to be reported to distant partners before further operations can proceed. Also, operations in the middle of the network must be coordinated to route and swap properly. This requires classical messages to make operations robust, but message propagation times penalize performance. Even though this delay is usually included in repeater simulations, prior work has not defined the protocols in detail, especially with respect to how all of the nodes make consistent decisions in a timely fashion. In this work, we introduce a protocol stack for networks of quantum repeaters that considers all the necessary classical messages and which can be easily adapted for different approaches at all three protocol layers. We run simulations of competing flows on a dumbbell topology in order to increase our confidence in the behavior of our network protocols. By adjusting the fidelity thresholds required for entanglement swapping, we show that some configurations boost the aggregate throughput for multiple flows significantly above the maximum for a single flow, taking advantage of resources that would otherwise sit idle. The operation of such complex networks and such delicate tuning of the system without formal protocol definitions would not be possible. Previous work has also concentrated almost exclusively on the dedicated use of a single line or chain of repeaters, delivering Bell pairs only to the two nodes at the ends of the chain. Networks, however, typically have more than two end points, and allow any pair of these end nodes to communicate. More topologically complex networks, with numerous end nodes, are obviously much more scalable than connecting every possible pair of nodes using a dedicated line of repeaters. we investigate how classical multiplexing schemes translate to the domain of quantum repeaters, in order to manage shared resources and active communication flows of data from different stations. We simulate four sharing protocols in a complex network with competing traffic. Circuit switching gives any individual flow the best performance, but makes poor use of the overall network and is inflexible. We use circuit switching as our baseline case to compare time division multiplexing, buffer space multiplexing, and statistical multiplexing, and show that all multiplexing schemes are better than circuit switching. For the particular network simulated, we find that statistical multiplexing outperforms time division multiplexing by 28% and buffer space multiplexing by 13%. We find that all three multiplexing schemes are fair; each flow is penalized a similar percentage of its throughput as the the total number of users in the network increases. Finally, statistical multiplexing requires no network-wide coordination of the use of quantum memory or channels, and is easier to implement than a robust, scalable scheme for the other protocols. Our current results suggest that the best strategy for quantum repeater networks is statistical multiplexing. (This is in fact the quantum analogue of the basis on which the Internet works.) However, our current simulations are done with no degradation of memory over time, using the assumption of quantum error-corrected memory at each repeater; inclusion of decoherence and a finite qubit lifetime remains as future work.

•Sep 27, 2011•2 citations

Purification

Rodney Van Meter

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.

Wiley eBooks•Apr 14, 2014•0 citations

The Quantum Internet

Seng W. Loke

This chapter discusses some of the key concepts and ideas of the quantum internet and includes the central role that entanglement plays, and the concepts of entanglement swapping and entanglement purification. It briefly reviews the notion of quantum repeaters and quantum Internet architectures and also looks at quantum computations in relation to the quantum Internet. Any two nodes which want to do computations together (e.g. perform a distributed – CNOT operation) need to share entangled qubits, even when the two nodes are geographically far apart. A repeated application of entanglement swapping can be used to create entanglement between a pair of qubits over long distances.

Wiley eBooks•Dec 1, 2023•0 citations

Teleportation

Rodney Van Meter

Much of quantum networking depends on teleportation. This chapter describes teleportation and its procedure, and then briefly introduces experimental demonstrations, classical state machine and communication necessary to support teleportation in a simple fashion. Teleportation between two atoms can be achieved although the original Bell pair can be created by interacting the atoms directly and then separating them. The chapter shows a protocol state machine (PSM) that is used to manage a qubit at the teleportation destination. Control of the qubit can be handed to this machine once two conditions are confirmed: (1) the existence of a Bell pair of adequate fidelity, shared with the prospective teleportation source, and (2) confirmation that this qubit is the teleportation target. The generic teleportation operation is equivalent to a gate on the data qubit as it moves from one site to the other although the exact gate is probabilistic.

Wiley eBooks•Apr 14, 2014•1 citation

REDiP: Ranked Entanglement Distribution Protocol for the Quantum Internet

Leonardo Bacciottini, Luciano Lenzini, Enzo Mingozzi +1 more

The distribution of entangled qubit pairs to end nodes is the key requirement of a quantum network to enable qubit state transmission through quantum teleportation. Existing protocols for entanglement distribution fix a specific swapping order on the involved quantum repeaters and delegate entanglement purification to upper-layer protocols. This limitation is problematic because entangled states tend to degrade due to quantum noise, and they cannot be purified if their fidelity (i.e. quality) falls below a certain threshold. It is therefore of the utmost importance to co-plan entanglement swapping and purification to achieve a target end-to-end fidelity. In this work, we present the Ranked Entanglement Distribution Protocol (REDiP), which overcomes the aforementioned limits by including the "ranks" mechanism to configure the ordering of both purification and entanglement swapping steps. We show how REDiP can easily be configured to implement custom entanglement swapping and purification strategies, including (but not restricted to) those adopted in two recent works. We also propose an algorithm to estimate the bandwidth to allocate on every link of the REDiP path, and we provide a set of guidelines on how REDiP ranks can be configured depending on user requirements and hardware configuration. Such guidelines are driven by original insights into purification performance. We conduct simulations to verify our results and assess the impact of different REDiP configurations on the performance of a repeater network, in terms of throughput and fidelity.

IEEE Open Journal of the Communications Society•Dec 20, 2023•7 citations

Quantum communication with entanglement

Vlatko Vedral

Abstract This chapter discusses some of the ways in which quantum entanglement can be used for quantum communication. Suppose Alice and Bob share an entangled state: they can use it for dense coding, in which Alice sends Bob just one qubit of an entangled pair, which delivers two bits of classical information. Alice and Bob can also use an entangled state for teleportation, in which a qubit in a unknown quantum state is teleported from Alice to Bob when Alice sends Bob two classical bits. Entanglement swapping is an example of a tripartite communication protocol. If Alice and Bob share entanglement, and Bob and Charlie share entanglement, entanglement swapping can be used to entangle Alice and Charlie. Even if Alice and Bob are entangled, Alice cannot communicate with Bob without sending him classical bits or qubits, which prevents Alice and Bob from breaking the laws of relativity. This chapter also discusses Pauli matrices and the extension of Hilbert spaces.

Oxford University Press eBooks•Sep 28, 2006•0 citations
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.
When built, quantum repeater networks will require classical network protocols to control the quantum operations. However, existing work on repeaters has focused on the quantum operations themselves, with less attention paid to the contents, semantics, ordering and reliability of the classical control messages. In this work we define and describe our implementation of the classical control protocols. The state machines and packet sequences for the three protocol layers are presented, and operation confirmed by running the protocols over simulations of the physical network. We also show that proper management of the resources in a bottleneck link allows the aggregate throughput of two end-to-end flows to substantially exceed that of a single flow. Our layered architectural framework will support independent evolution of the separate protocol layers. Networks of quantum repeaters utilize three concepts to execute a distributed algorithm that creates entangled quantum states between nodes that are far apart: a basic entanglement mechanism which depends on the physical implementation, error management (in this work, we study a method known as purification), and finally a quantum state propagation layer (here we implement entanglement swapping, which builds multi-hop connections from single-hop connections). Some researchers are investigating approaches that are substantially different from entanglement swapping [30, 24, 19]. Here we focus on swapping, but the layered architecture approach is broadly applicable, allowing other implementations to replace only a single layer in the protocol stack. Previous work primarily focused on the physical and mathematical tools for building repeaters. Classical information is also needed to enable teleportation and swapping, as many quantum operations are not deterministic, and results of quantum measurements need to be reported to distant partners before further operations can proceed. Also, operations in the middle of the network must be coordinated to route and swap properly. This requires classical messages to make operations robust, but message propagation times penalize performance. Even though this delay is usually included in repeater simulations, prior work has not defined the protocols in detail, especially with respect to how all of the nodes make consistent decisions in a timely fashion. In this work, we introduce a protocol stack for networks of quantum repeaters that considers all the necessary classical messages and which can be easily adapted for different approaches at all three protocol layers. We run simulations of competing flows on a dumbbell topology in order to increase our confidence in the behavior of our network protocols. By adjusting the fidelity thresholds required for entanglement swapping, we show that some configurations boost the aggregate throughput for multiple flows significantly above the maximum for a single flow, taking advantage of resources that would otherwise sit idle. The operation of such complex networks and such delicate tuning of the system without formal protocol definitions would not be possible. Previous work has also concentrated almost exclusively on the dedicated use of a single line or chain of repeaters, delivering Bell pairs only to the two nodes at the ends of the chain. Networks, however, typically have more than two end points, and allow any pair of these end nodes to communicate. More topologically complex networks, with numerous end nodes, are obviously much more scalable than connecting every possible pair of nodes using a dedicated line of repeaters. we investigate how classical multiplexing schemes translate to the domain of quantum repeaters, in order to manage shared resources and active communication flows of data from different stations. We simulate four sharing protocols in a complex network with competing traffic. Circuit switching gives any individual flow the best performance, but makes poor use of the overall network and is inflexible. We use circuit switching as our baseline case to compare time division multiplexing, buffer space multiplexing, and statistical multiplexing, and show that all multiplexing schemes are better than circuit switching. For the particular network simulated, we find that statistical multiplexing outperforms time division multiplexing by 28% and buffer space multiplexing by 13%. We find that all three multiplexing schemes are fair; each flow is penalized a similar percentage of its throughput as the the total number of users in the network increases. Finally, statistical multiplexing requires no network-wide coordination of the use of quantum memory or channels, and is easier to implement than a robust, scalable scheme for the other protocols. Our current results suggest that the best strategy for quantum repeater networks is statistical multiplexing. (This is in fact the quantum analogue of the basis on which the Internet works.) However, our current simulations are done with no degradation of memory over time, using the assumption of quantum error-corrected memory at each repeater; inclusion of decoherence and a finite qubit lifetime remains as future work.
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.
This chapter discusses some of the key concepts and ideas of the quantum internet and includes the central role that entanglement plays, and the concepts of entanglement swapping and entanglement purification. It briefly reviews the notion of quantum repeaters and quantum Internet architectures and also looks at quantum computations in relation to the quantum Internet. Any two nodes which want to do computations together (e.g. perform a distributed – CNOT operation) need to share entangled qubits, even when the two nodes are geographically far apart. A repeated application of entanglement swapping can be used to create entanglement between a pair of qubits over long distances.
Much of quantum networking depends on teleportation. This chapter describes teleportation and its procedure, and then briefly introduces experimental demonstrations, classical state machine and communication necessary to support teleportation in a simple fashion. Teleportation between two atoms can be achieved although the original Bell pair can be created by interacting the atoms directly and then separating them. The chapter shows a protocol state machine (PSM) that is used to manage a qubit at the teleportation destination. Control of the qubit can be handed to this machine once two conditions are confirmed: (1) the existence of a Bell pair of adequate fidelity, shared with the prospective teleportation source, and (2) confirmation that this qubit is the teleportation target. The generic teleportation operation is equivalent to a gate on the data qubit as it moves from one site to the other although the exact gate is probabilistic.
The distribution of entangled qubit pairs to end nodes is the key requirement of a quantum network to enable qubit state transmission through quantum teleportation. Existing protocols for entanglement distribution fix a specific swapping order on the involved quantum repeaters and delegate entanglement purification to upper-layer protocols. This limitation is problematic because entangled states tend to degrade due to quantum noise, and they cannot be purified if their fidelity (i.e. quality) falls below a certain threshold. It is therefore of the utmost importance to co-plan entanglement swapping and purification to achieve a target end-to-end fidelity. In this work, we present the Ranked Entanglement Distribution Protocol (REDiP), which overcomes the aforementioned limits by including the "ranks" mechanism to configure the ordering of both purification and entanglement swapping steps. We show how REDiP can easily be configured to implement custom entanglement swapping and purification strategies, including (but not restricted to) those adopted in two recent works. We also propose an algorithm to estimate the bandwidth to allocate on every link of the REDiP path, and we provide a set of guidelines on how REDiP ranks can be configured depending on user requirements and hardware configuration. Such guidelines are driven by original insights into purification performance. We conduct simulations to verify our results and assess the impact of different REDiP configurations on the performance of a repeater network, in terms of throughput and fidelity.
Abstract This chapter discusses some of the ways in which quantum entanglement can be used for quantum communication. Suppose Alice and Bob share an entangled state: they can use it for dense coding, in which Alice sends Bob just one qubit of an entangled pair, which delivers two bits of classical information. Alice and Bob can also use an entangled state for teleportation, in which a qubit in a unknown quantum state is teleported from Alice to Bob when Alice sends Bob two classical bits. Entanglement swapping is an example of a tripartite communication protocol. If Alice and Bob share entanglement, and Bob and Charlie share entanglement, entanglement swapping can be used to entangle Alice and Charlie. Even if Alice and Bob are entangled, Alice cannot communicate with Bob without sending him classical bits or qubits, which prevents Alice and Bob from breaking the laws of relativity. This chapter also discusses Pauli matrices and the extension of Hilbert spaces.