Pith. sign in

REVIEW 3 major objections 4 minor 83 references

Reduced State Embedding for Error Correction in Quantum Cryptography

T0 review · 3 major / 4 minor · reviewed 2026-08-04 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read A quantum key distribution protocol that encodes in a k-symbol subset of a d-dimensional space can beat the full-dimensional scheme under realistic block-biased noise, with the optimum at k=5 for d=25.

desk verdict Useful idea, clean results for two channels, but the block-bias 'optimal' encoding is unproven and the k=5 validation is fitted, not predicted—worth a serious referee with major revision. read the letter →

arxiv 2510.19989 v2 pith:OA6ABE3C submitted 2025-10-22 quant-ph

Amit Kam , Kfir Sulimany , Shai Tsesses , Uzi Pereg This is my paper
classification quant-ph MSC 81P94 PACS 03.67.Dd
keywords quantumkeydistributionhigh-dimensionalencodingreducedstateembeddingerasureconversionDevetak-Winterrateblock-biasnoisespatialmodeserrorcorrection
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

The paper claims that encoding a quantum key in only k of the d available states, and filtering the receiver's measurement with a (k+1)-outcome test, can yield a higher secure key rate than using all d states. This works because physical errors that push the signal outside the chosen k-state subspace become inconclusive outcomes and are discarded, rather than becoming bit errors. For three noise models—depolarizing, modulo, and block-biased—the paper derives closed-form expressions for the Devetak-Winter key rate, the error threshold, and the sifting efficiency. In the block-biased channel, which matches their experiment, the rate peaks at an interior value k < d; for d=25 the predicted and measured optimum is k=5. The paper therefore argues that reduced-state embedding is a practical physical-layer error-correction strategy for high-dimensional QKD.

What carries the argument

The central object is the reduced-state embedding: a set of k mutually unbiased states selected from the d-dimensional space together with Bob's (k+1)-outcome filter Π_{b,x}, whose final outcome ⊥ is the projector onto the complement of the signal subspace. This filter acts as a syndrome test that converts physical errors into erasures before classical reconciliation. In the block-bias analysis, the block overlap E_b — the average fraction of block-smeared signal weight that remains inside the kept subspace — determines both the kept probability and the conditional error rate, and the balanced-occupancy assignment minimizing E_b drives the predicted optimum at k=√d.

What would settle it

For the d=25 block-biased channel with fixed ε1≈0.31 and ε2≈0.12, measure the per-signal key rate for k=5 using an unbalanced occupancy of states (e.g., all five kept states in one block). If any such encoding exceeds the balanced-occupancy rate, or if the measured rate at k=5 does not exceed those at k=4 and k=6, the predicted optimum would be contradicted.

Watch

Extended reading notes

Core claim

The central claim is that a k-symbol subset of a d-dimensional Hilbert space, paired with Bob's (k+1)-outcome POVM that replaces errors outside the subset with an inconclusive outcome, can outperform full d-dimensional encoding under realistic noise. The key rate per signal is R = (1/2) α_B [log2 k − 2 h_k(Q_B)], where α_B is the probability of a conclusive, basis-matched measurement and Q_B is the conditional dit error among kept events. For the block-biased channel, both α_B and Q_B are controlled by the block overlap E_b, and the paper identifies the balanced-occupancy encoding as optimal. Substituting the optimized E_b yields closed-form thresholds and predicts an interior maximum at k=5

Load-bearing premise

The claim that the balanced-occupancy encoding is optimal for the block-biased channel rests on the assumption that minimizing the block overlap E_b also maximizes the Devetak-Winter rate, which the paper states but does not prove for all noise parameters.

Editorial extensions

If this is right

  • For block-biased high-dimensional QKD channels, choosing k=√d rather than k=d is predicted to give a strictly higher secure key rate, with the experiment confirming this for d=25.
  • The closed-form rate and threshold expressions allow system designers to select k from measured noise parameters ε1 and ε2 without exhaustive search.
  • Because the receiver-side filtering is agnostic to the physical implementation, the method extends naturally to orbital-angular-momentum, time-bin, and frequency-encoded QKD platforms.
  • The reduction converts part of the physical noise into inconclusive outcomes, raising the effective error threshold at the cost of throughput, a trade-off that can be tuned.
  • The scheme realizes physical-layer erasure error correction, moving part of the standard post-processing error-correction task into the quantum communication stage itself.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • The paper's optimality claim for the balanced-occupancy encoding is asserted rather than proven; a direct search over unbalanced occupancies for fixed k and noise parameters could verify whether E_min truly maximizes the rate.
  • For real platforms where the block structure is anchored in one basis rather than both MUBs, the effective overlap differs and the optimal k may shift; this is a testable prediction of the same framework.
  • The erasure-conversion principle could be adapted to time-varying or non-block-structured noise by making the filter basis adapt to the measured error geometry, potentially improving rates beyond the fixed-embedding results.
  • The correspondence with erasure-based quantum gate conditioning suggests that the same reduced-state logic could be applied to quantum direct secure communication or quantum-secure computation, as the authors note.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The paper proposes a reduced-state embedding scheme for high-dimensional QKD: Alice encodes information in a k-symbol subset of a d-dimensional Hilbert space (k<d), and Bob performs a (k+1)-outcome POVM that filters the complementary subspace into an inconclusive outcome. The authors analyze three noise models—depolarizing, modulo, and block-biased channels—and derive closed-form expressions for the kept probability, conditional dit error, and Devetak–Winter key rate. They claim that for realistic noise, the per-signal secure key rate can be maximized at an intermediate k<d, and they support this with a d=25 experiment using an MPLC platform, reporting an optimum at k=5. The central idea is that a smaller, cleaner signal set converts physical errors into erasures, improving the net key rate despite reduced throughput.

