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/0406017

The equivalence of two approaches to the design of entanglement distillation protocols

Erik Hostens, Jeroen Dehaene, Bart De Moor

Published Jun 2, 2004• 18 citations
arXivHTMLPDF

Abstract

We show the equivalence of two approaches to the design of entanglement distillation protocols. The first approach is based on local unitary operations that yield permutations of tensor products of Bell states. The second approach is based on stabilizer codes.
DOI
10.48550/arxiv.quant-ph/0406017

Related papers

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•7 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

Unitary Local Permutations on Bell Diagonal States of Qudits and Quantum Distillation Protocols

Héctor Bombín, Miguel Angel Martin-Delgado

•Jan 1, 2006•0 citations

Distilling GHZ States using Stabilizer Codes

Narayanan Rengaswamy, Ankur Raina, Nithin Raveendran +1 more

Entanglement distillation is a well-studied problem in quantum information, where one typically starts with $n$ noisy Bell pairs and distills $k$ Bell pairs of higher fidelity. While distilling Bell pairs is the canonical setting, it is important to study the distillation of multipartite entangled states because these can be useful for realizing distributed algorithms on quantum networks. In this paper, we study the distillation of GHZ states using quantum error correcting codes (QECCs). Using the stabilizer formalism, we begin by explaining the QECC-based Bell pair distillation protocol in arXiv:0708.3699, which relies particularly on the transpose symmetry between Alice's and Bob's qubits in Bell states. Extending this idea, we show that, given $n$ GHZ states, performing a matrix on Alice's qubits is equivalent to performing a "stretched" version of the transpose of the matrix on the qubits of Bob and Charlie. We call this mapping to the stretched version of the matrix the GHZ-map, and show that it is an algebra homomorphism. Using this property, we show that Alice projecting her qubits onto an $[[n,k]]$ stabilizer code implies the simultaneous projection of Bob's and Charlie's qubits onto an induced $[[2n,k]]$ stabilizer code. Guided by this insight, we develop a GHZ distillation protocol based on local operations and classical communication that uses any stabilizer code. Inspired by stabilizer measurements on GHZ states, we also develop a new algorithm to generate logical Pauli operators of any stabilizer code and use it in the protocol. Since quantum codes with finite rate and almost linear minimum distance have recently been discovered, this paper paves the way for high-rate high-output-fidelity GHZ distillation. We provide simulation results on the $5$-qubit perfect code to emphasize the importance of the placement of a certain local Clifford operation in the protocol.

arXiv:2109.06248•Sep 13, 2021•9 citations

Local permutations of products of Bell states and entanglement distillation

Jeroen Dehaene, Maarten Van den Nest, Bart De Moor +1 more

We present different algorithms for mixed-state multicopy entanglement distillation for pairs of qubits. Our algorithms perform significantly better than the best-known algorithms. Better algorithms can be derived that are tuned for specific initial states. These algorithms are based on a characterization of the group of all locally realizable permutations of the ${4}^{n}$ possible tensor products of n Bell states.

arXiv:quant-ph/0207154•Physical Review A•Feb 28, 2003•94 citations

Efficient Graph State Purification with Factorized Graph-Preserving Operations across Local Clifford Orbits

Mingyuan Wang, Guus Avis, Kenneth Goodenough +1 more

Graph states form a broad class of multipartite entangled states underlying measurement-based quantum computation, quantum networks, and stabilizer codes. However, systematic entanglement distillation for arbitrary graph states remains challenging because the circuit design space grows rapidly with the number of parties. We introduce a group of Clifford operations that we call "factorized graph-preserving". It enables us to efficiently enumerate and optimize graph-state purification circuits at finite size for realistic noisy hardware. These operations map products of graph-basis states to products of graph-basis states, so their action can be represented as permutations of graph-basis labels. Moreover, this useful gate set admits a compact factorized description determined by simple graph-theoretic features. This structure also allows, after some initial cached precomputation, drastically lower computational complexity for simulating a gate. We further organize these operations over local-complementation (LC) orbits using minimum-edge representatives (MERs), which let us design purification circuits that apply to all locally equivalent graph states (up to a basis change). Using this framework, we optimize noisy finite-size multipartite distillation circuits for several graph-state families. Numerical results show that the resulting graph-preserving circuits can outperform standard recurrence-based purification protocols under realistic gate and measurement noise. Our results establish LC-orbit structure and factorized graph-preserving operations as practical tools for scalable, topology-aware and hardware-constrained graph-state distillation protocol design. Our work can also be interpreted as a graph-based heuristic for finding transversal gates.

