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:2401.02265

Breeding protocols are advantageous for finite-length entanglement distillation

Ryutaroh Matsumoto

Published Jan 4, 2024• 1 citation
arXivHTMLPDF

Abstract

Bennett et al. proposed a family of protocols for entanglement distillation, namely, hashing, recurrence and breeding protocols. The last one is inferior to the hashing protocol in the asymptotic regime and has been investigated little. In this paper, we propose a framework of converting a stabilizer quantum error-correcting code to a breeding protocol, which is a generalization of the previous conversion methods by Luo-Devetak and Wilde. Then, show an example of a stabilizer that gives a breeding protocol better than hashing protocols, in which the finite number of maximally entangled pairs are distilled from the finite number of partially entangled pairs.

DOI
10.48550/arxiv.2401.02265

Related papers

Conversion of a general quantum stabilizer code to an entanglement distillation protocol

Ryutaroh Matsumoto

We show how to convert a quantum stabilizer code to a one- or two-way entanglement distillation protocol. The proposed conversion method is a generalization of those of Shor–Preskill and Nielsen–Chuang. The recurrence protocol and the quantum privacy amplification protocol are equivalent to the protocols converted from [[2, 1]] stabilizer codes. We also give an example of a two-way protocol converted from a stabilizer better than the recurrence protocol and the quantum privacy amplification protocol. The distillable entanglement by the class of one-way protocols converted from stabilizer codes for a certain class of states is equal to or greater than the achievable rate of stabilizer codes over the channel corresponding to the distilled state, and they can distill asymptotically more entanglement from a very noisy Werner state than the hashing protocol.

arXiv:quant-ph/0209091•Journal of Physics A Mathematical and General•Jul 9, 2003•28 citations

Conversion of a general quantum stabilizer code to an entanglement distillation protocol

Ryutaroh Matsumoto

We show how to convert a quantum stabilizer code to a one-way or two-way entanglement distillation protocol, and give an example of a converted two-way protocol better than the recurrence protocol and the quantum privacy amplification protocol.

IEEE International Symposium on Information Theory (ISIT)•Jan 1, 2003•1 citation

Interpolation of recurrence and hashing entanglement distillation protocols

K. G. H. Vollbrecht, Frank Verstraete

We construct interesting entanglement distillation protocols by interpolating between the recurrence and hashing protocols. This leads to asymptotic two-way distillation protocols, resulting in an improvement of the distillation rate for all mixed Bell diagonal entangled states, even for the ones with very high fidelity. We also present a method for how entanglement-assisted distillation protocol can be converted into nonentanglement-assisted protocols with the same yield.

arXiv:quant-ph/0404111•Physical Review A•Jun 1, 2005•55 citations

Breeding quantum error-correcting codes

Ying Dong, Dan Mei Hu, Sixia Yu

The stabilizer code, one major family of quantum error-correcting codes (QECC), is specified by the joint eigenspace of a commuting set of Pauli observables. It turns out that noncommuting sets of Pauli observables can be used to construct more efficient QECCs, such as the entanglement-assisted QECCs, which are built directly from any linear classical codes whose detailed properties are needed to determine the parameters of the resulting quantum codes. Here we propose another family of QECCs, namely, the breeding QECCs, that also employ noncommuting sets of Pauli observables and can be built from any classical additive codes, either linear or nonlinear, with the advantage that their parameters can be read off directly from the corresponding classical codes. Besides, since nonlinear codes are generally more efficient than linear codes, our breeding codes have better parameters than those codes built from linear codes. The terminology is justified by the fact that our QECCs are related to the ordinary QECCs in exactly the same way that the breeding protocols are related to the hashing protocols in the entanglement purification.

Physical Review A•Feb 22, 2010•5 citations

Efficient distillation beyond qubits

K. G. H. Vollbrecht, Michael M. Wolf

We provide generalizations of known two-qubit entanglement distillation protocols for arbitrary Hilbert space dimensions. The protocols, which are analogs of the hashing and breeding procedures, are adapted to bipartite quantum states that are diagonal in a basis of maximally entangled states. We show that the obtained rates are optimal, and thus equal to the distillable entanglement, for a $(d\ensuremath{-}1)$-parameter family of rank deficient states. Methods to improve the rates for other states are discussed. In particular, for isotropic states it is shown that the rate can be improved such that it approaches the relative entropy of entanglement in the limit of large dimensions.

arXiv:quant-ph/0208152•Physical Review A•Jan 7, 2003•35 citations

A Novel Stabilizer-based Entanglement Distillation Protocol for Qudits

Christopher Popp, Tobias C. Sutter, Beatrix C. Hiesmayr