Significance. If the central claim holds, the paper introduces a practical and conceptually interesting physical-layer error-correction strategy for high-dimensional QKD. The algebraic derivations for the three channels are internally consistent, and the closed-form expressions for α, Q, and thresholds are useful contributions. The experimental platform is real and the connection to erasure-based QEC is thought-provoking. However, the block-bias analysis contains an unproven optimality assertion, and the experimental validation is model-dependent, so the strength of the paper's main claim is currently limited. The paper does not ship code or machine-checked proofs, but the data are referenced as available.

major comments (3)
  1. [§2.2.3, Eqs. (39)–(43), (48)] The claim that the optimal encoding for fixed k is the balanced occupancy that minimizes E_b is not proved. In Eq. (42), E_b=(1/k)Σℓ_m², and the text substitutes E_b=E_min into (39) and (41) to compute the rate. However, R in Eq. (48) depends on E_b through α_B, which increases with E_b, and through Q_B, which also increases with E_b. The rate can therefore have an interior maximum in E_b. The numerical examples do not scan the full feasible set 0≤ℓ_m≤s, Σℓ_m=k. Since Section 2.3 uses this rule to select the embedded subspace at each k, the predicted and measured k=5 optimum rests on this unproven assertion. Please provide a proof that R is maximized at E_min, or perform an explicit optimization over all occupancy vectors and report the resulting rate landscape.
  2. [§2.3 and Fig. 6] The experimental validation is weaker than claimed because it is model-dependent. The figure caption states that the rate curves are evaluated via Eq. (14) with parameters extracted using Eqs. (39)–(41); that is, ε1=0.31 and ε2=0.12 are fitted from the same d=25 dataset, and the optimum at k=5 is then computed from the block-bias model. This is not a direct, model-free measurement of the secure key rate and does not independently confirm the model. The paper should state this explicitly, report the measured α and Q at each k (or the raw confusion matrices), and clarify that the k=5 maximum is a model prediction with fitted parameters, not an independently measured optimum.
  3. [§2.2.3, Fig. 5b] The statement 'the optimal signal-set size is k=s=√d' is presented as a general conclusion, but it is supported only by the four plotted curves at ε1=0.3, ε2=0.07. No proof or exhaustive parameter scan is given. If this is intended as a general theorem, it needs a proof; otherwise it should be qualified as a numerical observation at the displayed operating point. This is directly related to the missing optimality proof for E_b in Eqs. (42)–(43).
minor comments (4)
  1. [§2.2.1, 'Advantage of reduced state embedding'] The text says 'for ε<0.083, the optimal performance occurs when the signal-set size is strictly smaller than the space dimension.' This appears to be a sign error: the surrounding discussion and Figure 2b indicate that reduced-state embedding becomes preferable for larger noise ε, not smaller. Please check and correct this inequality.
  2. [§2.3] The text says 'the secure key rate per signal follows from Eq. (14)', but Eq. (14) is the per-sifted-symbol rate. The per-signal rate is given by Eq. (48). The same issue appears in the Figure 6 caption ('evaluated via Eq. (14)'). Please correct the equation reference.
  3. [§2.3] The sentence 'The quantities α and Q are obtained from the data using Eqs. (39)–(41)' is ambiguous: those are model expressions, not data estimators. Please clarify that the channel parameters ε1 and ε2 are fitted to the data, and then α and Q are computed from the model, or provide the directly measured α and Q.
  4. [§2.2.3, Remark 4] Remark 4 correctly notes that in a cross-basis situation the relevant overlap is E_X^(Z), not E_b. This is important because the main derivation assumes symmetric errors QX=QB. Please state explicitly whether the experimental MPLC validation satisfies this symmetry or uses the more general cross-basis expressions.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the rate derivation is self-contained, and the k=5 optimum is a structural model output rather than a directly fitted parameter.

full rationale

