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:quant-ph/0209030

Universal distortion-free entanglement concentration

Masahito Hayashi, Keiji Matsumoto

Published Sep 4, 2002• 5 citations
arXivHTMLPDF

Abstract

Entanglement concentration from many copies of unknown pure states is discussed, and we propose the protocol which not only achieves entropy rate, but also produces the perfect maximally entangled state. Our protocol is induced naturally from symmetry of $n$-tensored pure state, and is optimal for all the protocols which concentrates entanglement from unknown pure states, in the sense of failure probability. In the proof of optimality, the statistical estimation theory plays a key role, for concentrated entanglement gives a natural estimate of the entropy of entanglement.

DOI
10.48550/arxiv.quant-ph/0209030

Related papers

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

Streaming Universal Distortion-Free Entanglement Concentration

Robin Blume-Kohout, Sarah Croke, Daniel Gottesman

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.

arXiv:0910.5952•IEEE Transactions on Information Theory•Jan 1, 2014•11 citations

Universal distortion-free entanglement concentration

Keiji Matsumoto, Masahito Hayashi

This paper proposes a universal distortion-free entanglement concentration protocol. The proposed protocol uses only local operations and no classical communication, but still achieves optimality in such strong senses

IEEE International Symposium on Information Theory (ISIT)•Dec 23, 2004•9 citations

Universal magic state concentration

Jacopo Rizzo, Lorenzo Leone

Magic plays a dual role in quantum computation: it promotes stabilizer dynamics from efficient classical simulability to computational universality, but also challenges fault-tolerant architectures, since non-stabilizer operations are harder to protect against noise. Magic state distillation addresses this issue, yet existing protocols remain largely tailored to specific assumptions about the input or noise model and, more fundamentally, no general information-theoretic theory of optimal magic-state conversion currently exists. Here we develop such a characterization for pure qubit states through universal magic state concentration: a fixed stabilizer protocol that converts a few copies of an unknown pure non-stabilizer qubit state into an exact target magic state. Motivated by the impossibility of exact $T$-state concentration, we build six- and eight-copy protocols producing an exact $\mathrm{CCZ}$ state, with six copies being minimal. Their success probabilities are governed by the linearized order-three stabilizer Rényi entropy $M^{\mathrm{lin}}_3$. We show that this connection is structural: for up to nine input copies, $M^{\mathrm{lin}}_3$ fully determines the success probability of every universal Clifford-invariant stabilizer protocol. Remarkably, this characterization persists asymptotically: our constructions achieve optimal rates among universal single-output protocols and remain optimal up to logarithmic factors among arbitrary stabilizer protocols. As a corollary, we show that any unknown pure non-stabilizer state suffices for universal quantum computation via probabilistic $\mathrm{CCZ}$-state injection. Together, these results identify the stabilizer Rényi entropy as a fundamental operational quantity in magic state distillation.

quant-pharXiv:2608.13376•Aug 14, 2026•0 citations

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 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
Entanglement concentration from many copies of unknown pure states is discussed, and we propose the protocol which not only achieves entropy rate, but also produces the perfect maximally entangled state. Our protocol is induced naturally from symmetry of nnn-tensored pure state, and is optimal for all the protocols which concentrates entanglement from unknown pure states, in the sense of failure probability. In the proof of optimality, the statistical estimation theory plays a key role, for concentrated entanglement gives a natural estimate of the entropy of entanglement.
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.
Magic plays a dual role in quantum computation: it promotes stabilizer dynamics from efficient classical simulability to computational universality, but also challenges fault-tolerant architectures, since non-stabilizer operations are harder to protect against noise. Magic state distillation addresses this issue, yet existing protocols remain largely tailored to specific assumptions about the input or noise model and, more fundamentally, no general information-theoretic theory of optimal magic-state conversion currently exists. Here we develop such a characterization for pure qubit states through universal magic state concentration: a fixed stabilizer protocol that converts a few copies of an unknown pure non-stabilizer qubit state into an exact target magic state. Motivated by the impossibility of exact TTT-state concentration, we build six- and eight-copy protocols producing an exact CCZ\mathrm{CCZ}CCZ state, with six copies being minimal. Their success probabilities are governed by the linearized order-three stabilizer Rényi entropy M3linM^{\mathrm{lin}}_3M3lin​. We show that this connection is structural: for up to nine input copies, M3linM^{\mathrm{lin}}_3M3lin​ fully determines the success probability of every universal Clifford-invariant stabilizer protocol. Remarkably, this characterization persists asymptotically: our constructions achieve optimal rates among universal single-output protocols and remain optimal up to logarithmic factors among arbitrary stabilizer protocols. As a corollary, we show that any unknown pure non-stabilizer state suffices for universal quantum computation via probabilistic CCZ\mathrm{CCZ}CCZ-state injection. Together, these results identify the stabilizer Rényi entropy as a fundamental operational quantity in magic state distillation.
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 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.