Discrete-phase-randomized mode-pairing quantum key distribution

This paper proposes a discrete-phase-randomized mode-pairing quantum key distribution (DPR-MP-QKD) protocol that ensures practical security by replacing the experimentally infeasible continuous phase randomization with a discrete version requiring only a few random bits, while achieving key rates comparable to the continuous case with approximately 14 discrete phases.

The Gist

Imagine two friends, Alice and Bob, trying to share a secret code over a long distance using light. This is the goal of Quantum Key Distribution (QKD). The challenge is that if they send too much light, a spy (Eve) can steal the message without being noticed. If they send too little, the signal gets lost in the noise of the fiber optic cables.

For a long time, scientists had a "Goldilocks" problem: they needed a perfect balance that was theoretically possible but practically impossible to build.

Here is a simple breakdown of what this paper achieves, using everyday analogies.

1. The Problem: The "Perfectly Random" Spinner

In the best version of this technology (called MP-QKD), Alice and Bob need to spin a wheel to decide the "phase" (the timing or color) of their light pulses.

• The Ideal: In theory, this wheel should spin so smoothly and randomly that it can land on any angle between 0 and 360 degrees. This is called continuous phase randomization. It's like trying to spin a wheel and having it stop on any of the infinite points on a circle.
• The Reality: In the real world, you can't spin a wheel to land on every possible point. You can only land on specific spots, like the numbers on a clock (12, 1, 2, etc.). This is discrete phase randomization.
• The Risk: Previous security proofs assumed the wheel was perfectly smooth. Because real machines are "chunky" (discrete), hackers might find a loophole to steal the key without Alice and Bob knowing. The old method was like building a fortress based on the assumption that the walls were made of solid steel, when in reality, they had tiny gaps between the bricks.

2. The Solution: The "Discrete" Protocol

The authors propose a new protocol called DPR-MP-QKD. Instead of trying to build a perfect, smooth wheel (which is impossible), they designed a security system that works perfectly with a "chunky" wheel that only has a few specific spots.

Think of it like this:

• Old Way: "We need a magic lock that opens with any key shape. Since we can't make a magic lock, we are vulnerable."
• New Way: "We know our lock only accepts keys with 14 specific notches. We have designed a new security system that proves the lock is safe even though it only has those 14 notches."

3. How It Works: The "Pseudo" Single Photon

The paper explains that when you use a "chunky" wheel, the light you send out isn't a perfect single particle (photon). It's a mix.

• The Analogy: Imagine you are trying to send a single, perfect apple to a friend. But because your machine is imperfect, sometimes you send a whole bushel, sometimes a basket, and sometimes just one apple.
• The Discovery: The authors figured out that even with the imperfect machine, there is a specific "slice" of the light that acts exactly like a single apple (a "pseudo single-photon").
• The Strategy: They proved that if you only count the messages that come from these "single apple" moments, the system is perfectly secure. The "bushels" and "baskets" (multi-photon states) are ignored or treated as noise.

4. The Results: "Good Enough" is Perfect

The team ran computer simulations to see how many "notches" (discrete phases) they needed on their wheel to make it as good as the impossible "smooth" wheel.

• The Finding: They found that if they use just 14 discrete phases (like a clock with 14 numbers instead of 12), the security and speed of the key generation become almost identical to the theoretical perfect version.
• The Randomness Bonus: A smooth wheel requires an infinite amount of random numbers to spin. A 14-notch wheel only needs 4 bits of randomness (since $2^4 = 16$, which covers 14 spots). This is a massive saving in computing resources.

5. The Bottom Line

This paper solves a practical engineering headache. It takes a quantum communication protocol that was theoretically great but experimentally shaky (because it required impossible hardware) and makes it practical and secure.

• Before: "We can't build this because we can't make perfect random light."
• Now: "We can build this using standard, imperfect light sources, as long as we use a specific math trick to filter out the bad parts. We only need a tiny bit of randomness (4 bits) to make it work."

The paper confirms that this new method allows Alice and Bob to share secret keys over long distances faster than ever before, breaking the "speed limit" that used to apply to fiber-optic cables, all without needing the impossible "perfect" hardware.

Technical Summary

Technical Summary: Discrete-Phase-Randomized Mode-Pairing Quantum Key Distribution

