arxiv: 2605.14484 · v1 · submitted 2026-05-14 · 🪐 quant-ph

Recognition: 2 theorem links

· Lean Theorem

Discrete-phase-randomized mode-pairing quantum key distribution

Yuewei Xu , Zeyang Lu , Chan Li , Jian Long , Zhu Cao

Authors on Pith no claims yet

Pith reviewed 2026-05-15 01:55 UTC · model grok-4.3

classification 🪐 quant-ph

keywords quantum key distributionmode-pairing QKDdiscrete phase randomizationdecoy state methodbasis dependencesecret key ratepractical QKD

0 comments

The pith

Discrete phase randomization secures mode-pairing QKD with finite phases and few random bits.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

Mode-pairing QKD reaches high rates without global phase locking, yet its security proofs have required continuous phase randomization at the source, an assumption impossible to realize in experiment. The paper replaces that assumption with discrete phase randomization and supplies a matching discrete decoy-state analysis that handles the resulting basis dependence of the source. Numerical simulations show the secret-key rate of the new protocol approaches the continuous-phase limit once roughly 14 discrete phases are used. The same change reduces the randomness requirement from an unbounded supply of bits to a handful per pulse.

Core claim

The DPR-MP-QKD protocol is made secure by a discrete decoy-state method that fully accounts for basis dependence under finite phase randomization; the resulting key rate converges to the continuous-phase MP-QKD rate at approximately 14 phases while requiring only a few random bits.

What carries the argument

The discrete decoy-state method adapted to basis-dependent sources under discrete phase randomization.

If this is right

The secret key rate of DPR-MP-QKD converges to the continuous-phase MP-QKD rate once about 14 discrete phases are employed.
Only a small number of random bits (for example four) suffice for phase randomization instead of an unlimited supply.
The protocol remains secure against basis-dependent attacks while preserving the high-rate advantage of mode-pairing.
Practical implementations become feasible without continuous phase randomization hardware.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The same discrete-phase technique may simplify security proofs for other QKD protocols that currently assume continuous randomization.
Hardware demonstrations could verify the 14-phase convergence using existing laser and modulator technology.
Lower randomness demand could reduce the engineering overhead of integrating QKD into existing optical networks.
Further analysis might reveal distance-dependent thresholds where even fewer phases suffice.

Load-bearing premise

A concrete discrete decoy-state method exists that fully accounts for the basis dependence of the source under discrete phase randomization.

What would settle it

A security proof or experimental attack that shows the discrete decoy bounds fail to guarantee positive key rate for any finite number of phases would falsify the central claim.

Figures

Figures reproduced from arXiv: 2605.14484 by Chan Li, Jian Long, Yuewei Xu, Zeyang Lu, Zhu Cao.

**Figure 3.** Figure 3: FIG. 3. The relation between the key rate and the transmis [PITH_FULL_IMAGE:figures/full_fig_p008_3.png] view at source ↗

**Figure 2.** Figure 2: FIG. 2. The relation between the key rate and the trans [PITH_FULL_IMAGE:figures/full_fig_p008_2.png] view at source ↗

read the original abstract

Mode-pairing quantum key distribution (MP-QKD) protocol achieves performance beyond the repeaterless rate-transmittance bound and exhibits excellent practicality by avoiding the requirement for difficult global phase locking. However, the source side of MP-QKD still relies on the assumption of continuous phase randomization, an experimentally infeasible requirement in practice. Therefore, the practical security of the protocol cannot be fully guaranteed. In this work, we propose a discrete-phase-randomized mode-pairing quantum key distribution (DPR-MP-QKD) protocol and analyze the basis-dependence of the source side. Then, we introduce a concrete discrete version of the decoy state method that ensures the security of the DPR-MP-QKD protocol. Finally, simulation results indicate that as the number of discrete phases increases, the key rate performance of DPR-MP-QKD progressively approaches that of the continuous case, with convergence achieved at approximately 14 discrete phases. Moreover, our approach drastically lowers the demand for randomness. While conventional continuous phase randomization demands an unlimited supply of random bits, we show that merely a few bits (e.g., 4) are adequate.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

