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

Streaming Universal Distortion-Free Entanglement Concentration

Robin Blume-Kohout, Sarah Croke, Daniel Gottesman

Published Jan 1, 2014• 11 citations
arXivHTMLPDF

Abstract

This paper presents a streaming (sequential) protocol for universal entanglement concentration at the Shannon bound. Alice and Bob begin with N identical (but unknown) two-qubit pure states, each containing E ebits of entanglement. They each run a reversible algorithm on their qubits, and end up with Y perfect EPR pairs, where Y=NE ± O(√(N)). Our protocol is streaming, so the N input systems are fed in one at a time, and perfect EPR pairs start popping out almost immediately. It matches the optimal block protocol exactly at each stage, so the average yield after n inputs is 〈 Y〉=nE-O(logn). So, somewhat surprisingly, there is no tradeoff between yield and lag-our protocol optimizes both. In contrast, the optimal N-qubit block protocol achieves the same yield, but since no EPR pairs are produced until the entire input block is read, its lag is O(N). Finally, our algorithm runs in O(log N) space, so a lot of entanglement can be efficiently concentrated using a very small (e.g., current or near-future technology) quantum processor. Along the way, we find an optimal streaming protocol for extracting randomness from classical i.i.d. sources and a more space-efficient implementation of the Schur transform.

DOI
10.1109/tit.2013.2292135

Related papers

Optimality of universal conclusive entanglement concentration protocols

Alexandre C. Orthey, Aby Philip, Tulja Varun Kondra +1 more

Entanglement concentration is essential for quantum technologies, yet rigorous bounds on the success probability for universal protocols (those requiring no prior knowledge about the input state) have remained underexplored. We establish such fundamental limits for conclusive protocols distilling a perfect Bell state from pure two-qubit states by deriving the optimal success probability starting with two copies of a state with known Schmidt basis and four copies of a state with unknown Schmidt basis, using concatenated two-qubit operations. We prove that a known protocol achieves these bounds, confirming its optimality. Crucially, universality imposes an inherent efficiency trade-off, yielding an average success probability of just 2/105 over Haar measure.

arXiv:2509.09423•Physical Review A•May 13, 2026•0 citations

Universal distortion-free entanglement concentration

Keiji Matsumoto, Masahito Hayashi

We propose a new protocol of universal entanglement concentration, which converts many copies of an unknown pure state to an exact maximally entangled state. The yield of the protocol, which is outputted as a classical information, is probabilistic, and achieves the entropy rate with high probability, just as nonuniversal entanglement concentration protocols do.

arXiv:quant-ph/0509140•Physical Review A•Jun 29, 2007•33 citations

Entanglement Distribution in a Quantum Network: A Multicommodity Flow-Based Approach

Kaushik Chakraborty, David Elkouss, Bruno Rijsman +1 more

We consider the problem of optimizing the achievable EPR-pair distribution rate between multiple source-destination pairs in a quantum Internet, where the repeaters may perform a probabilistic Bell-state measurement and we may impose a minimum end-to-end fidelity as a requirement. We construct an efficient linear programming (LP) formulation that computes the maximum total achievable entanglement distribution rate, satisfying the end-to-end fidelity constraint in polynomial time (in the number of nodes in the network). Our LP formulation gives the optimal rate for a class of entanglement generation protocols where the repeaters have very short-lived quantum memories. We also propose an efficient algorithm that takes the output of the LP solver as an input and runs in polynomial time (in the number of nodes) to produce the set of paths to be used to achieve the entanglement distribution rate. Moreover, we point out a practical entanglement generation protocol that can achieve those rates.

arXiv:2005.14304•IEEE Transactions on Quantum Engineering•Jan 1, 2020•122 citations

Efficient single-photon-assisted entanglement concentration for partially entangled photon pairs

Yu‐Bo Sheng, Lan Zhou, Shengmei Zhao +1 more