Problem Statement
Mode-pairing quantum key distribution (MP-QKD) has emerged as a promising protocol capable of surpassing the repeaterless rate-transmittance bound (PLOB bound) without requiring global phase locking, a significant practical hurdle for twin-field (TF) type protocols. However, the security proofs for existing MP-QKD implementations rely on the assumption of continuous phase randomization at the source. In practice, generating a truly continuous random phase is experimentally infeasible; real-world devices can only implement discrete phase choices. This discrepancy creates a potential security loophole, as the source may not perfectly match the idealized statistical mixture of Fock states assumed in security proofs, potentially compromising the protocol's practical security.

Methodology
To address this limitation, the authors propose a Discrete-Phase-Randomized Mode-Pairing Quantum Key Distribution (DPR-MP-QKD) protocol. The methodology involves three primary analytical steps:

1. Source Modeling and Basis Dependence Analysis:
   The authors model the coherent state source where the phase $\theta$ is chosen from a finite set of $D$ discrete values uniformly distributed in $[0, 2\pi)$. They introduce virtual ancilla qudit systems to record the discrete phase information. Through Fourier transformation, they decompose the joint state into "pseudo single-photon states" ($|\lambda^\mu_k\rangle$) and higher-order components.
   A critical part of the analysis is examining the basis dependence of the source. By calculating the fidelity between the density matrices of the Z-basis and the X-basis, the authors demonstrate that under discrete phase randomization, the source is not perfectly basis-independent. They prove that only the pseudo single-photon states ($k=1$) contribute positively to the secure key rate, while multi-photon components introduce significant basis dependence that renders them insecure. The fidelity for the vacuum component ($k=0$) is found to be $1/\sqrt{2}$, but its high error rate precludes key generation.

2. Discrete-Phase-Randomized Decoy State Method:
   To ensure security against photon-number-splitting attacks and to estimate the yield and error rates of the pseudo single-photon states, the authors develop a concrete decoy state method adapted for discrete phases. Unlike standard MP-QKD where yields are assumed identical across different intensities, the discrete nature of the phase introduces deviations. The authors derive upper and lower bounds for the yield ($Y$) and error rate ($e$) differences between different intensity settings using the fidelity between the corresponding quantum states. These bounds allow for the estimation of the fraction of pseudo single-photon pairs ($q^Z_{1,1}$) and the phase error rate ($e^{Z,p}_{1,1}$) in the Z-basis, which are essential for calculating the final key rate.

3. Protocol Definition:
   The paper details the DPR-MP-QKD protocol steps, including state preparation (using discrete phases and signal/decoy intensities), mode pairing (pairing successful detection events within a maximal interval $l$), basis sifting, key mapping, and parameter estimation.

Key Results
Numerical simulations were conducted to evaluate the performance of the DPR-MP-QKD protocol under various conditions:

• Convergence to Continuous Case: The simulation results indicate that as the number of discrete phases ($D$) increases, the key rate performance of the DPR-MP-QKD protocol progressively approaches that of the ideal continuous phase randomization case. Convergence is effectively achieved at approximately $D=14$ discrete phases.
• Performance vs. PLOB Bound: Even with a fixed number of discrete phases, the protocol retains the ability to surpass the PLOB bound, provided the pairing interval $l$ is sufficiently large.
• Randomness Efficiency: A significant finding is the drastic reduction in randomness requirements. While continuous phase randomization theoretically demands an unlimited supply of random bits, the proposed scheme requires only a few bits to encode the discrete phases. Specifically, the authors note that 4 random bits are sufficient to encode 14 discrete phases ($2^4 = 16 > 14$), making the protocol highly practical for real-world implementation.

Significance and Claims
The paper claims to resolve the practical security vulnerability of MP-QKD caused by the infeasibility of continuous phase randomization. By introducing the DPR-MP-QKD protocol and a corresponding security analysis framework, the authors demonstrate that:

1. The protocol maintains security without the experimentally impossible requirement of continuous phase randomization.
2. The key rate performance is nearly identical to the continuous case with a modest number of discrete phases (around 14), ensuring high efficiency.
3. The randomness consumption is reduced from infinite to a finite, small number of bits (e.g., 4 bits), significantly lowering the hardware and computational demands for the random number generator.

The authors conclude that their approach provides a robust, practical, and secure implementation of MP-QKD, bridging the gap between theoretical security proofs and experimental feasibility. They suggest future work could extend this analysis to finite-key regimes, asymmetric channels, and source imperfections such as phase deviations.