This paper replaces the continuous phase randomization in mode-pairing QKD with a discrete version and supplies a matching decoy-state analysis that keeps most of the rate advantage while needing only a handful of random bits.

read the letter

The main takeaway is that discrete phase randomization at around 14 phases gets the key rate close to the continuous-phase limit for MP-QKD, and the randomness demand drops from unlimited bits to just a few. That is the concrete advance here. The authors define a discrete-phase source, work out the basis dependence that remains at finite phase count, and then build a decoy-state method that bounds the yields while folding in that dependence. They derive the relevant bounds directly from the protocol equations and show numerically that the resulting rate converges by N=14. The argument is parameter-free on the security side and the simulations follow from the same formulas, so the internal logic holds together. What stands out is the reduction in experimental demand: no more need for a continuous phase modulator or infinite randomness. That moves the protocol closer to something that can actually be built with current hardware. The soft spots are modest. The yield bounds are derived to account for residual basis dependence, but their tightness depends on how the discrete phases are chosen and on the channel model; a referee would want to see whether those bounds leave much room on the table compared with the continuous case. The simulations are clean but would benefit from explicit checks on statistical fluctuations and on how the choice of phase set affects the final rate. No obvious circularity or fitting issues appear. This is work for groups already running or simulating mode-pairing experiments who need a source model they can actually implement. It is not a complete overhaul of the field, but it removes a clear practical obstacle without sacrificing the performance edge. The paper deserves a serious referee; the central construction is explicit enough to be checked and the numerical evidence is tied directly to the security derivation.

Referee Report

0 major / 3 minor

Summary. The manuscript proposes the discrete-phase-randomized mode-pairing quantum key distribution (DPR-MP-QKD) protocol. It analyzes the basis dependence introduced by replacing continuous phase randomization with a finite set of discrete phases, constructs an explicit discrete decoy-state method that incorporates the residual basis dependence into the yield bounds, and presents numerical simulations showing that the resulting secret key rate converges to the continuous-phase MP-QKD limit at approximately 14 phases while requiring only a few bits of randomness (e.g., 4 bits).

Significance. If the central construction holds, the work removes a major experimental obstacle to MP-QKD by eliminating the need for continuous phase randomization while preserving its repeaterless rate advantage. The parameter-free derivation of the discrete-phase yield bounds and the direct numerical demonstration that convergence occurs by N=14 constitute a concrete, falsifiable advance that lowers the randomness overhead from an unbounded supply to a small fixed number of bits.

minor comments (3)

The simulation section should report the precise channel parameters, detector efficiencies, and error-bar analysis used to establish convergence at N=14; without these, the claim that performance 'progressively approaches' the continuous case remains difficult to reproduce.
The statement that 'merely a few bits (e.g., 4) are adequate' should be accompanied by an explicit accounting of how the discrete phases are selected (e.g., uniform spacing) and how the finite randomness is mapped onto the phase choices in the security proof.
Notation for the discrete-phase yield bounds (e.g., the modified Y_{11} and e_{11} expressions) should be introduced with a clear comparison table to the continuous-phase formulas to highlight exactly where the basis-dependence correction appears.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for the careful reading and positive evaluation of our manuscript. The summary accurately captures the protocol, the discrete decoy-state analysis, and the numerical demonstration of convergence at approximately 14 phases. We appreciate the recognition that the work removes a major experimental obstacle by reducing randomness overhead to a small fixed number of bits. No specific major comments were listed in the report.

Circularity Check

0 steps flagged

No significant circularity in derivation chain

full rationale

The paper supplies an explicit construction of the discrete decoy-state method together with derived yield bounds that incorporate residual basis dependence at finite phase numbers. These bounds are obtained directly from the protocol definition and the discrete-phase source model; the numerical convergence to the continuous-phase limit at N≈14 is computed from the same closed-form expressions used in the security proof. No fitted parameters are renamed as predictions, no self-citation supplies a load-bearing uniqueness theorem, and the central security claim does not reduce to a tautology or to data already used to define the input quantities. The derivation is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