The key-rate chain starts from the Devetak-Winter bound (Eqs. 14, 19, 27, 31, 44, 48) and derives the kept probabilities α and dit errors Q from the stated channel maps (depolarizing Eq. 8; modulo Eq. 20; block-bias Eqs. 34–37). The rate expressions are therefore not defined in terms of their outputs. For the block-bias channel, the claimed optimum at k=√d is obtained by substituting the balanced-occupancy value E_min (Eq. 43) into Eqs. (39), (41), and (48). The paper does not prove that minimizing E_b maximizes R over all occupancies for every ε1, ε2, but this is an omitted-proof/correctness gap, not a circularity: R is not defined via E_min, and E_min is not fitted to the rate maximum. In the experimental validation, ε1 = 0.31 and ε2 = 0.12 are extracted from the same d=25 data (Section 2.3 and Fig. 6 caption), so the agreement is in-sample rather than a blind out-of-sample prediction. However, the location of the maximum is a structural consequence of the rate formulas and the block-bias model, not a directly fitted parameter, so the validation does not reduce by construction to its inputs. Self-citations (Refs. 61, 62, 82) supply the experimental platform and dataset, which are external, published, and falsifiable evidence; no load-bearing uniqueness theorem or ansatz is imported from the authors' prior work. Finding: no significant circularity.

Assumptions & free parameters 2 free parameters · 5 assumptions · 0 invented entities

The central claim rests on three channel models, one of which (block-bias) is introduced ad hoc to fit the authors' own experimental platform. The key-rate formulas assume the validity of the Devetak-Winter bound for a post-selected erasure-POVM protocol, which is not re-proven. In the experimental validation, the block-bias parameters ε1 and ε2 are fitted to the same data used to claim agreement, so the 'prediction' of the k=5 optimum is not parameter-free.

free parameters (2)
  • ε1 (block-bias intra-block depolarization probability) = 0.31
    Used to fit the block-bias model to the d=25 experimental data in Section 2.3; not independently measured.
  • ε2 (block-bias global depolarization probability) = 0.12
    Same fit; the key-rate 'prediction' at k=5 depends on these fitted values.
assumptions (5)
  • domain assumption The Devetak-Winter lower bound R ≥ log2 k − 2h_k(Q) applies to the two-basis k-ary protocol with the (k+1)-outcome erasure POVM, with Q estimated on conclusive, basis-matched rounds.
    Invoked at Eq. (14); no security proof specific to the erasure post-selection is given, so this is a load-bearing assumption.
  • standard math Depolarizing channel model D(ρ) = (1−ε)ρ + (ε/d)1_d describes the symmetric noise.
    Standard channel model, Section 2.2.1.
  • domain assumption Modulo channel M(ρ) = (1−2ε)ρ + εXρX† + εX†ρX describes nearest-neighbor hopping on a cycle.
    Motivated by multicore fiber coupling, Section 2.2.2.
  • ad hoc to paper The block-bias channel Λglobal∘Λblock(b) with block size s=√d captures the experimental error structure of the MPLC platform.
    Introduced by the authors to model their platform (Section 2.2.3); parameters are fitted to validate the protocol, so this model is not independently established.
  • ad hoc to paper The optimal encoding for a given k in the block-bias channel is the balanced occupancy across blocks (minimizing E_b).
    Stated in Section 2.2.3 without proof that it maximizes the key rate.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Reduced State Embedding for Error Correction in Quantum Cryptography." pith.science (2026). https://pith.science/paper/OA6ABE3C

@misc{pith2026251019989,
  author       = {Pith},
  title        = {Pith review of: Reduced State Embedding for Error Correction in Quantum Cryptography},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/OA6ABE3C}},
  note         = {Machine review of arXiv:2510.19989}
}
read the original abstract

Encoding in a high-dimensional Hilbert space improves noise resilience in quantum information processing. This approach, however, may result in cross-mode coupling and detection complexities, thereby reducing quantum cryptography performance. This fundamental trade-off between correctness and secrecy motivates the search for quantum error-correction approaches for cryptography. Here, we introduce state embeddings that use a k-symbol subset within a d-dimensional Hilbert space, tailored to the channel's error structure. In the framework of quantum error-correction, our reduced-state embedding realizes an explicit erasure-type error-correction within the quantum channel. We demonstrate the advantage of our scheme in realistic quantum channels, producing a higher secure key rate. We validate our approach using a d=25 quantum key distribution (QKD) experimental data, derive closed-form expressions for the key rate and threshold, and determine the optimum at k=5. These findings advance high-dimensional QKD and pave the way to error-correction and modulation for quantum cryptography.

Figures

Figures reproduced from arXiv: 2510.19989 by the authors.

