Advantage Distillation for Quantum Key Distribution

TL;DR

Advantage Distillation for Quantum Key Distribution develops a unified, framework-level approach to QKD post-processing that generalizes preprocessing using classical linear codes within an entanglement-distillation perspective. It derives explicit key-rate formulas for scenarios with and without OTP encryption and shows that omitting OTP can yield higher rates, achieving state-of-the-art tolerable-error-rate thresholds with [n 1 n] codes and further rate gains with [m m-1 2] codes. The framework accommodates adding structured noise and B-steps in a CRO-compatible, prepare-and-measure-reducible fashion, providing a systematic path to design higher-performance, more practical QKD protocols. This work suggests broad applicability, including enhancements to measurement-device-independent QKD and decoy-state variants, and lays groundwork for finite-size analyses and extensions to continuous-variable QKD.

Abstract

Quantum key distribution promises information-theoretically secure communication, with data post-processing playing a vital role in extracting secure keys from raw data. While hardware advancements have significantly improved practical implementations, optimizing post-processing techniques offers a cost-effective avenue to enhance performance. Advantage distillation, which extends beyond standard information reconciliation and privacy amplification, has proven instrumental in various post-processing methods. However, the optimal post-processing remains an open question. Therefore, it is important to develop a comprehensive framework to encapsulate and enhance these existing methods. In this work, we propose an advantage distillation framework for quantum key distribution, generalizing and unifying existing key distillation protocols. Inspired by entanglement distillation, our framework not only integrates current techniques but also improves upon them. Notably, by employing classical linear codes, we achieve higher key rates, particularly in scenarios where one-time pad encryption is not used for post-processing. Our approach provides insights into existing protocols and offers a systematic way for further enhancements in quantum key distribution.

Figures (16)

• Figure 1: Flowchart for QKD. The process consists of two phases. Top: The quantum phase involves state preparation, transmission through a potentially adversarial channel, and measurement. Bottom: Classical data post-processing encompasses data sifting, preprocessing (the focus of this work), information reconciliation, and privacy amplification. Parameter estimation, utilizing data statistics, is also crucial. For simplicity, procedures like authentication and error verification Fung2010Finite are omitted.
• Figure 2: Quantum circuit for extracting the tag $t = Hx$ from data qubits $\ket{x}$. The circuit employs the parity check matrix $H$ of the $[7\ 4\ 3]$ code. Ancillary qubits are initialized to $\ket{0}$. The operations on each ancillary qubit correspond to a row of $H$. Ancillary qubits are measured in the computational basis at the end, yielding the tag $t=Hx$ of the data $x$.
• Figure 3: The CCNOT operation, also known as the Toffoli gate, exhibits non-linearity in its treatment of the two control qubits.
• Figure 4: The quantum circuit for hashing and measuring the tag, along with its equivalent circuit. Only one side of Alice and Bob is illustrated. Here, the Hadamard gates transform phase errors into bit errors. Since the ancillary qubits are perfect EPR pairs, Alice and Bob simultaneously apply the XOR operation or not, ensuring that the phase error pattern remains unchanged.
• Figure 5: The QKD protocol consists of two essential steps: information reconciliation (IR) and privacy amplification(PA) Shor_simple_2000Huang_stream_2022. Here, we focus on Bob's operations. In the information reconciliation step, Alice and Bob conduct hashing from noisy EPR pairs to perfect EPR pairs to extract the bit error syndrome(illustrated by the CNOT operation from noisy EPR to perfect EPR). Subsequently, Bob corrects his noisy EPR pairs based on the obtained syndrome, employing the controlled-X operation. They proceed to privacy amplification, which uses additional perfect EPR pairs to add randomness to their keys, ensuring the security of the generated keys (illustrated by the CNOT operation from perfect EPR to noisy EPR). Finally, the process concludes with measuring the noisy EPR pairs in the computational basis, obtaining the secret keys.

Theorems & Definitions (14)

• Definition 1: $\varepsilon$-smallest probable set
• Definition 2: Universal hash family CARTER1979143WEGMAN1981265
• Lemma 1: One-way error correction Shannon_mathematical_1948cover1999elements
• proof
• Lemma 2: Bit- and phase-error-correction decoupling Lo_2003
• proof
• Definition 3: Classically Replaceable Operation, CRO Liu2022classically
• Theorem 1: Key rate formula for advantage distillation with OTP encryption
• Theorem 2: Key rate formula for advantage distillation with OTP encryption and bit error syndrome hashing
• Lemma 3: Transformation of the phase error pattern without OTP encryption