We present two realistic entanglement concentration protocols (ECPs) for pure partially entangled photons. A partially entangled photon pair can be concentrated to a maximally entangled pair with only an ancillary single photon with a certain probability, while the conventional ECPs require two copies of partially entangled pairs at least. Our first protocol is implemented with linear optics and the second protocol is implemented with cross-Kerr-nonlinearities. Compared with other ECPs, they do not need to know the accurate coefficients of the initial state. With linear optics, it is feasible with current experiments. With cross-Kerr-nonlinearities, it does not require sophisticated single-photon detectors and can be repeated to get a higher success probability. Moreover, the second protocol can get the higher entanglement transformation efficiency and it may be the most economical protocol by far. Meanwhile, both protocols are more suitable for multiphoton system concentration because they need less operations and classical communications. All these advantages make the two protocols useful in current long-distance quantum communications.

arXiv:1202.2190•Physical Review A•Jan 4, 2012•258 citations

Efficient quantum repeater with respect to both entanglement-concentration rate and complexity of local operations and classical communication

Zhaofeng Su, Ji Guan, Lvzhou Li

Quantum entanglement is an indispensable resource for many significant quantum information processing tasks. However, in practice, it is difficult to distribute quantum entanglement over a long distance, due to the absorption and noise in quantum channels. A solution to this challenge is a quantum repeater, which can extend the distance of entanglement distribution. In this scheme, the time consumption of classical communication and local operations takes an important place with respect to time efficiency. Motivated by this observation, we consider a basic quantum repeater scheme that focuses on not only the optimal rate of entanglement concentration but also the complexity of local operations and classical communication. First, we consider the case where two different two-qubit pure states are initially distributed in the scenario. We construct a protocol with the optimal entanglement-concentration rate and less consumption of local operations and classical communication. We also find a criterion for the projective measurements to achieve the optimal probability of creating a maximally entangled state between the two ends. Second, we consider the case in which two general pure states are prepared and general measurements are allowed. We get an upper bound on the probability for a successful measurement operation to produce a maximally entangled state without any further local operations.

arXiv:1710.02805•Physical Review A•Jan 22, 2018•17 citations

Universal and distortion-free entanglement concentration of multiqubit quantum states in the W class

Alonso Botero, José Mejía

We propose a multipartite extension of Matsumoto and Hayashi's distortion-free entanglement concentration protocol, which takes $n$ copies of a general multipartite state and, via local measurements and produces a maximally entangled multipartite state between local spaces of dimensions $\ensuremath{\sim}{2}^{n{E}_{i}}$, where ${E}_{i}$ are the local entropies of the input state. However, the extended protocol is generally not universal in the sense that for the same measurement outcomes, the output state will still depend on the input state. Our main result is that when specialized to any state in the multiqubit W class, the protocol is also universal, so that as in the biparatite version, the output is a unique, maximally entangled state for each given set of measurement outcomes. Our analysis brings to the forefront an interesting family of maximally entangled multipartite states, which we term Kronecker states. A recurrence relation to obtain the coefficients of the W-class Kronecker states is also given.

