Enhancing Quantum Key Distribution with Entanglement Distillation and Classical Advantage Distillation

Abstract

Realizing secure communication between distant parties is one of quantum technology's main goals. Although quantum key distribution promises information-theoretic security for sharing a secret key, the key rate heavily depends on the level of noise in the quantum channel. To overcome the noise, both quantum and classical techniques exist, i.e., entanglement distillation and classical advantage distillation. So far, these techniques have only been used separately from each other. Herein, we present a two-stage distillation scheme concatenating entanglement distillation with classical advantage distillation. For advantage distillation, we utilize a fixed protocol, specifically, the repetition code; in the case of entanglement distillation, we employ an enumeration algorithm to find the optimal protocol. We test our scheme for different noisy entangled states and demonstrate its quantitative advantage: our two-stage distillation scheme achieves finite key rates even in the high-noise regime where entanglement distillation or advantage distillation alone cannot afford key sharing. We also calculate the security bounds for relevant QKD protocols with our key distillation scheme and show that they exceed the previous security bounds with only advantage distillation. Since the advantage distillation part does not introduce further requirements on quantum resources, the proposed scheme is well-suited for near-term quantum key distribution tasks.

References in corpus (21)

• Quantum cryptography: Public key distribution and coin tossing
• The Security of Practical Quantum Key Distribution
• Secure quantum key distribution with realistic devices
• Large Scale Modular Quantum Computer Architecture with Atomic Memory and Photonic Interconnects
• An information-theoretic security proof for QKD protocols
• High threshold universal quantum computation on the surface code
• Entanglement Distillation between Solid-State Quantum Network Nodes
• Lower and upper bounds on the secret key rate for QKD protocols using one--way classical communication
• Long-distance entanglement purification for quantum communication
• Topological quantum computing with a very noisy network and local error rates approaching one percent
• The Clifford group, stabilizer states, and linear and quadratic operations over GF(2)
• Standard forms of noisy quantum operations via depolarization
• Local permutations of products of Bell states and entanglement distillation
• Key distillation from quantum channels using two-way communication protocols
• A repetition code of 15 qubits
• High threshold distributed quantum computing with three-qubit nodes
• Key rates for quantum key distribution protocols with asymmetric noise
• Enumerating all bilocal Clifford distillation protocols through symmetry reduction
• Near-term $n$ to $k$ distillation protocols using graph codes
• No-Go Theorems for Universal Entanglement Purification
• Counting stabiliser codes for arbitrary dimension