Figure 1
Figure 1. Conceptual visualizations of the noisy channels. The states are represented by nodes in a graph, where the distance between adjacent nodes indicates the transition probability between the corresponding states. (a) Depolarizing channel (Section 2.2.1). In the depolarization model, each state is equally distant from every other state, as every pair has the same transition probability. The states sit at the vertices of… view at source ↗
Figure 2
Figure 2. Physical-noise threshold and secure key rate for the depolarizing channel. (a) Physical-noise threshold ε th D for different values of d. The heatmap shows the threshold of the tolerable depolarization probability ε, for a positive Devetak–Winter key rate, as a function of the signal￾set size k and the space dimension d. (b) Secure key rate R as a function of signal-set size k, for a fixed dimension d = 25. Each cur… view at source ↗
Figure 3
Figure 3. Encoding a signal set of size k on the cycle graph C6, for k = 2, . . . , 6. Red nodes rep￾resent chosen states in the subset Sb, corresponding to basis b. Blue edges indicate internal adjacencies in W(·) (“confusions”) that generate errors within the kept set, and green dashed edges are boundary adjacencies in B(·) that lead to inconclusive out￾comes. For k ≤ 3, the encoding removes all internal adjacencies, i.e., … view at source ↗
Figures from the paper (4 more)
Figure 4
Figure 4. Figure 4: Physical-noise threshold and secure key rate for modulo channel. (a) Heatmap of the physical-noise threshold ε th M. Results correspond to the evenly spaced encoding strategy. The triangular region k ≤ d marks valid encodings, with lighter colors indicating higher tole…
Figure 5
Figure 5. Figure 5: Physical-noise threshold and secure key rate for the block-bias channel. (a) Heatmap of the physical-noise threshold ε th 2 as a function of the Hilbert space dimen￾sion d and signal-set size k, with intra-block depolarization fixed at ε1 = 0.07. The contour lines high…
Figure 6
Figure 6. Figure 6: Validation in d=25 with reduced-state embedding. (a) Dit error Q among kept events and kept-event probability α versus embedded dimension k. (b) Secure-key rate per signal, evaluated via Eq. (14) with parameters extracted using Eqs. (39)–(41), exhibits a clear maximum …
Figure 7
Figure 7. Figure 7: System under test (d=25): entangled photon pairs are filtered to a 5 × 5 pixel basis and routed to two 10-plane MPLCs. The two MUBs are realized by five-mode DFTs applied along rows or columns. Basis choice is performed by switching displayed phase masks. This construc…

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

83 extracted references · 10 canonical work pages

  1. [1]

    Ekert, A. K. Quantum Cryptography Based on Bell’s Theorem.Physical Review Letters 67,661–663. doi:10.1103/PhysRevLett.67. 661(1991)

    doi:10.1103/physrevlett.67 1991

  2. [2]

    Scarani, V.et al.The Security of Practical Quantum Key Distribution.Reviews of Mod- ern Physics81,1301–1350. doi:10 . 1103 / RevModPhys.81.1301(2009)

    2009

  3. [3]

    & Bloch, M

    Pereg, U., Ferrara, R. & Bloch, M. R.Key As- sistance, Key Agreement, and Layered Secrecy for Bosonic Broadcast Channelsin2021 IEEE Information Theory Workshop (ITW)(2021), 1–6. doi:10.1109/ITW48936.2021.9611359

    arXiv 2021

  4. [4]

    & Pereg, U.Secure Commu- nication with Unreliable Entanglement Assis- tancein2024 IEEE International Sympo- sium on Information Theory (ISIT)(2024), 1017–1022

    Lederman, M. & Pereg, U.Secure Commu- nication with Unreliable Entanglement Assis- tancein2024 IEEE International Sympo- sium on Information Theory (ISIT)(2024), 1017–1022. doi:10 . 1109 / ISIT57864 . 2024 . 10619085

    2024

  5. [5]

    Berta, M., Christandl, M., Colbeck, R., Renes, J. M. & Renner, R. The uncertainty principle in the presence of quantum memory.Nature Physics6,659–662 (2010)

    2010

  6. [6]

    Bennett, C. H. & Brassard, G. Quantum Cryptography: Public Key Distribution and Coin Tossing.Proceedings of IEEE Interna- tional Conference on Computers, Systems and Signal Processing,175–179. doi:10 . 1109 / ICCS.1984.217339(1984)

    arXiv 1984

  7. [7]

    doi:10.1109/COMST

    Cao, Y.et al.The Evolution of Quantum Key Distribution Networks: On the Road to the Qinternet.IEEE Communications Surveys & Tutorials24,839–894. doi:10.1109/COMST. 2022.3152073(2022)

    arXiv 2022

  8. [8]

    doi:10.1038/s41566- 021- 00928-2(2022)

    Wang, S.et al.Twin-Field Quantum Key Dis- tribution over 830-km Fibre.Nature Photon- ics16,154–161. doi:10.1038/s41566- 021- 00928-2(2022)

    doi:10.1038/s41566- 2022

