Security of deterministic key distribution with higher-dimensional systems
Pith reviewed 2026-05-22 13:19 UTC · model grok-4.3
The pith
Higher-dimensional systems in two-way quantum key distribution generate secret keys against stronger individual attacks and greater collective eavesdropping.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The central claim is that a two-way deterministic key distribution protocol using arbitrary finite-dimensional systems, two mutually unbiased bases, and Heisenberg-Weyl operators achieves secret key generation for greater interception strengths in individual cloning attacks and exhibits monotonically increasing robustness to collective eavesdropping as the dimension grows, with the asymptotic key rate derived via a purification scheme and entropic uncertainty relations without requiring effective entanglement.
What carries the argument
Two mutually unbiased bases together with Heisenberg-Weyl operators in higher dimensions, which bound the eavesdropper's information for both cloning attacks and collective attacks through purification and uncertainty relations.
If this is right
- Secret keys remain extractable for interception strengths where lower-dimensional versions produce zero rate.
- The asymptotic key rate under collective attacks stays positive for stronger noise levels as dimension rises.
- The protocol outperforms an entangled two-way dense-coding scheme when eavesdropper noise is modeled as correlated or uncorrelated.
- Security analysis holds without the need to prepare or distribute entangled states in the actual key-distribution step.
Where Pith is reading between the lines
- Practical devices that naturally support higher-dimensional encoding, such as orbital-angular-momentum photons, could be tested directly for the predicted dimensional gain in attack tolerance.
- The same bounding technique might extend to other two-way protocols that currently rely on entanglement, potentially simplifying hardware requirements.
- Numerical checks of the key-rate formula for dimensions four through eight would reveal how quickly the robustness saturates.
Load-bearing premise
The chosen two mutually unbiased bases and Heisenberg-Weyl operators are assumed to fully capture every possible piece of information an eavesdropper could extract in both individual and collective attacks.
What would settle it
Measure the secret key rate in a laboratory implementation of the protocol with dimension three under controlled cloning attacks of varying strength and check whether positive rates persist beyond the threshold predicted for dimension two.
read the original abstract
We analyze the security of two-way quantum key distribution using arbitrary finite-dimensional systems, considering both individual and collective eavesdropping attacks, without the effective use of entangled states, by incorporating two mutually unbiased bases and Heisenberg-Weyl operators in higher dimensions. For individual attacks, we consider cloning operations by the eavesdropper and demonstrate a dimensional advantage where secret keys can be generated for greater strengths of interception. To analyze security under collective attacks, we employ a purification scheme and derive the key rate using entropic uncertainty relations. Further, we exhibit how the protocol is more robust against eavesdropping with increasing dimension of the systems used, and compare the performance with that of the entangled two-way secure dense coding protocol when the presence of the eavesdropper is modeled by correlated and uncorrelated noise.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript analyzes the security of a two-way deterministic quantum key distribution protocol that uses arbitrary finite-dimensional systems, two mutually unbiased bases, and Heisenberg-Weyl operators, without effective entanglement. For individual attacks it derives a dimensional advantage via cloning maps, allowing secret-key generation against stronger interception as dimension increases. For collective attacks it employs a specific purification scheme followed by entropic uncertainty relations to obtain a lower bound on the key rate, claiming increased robustness with dimension; performance is also compared to an entangled two-way dense-coding protocol under correlated and uncorrelated noise models.
Significance. If the purification construction and resulting bounds are shown to be tight against all admissible collective attacks, the work would supply concrete evidence that high-dimensional two-way protocols can tolerate stronger eavesdropping than their qubit counterparts while remaining entanglement-free, which is relevant for practical QKD implementations that seek to exploit larger alphabets.
major comments (1)
- §4 (collective-attack analysis): the lower bound on the secret-key rate is obtained after a purification that models the eavesdropper’s information exclusively via the two chosen MUBs and the associated Heisenberg-Weyl operators. It is not shown that every possible collective attack in dimension d>2 can be represented by such a purification; an optimal attack employing a different set of generalized Pauli operators or non-Weyl unitaries could evade the bound, rendering the claimed dimensional robustness for collective attacks conditional on this modeling choice.
minor comments (2)
- The abstract and §3 state that the protocol exhibits “increased robustness against eavesdropping with increasing dimension,” yet the numerical plots in Fig. 4 only show the key rate for d=2,3,4 under a single noise model; explicit comparison tables or additional curves for d=5,6 would strengthen the claim.
- Notation for the cloning fidelity and the entropic quantities is introduced without a consolidated table; a short appendix listing all symbols and their definitions would improve readability.
Simulated Author's Rebuttal
We thank the referee for the careful reading of our manuscript and the constructive feedback. We address the single major comment below.
read point-by-point responses
-
Referee: §4 (collective-attack analysis): the lower bound on the secret-key rate is obtained after a purification that models the eavesdropper’s information exclusively via the two chosen MUBs and the associated Heisenberg-Weyl operators. It is not shown that every possible collective attack in dimension d>2 can be represented by such a purification; an optimal attack employing a different set of generalized Pauli operators or non-Weyl unitaries could evade the bound, rendering the claimed dimensional robustness for collective attacks conditional on this modeling choice.
Authors: We agree that our purification construction is tailored to the protocol's use of two specific mutually unbiased bases and the associated Heisenberg-Weyl operators. The resulting lower bound on the key rate therefore applies to collective attacks whose action on the transmitted qudits can be captured by this modeling choice. We do not claim, nor does the manuscript demonstrate, that the bound holds against every conceivable collective attack in d > 2. To address this point we will revise Section 4 to (i) explicitly state the class of attacks for which the bound is derived, (ii) clarify that the dimensional robustness is shown within this class, and (iii) note that extending the analysis to fully general collective attacks remains an interesting open direction. This revision will be accompanied by a short discussion of why the chosen purification is natural given the protocol's measurement structure. revision: partial
Circularity Check
No significant circularity; key-rate bounds derived from standard entropic relations and purification
full rationale
The paper derives individual-attack security via explicit cloning maps on higher-dimensional systems and collective-attack rates via a purification scheme plus entropic uncertainty relations applied to two MUBs and Heisenberg-Weyl operators. These steps are standard QKD techniques and do not reduce by construction to fitted parameters, self-defined quantities, or load-bearing self-citations. The claimed dimensional robustness follows from direct comparison of the resulting key-rate expressions against noise models, without renaming known results or smuggling ansatzes. The derivation chain remains self-contained against external benchmarks and does not equate outputs to inputs.
Axiom & Free-Parameter Ledger
axioms (2)
- standard math Properties of mutually unbiased bases and Heisenberg-Weyl operators hold in arbitrary finite dimensions.
- domain assumption Entropic uncertainty relations provide tight bounds on eavesdropper information under the purification scheme.
Lean theorems connected to this paper
-
IndisputableMonolith/Foundation/AlexanderDuality.leanalexander_duality_circle_linking (D=3 forcing) unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
To analyze security under collective attacks, we employ a purification scheme and derive the key rate using entropic uncertainty relations... exhibit how the protocol is more robust against eavesdropping with increasing dimension
-
IndisputableMonolith/Cost/FunctionalEquation.leanwashburn_uniqueness_aczel (J-cost uniqueness) unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
We consider a general cloning strategy... assumptions AI-AIII... key rate r_d = I_AB - min[I_AE,I_BE]
-
IndisputableMonolith/Foundation/ArithmeticFromLogic.leanLogicNat recovery and orbit embedding unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
Purified LM05 protocol... entropic uncertainty relation S_B|E + S_B|E >= log2(1/gamma)
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
-
[1]
N. Gisin, G. Ribordy, W. Tittel, H. Zbinden, Quan- tum cryptography, Rev. Mod. Phys.74(2002) 145–195. URL:https://link.aps.org/doi/ 10.1103/RevModPhys.74.145. doi:10.1103/ RevModPhys.74.145
-
[2]
V . Scarani, H. Bechmann-Pasquinucci, N. J. Cerf, M. Dušek, N. Lütkenhaus, M. Peev, The security of practical quantum key distribution, Rev. Mod. Phys.81(2009) 1301–1350. URL:https://link.aps. org/doi/10.1103/RevModPhys.81.1301. doi:10.1103/RevModPhys.81.1301
-
[3]
R. Horodecki, M. Horodecki, K. Horodecki, P . Horodecki, Quantum entanglement, Rev. Mod. Phys.81(2009)865–942. URL:https://link. aps.org/doi/10.1103/RevModPhys.81.865. doi:10.1103/RevModPhys.81.865
-
[4]
N. Brunner, D. Cavalcanti, S. Pironio, V . Scarani, S. Wehner, Bell nonlocality, Rev. Mod. Phys.86 (2014)839.arXiv:quant-ph/1303.2849
work page internal anchor Pith review Pith/arXiv arXiv 2014
-
[5]
A. K. Ekert, Quantum cryptography based on bell’s theorem, Phys. Rev. Lett.67 (1991)661–663. URL:https://link.aps.org/ doi/10.1103/PhysRevLett.67.661. doi:10. 1103/PhysRevLett.67.661
-
[6]
D. Mayers, A. Yao, Quantum cryptography with imperfect apparatus, in: Proceedings39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), IEEE Comput. Soc,1998, pp. 503–509. doi:10.1109/SFCS.1998.743501
-
[7]
D. Gottesman, H.-K. Lo, N. Lutkenhaus, J. Preskill, Security of quantum key distribution with im- perfect devices, in: International Symposium onInformation Theory,2004. ISIT2004. Proceed- ings., IEEE,2004, pp.135–135. doi:10.1109/ ISIT.2004.1365172
-
[8]
A. Acín, J. Bae, E. Bagan, M. Baig, L. Masanes, R. Muñoz-Tapia, Secrecy properties of quan- tum channels, Phys. Rev. A.73(2006) 012327. doi:10.1103/PhysRevA.73.012327. arXiv:arXiv:quant-ph/0411092
work page internal anchor Pith review Pith/arXiv arXiv doi:10.1103/physreva.73.012327 2006
-
[9]
A. Acín, N. Brunner, N. Gisin, S. Massar, S. Pironio, V . Scarani, Device-independent security of quantum cryptography against collective attacks, Phys. Rev. Lett.98(2007) 230501. URL:https://link.aps.org/ doi/10.1103/PhysRevLett.98.230501. doi:10.1103/PhysRevLett.98.230501
-
[10]
L. Masanes, S. Pironio, A. Acín, Secure device- independent quantum key distribution with causally independent measurement devices, Nat. Commun.2(2011). URL:https://doi.org/10. 1038/ncomms1244. doi:10.1038/ncomms1244
-
[11]
Scalable Quantum Simula- tion of Molecular Energies
S. Pironio, L. Masanes, A. Leverrier, A. Acín, Security of device-independent quantum key distribution in the bounded-quantum-storage model, Phys. Rev. X3(2013)031007. URL:https: //link.aps.org/doi/10.1103/PhysRevX. 3.031007. doi:10.1103/PhysRevX.3.031007
-
[12]
U. Vazirani, T. Vidick, Fully device-independent quantum key distribution, Phys. Rev. Lett.113 (2014)140501. URL:https://link.aps.org/ doi/10.1103/PhysRevLett.113.140501. doi:10.1103/PhysRevLett.113.140501
-
[13]
C. A. Miller, Y. Shi, Robust protocols for securely expanding randomness and distributing keys us- ing untrusted quantum devices, Journal of the ACM63(2016)1–63. doi:10.1145/2885493
-
[14]
M. A. Nielsen, I. L. Chuang, Quantum Compu- tation and Quantum Information:10th Anniver- sary Edition, Cambridge University Press,2010. doi:10.1017/CBO9780511976667
-
[15]
M. M. Wilde, Quantum Information Theory, Cambridge University Press,2013. doi:10.1017/ CBO9781139525343
work page 2013
-
[16]
Preskill, CreateSpace Independent Publish- ing Platform,2015
J. Preskill, CreateSpace Independent Publish- ing Platform,2015. URL:http://theory. caltech.edu/~preskill/ph229/. doi:http: //theory.caltech.edu/~preskill/ph229/
work page 2015
-
[17]
Watrous, The Theory of Quantum Information, Cambridge University Press,2018
J. Watrous, The Theory of Quantum Information, Cambridge University Press,2018. doi:10.1017/ 9781316848142
work page 2018
-
[18]
C. H. Bennett, G. Brassard, Quantum cryptog- raphy: Public key distribution and coin tossing, Theoretical Computer Science560(2014)7–11. URL:https://www.sciencedirect.com/ science/article/pii/S0304397514004241. doi:https://doi.org/10.1016/j.tcs. 2014.05.025, theoretical Aspects of Quantum Cryptography – celebrating30years of BB84. 15
-
[19]
Bruß, Optimal eavesdropping in quantum cryptography with six states, Phys
D. Bruß, Optimal eavesdropping in quantum cryptography with six states, Phys. Rev. Lett.81 (1998)3018–3021. URL:https://link.aps. org/doi/10.1103/PhysRevLett.81.3018. doi:10.1103/PhysRevLett.81.3018
-
[20]
H. Bechmann-Pasquinucci, N. Gisin, Incoher- ent and coherent eavesdropping in the six-state protocol of quantum cryptography, Phys. Rev. A59(1999)4238–4248. URL:https://link. aps.org/doi/10.1103/PhysRevA.59.4238. doi:10.1103/PhysRevA.59.4238
-
[21]
M. Tomamichel, C. C. W. Lim, N. Gisin, R. Ren- ner, Tight finite-key analysis for quantum cryp- tography, Nature Communications3(2012)634. doi:10.1038/ncomms1631
-
[22]
K. Boström, T. Felbinger, Determinis- tic secure direct communication using en- tanglement, Phys. Rev. Lett.89(2002) 187902. URL:https://link.aps.org/ doi/10.1103/PhysRevLett.89.187902. doi:10.1103/PhysRevLett.89.187902
-
[23]
M. Lucamarini, S. Mancini, Secure deterministic communication without entanglement, Phys. Rev. Lett.94(2005)140501. URL:https://link.aps. org/doi/10.1103/PhysRevLett.94.140501. doi:10.1103/PhysRevLett.94.140501
-
[24]
Q.-y. Cai, The “ping-pong” protocol can be attacked without eavesdropping, Phys. Rev. Lett. 91(2003)109801. URL:https://link.aps. org/doi/10.1103/PhysRevLett.91.109801. doi:10.1103/PhysRevLett.91.109801
-
[25]
A. Wójcik, Eavesdropping on the “ping-pong” quantum communication protocol, Phys. Rev. Lett. 90(2003)157901. URL:https://link.aps. org/doi/10.1103/PhysRevLett.90.157901. doi:10.1103/PhysRevLett.90.157901
-
[26]
F.-G. Deng, G. L. Long, X.-S. Liu, Two-step quantum direct communication protocol using the einstein-podolsky-rosen pair block, Phys. Rev. A68 (2003)042317. URL:https://link.aps.org/ doi/10.1103/PhysRevA.68.042317. doi:10. 1103/PhysRevA.68.042317
-
[27]
F.-G. Deng, G. L. Long, Secure direct communica- tion with a quantum one-time pad, Phys. Rev. A69 (2004)052319. URL:https://link.aps.org/ doi/10.1103/PhysRevA.69.052319. doi:10. 1103/PhysRevA.69.052319
-
[28]
Q.-y. Cai, B.-w. Li, Improving the capacity of the boström-felbinger protocol, Phys. Rev. A69 (2004)054301. URL:https://link.aps.org/ doi/10.1103/PhysRevA.69.054301. doi:10. 1103/PhysRevA.69.054301
-
[29]
H. Lu, C.-H. F. Fung, X. Ma, Q.-y. Cai, Unconditional security proof of a determin- istic quantum key distribution with a two- way quantum channel, Phys. Rev. A84 (2011)042344. URL:https://link.aps.org/ doi/10.1103/PhysRevA.84.042344. doi:10. 1103/PhysRevA.84.042344
-
[30]
C.-H. F. Fung, X. Ma, H. F. Chau, Q.-y. Cai, Quan- tum key distribution with delayed privacy amplifi- cation and its application to the security proof of a two-way deterministic protocol, Phys. Rev. A85 (2012)032308. URL:https://link.aps.org/ doi/10.1103/PhysRevA.85.032308. doi:10. 1103/PhysRevA.85.032308
-
[31]
H. Bechmann-Pasquinucci, W. Tittel, Quantum cryptography using larger alphabets, Phys. Rev. A61(2000)062308. URL:https://link.aps. org/doi/10.1103/PhysRevA.61.062308. doi:10.1103/PhysRevA.61.062308
-
[32]
M. Bourennane, A. Karlsson, G. Björk, Quantum key distribution using multi- level encoding, Phys. Rev. A64(2001) 012306. URL:https://link.aps.org/ doi/10.1103/PhysRevA.64.012306. doi:10.1103/PhysRevA.64.012306
-
[33]
M. Bourennane, A. Karlsson, G. Bj rk, N. Gisin, N. J. Cerf, Quantum key distribution using mul- tilevel encoding: security analysis, Journal of Physics A: Mathematical and General35(2002) 10065–10076. doi:10.1088/0305-4470/35/47/ 307
-
[34]
G. M. Nikolopoulos, K. S. Ranade, G. Al- ber, Error tolerance of two-basis quantum- key-distribution protocols using qudits and two- way classical communication, Phys. Rev. A73 (2006)032325. URL:https://link.aps.org/ doi/10.1103/PhysRevA.73.032325. doi:10. 1103/PhysRevA.73.032325
-
[35]
T. Sasaki, Y. Yamamoto, M. Koashi, Practical quan- tum key distribution protocol without monitoring signal disturbance, Nature509(2014)475–478. doi:10.1038/nature13303
-
[36]
G. B. Xavier, G. Lima, Quantum information processing with space-division multiplexing opti- cal fibres, Communications Physics3(2020)9. doi:10.1038/s42005-019-0269-7
-
[37]
N. J. Cerf, M. Bourennane, A. Karlsson, N. Gisin, Security of quantum key distribution using d -level systems, Physical Review Letters88(2002)127902. doi:10.1103/PhysRevLett.88.127902. 16
-
[38]
M. Ogrodnik, A. Widomski, D. Bruß, G. Chesi, F. Grasselli, H. Kampermann, C. Macchiavello, N. Walk, N. Wyderka, M. Karpi ´ nski, High- dimensional quantum key distribution with resource-efficient detection, arXiv:2412.16782 (2024). URL:https://arxiv.org/abs/2412. 16782
-
[39]
High-dimensional quantum key distribution rates for multiple measurement bases
N. Wyderka, G. Chesi, H. Kampermann, C. Mac- chiavello, D. Bruß, High-dimensional quantum key distribution rates for multiple measurement bases, arXiv:2501.05890(2025). URL:https://arxiv. org/abs/2501.05890
work page internal anchor Pith review Pith/arXiv arXiv 2025
- [40]
- [41]
-
[42]
F. Kanitschar, M. Huber, Composable finite-size security of high-dimensional quantum key distri- bution protocols, arXiv:2505.03874(2025). URL: https://arxiv.org/abs/2505.03874
-
[43]
L. A. Correa, Multistage quantum ab- sorption heat pumps, Phys. Rev. E89 (2014)042128. URL:https://link.aps. org/doi/10.1103/PhysRevE.89.042128. doi:10.1103/PhysRevE.89.042128
-
[44]
J. Wang, Y. Lai, Z. Ye, J. He, Y. Ma, Q. Liao, Four- level refrigerator driven by photons, Phys. Rev. E91(2015)050102. URL:https://link.aps. org/doi/10.1103/PhysRevE.91.050102. doi:10.1103/PhysRevE.91.050102
-
[45]
A. C. Santos, B. Çakmak, S. Campbell, N. T. Zinner, Stable adiabatic quantum batteries, Phys. Rev. E 100(2019)032107. URL:https://link.aps. org/doi/10.1103/PhysRevE.100.032107. doi:10.1103/PhysRevE.100.032107
-
[46]
F.-Q. Dou, Y.-J. Wang, J.-A. Sun, Closed- loop three-level charged quantum battery, EPL (Europhysics Letters)131(2020)43001. URL:https://iopscience.iop.org/ article/10.1209/0295-5075/131/43001. doi:10.1209/0295-5075/131/43001
-
[47]
A. Usui, W. Niedenzu, M. Huber, Simpli- fying the design of multilevel thermal ma- chines using virtual qubits, Phys. Rev. A104 (2021)042224. URL:https://link.aps. org/doi/10.1103/PhysRevA.104.042224. doi:10.1103/PhysRevA.104.042224
-
[48]
S. Ghosh, A. Sen(De), Dimensional en- hancements in a quantum battery with imperfections, Phys. Rev. A105(2022) 022628. URL:https://link.aps.org/ doi/10.1103/PhysRevA.105.022628. doi:10.1103/PhysRevA.105.022628
-
[49]
T. K. Konar, S. Ghosh, A. K. Pal, A. Sen(De), Designing refrigerators in higher dimensions using quantum spin models, Phys. Rev. A 107(2023)032602. URL:https://link.aps. org/doi/10.1103/PhysRevA.107.032602. doi:10.1103/PhysRevA.107.032602
-
[50]
K. Wei, N. Tischler, S.-R. Zhao, Y.-H. Li, J. M. Ar- razola, Y. Liu, W. Zhang, H. Li, L. You, Z. Wang, Y.-A. Chen, B. C. Sanders, Q. Zhang, G. J. Pryde, F. Xu, J.-W. Pan, Experimental quantum switch- ing for exponentially superior quantum commu- nication complexity, Phys. Rev. Lett.122(2019) 120504. URL:https://link.aps.org/doi/ 10.1103/PhysRevLett.122.12...
-
[51]
E. Nagali, D. Giovannini, L. Marrucci, S. Slus- sarenko, E. Santamato, F. Sciarrino, Experimen- tal optimal cloning of four-dimensional quantum states of photons, Phys. Rev. Lett.105(2010) 073602. URL:https://link.aps.org/doi/ 10.1103/PhysRevLett.105.073602. doi:10. 1103/PhysRevLett.105.073602
-
[52]
F. Bouchard, R. Fickler, R. W. Boyd, E. Karimi, High-dimensional quantum cloning and applica- tions to quantum hacking, Science Advances3 (2017). doi:10.1126/sciadv.1601915
-
[53]
S. Ecker, F. Bouchard, L. Bulla, F. Brandt, O. Ko- hout, F. Steinlechner, R. Fickler, M. Malik, Y. Guryanova, R. Ursin, M. Huber, Overcom- ing noise in entanglement distribution, Phys. Rev. X9(2019)041042. URL:https://link. aps.org/doi/10.1103/PhysRevX.9.041042. doi:10.1103/PhysRevX.9.041042
-
[54]
B. P . Lanyon, M. Barbieri, M. P . Almeida, T. Jen- newein, T. C. Ralph, K. J. Resch, G. J. Pryde, J. L. O’Brien, A. Gilchrist, A. G. White, Sim- plifying quantum logic using higher-dimensional hilbert spaces, Nature Physics5(2009)134–140. doi:10.1038/nphys1150
-
[55]
A. Babazadeh, M. Erhard, F. Wang, M. Malik, R. Nouroozi, M. Krenn, A. Zeilinger, High- dimensional single-photon quantum gates: Con- cepts and experiments, Phys. Rev. Lett.119(2017) 180510. URL:https://link.aps.org/doi/ 10.1103/PhysRevLett.119.180510. doi:10. 1103/PhysRevLett.119.180510. 17
-
[56]
S. Muralidharan, C.-L. Zou, L. Li, J. Wen, L. Jiang, Overcoming erasure errors with multilevel sys- tems, New Journal of Physics19(2017)013026. doi:10.1088/1367-2630/aa573a
-
[57]
F. Bouchard, K. Heshami, D. England, R. Fick- ler, R. W. Boyd, B.-G. Englert, L. L. Sánchez-Soto, E. Karimi, Experimental investigation of high- dimensional quantum key distribution protocols with twisted photons, Quantum2(2018)111. doi:10.22331/q-2018-12-04-111
-
[58]
Y. Ding, D. Bacco, K. Dalgaard, X. Cai, X. Zhou, K. Rottwitt, L. K. Oxenløwe, High-dimensional quantum key distribution based on multicore fiber using silicon photonic integrated circuits, npj Quantum Information3(2017)25. doi:10.1038/ s41534-017-0026-2
work page 2017
-
[59]
A. Sit, R. Fickler, F. Alsaiari, F. Bouchard, H. Larocque, P . Gregg, L. Yan, R. W. Boyd, S. Ra- machandran, E. Karimi, Quantum cryptography with structured photons through a vortex fiber, Optics Letters43(2018)4108. doi:10.1364/OL. 43.004108
work page doi:10.1364/ol 2018
-
[60]
L. V . Amitonova, T. B. H. Tentrup, I. M. Vellekoop, P . W. H. Pinkse, Quantum key establishment via a multimode fiber, Optics Express28(2020)5965. doi:10.1364/OE.380791
-
[61]
G. Cañas, N. Vera, J. Cariñe, P . González, J. Car- denas, P . W. R. Connolly, A. Przysiezna, E. S. Gómez, M. Figueroa, G. Vallone, P . Villoresi, T. F. da Silva, G. B. Xavier, G. Lima, High-dimensional decoy-state quantum key distribution over multi- core telecommunication fibers, Phys. Rev. A96 (2017)022317. URL:https://link.aps.org/ doi/10.1103/PhysRev...
-
[62]
N. T. Islam, C. C. W. Lim, C. Cahall, J. Kim, D. J. Gauthier, Provably secure and high-rate quantum key distribution with time-bin qudits, Science Ad- vances3(2017). doi:10.1126/sciadv.1701491
- [63]
-
[64]
I. D. Ivonovic, Geometrical description of quan- tal state determination, Journal of Physics A: Mathematical and General14(1981)3241–3245. doi:10.1088/0305-4470/14/12/019
-
[65]
W. K. Wootters, B. D. Fields, Optimal state- determination by mutually unbiased measure- ments, Annals of Physics191(1989)363–381. doi:10.1016/0003-4916(89)90322-9
-
[66]
S. Bandyopadhyay, P . O. Boykin, V . Roychowdhury, F. Vatan, A new proof for the existence of mutually unbiased bases, Algorithmica34(2002)512–528. doi:10.1007/s00453-002-0980-7
-
[67]
G. L. Mullen, A. Poli, H. Stichtenoth (Eds.), Finite Fields and Applications, volume2948, Springer Berlin Heidelberg,2004. doi:10.1007/b95905
-
[68]
N. J. Beaudry, M. Lucamarini, S. Mancini, R. Renner, Security of two-way quan- tum key distribution, Phys. Rev. A88 (2013)062302. URL:https://link.aps. org/doi/10.1103/PhysRevA.88.062302. doi:10.1103/PhysRevA.88.062302
-
[69]
P . W. Shor, J. Preskill, Simple proof of se- curity of the bb84quantum key distribu- tion protocol, Phys. Rev. Lett.85(2000) 441–444. URL:https://link.aps.org/ doi/10.1103/PhysRevLett.85.441. doi:10.1103/PhysRevLett.85.441
-
[70]
B. Kraus, N. Gisin, R. Renner, Lower and upper bounds on the secret-key rate for quan- tum key distribution protocols using one-way classical communication, Phys. Rev. Lett.95 (2005)080501. URL:https://link.aps.org/ doi/10.1103/PhysRevLett.95.080501. doi:10.1103/PhysRevLett.95.080501
-
[71]
A. Patra, R. Gupta, T. Das, A. Sen(De), Dimen- sional advantage in secure information trading via the noisy dense-coding protocol, Phys. Rev. A110(2024)032419. URL:https://link.aps. org/doi/10.1103/PhysRevA.110.032419. doi:10.1103/PhysRevA.110.032419
-
[72]
T. Hiroshima, Optimal dense coding with mixed state entanglement, Journal of Physics A: Mathe- matical and General34(2001)6907–6912. doi:10. 1088/0305-4470/34/35/316
work page 2001
-
[74]
C. W. Helstrom, Quantum detection and estima- tion theory, Journal of Statistical Physics1(1969) 231–252. doi:10.1007/BF01007479
-
[75]
A. Holevo, Statistical decision theory for quan- tum systems, Journal of Multivariate Analysis 3(1973)337–394. doi:10.1016/0047-259X(73) 90028-6
-
[76]
S. M. Barnett, S. Croke, Quantum state discrimi- nation, Advances in Optics and Photonics1(2009)
work page 2009
-
[77]
doi:10.1364/AOP.1.000238. 18
-
[78]
J. Bae, L.-C. Kwek, Quantum state discrimina- tion and its applications, Journal of Physics A: Mathematical and Theoretical48(2015)083001. doi:10.1088/1751-8113/48/8/083001
-
[79]
M. Ježek, J. ˇRehᡠcek, J. Fiurášek, Find- ing optimal strategies for minimum-error quantum-state discrimination, Phys. Rev. A 65(2002)060301. URL:https://link.aps. org/doi/10.1103/PhysRevA.65.060301. doi:10.1103/PhysRevA.65.060301
-
[80]
Y. Eldar, A. Megretski, G. Verghese, Design- ing optimal quantum detectors via semidefinite programming, IEEE Transactions on Information Theory49(2003)1007–1012. doi:10.1109/TIT. 2003.809510
work page doi:10.1109/tit 2003
-
[81]
W. Wengang, D. Guohua, L. Mingshan, Minimum- error quantum state discrimination based on semidefinite programming, in:2008 27th Chi- nese Control Conference, IEEE,2008, pp.521–524. doi:10.1109/CHICC.2008.4605546
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.