Entanglement distillation, the process of converting weakly entangled states into maximally entangled ones using Local Operations and Classical Communication (LOCC), is pivotal for robust entanglement-assisted quantum information processing in error-prone environments. A construction based on stabilizer codes offers an effective method for designing such protocols. By analytically investigating the effective action of stabilizer protocols for systems of prime dimension d , we establish a standard form for the output states of recurrent stabilizer-based distillation. This links the properties of input states, stabilizers, and encodings to the properties of the protocol. Based on those insights, we present a novel two-copy distillation protocol, applicable to all bipartite states in prime dimension, that maximizes the fidelity increase per iteration for Bell-diagonal states. The power of this framework and the protocol is demonstrated through numerical investigations, which provide evidence for superior performance in terms of efficiency and distillability of low-fidelity states compared to other well-established recurrence protocols. By elucidating the interplay between states, errors, and protocols, our contribution advances the systematic development of highly effective distillation protocols, enhancing our understanding of distillability.

arXiv:2408.02383•Quantum•Dec 15, 2025•3 citations
Bennett et al. proposed a family of protocols for entanglement distillation, namely, hashing, recurrence and breeding protocols. The last one is inferior to the hashing protocol in the asymptotic regime and has been investigated little. In this paper, we propose a framework of converting a stabilizer quantum error-correcting code to a breeding protocol, which is a generalization of the previous conversion methods by Luo-Devetak and Wilde. Then, show an example of a stabilizer that gives a breeding protocol better than hashing protocols, in which the finite number of maximally entangled pairs are distilled from the finite number of partially entangled pairs.
We show how to convert a quantum stabilizer code to a one- or two-way entanglement distillation protocol. The proposed conversion method is a generalization of those of Shor–Preskill and Nielsen–Chuang. The recurrence protocol and the quantum privacy amplification protocol are equivalent to the protocols converted from [[2, 1]] stabilizer codes. We also give an example of a two-way protocol converted from a stabilizer better than the recurrence protocol and the quantum privacy amplification protocol. The distillable entanglement by the class of one-way protocols converted from stabilizer codes for a certain class of states is equal to or greater than the achievable rate of stabilizer codes over the channel corresponding to the distilled state, and they can distill asymptotically more entanglement from a very noisy Werner state than the hashing protocol.
The stabilizer code, one major family of quantum error-correcting codes (QECC), is specified by the joint eigenspace of a commuting set of Pauli observables. It turns out that noncommuting sets of Pauli observables can be used to construct more efficient QECCs, such as the entanglement-assisted QECCs, which are built directly from any linear classical codes whose detailed properties are needed to determine the parameters of the resulting quantum codes. Here we propose another family of QECCs, namely, the breeding QECCs, that also employ noncommuting sets of Pauli observables and can be built from any classical additive codes, either linear or nonlinear, with the advantage that their parameters can be read off directly from the corresponding classical codes. Besides, since nonlinear codes are generally more efficient than linear codes, our breeding codes have better parameters than those codes built from linear codes. The terminology is justified by the fact that our QECCs are related to the ordinary QECCs in exactly the same way that the breeding protocols are related to the hashing protocols in the entanglement purification.
We provide generalizations of known two-qubit entanglement distillation protocols for arbitrary Hilbert space dimensions. The protocols, which are analogs of the hashing and breeding procedures, are adapted to bipartite quantum states that are diagonal in a basis of maximally entangled states. We show that the obtained rates are optimal, and thus equal to the distillable entanglement, for a $(d\ensuremath{-}1)$-parameter family of rank deficient states. Methods to improve the rates for other states are discussed. In particular, for isotropic states it is shown that the rate can be improved such that it approaches the relative entropy of entanglement in the limit of large dimensions.
Entanglement distillation, the process of converting weakly entangled states into maximally entangled ones using Local Operations and Classical Communication (LOCC), is pivotal for robust entanglement-assisted quantum information processing in error-prone environments. A construction based on stabilizer codes offers an effective method for designing such protocols. By analytically investigating the effective action of stabilizer protocols for systems of prime dimension d , we establish a standard form for the output states of recurrent stabilizer-based distillation. This links the properties of input states, stabilizers, and encodings to the properties of the protocol. Based on those insights, we present a novel two-copy distillation protocol, applicable to all bipartite states in prime dimension, that maximizes the fidelity increase per iteration for Bell-diagonal states. The power of this framework and the protocol is demonstrated through numerical investigations, which provide evidence for superior performance in terms of efficiency and distillability of low-fidelity states compared to other well-established recurrence protocols. By elucidating the interplay between states, errors, and protocols, our contribution advances the systematic development of highly effective distillation protocols, enhancing our understanding of distillability.