Abstract-only review prevents exhaustive enumeration; the central claim rests on the unproven assertion that a discrete decoy-state method can be constructed to bound eavesdropper information under finite phase randomization.

axioms (1)

domain assumption A concrete discrete version of the decoy state method exists that ensures security once basis dependence is analyzed.
Stated directly in the abstract as the step that guarantees security of DPR-MP-QKD.

pith-pipeline@v0.9.0 · 5497 in / 1315 out tokens · 34107 ms · 2026-05-15T01:55:24.592749+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

We introduce a concrete discrete version of the decoy state method... convergence achieved at approximately 14 discrete phases
IndisputableMonolith/Foundation/RealityFromDistinction.lean reality_from_one_distinction unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

basis-dependence formula... F^θ_{k,k} ... Sk(α) = ∑ e^{i 2π n k / D} exp(α e^{-i 2π n / D})

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

40 extracted references · 40 canonical work pages

[1]

except that the intensity parameter µ is replaced by 2 µ . C. Basis-dependence analysis Under the framework of the original MP-QKD protocol with discrete phase randomization [27], and according to the decompositions presented in II A and II B, we obtain the encoded logical bases for Alice (Bob’s case is analo- gous) of Z and {Xθ}θ= 2π D n,n =0, 1, 2,..., ...

work page
[2]

to bound the phase error rate eZ,p 1, 1 in the Z- basis. IV. SIMULATION RESULT In this section, we simulate the performance of DPR- MP-QKD as a function of the communication distance under diﬀerent pairing intervals l and diﬀerent numbers of discrete phases D. The intensity µ is varied within the 8 range [0, 0. 5] to optimize the key rate. The simulation ...

work page
[3]

C. H. Bennett and G. Brassard, Quantum cryptogra- phy: Public key distribution and coin tossing, Theoreti- cal computer science 560, 7 (2014)

work page 2014
[4]

Y.-A. Chen, Q. Zhang, T.-Y. Chen, W.-Q. Cai, S.-K. Liao, J. Zhang, K. Chen, J. Yin, J.-G. Ren, Z. Chen, et al. , An integrated space-to-ground quantum commu- nication network over 4,600 kilometres, Nature 589, 214 (2021)

work page 2021
[5]

Pirandola, U

S. Pirandola, U. L. Andersen, L. Banchi, M. Berta, D. Bunandar, R. Colbeck, D. Englund, T. Gehring, C. Lupo, C. Ottaviani, et al., Advances in quantum cryp- tography, Advances in optics and photonics 12, 1012 (2020)

work page 2020
[6]

Lydersen, C

L. Lydersen, C. Wiechers, C. Wittmann, D. Elser, J. Skaar, and V. Makarov, Hacking commercial quan- tum cryptography systems by tailored bright illumina- tion, Nature photonics 4, 686 (2010)

work page 2010
[7]

F. Xu, X. Ma, Q. Zhang, H.-K. Lo, and J.-W. Pan, Secure quantum key distribution with realistic devices, Reviews of modern physics 92, 025002 (2020)

work page 2020
[8]

Takeoka, S

M. Takeoka, S. Guha, and M. M. Wilde, Fundamental rate-loss tradeoﬀ for optical quantum key distribution, Nature communications 5, 5235 (2014)

work page 2014
[9]

Pirandola, R

S. Pirandola, R. Laurenza, C. Ottaviani, and L. Banchi, Fundamental limits of repeaterless quantum communica- tions, Nature communications 8, 15043 (2017)

work page 2017
[10]

Lo and H

H.-K. Lo and H. F. Chau, Unconditional security of quan- tum key distribution over arbitrarily long distances, sci- ence 283, 2050 (1999)

work page 2050
[11]

