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.
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.
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 is essential for quantum information processing, but is limited by noise. We address this by developing high-yield entanglement distillation protocols with several advancements. (1) We extend the 2-to-1 recurrence entanglement distillation protocol to higher-rate n -to- ( n − 1 ) protocols that can correct any single-qubit errors. These protocols are evaluated through numerical simulations focusing on fidelity and yield. We also outline a method to adapt any classical error-correcting code for entanglement distillation, where the code can correct both bit-flip and phase-flip errors by incorporating Hadamard gates. (2) We propose a constant-depth decoder for stabilizer codes that transforms logical states into physical ones using single-qubit measurements. This decoder is applied to entanglement distillation protocols, reducing circuit depth and enabling protocols derived from high-performance quantum error-correcting codes. We demonstrate this by evaluating the circuit complexity for entanglement distillation protocols based on surface codes and quantum convolutional codes. (3) Our stabilizer entanglement distillation techniques advance quantum computing. We propose a fault-tolerant protocol for constant-depth encoding and decoding of arbitrary states in surface codes, with potential extensions to more general quantum low-density parity-check codes. This protocol is feasible with state-of-the-art reconfigurable atom arrays and surpasses the limits of conventional logarithmic depth encoders. Overall, our study integrates stabilizer formalism, measurement-based quantum computing, and entanglement distillation, advancing both quantum communication and computing.
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.