Show all 83 references
  1. [9]

    doi:10.1038/nature23655(2017)

    Liao, S.-K.et al.Satellite-to-Ground Quan- tum Key Distribution.Nature549,43–47. doi:10.1038/nature23655(2017)

    2017 doi

  2. [10]

    & Pan, J.-W

    Xu, F., Ma, X., Zhang, Q., Lo, H.-K. & Pan, J.-W. Secure Quantum Key Distribution with Realistic Devices.Reviews of Modern Physics 92,025002. doi:10 . 1103 / RevModPhys . 92 . 025002(2020)

    2020

  3. [11]

    Physical Review Letters98,010504

    Schmitt-Manderbach, T.et al.Experimen- tal Demonstration of Free-Space Decoy-State Quantum Key Distribution over 144 km. Physical Review Letters98,010504. doi:10. 1103/PhysRevLett.98.010504(2007). 12

    2007

  4. [12]

    Bloom, Y.et al.Decoy-State and Purifica- tion Protocols for Superior Quantum Key Dis- tribution with Imperfect Quantum-Dot-Based Single-Photon Sources: Theory and Exper- iment.PRX Quantum6,030332. doi:10 . 1103/PRXQuantum.6.030332(2025)

    2025

  5. [13]

    & Zhou, H.-Y

    Li, X.-H., Deng, F.-G. & Zhou, H.-Y. Efficient Quantum Key Distribution over a Collective Noise Channel.Physical Review A78,022321. doi:10.1103/PhysRevA.78.022321(2008)

    2008 doi

  6. [14]

    & Wilde, M

    Takeoka, M., Guha, S. & Wilde, M. M. Fun- damental rate-loss tradeoff for optical quan- tum key distribution.Nature communications 5,5235 (2014)

    2014

  7. [15]

    & Yuan, Z

    Diamanti, E., Lo, H.-K., Qi, B. & Yuan, Z. Practical challenges in quantum key distri- bution.npj Quantum Information2,1–12 (2016)

    2016

  8. [16]

    J., Bourennane, M., Karlsson, A

    Cerf, N. J., Bourennane, M., Karlsson, A. & Gisin, N. Security of Quantum Key Dis- tribution Using d-Level Systems.Physical Review Letters88,127902. doi:10 . 1103 / PhysRevLett.88.127902(2002)

    2002

  9. [17]

    & Zeilinger, A

    Erhard, M., Fickler, R., Krenn, M. & Zeilinger, A. Twisted Photons: New Quantum Perspectives in High Dimensions.Light: Sci- ence & Applications7,17146. doi:10.1038/ lsa.2017.146(2018)

    2017

  10. [18]

    & Zeilinger, A

    Erhard, M., Krenn, M. & Zeilinger, A. Ad- vances in High-Dimensional Quantum Entan- glement.Nature Reviews Physics2,365–381. doi:10.1038/s42254-020-0193-5(2020)

    2020 doi

  11. [19]

    & Scarani, V

    Sheridan, L. & Scarani, V. Security Proof for Quantum Key Distribution Using Qudit Sys- tems.Physical Review A82,030301. doi:10. 1103/PhysRevA.82.030301(2010)

    2010

  12. [20]

    & Karimi, E

    Scarfe, L., Zhang, Y. & Karimi, E. Spatial- Mode Quantum Cryptography in a 545- Dimensional Hilbert Space. arXiv:2503 . 22058 [quant-ph](2025)

    2025

  13. [21]

    & Souto Ribeiro, P

    Walborn, S., Lemelle, D., Almeida, M. & Souto Ribeiro, P. H. Quantum Key Distribu- tion with Higher-Order Alphabets Using Spa- tially Encoded Qudits.Physical Review Let- ters96,090501. doi:10.1103/PhysRevLett. 96.090501(2006)

    2006 doi

  14. [22]

    Etcheverry, S.et al.Quantum Key Distri- bution Session with 16-Dimensional Photonic States.Scientific Reports3,2316. doi:10 . 1038/srep02316(2013)

    2013

  15. [23]

    New Journal of Physics17,033033

    Mirhosseini, M.et al.High-Dimensional Quantum Cryptography with Twisted Light. New Journal of Physics17,033033. doi:10. 1088/1367-2630/17/3/033033(2015)

    2015

  16. [24]

    Sit, A.et al.High-Dimensional Intracity Quantum Cryptography with Structured Pho- tons.Optica4,1006–1010. doi:10 . 1364 / OPTICA.4.001006(2017)

    2017

  17. [25]

    Bouchard, F., Fickler, R., Boyd, R. W. & Karimi, E. High-Dimensional Quantum Cloning and Applications to Quantum Hack- ing.Science Advances3,e1601915. doi:10 . 1126/sciadv.1601915(2017)

    2017

  18. [26]

    Quantum2,111

    Bouchard, F.et al.Experimental Investiga- tion of High-Dimensional Quantum Key Dis- tribution Protocols with Twisted Photons. Quantum2,111. doi:10.22331/q-2018-11- 19-111(2018)

    2018 doi

  19. [27]

    doi:10.1103/ PhysRevApplied.11.064058(2019)

    Cozzolino, D.et al.Orbital Angular Mo- mentum States Enabling Fiber-Based High- Dimensional Quantum Communication.Phys- ical Review Applied11,064058. doi:10.1103/ PhysRevApplied.11.064058(2019)

    2019

  20. [28]

    Tentrup, T. B. H., Luiten, W., van der Meer, R., van Exter, M. P. & Pinkse, P. W. H. Large-Alphabet Quantum Key Distribution Using Spatially Encoded Light.New Journal of Physics21,123044. doi:10 . 1088 / 1367 - 2630/ab5d1e(2019)

    2019

  21. [29]

    Zhou, Y., Mirhosseini, M., Oliver, S., Willner, A. E. & Boyd, R. W. Using All Transverse Degrees of Freedom in Quantum Communica- tions Based on a Generic Mode Sorter.Optics Express27,10383–10394. doi:10 . 1364 / OE . 27.010383(2019)

    2019

  22. [30]

    & Forbes, A

    Otte, E., Nape, I., Rosales-Guzm´ an, C. & Forbes, A. High-Dimensional Cryptography with Spatial Modes of Light: Tutorial.Journal of the Optical Society of America B37,A309– A323. doi:10.1364/JOSAB.389615(2020)

    2020 doi

  23. [31]

    Hu, X.-M.et al.Pathways for Entanglement- Based Quantum Communication in the Face of High Noise.Physical Review Letters127, 110505. doi:10 . 1103 / PhysRevLett . 127 . 110505(2021)

    2021

  24. [32]

    A.et al.Experimental Space-Division Multiplexed Polarization- Entanglement Distribution through 12 Paths of a Multicore Fiber.PRX Quantum2, 040356

    Ortega, E. A.et al.Experimental Space-Division Multiplexed Polarization- Entanglement Distribution through 12 Paths of a Multicore Fiber.PRX Quantum2, 040356. doi:10.1103/PRXQuantum.2.040356 (2021)

    2021 doi

  25. [33]

    doi:10.22331/q- 2023-06-26-1207(2023)

    Stasiuk, M.et al.High-Dimensional Encoding in the Round-Robin Differential-Phase-Shift Protocol.Quantum7,1207. doi:10.22331/q- 2023-06-26-1207(2023). 13

    2023 doi

  26. [34]

    doi:10.1364/OQ

    Halevi, D.et al.High-Dimensional Quantum Key Distribution Using Orbital Angular Mo- mentum of Single Photons from a Colloidal Quantum Dot at Room Temperature.Op- tica Quantum2,351–357. doi:10.1364/OQ. 523443(2024)

    2024 doi

  27. [35]

    Nemirovsky-Levy, L.et al.Nonlinear Nanophotonics for High-Dimensional Quantum States.arXiv preprint.arXiv: 2503.04508 [quant-ph](2025)

    2025 arXiv

  28. [36]

    Meyer, J.et al.Analogy of free-space quantum key distribution using spatial modes of light: scaling up the distance and the dimensional- ity.Optics Letters50,3297–3300 (2025)

    2025

  29. [37]

    T., Lim, C

    Islam, N. T., Lim, C. C. W., Cahall, C., Kim, J. & Gauthier, D. J. Provably Secure and High-Rate Quantum Key Distribution with Time-Bin Qudits.Science Advances3, e1701491. doi:10 . 1126 / sciadv . 1701491 (2017)

    2017

  30. [38]

    doi:10.1364/ OE.27.017539(2019)

    Lee, C.et al.Large-Alphabet Encoding for Higher-Rate Quantum Key Distribution.Op- tics Express27,17539–17549. doi:10.1364/ OE.27.017539(2019)

    2019

  31. [39]

    Vagniluca, I.et al.Efficient Time-Bin Encod- ing for Practical High-Dimensional Quantum Key Distribution.Physical Review Applied 14,014051. doi:10 . 1103 / PhysRevApplied . 14.014051(2020)

    2020

  32. [40]

    & Takesue, H

    Ikuta, T., Akibue, S., Yonezu, Y., Mat- sumoto, R. & Takesue, H. Scalable Imple- mentation of (d+1) Mutually Unbiased Bases for d-Dimensional Quantum Key Distribution. Physical Review Research4,L042007. doi:10. 1103/PhysRevResearch.4.L042007(2022)

    2022

  33. [41]

    C., Lim, C

    Chapman, J. C., Lim, C. C. W. & Kwiat, P. G. Hyperentangled Time-Bin and Polar- ization Quantum Key Distribution.Physical Review Applied18,044027. doi:10 . 1103 / PhysRevApplied.18.044027(2022)

    2022

  34. [42]

    doi:10.1038/ s41534025009657(2025)

    Sulimany, K.et al.High-dimensional coher- ent one-way quantum key distribution.npj Quantum Information11,16. doi:10.1038/ s41534025009657(2025)

    2025

  35. [43]

    arXiv:2504.03893 [quant-ph](2025)

    Scarfe, L.et al.High-Dimensional Quan- tum Key Distribution with Qubit-like States. arXiv:2504.03893 [quant-ph](2025)

    2025 arXiv

  36. [44]

    Ali-Khan, I., Broadbent, C. J. & Howell, J. C. Large-Alphabet Quantum Key Distribu- tion Using Energy-Time Entangled Bipartite States.Physical Review Letters98,060503. doi:10 . 1103 / PhysRevLett . 98 . 060503 (2007)

    2007

  37. [45]

    Physical Review A87,062322

    Mower, J.et al.High-Dimensional Quantum Key Distribution Using Dispersive Optics. Physical Review A87,062322. doi:10.1103/ PhysRevA.87.062322(2013)

    2013

  38. [46]

    Lee, C.et al.Entanglement-Based Quan- tum Communication Secured by Nonlocal Dis- persion Cancellation.Physical Review A90, 062331. doi:10 . 1103 / PhysRevA . 90 . 062331 (2014)

    2014

  39. [47]

    New Journal of Physics17,022002

    Zhong, T.et al.Photon-Efficient Quantum Key Distribution Using Time–Energy En- tanglement with High-Dimensional Encoding. New Journal of Physics17,022002. doi:10. 1088/1367-2630/17/2/022002(2015)

    2015

  40. [48]

    doi:10.1063/1

    Liu, X.et al.Energy-Time Entanglement- Based Dispersive Optics Quantum Key Distri- bution over Optical Fibers of 20 km.Applied Physics Letters114,011102. doi:10.1063/1. 5079301(2019)

    2019 doi

  41. [49]

    doi:10.1103/ PhysRevApplied.15.024027(2021)

    Bouchard, F.et al.Achieving Ultimate Noise Tolerance in Quantum Communication.Phys- ical Review Applied15,024027. doi:10.1103/ PhysRevApplied.15.024027(2021)

    2021

  42. [50]

    Quantum Science and Technology9,015003

    Liu, J.et al.High-Dimensional Quantum Key Distribution Using Energy-Time Entan- glement over 242 km Partially Deployed Fiber. Quantum Science and Technology9,015003. doi:10.1088/2058-9565/acfb3a(2023)

    doi

  43. [51]

    Bulla, L.et al.Nonlocal Temporal Interfer- ometry for Highly Resilient Free-Space Quan- tum Communication.Physical Review X13, 021001. doi:10 . 1103 / PhysRevX . 13 . 021001 (2023)

    2023

  44. [52]

    Chang, K.-C.et al.Large-Alphabet Time- Bin Quantum Key Distribution and Ein- stein–Podolsky–Rosen Steering via Dispersive Optics.Quantum Science and Technology9, 015018. doi:10 . 1088 / 2058 - 9565 / acba61 (2023)

  45. [53]

    Tagliavacche, N.et al.Frequency-bin entanglement-based quantum key distri- bution.npj Quantum Information11,60 (2025)

    2025

  46. [54]

    & Pan, J.-W

    Zhang, Q., Xu, F., Chen, Y.-A., Peng, C.-Z. & Pan, J.-W. Large Scale Quantum Key Distri- bution: Challenges and Solutions.Optics Ex- press26,24260–24273. doi:10.1364/OE.26. 024260(2018)

    2018 doi

  47. [55]

    Shor, P. W. & Preskill, J. Simple proof of se- curity of the BB84 quantum key distribution protocol.Physical Review Letters85,441–

  48. [56]

    Security of Quantum Key Dis- tribution.International Journal of Quan- tum Information6,1–127

    Renner, R. Security of Quantum Key Dis- tribution.International Journal of Quan- tum Information6,1–127. doi:10 . 1142 / S0219749908003256(2008)

    2008

  49. [57]

    & Pereg, U.Semantic Security with Unreliable Entanglement Assistance: In- terception and Lossin2024 IEEE Informa- tion Theory Workshop (ITW)(2024)

    Lederman, M. & Pereg, U.Semantic Security with Unreliable Entanglement Assistance: In- terception and Lossin2024 IEEE Informa- tion Theory Workshop (ITW)(2024). doi:10. 1109/ITW61385.2024.10806955

    2024

  50. [58]

    Doda, M.et al.Quantum key distribution overcoming extreme noise: Simultaneous sub- space coding using high-dimensional entan- glement.Physical Review Applied15,034003 (2021)

    2021

  51. [59]

    & Huber, M

    Kanitschar, F. & Huber, M. Practical Frame- work for Analyzing High-Dimensional Quan- tum Key Distribution Setups.Physical Review Letters135,010802 (2025)

    2025

  52. [60]

    & Winter, A

    Devetak, I. & Winter, A. Distillation of Secret Key and Entanglement from Quantum States. Proceedings of the Royal Society A: Math- ematical, Physical and Engineering Sciences 461,207–235. doi:10.1098/rspa.2004.1372 (2005)

    2004

  53. [61]

    & Bromberg, Y

    Lib, O., Sulimany, K. & Bromberg, Y. Pro- cessing Entangled Photons in High Dimen- sions with a Programmable Light Converter. Physical Review Applied18,014063. doi:10. 1103/PhysRevApplied.18.014063(2022)

    2022

  54. [62]

    & Bromberg, Y

    Lib, O., Sulimany, K., Dudkiewicz, R., Porat, A. & Bromberg, Y. High-Dimensional Quan- tum Key Distribution Using a Multi-Plane Light Converter.Optica Quantum3,182–188. doi:10.1364/OQ.558906(2025)

    2025 doi

  55. [63]

    & Chau, H

    Lo, H.-K. & Chau, H. F. Unconditional se- curity of quantum key distribution over arbi- trarily long distances.science283,2050–2056 (1999)

  56. [64]

    & Kashefi, E

    Broadbent, A., Fitzsimons, J. & Kashefi, E. Universal Blind Quantum Computationin 50th Annual IEEE Symposium on Founda- tions of Computer Science (FOCS)(IEEE, 2009), 517–526. doi:10.1109/FOCS.2009.36

    2009 doi

  57. [65]

    K., Hamerly, R., Iyengar, P

    Sulimany, K., Vadlamani, S. K., Hamerly, R., Iyengar, P. & Englund, D. Quantum-Secure Multiparty Deep Learning. arXiv:2408 . 05629 [quant-ph](2024)

    2024

  58. [66]

    Zhang, W.et al.Quantum Secure Direct Com- munication with Quantum Memory.Physical Review Letters118,220501. doi:10 . 1103 / PhysRevLett.118.220501(2017)

    2017

  59. [67]

    Symmetric Collective Attacks for the Eavesdropping of Symmetric Quan- tum Key Distribution.International Journal of Quantum Information6,765–771

    Pirandola, S. Symmetric Collective Attacks for the Eavesdropping of Symmetric Quan- tum Key Distribution.International Journal of Quantum Information6,765–771. doi:10. 1142/S0219749908003839(2008)

    2008

  60. [68]

    npj Quantum Information3,25

    Ding, Y.et al.High-Dimensional Quantum Key Distribution Based on Multicore Fiber Using Silicon Photonic Integrated Circuits. npj Quantum Information3,25. doi:10 . 1038/s41534-017-0026-2(2017)

    2017

  61. [69]

    doi:10.1038/s41534-021-00393- y(2021)

    Da Lio, B.et al.Path-Encoded High- Dimensional Quantum Communication over a 2-km Multicore Fiber.npj Quantum Informa- tion7,63. doi:10.1038/s41534-021-00393- y(2021)

    2021 doi

  62. [70]

    doi:10.1038/ s41467-021-22134-7(2021)

    Zhou, Y.et al.High-Fidelity Spatial Mode Transmission through a 1-km-Long Multi- mode Fiber via Vectorial Time Reversal.Na- ture Communications12,1866. doi:10.1038/ s41467-021-22134-7(2021)

    2021

  63. [71]

    Zahidy, M.et al.Practical High-Dimensional Quantum Key Distribution Protocol over De- ployed Multicore Fiber.Nature Communica- tions15,1651. doi:10 . 1038 / s41467 - 024 - 46283-x(2024)

    2024

  64. [72]

    & ˇCiˇ zm´ ar, T

    Pl¨ oschner, M., Tyc, T. & ˇCiˇ zm´ ar, T. Seeing through Chaos in Multimode Fibres.Nature Photonics9,529–535. doi:10.1038/nphoton. 2015.112(2015)

    2015 doi

  65. [73]

    & Bromberg, Y

    Sulimany, K. & Bromberg, Y. All-Fiber Source and Sorter for Multimode Correlated Photons.npj Quantum Information8,4. doi:10.1038/s41534-021-00514-w(2022)

    2022 doi

  66. [74]

    Krenn, M.et al.Generation and Confirma- tion of a (100×100)-Dimensional Entangled Quantum System.Proceedings of the National Academy of Sciences111,6243–6247. doi:10. 1073/pnas.1402365111(2014)

    2014

  67. [75]

    Shannon, C. E. A Mathematical Theory of Communication.The Bell System Technical Journal27,379–423. doi:10.1002/j.1538- 7305.1948.tb01338.x(1948)

    1948

  68. [76]

    The Zero Error Capacity of a Noisy Channel.IRE Transactions on Infor- mation Theory2,8–19

    Shannon, C. The Zero Error Capacity of a Noisy Channel.IRE Transactions on Infor- mation Theory2,8–19. doi:10 . 1109 / TIT . 1956.1056798(1956)

    1956

  69. [77]

    arXiv:2502.20558 [quant-ph](2025)

    Baranes, G.et al.Leveraging Atom Loss Errors in Fault Tolerant Quantum Al- gorithms.arXiv preprint arXiv:2502.20558. arXiv:2502.20558 [quant-ph](2025)

    2025

  70. [78]

    Nature622,279–284

    Ma, S.et al.High-fidelity gates and mid- circuit erasure conversion in an atomic qubit. Nature622,279–284. doi:10.1038/s41586- 023-06438-1(2023). 15

    2023 doi

  71. [79]

    Scholl, P.et al.Erasure conversion in a high- fidelity Rydberg quantum simulator.Nature 622,273–278. doi:10 . 1038 / s41586 - 023 - 06516-4(2023)

    2023

  72. [80]

    & Vil- loresi, P

    Schiavon, M., Vallone, G., Ticozzi, F. & Vil- loresi, P. Heralded single-photon sources for quantum-key-distribution applications.Phys- ical Review A93,012331. doi:10 . 1103 / PhysRevA.93.012331(2016)

    2016

  73. [81]

    & Chen, K

    Lo, H.-K., Ma, X. & Chen, K. Decoy State Quantum Key Distribution.Physical Re- view Letters94,230504. doi:10 . 1103 / PhysRevLett.94.230504(2005)

    2005

  74. [82]

    & Bromberg, Y.Data for: High-Dimensional Quantum Key Dis- tribution Using a Multi-Plane Light Con- verterDataset

    Lib, O., Sulimany, K. & Bromberg, Y.Data for: High-Dimensional Quantum Key Dis- tribution Using a Multi-Plane Light Con- verterDataset. 2024. doi:10 . 5281 / zenodo . 10645760. 16

    2024

  75. [444]

    1103 / PhysRevLett

    doi:10 . 1103 / PhysRevLett . 85 . 441 (2000). 14

    2000

Pith tools

Reviewed August 4, 2026 · model on record in the stance chip above.