P. W. Shor and J. Preskill, Simple proof of security of the bb84 quantum key distribution protocol, Physical review letters 85, 441 (2000)

work page 2000
[12]

Koashi, Simple security proof of quantum key dis- tribution based on complementarity, New Journal of Physics 11, 045018 (2009)

M. Koashi, Simple security proof of quantum key dis- tribution based on complementarity, New Journal of Physics 11, 045018 (2009)

work page 2009
[13]

H. K. Lo and J. Preskill, Security of quantum key dis- tribution using weak coherent states with nonrandom phases, Quantum Information and Computation (2007)

work page 2007
[14]

H.-K. Lo, M. Curty, and B. Qi, Measurement-device- independent quantum key distribution, Physical review letters 108, 130503 (2012)

work page 2012
[15]

Tamaki, H.-K

K. Tamaki, H.-K. Lo, C.-H. F. Fung, and B. Qi, Phase encoding schemes for measurement-device-independent quantum key distribution with basis-dependent ﬂaw, Physical Review A—Atomic, Molecular, and Optical Physics 85, 042307 (2012)

work page 2012
[16]

Ma and M

X. Ma and M. Razavi, Alternative schemes for measurement-device-independent quantum key distribu- tion, Physical Review A—Atomic, Molecular, and Opti- cal Physics 86, 062319 (2012)

work page 2012
[17]

Liu, T.-Y

Y. Liu, T.-Y. Chen, L.-J. Wang, H. Liang, G.-L. Shentu, J. Wang, K. Cui, H.-L. Yin, N.-L. Liu, L. Li, et al., Exper- imental measurement-device-independent quantum key distribution, Physical review letters 111, 130502 (2013)

work page 2013
[18]

Ferreira da Silva, D

T. Ferreira da Silva, D. Vitoreti, G. Xavier, G. Do Ama- ral, G. Tempor˜ ao, and J. Von Der Weid, Proof- of-principle demonstration of measurement-device- independent quantum key distribution using polarization qubits, Physical Review A—Atomic, Molecular, and Optical Physics 88, 052303 (2013)

work page 2013
[19]

Z. Tang, Z. Liao, F. Xu, B. Qi, L. Qian, and H.-K. Lo, Experimental demonstration of polarization encoding measurement-device-independent quantum key distribu- tion, Physical review letters 112, 190503 (2014)

work page 2014
[20]

R. I. Woodward, Y. Lo, M. Pittaluga, M. Minder, T. K. Para ¨ ıso, M. Lucamarini, Z. Yuan, and A. Shields, Giga- hertz measurement-device-independent quantum key dis- tribution using directly modulated lasers, npj Quantum Information 7, 58 (2021)

work page 2021
[21]

Tang, H.-L

Y.-L. Tang, H.-L. Yin, Q. Zhao, H. Liu, X.-X. Sun, M.- Q. Huang, W.-J. Zhang, S.-J. Chen, L. Zhang, L.-X. You, et al. , Measurement-device-independent quantum key distribution over untrustful metropolitan network, Physical Review X 6, 011024 (2016)

work page 2016
[22]

Zukowski, A

M. Zukowski, A. Zeilinger, M. Horne, and A. Ekert, ” event-ready-detectors” bell experiment via entanglement swapping., Physical review letters 71 (1993)

work page 1993
[23]

Briegel, W

H.-J. Briegel, W. D¨ ur, J. I. Cirac, and P. Zoller, Quantum repeaters: the role of imperfect local operations in quan- tum communication, Physical Review Letters 81, 5932 (1998)

work page 1998
[24]

Azuma, K

K. Azuma, K. Tamaki, and H.-K. Lo, All-photonic quan- tum repeaters, Nature communications 6, 6787 (2015)

work page 2015
[25]

Lucamarini, Z

M. Lucamarini, Z. L. Yuan, J. F. Dynes, and A. J. Shields, Overcoming the rate–distance limit of quantum key distribution without quantum repeaters, Nature 557, 400 (2018)

