Near-term $n$ to $k$ distillation protocols using graph codes

Abstract

Noisy hardware forms one of the main hurdles to the realization of a near-term quantum internet. Distillation protocols allows one to overcome this noise at the cost of an increased overhead. We consider here an experimentally relevant class of distillation protocols, which distill $n$ to $k$ end-to-end entangled pairs using bilocal Clifford operations, a single round of communication and a possible final local operation depending on the observed measurement outcomes. In the case of permutationally invariant depolarizing noise on the input states, we find a correspondence between these distillation protocols and graph codes. We leverage this correspondence to find provably optimal distillation protocols in this class for several tasks important for the quantum internet. This correspondence allows us to investigate use cases for so-called non-trivial measurement syndromes. Furthermore, we detail a recipe to construct the circuit used for the distillation protocol given a graph code. We use this to find circuits of short depth and small number of two-qubit gates. Additionally, we develop a black-box circuit optimization algorithm, and find that both approaches yield comparable circuits. Finally, we investigate the teleportation of encoded states and find protocols which jointly improve the rate and fidelities with respect to prior art.

arXiv comment29 pages, 19 figures

References in corpus (32)

• Quantum Computing in the NISQ era and beyond
• Mixed State Entanglement and Quantum Error Correction
• Quantum cryptography: Public key distribution and coin tossing
• Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
• Quantum privacy amplification and the security of quantum cryptography over noisy channels
• Multi-party entanglement in graph states
• Quantum Error Correction and Orthogonal Geometry
• Quantum repeaters based on entanglement purification
• Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask)
• Entanglement purification and quantum error correction
• Optimizing practical entanglement distillation
• Entanglement purification for Quantum Computation
• Hadamard-free circuits expose the structure of the Clifford group
• Optimized Entanglement Purification
• Graphs, Quadratic Forms, and Quantum Codes
• On the Classification of All Self-Dual Additive Codes over GF(4) of Length up to 12
• Local unitary versus local Clifford equivalence of stabilizer states
• Entanglement-assisted entanglement purification
• Interpolation of recurrence and hashing entanglement distillation protocols
• Entanglement Purification with Double Selection
• Efficient entanglement purification protocols for d-level systems
• Optimal preparation of graph states
• Adaptive recurrence quantum entanglement distillation for two-Kraus-operator channels
• Local unitary versus local Clifford equivalence of stabilizer and graph states
• Graphical Quantum Error-Correcting Codes
• Entanglement purification by counting and locating errors with entangling measurements
• Enumerating all bilocal Clifford distillation protocols through symmetry reduction
• Quantum key distribution over quantum repeaters with encoding: Using Error Detection as an Effective Post-Selection Tool
• Transformations of Stabilizer States in Quantum Networks
• Scheme for constructing graphs associated with stabilizer quantum codes
• Counting stabiliser codes for arbitrary dimension
• Faster-than-Clifford Simulations of Entanglement Purification Circuits and Their Full-stack Optimization

Cited by in corpus (11)

• Thresholds for the distributed surface code in the presence of memory decoherence
• No-Go Theorems for Universal Entanglement Purification
• Stabilizer Entanglement Distillation and Efficient Fault-Tolerant Encoders
• Entanglement buffering with two quantum memories
• Fault-tolerant structures for measurement-based quantum computation on a network
• On noise in swap ASAP repeater chains: exact analytics, distributions and tight approximations
• Disti-Mator: an entanglement distillation-based state estimator
• Reliable Quantum Communications based on Asymmetry in Distillation and Coding
• Constant Overhead Entanglement Distillation via Scrambling
• A double selection entanglement distillation-based state estimator
• Enhancing Quantum Key Distribution with Entanglement Distillation and Classical Advantage Distillation