arXiv:1712.09174•Physical Review A•Sep 24, 2018•5 citations
This paper presents a streaming (sequential) protocol for universal entanglement concentration at the Shannon bound. Alice and Bob begin with N identical (but unknown) two-qubit pure states, each containing E ebits of entanglement. They each run a reversible algorithm on their qubits, and end up with Y perfect EPR pairs, where Y=NE ± O(√(N)). Our protocol is streaming, so the N input systems are fed in one at a time, and perfect EPR pairs start popping out almost immediately. It matches the optimal block protocol exactly at each stage, so the average yield after n inputs is 〈 Y〉=nE-O(logn). So, somewhat surprisingly, there is no tradeoff between yield and lag-our protocol optimizes both. In contrast, the optimal N-qubit block protocol achieves the same yield, but since no EPR pairs are produced until the entire input block is read, its lag is O(N). Finally, our algorithm runs in O(log N) space, so a lot of entanglement can be efficiently concentrated using a very small (e.g., current or near-future technology) quantum processor. Along the way, we find an optimal streaming protocol for extracting randomness from classical i.i.d. sources and a more space-efficient implementation of the Schur transform.
Entanglement concentration is essential for quantum technologies, yet rigorous bounds on the success probability for universal protocols (those requiring no prior knowledge about the input state) have remained underexplored. We establish such fundamental limits for conclusive protocols distilling a perfect Bell state from pure two-qubit states by deriving the optimal success probability starting with two copies of a state with known Schmidt basis and four copies of a state with unknown Schmidt basis, using concatenated two-qubit operations. We prove that a known protocol achieves these bounds, confirming its optimality. Crucially, universality imposes an inherent efficiency trade-off, yielding an average success probability of just 2/105 over Haar measure.
We consider the problem of optimizing the achievable EPR-pair distribution rate between multiple source-destination pairs in a quantum Internet, where the repeaters may perform a probabilistic Bell-state measurement and we may impose a minimum end-to-end fidelity as a requirement. We construct an efficient linear programming (LP) formulation that computes the maximum total achievable entanglement distribution rate, satisfying the end-to-end fidelity constraint in polynomial time (in the number of nodes in the network). Our LP formulation gives the optimal rate for a class of entanglement generation protocols where the repeaters have very short-lived quantum memories. We also propose an efficient algorithm that takes the output of the LP solver as an input and runs in polynomial time (in the number of nodes) to produce the set of paths to be used to achieve the entanglement distribution rate. Moreover, we point out a practical entanglement generation protocol that can achieve those rates.
We present two realistic entanglement concentration protocols (ECPs) for pure partially entangled photons. A partially entangled photon pair can be concentrated to a maximally entangled pair with only an ancillary single photon with a certain probability, while the conventional ECPs require two copies of partially entangled pairs at least. Our first protocol is implemented with linear optics and the second protocol is implemented with cross-Kerr-nonlinearities. Compared with other ECPs, they do not need to know the accurate coefficients of the initial state. With linear optics, it is feasible with current experiments. With cross-Kerr-nonlinearities, it does not require sophisticated single-photon detectors and can be repeated to get a higher success probability. Moreover, the second protocol can get the higher entanglement transformation efficiency and it may be the most economical protocol by far. Meanwhile, both protocols are more suitable for multiphoton system concentration because they need less operations and classical communications. All these advantages make the two protocols useful in current long-distance quantum communications.
Quantum entanglement is an indispensable resource for many significant quantum information processing tasks. However, in practice, it is difficult to distribute quantum entanglement over a long distance, due to the absorption and noise in quantum channels. A solution to this challenge is a quantum repeater, which can extend the distance of entanglement distribution. In this scheme, the time consumption of classical communication and local operations takes an important place with respect to time efficiency. Motivated by this observation, we consider a basic quantum repeater scheme that focuses on not only the optimal rate of entanglement concentration but also the complexity of local operations and classical communication. First, we consider the case where two different two-qubit pure states are initially distributed in the scenario. We construct a protocol with the optimal entanglement-concentration rate and less consumption of local operations and classical communication. We also find a criterion for the projective measurements to achieve the optimal probability of creating a maximally entangled state between the two ends. Second, we consider the case in which two general pure states are prepared and general measurements are allowed. We get an upper bound on the probability for a successful measurement operation to produce a maximally entangled state without any further local operations.
We propose a multipartite extension of Matsumoto and Hayashi's distortion-free entanglement concentration protocol, which takes nnn copies of a general multipartite state and, via local measurements and produces a maximally entangled multipartite state between local spaces of dimensions $\ensuremath{\sim}{2}^{n{E}_{i}}$, where Ei{E}_{i}Ei​ are the local entropies of the input state. However, the extended protocol is generally not universal in the sense that for the same measurement outcomes, the output state will still depend on the input state. Our main result is that when specialized to any state in the multiqubit W class, the protocol is also universal, so that as in the biparatite version, the output is a unique, maximally entangled state for each given set of measurement outcomes. Our analysis brings to the forefront an interesting family of maximally entangled multipartite states, which we term Kronecker states. A recurrence relation to obtain the coefficients of the W-class Kronecker states is also given.