work page 2018
[26]

X. Ma, P. Zeng, and H. Zhou, Phase-matching quantum key distribution, Physical Review X 8, 031043 (2018)

work page 2018
[27]

Lin and N

J. Lin and N. L¨ utkenhaus, Simple security analysis of phase-matching measurement-device-independent quan- tum key distribution, Physical Review A 98, 042332 13 (2018)

work page 2018
[28]

Wang, Z.-W

X.-B. Wang, Z.-W. Yu, and X.-L. Hu, Twin-ﬁeld quan- tum key distribution with large misalignment error, Physical Review A 98, 062323 (2018)

work page 2018
[29]

P. Zeng, H. Zhou, W. Wu, and X. Ma, Mode-pairing quantum key distribution, Nature Communications 13, 3903 (2022)

work page 2022
[30]

H.-T. Zhu, Y. Huang, H. Liu, P. Zeng, M. Zou, Y. Dai, S. Tang, H. Li, L. You, Z. Wang, et al. , Experimental mode-pairing measurement-device-independent quantum key distribution without global phase locking, Physical Review Letters 130, 030801 (2023)

work page 2023
[31]

S.-H. Sun, M. Gao, M.-S. Jiang, C.-Y. Li, and L.-M. Liang, Partially random phase attack to the practical two-way quantum-key-distribution system, Phys. Rev. A 85, 032304 (2012)

work page 2012
[32]

Tang, H.-L

Y.-L. Tang, H.-L. Yin, X. Ma, C.-H. F. Fung, Y. Liu, H.-L. Yong, T.-Y. Chen, C.-Z. Peng, Z.-B. Chen, and J.-W. Pan, Source attack of decoy-state quantum key distribution using phase information, Physical Review A—Atomic, Molecular, and Optical Physics 88, 022308 (2013)

work page 2013
[33]

Z. Cao, Z. Zhang, H.-K. Lo, and X. Ma, Discrete-phase- randomized coherent state source and its application in quantum key distribution, New Journal of Physics 17, 053014 (2015)

work page 2015
[34]

Cao, Discrete-phase-randomized measurement-device- independent quantum key distribution, Physical Review A 101, 062325 (2020)

Z. Cao, Discrete-phase-randomized measurement-device- independent quantum key distribution, Physical Review A 101, 062325 (2020)

work page 2020
[35]

H.-K. Lo, X. Ma, and K. Chen, Decoy state quantum key distribution, Physical review letters 94, 230504 (2005)

work page 2005
[36]

Z.-H. Wang, R. Wang, Z.-Q. Yin, S. Wang, F.-Y. Lu, W. Chen, D.-Y. He, G.-C. Guo, and Z.-F. Han, Tight ﬁnite-key analysis for mode-pairing quantum key distri- bution, Communications Physics 6, 265 (2023)

work page 2023
[37]

Z. Lu, G. Wang, C. Li, and Z. Cao, Asymmetric mode- pairing quantum key distribution, Physical Review A 109, 012401 (2024)

work page 2024
[38]

H.-T. Wang, C. Zhou, Y.-F. Lu, C.-P. Hao, Y.-M. Zhao, Y.-Y. Zhou, H.-W. Li, and W.-S. Bao, Asymmetric mode- pairing quantum key distribution with advantage distil- lation, Chinese Physics B 34, 040305 (2025)

work page 2025
[39]

Z. Li, T. Dou, Y. Xie, W. Kong, Y. Liu, H. Ma, and J. Tang, Asymmetric protocols for mode pairing quantum key distribution with ﬁnite-key analysis, Entropy 27, 737 (2025)

work page 2025
[40]

Gottesman, H.-K

D. Gottesman, H.-K. Lo, N. Lutkenhaus, and J. Preskill, Security of quantum key distribution with imperfect de- vices, in International Symposium onInformation The- ory, 2004. ISIT 2004. Proceedings. (IEEE, 2004) p. 136

work page 2004