quant-pharXiv:2606.23809•Jun 24, 2026•3 citations
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.
Entanglement distillation is a well-studied problem in quantum information, where one typically starts with nnn noisy Bell pairs and distills kkk Bell pairs of higher fidelity. While distilling Bell pairs is the canonical setting, it is important to study the distillation of multipartite entangled states because these can be useful for realizing distributed algorithms on quantum networks. In this paper, we study the distillation of GHZ states using quantum error correcting codes (QECCs). Using the stabilizer formalism, we begin by explaining the QECC-based Bell pair distillation protocol in arXiv:0708.3699, which relies particularly on the transpose symmetry between Alice's and Bob's qubits in Bell states. Extending this idea, we show that, given nnn GHZ states, performing a matrix on Alice's qubits is equivalent to performing a "stretched" version of the transpose of the matrix on the qubits of Bob and Charlie. We call this mapping to the stretched version of the matrix the GHZ-map, and show that it is an algebra homomorphism. Using this property, we show that Alice projecting her qubits onto an [[n,k]][[n,k]][[n,k]] stabilizer code implies the simultaneous projection of Bob's and Charlie's qubits onto an induced [[2n,k]][[2n,k]][[2n,k]] stabilizer code. Guided by this insight, we develop a GHZ distillation protocol based on local operations and classical communication that uses any stabilizer code. Inspired by stabilizer measurements on GHZ states, we also develop a new algorithm to generate logical Pauli operators of any stabilizer code and use it in the protocol. Since quantum codes with finite rate and almost linear minimum distance have recently been discovered, this paper paves the way for high-rate high-output-fidelity GHZ distillation. We provide simulation results on the 555-qubit perfect code to emphasize the importance of the placement of a certain local Clifford operation in the protocol.
We present different algorithms for mixed-state multicopy entanglement distillation for pairs of qubits. Our algorithms perform significantly better than the best-known algorithms. Better algorithms can be derived that are tuned for specific initial states. These algorithms are based on a characterization of the group of all locally realizable permutations of the 4n{4}^{n}4n possible tensor products of n Bell states.
Graph states form a broad class of multipartite entangled states underlying measurement-based quantum computation, quantum networks, and stabilizer codes. However, systematic entanglement distillation for arbitrary graph states remains challenging because the circuit design space grows rapidly with the number of parties. We introduce a group of Clifford operations that we call "factorized graph-preserving". It enables us to efficiently enumerate and optimize graph-state purification circuits at finite size for realistic noisy hardware. These operations map products of graph-basis states to products of graph-basis states, so their action can be represented as permutations of graph-basis labels. Moreover, this useful gate set admits a compact factorized description determined by simple graph-theoretic features. This structure also allows, after some initial cached precomputation, drastically lower computational complexity for simulating a gate. We further organize these operations over local-complementation (LC) orbits using minimum-edge representatives (MERs), which let us design purification circuits that apply to all locally equivalent graph states (up to a basis change). Using this framework, we optimize noisy finite-size multipartite distillation circuits for several graph-state families. Numerical results show that the resulting graph-preserving circuits can outperform standard recurrence-based purification protocols under realistic gate and measurement noise. Our results establish LC-orbit structure and factorized graph-preserving operations as practical tools for scalable, topology-aware and hardware-constrained graph-state distillation protocol design. Our work can also be interpreted as a graph-based heuristic for finding transversal gates.