1ICFO-Institut de Ciencies Fotoniques, The Barcelona Institute of Science and Technology, Av. Carl Friedrich Gauss 3, 08860 Castelldefels (Barcelona), Spain.
2Université de Lyon, Inria, ENS de Lyon, UCBL, LIP, F-69342, Lyon Cedex 07, France.
3ICREA – Institució Catalana de Recerca i Estudis Avançats, 08010 Barcelona, Spain.
Find this paper interesting or want to discuss? Scite or leave a comment on SciRate.
Abstract
Continuous variable quantum key distribution with discrete modulation has the potential to provide information-theoretic security using widely available optical elements and existing telecom infrastructure. While their implementation is significantly simpler than that for protocols based on Gaussian modulation, proving their finite-size security against coherent attacks poses a challenge. In this work we prove finite-size security against coherent attacks for a discrete-modulated quantum key distribution protocol involving four coherent states and heterodyne detection. To do so, and contrary to most of the existing schemes, we first discretize all the continuous variables generated during the protocol. This allows us to use the entropy accumulation theorem, a tool that has previously been used in the setting of discrete variables, to construct the finite-size security proof. We then compute the corresponding finite-key rates through semi-definite programming and under a photon-number cutoff. Our analysis provides asymptotic rates in the range of $0.1-10^{-4}$ bits per round for distances up to hundred kilometres, while in the finite case and for realistic parameters, we get of the order of $10$ Gbits of secret key after $nsim10^{11}$ rounds and distances of few tens of kilometres.
Featured image: Left: Our novel scheme of discretisation of the phase space, which is performed by Bob in parameter estimation rounds. In this figure, the modulation for parameter estimation in phases and amplitudes is given by ∆/δ = 2, with the outmost modules extending to infinity. Right: Bob’s modulation in key rounds.
Popular summary
Efficiently distributing such a key between Alice and Bob in a way that they can test whether Eve has any correlations with it, is where quantum physics comes in. Namely, its has been shown by Bennett and Brassard in 1984 [Bennett, Charles H., and Gilles Brassard. “Quantum cryptography: Public key distribution and coin tossing.” Theoretical computer science 560 (2014): 7-11.] that a QKD protocol where Alice sends quantum states randomly chosen from two incompatible bases to Bob, who measures the states in one of the bases, which is followed by classical post-processing, can provide a secure key for the one-time-pad protocol. Its security relies on the incompatibility of the bases, which is a basic quantum mechanical property, that prevents Eve from obtaining a significant amount of key without being detected. A number of rigorous security proofs of this so-called BB84 protocol, and many variants, have been provided, even in the case of the most general attacks by Eve, also known as coherent attacks.
While being surprisingly simple in theory, the implementation of QKD has faced, and is still facing, a number of technical challenges. One challenge has been the fact that in its simplest form, QKD relies on single photon states, which are difficult to obtain experimentally. This challenge has been overcome by the use of weak laser pulses, which can be described by coherent states. One way to make use of coherent states is to simulate single photon protocols, such as BB84. A different approach has been taken by Grosshans and Grangier [Grosshans, Frédéric, and Philippe Grangier. “Continuous variable quantum cryptography using coherent states.” Physical review letters 88.5 (2002): 057902.], who have devised a protocol completely based on coherent states. In such a protocol, also known as continuous variable QKD (CVQKD), Alice chooses a coherent state, either by a Gaussian distribution, or uniformly from a discrete set, sends it to Bob who the performs either homodyne or heterodyne measurements. The advantage of using such an approach is that it can be implemented using readily available optical elements and existing fibre optical cables.
Proving the security of CVQKD in the case where Alice chooses from a discrete set of coherent states, also known as discrete modulated CVQKD (DMCVQKD), against the most general coherent attacks is a challenging task. In the present work we derive such a security proof. Our main ingredients are a numerical method that has previously only been used to prove security of DMCVQKD against a more restricted class of attacks, known as collective attacks, as well as the entropy accumulation theorem (EAT), which has been derived to proof coherent attack security for a different class of QKD protocols, which relies on entangled states rather than a prepare-and-measure setting. Adapting the EAT to the wide class of prepare-and-measure protocols, which includes our DMCVQKD protocol, has been a challenge on its own. We here overcome this challenge by introducing a method, involving a virtual state tomography, that could be more generally useful to apply the EAT to other prepare-and-measure protocols.
► BibTeX data
► References
[1] Charles H. Bennett and Gilles Brassard. “Quantum Cryptography: Public Key Distribution and Coin Tossing”. In Proceedings of the IEEE International Conference on Computers, Systems and Signal Processing. Bangalore, India (1984). IEEE Computer Society Press, New York.
[2] Artur K. Ekert. “Quantum cryptography based on bell’s theorem”. Phys. Rev. Lett. 67, 661–663 (1991).
https://doi.org/10.1103/PhysRevLett.67.661
[3] Charles H. Bennett, Gilles Brassard, and N. David Mermin. “Quantum cryptography without bell’s theorem”. Phys. Rev. Lett. 68, 557–559 (1992).
https://doi.org/10.1103/PhysRevLett.68.557
[4] N. J. Cerf, M. Lévy, and G. Van Assche. “Quantum distribution of gaussian keys using squeezed states”. Phys. Rev. A 63, 052311 (2001).
https://doi.org/10.1103/PhysRevA.63.052311
[5] Frédéric Grosshans and Philippe Grangier. “Continuous variable quantum cryptography using coherent states”. Phys. Rev. Lett. 88, 057902 (2002).
https://doi.org/10.1103/PhysRevLett.88.057902
[6] Christian Weedbrook, Andrew M. Lance, Warwick P. Bowen, Thomas Symul, Timothy C. Ralph, and Ping Koy Lam. “Quantum cryptography without switching”. Phys. Rev. Lett. 93, 170504 (2004).
https://doi.org/10.1103/PhysRevLett.93.170504
[7] Raúl García-Patrón and Nicolas J. Cerf. “Continuous-variable quantum key distribution protocols over noisy channels”. Phys. Rev. Lett. 102, 130501 (2009).
https://doi.org/10.1103/PhysRevLett.102.130501
[8] Peter W. Shor and John Preskill. “Simple proof of security of the bb84 quantum key distribution protocol”. Phys. Rev. Lett. 85, 441–444 (2000).
https://doi.org/10.1103/PhysRevLett.85.441
[9] Daniel Gottesman, H-K Lo, Norbert Lutkenhaus, and John Preskill. “Security of quantum key distribution with imperfect devices”. In International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. Page 136. IEEE (2004).
https://doi.org/10.1109/ISIT.2004.1365172
[10] Renato Renner, Nicolas Gisin, and Barbara Kraus. “Information-theoretic security proof for quantum-key-distribution protocols”. Physical Review A 72, 012332 (2005).
https://doi.org/10.1103/PhysRevA.72.012332
[11] Renato Renner. “Security of quantum key distribution”. International Journal of Quantum Information 06, 1–127 (2008).
https://doi.org/10.1142/S0219749908003256
[12] Masato Koashi. “Simple security proof of quantum key distribution based on complementarity”. New Journal of Physics 11, 045018 (2009).
https://doi.org/10.1088/1367-2630/11/4/045018
[13] Michael M. Wolf, Geza Giedke, and J. Ignacio Cirac. “Extremality of gaussian quantum states”. Phys. Rev. Lett. 96, 080502 (2006).
https://doi.org/10.1103/PhysRevLett.96.080502
[14] Igor Devetak and Andreas Winter. “Distillation of secret key and entanglement from quantum states”. Proceedings of the Royal Society A: Mathematical, Physical and engineering sciences 461, 207–235 (2005).
https://doi.org/10.1098/rspa.2004.1372
[15] Frédéric Grosshans, Nicolas J. Cerf, Jérôme Wenger, Rosa Tualle-Brouri, and Philippe Grangier. “Virtual entanglement and reconciliation protocols for quantum cryptography with continuous variables”. Quantum Info. Comput. 3, 535–552 (2003).
https://doi.org/10.26421/QIC3.s-6
[16] Miguel Navascués, Frédéric Grosshans, and Antonio Acín. “Optimality of gaussian attacks in continuous-variable quantum cryptography”. Phys. Rev. Lett. 97, 190502 (2006).
https://doi.org/10.1103/PhysRevLett.97.190502
[17] Raúl García-Patrón and Nicolas J. Cerf. “Unconditional optimality of gaussian attacks against continuous-variable quantum key distribution”. Phys. Rev. Lett. 97, 190503 (2006).
https://doi.org/10.1103/PhysRevLett.97.190503
[18] Anthony Leverrier and Philippe Grangier. “Simple proof that gaussian attacks are optimal among collective attacks against continuous-variable quantum key distribution with a gaussian modulation”. Phys. Rev. A 81, 062314 (2010).
https://doi.org/10.1103/PhysRevA.81.062314
[19] Anthony Leverrier. “Composable security proof for continuous-variable quantum key distribution with coherent states”. Phys. Rev. Lett. 114, 070501 (2015).
https://doi.org/10.1103/PhysRevLett.114.070501
[20] R. Renner and J. I. Cirac. “de finetti representation theorem for infinite-dimensional quantum systems and applications to quantum cryptography”. Phys. Rev. Lett. 102, 110504 (2009).
https://doi.org/10.1103/PhysRevLett.102.110504
[21] Anthony Leverrier, Raúl García-Patrón, Renato Renner, and Nicolas J. Cerf. “Security of continuous-variable quantum key distribution against general attacks”. Phys. Rev. Lett. 110, 030502 (2013).
https://doi.org/10.1103/PhysRevLett.110.030502
[22] Anthony Leverrier. “Security of continuous-variable quantum key distribution via a gaussian de finetti reduction”. Phys. Rev. Lett. 118, 200501 (2017).
https://doi.org/10.1103/PhysRevLett.118.200501
[23] F. Furrer, T. Franz, M. Berta, A. Leverrier, V. B. Scholz, M. Tomamichel, and R. F. Werner. “Continuous variable quantum key distribution: Finite-key analysis of composable security against coherent attacks”. Phys. Rev. Lett. 109, 100502 (2012).
https://doi.org/10.1103/PhysRevLett.109.100502
[24] Fabian Furrer. “Reverse-reconciliation continuous-variable quantum key distribution based on the uncertainty principle”. Phys. Rev. A 90, 042325 (2014).
https://doi.org/10.1103/PhysRevA.90.042325
[25] Matthias Christandl, Robert König, and Renato Renner. “Postselection technique for quantum channels with applications to quantum cryptography”. Phys. Rev. Lett. 102, 020504 (2009).
https://doi.org/10.1103/PhysRevLett.102.020504
[26] Cosmo Lupo. “Towards practical security of continuous-variable quantum key distribution”. Phys. Rev. A 102, 022623 (2020).
https://doi.org/10.1103/PhysRevA.102.022623
[27] Anthony Leverrier and Philippe Grangier. “Unconditional security proof of long-distance continuous-variable quantum key distribution with discrete modulation”. Phys. Rev. Lett. 102, 180504 (2009).
https://doi.org/10.1103/PhysRevLett.102.180504
[28] Anthony Leverrier and Philippe Grangier. “Continuous-variable quantum-key-distribution protocols with a non-gaussian modulation”. Phys. Rev. A 83, 042312 (2011).
https://doi.org/10.1103/PhysRevA.83.042312
[29] Shouvik Ghorai, Philippe Grangier, Eleni Diamanti, and Anthony Leverrier. “Asymptotic security of continuous-variable quantum key distribution with a discrete modulation”. Phys. Rev. X 9, 021059 (2019).
https://doi.org/10.1103/PhysRevX.9.021059
[30] Jie Lin, Twesh Upadhyaya, and Norbert Lütkenhaus. “Asymptotic security analysis of discrete-modulated continuous-variable quantum key distribution”. Phys. Rev. X 9, 041064 (2019).
https://doi.org/10.1103/PhysRevX.9.041064
[31] Twesh Upadhyaya, Thomas van Himbeeck, Jie Lin, and Norbert Lütkenhaus. “Dimension reduction in quantum key distribution for continuous- and discrete-variable protocols”. PRX Quantum 2, 020325 (2021).
https://doi.org/10.1103/PRXQuantum.2.020325
[32] Florian Kanitschar, Ian George, Jie Lin, Twesh Upadhyaya, and Norbert Lütkenhaus. “Finite-size security for discrete-modulated continuous-variable quantum key distribution protocols”. PRX Quantum 4, 040306 (2023).
https://doi.org/10.1103/PRXQuantum.4.040306
[33] Aurélie Denys, Peter Brown, and Anthony Leverrier. “Explicit asymptotic secret key rate of continuous-variable quantum key distribution with an arbitrary modulation”. Quantum 5, 540 (2021).
https://doi.org/10.22331/q-2021-09-13-540
[34] Wen-Bo Liu, Chen-Long Li, Yuan-Mei Xie, Chen-Xun Weng, Jie Gu, Xiao-Yu Cao, Yu-Shuo Lu, Bing-Hong Li, Hua-Lei Yin, and Zeng-Bing Chen. “Homodyne detection quadrature phase shift keying continuous-variable quantum key distribution with high excess noise tolerance”. PRX Quantum 2, 040334 (2021).
https://doi.org/10.1103/PRXQuantum.2.040334
[35] Cosmo Lupo and Yingkai Ouyang. “Quantum key distribution with nonideal heterodyne detection: Composable security of discrete-modulation continuous-variable protocols”. PRX Quantum 3, 010341 (2022).
https://doi.org/10.1103/PRXQuantum.3.010341
[36] Eneet Kaur, Saikat Guha, and Mark M. Wilde. “Asymptotic security of discrete-modulation protocols for continuous-variable quantum key distribution”. Phys. Rev. A 103, 012412 (2021).
https://doi.org/10.1103/PhysRevA.103.012412
[37] Panagiotis Papanastasiou and Stefano Pirandola. “Continuous-variable quantum cryptography with discrete alphabets: Composable security under collective gaussian attacks”. Phys. Rev. Res. 3, 013047 (2021).
https://doi.org/10.1103/PhysRevResearch.3.013047
[38] Takaya Matsuura, Kento Maeda, Toshihiko Sasaki, and Masato Koashi. “Finite-size security of continuous-variable quantum key distribution with digital signal processing”. Nature communications 12, 1–13 (2021).
https://doi.org/10.1038/s41467-020-19916-1
[39] Shinichiro Yamano, Takaya Matsuura, Yui Kuramochi, Toshihiko Sasaki, and Masato Koashi. “Finite-size security proof of binary-modulation continuous-variable quantum key distribution using only heterodyne measurement”. Physica Scripta 99, 025115 (2024).
https://doi.org/10.1088/1402-4896/ad1022
[40] Takaya Matsuura, Shinichiro Yamano, Yui Kuramochi, Toshihiko Sasaki, and Masato Koashi. “Refined finite-size analysis of binary-modulation continuous-variable quantum key distribution”. Quantum 7, 1095 (2023).
https://doi.org/10.22331/q-2023-08-29-1095
[41] Ryo Namiki and Takuya Hirano. “Security of quantum cryptography using balanced homodyne detection”. Phys. Rev. A 67, 022308 (2003).
https://doi.org/10.1103/PhysRevA.67.022308
[42] Frédéric Dupuis, Omar Fawzi, and Renato Renner. “Entropy accumulation”. Communications in Mathematical Physics 379, 867–913 (2020).
https://doi.org/10.1007/s00220-020-03839-5
[43] Frédéric Dupuis and Omar Fawzi. “Entropy accumulation with improved second-order term”. IEEE Transactions on information theory 65, 7596–7612 (2019).
https://doi.org/10.1109/TIT.2019.2929564
[44] Rotem Arnon-Friedman, Frédéric Dupuis, Omar Fawzi, Renato Renner, and Thomas Vidick. “Practical device-independent quantum cryptography via entropy accumulation”. Nature communications 9, 459 (2018).
https://doi.org/10.1038/s41467-017-02307-4
[45] Rotem Arnon-Friedman, Renato Renner, and Thomas Vidick. “Simple and tight device-independent security proofs”. SIAM Journal on Computing 48, 181–225 (2019).
https://doi.org/10.1137/18M1174726
[46] Ernest Y.-Z. Tan, Pavel Sekatski, Jean-Daniel Bancal, René Schwonnek, Renato Renner, Nicolas Sangouard, and Charles C.-W. Lim. “Improved DIQKD protocols with finite-size analysis”. Quantum 6, 880 (2022).
https://doi.org/10.22331/q-2022-12-22-880
[47] Ian George, Jie Lin, Thomas van Himbeeck, Kun Fang, and Norbert Lütkenhaus. “Finite-key analysis of quantum key distribution with characterized devices using entropy accumulation” (2022). arXiv:2203.06554.
arXiv:2203.06554
[48] Adam Winick, Norbert Lütkenhaus, and Patrick J. Coles. “Reliable numerical key rates for quantum key distribution”. Quantum 2, 77 (2018).
https://doi.org/10.22331/q-2018-07-26-77
[49] Tony Metger, Omar Fawzi, David Sutter, and Renato Renner. “Generalised entropy accumulation”. In 2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS). Pages 844–850. IEEE (2022).
https://doi.org/10.1109/FOCS54457.2022.00085
[50] Tony Metger and Renato Renner. “Security of quantum key distribution from generalised entropy accumulation”. Nature Communications 14, 5272 (2023).
https://doi.org/10.1038/s41467-023-40920-8
[51] Marco Tomamichel. “Quantum information processing with finite resources: Mathematical foundations”. Volume 5. Springer. (2015). url: https://link.springer.com/book/10.1007/978-3-319-21891-5.
https://link.springer.com/book/10.1007/978-3-319-21891-5
[52] Martin Müller-Lennert, Frédéric Dupuis, Oleg Szehr, Serge Fehr, and Marco Tomamichel. “On quantum Rényi entropies: A new generalization and some properties”. Journal of Mathematical Physics 54, 122203 (2013).
https://doi.org/10.1063/1.4838856
[53] Mark M Wilde, Andreas Winter, and Dong Yang. “Strong converse for the classical capacity of entanglement-breaking and hadamard channels via a sandwiched rényi relative entropy”. Communications in Mathematical Physics 331, 593–622 (2014).
https://doi.org/10.1007/s00220-014-2122-x
[54] Marcos Curty, Maciej Lewenstein, and Norbert Lütkenhaus. “Entanglement as a precondition for secure quantum key distribution”. Phys. Rev. Lett. 92, 217903 (2004).
https://doi.org/10.1103/PhysRevLett.92.217903
[55] Agnes Ferenczi and Norbert Lütkenhaus. “Symmetries in quantum key distribution and the connection between optimal attacks and optimal cloning”. Phys. Rev. A 85, 052310 (2012).
https://doi.org/10.1103/PhysRevA.85.052310
[56] Fabian Furrer. “Security of continuous-variable quantum key distribution and aspects of device-independent security”. PhD thesis. Gottfried Wilhelm Leibniz Universität Hannover. (2012).
[57] Mario Berta, Fabian Furrer, and Volkher B. Scholz. “The smooth entropy formalism for von Neumann algebras”. Journal of Mathematical Physics 57 (2015).
https://doi.org/10.1063/1.4936405
[58] Shipra Agrawal and Randy Jia. “Optimistic Posterior Sampling for Reinforcement Learning: Worst-Case Regret Bounds”. Mathematics of Operations Research 48, 363–392 (2023).
https://doi.org/10.1287/moor.2022.1266
[59] Mark M Wilde. “Quantum information theory”. Cambridge University Press. (2013).
https://doi.org/10.1017/CBO9781139525343
[60] Patrick J. Coles. “Unification of different views of decoherence and discord”. Phys. Rev. A 85, 042103 (2012).
https://doi.org/10.1103/PhysRevA.85.042103
[61] Wen-Zhao Liu, Ming-Han Li, Sammy Ragy, Si-Ran Zhao, Bing Bai, Yang Liu, Peter J Brown, Jun Zhang, Roger Colbeck, Jingyun Fan, et al. “Device-independent randomness expansion against quantum side information”. Nature Physics 17, 448–451 (2021).
https://doi.org/10.1038/s41567-020-01147-2
[62] Hao Hu, Jiyoung Im, Jie Lin, Norbert Lütkenhaus, and Henry Wolkowicz. “Robust Interior Point Method for Quantum Key Distribution Rate Computation”. Quantum 6, 792 (2022).
https://doi.org/10.22331/q-2022-09-08-792
[63] Stephen Boyd and Lieven Vandenberghe. “Convex optimization”. Cambridge University Press. (2004).
[64] Stephen M. Barnett and Paul M. Radmore. “Methods in Theoretical Quantum Optics”. Oxford University Press. (2002).
https://doi.org/10.1093/acprof:oso/9780198563617.001.0001
[65] J. Löfberg. “Yalmip : A toolbox for modeling and optimization in matlab”. In Proceedings of the CACSD Conference. Taipei, Taiwan (2004).
[66] M. J. Todd K. C. Toh and R. H. Tütüncü. “Sdpt3 — a matlab software package for semidefinite programming, version 1.3”. Optimization Methods and Software 11, 545–581 (1999).
https://doi.org/10.1080/10556789908805762
[67] R. H. Tütüncü, K. C. Toh, and M. J. Todd. “Solving semidefinite-quadratic-linear programs using sdpt3”. Mathematical programming Ser.B 95, 189–217 (2003).
https://doi.org/10.1007/s10107-002-0347-5
[68] Michael Grant and Stephen Boyd. “CVX: Matlab software for disciplined convex programming, version 2.1”. http://cvxr.com/cvx (2014).
http://cvxr.com/cvx
[69] Michael Grant and Stephen Boyd. “Graph implementations for nonsmooth convex programs”. In V. Blondel, S. Boyd, and H. Kimura, editors, Recent Advances in Learning and Control. Pages 95–110. Lecture Notes in Control and Information Sciences. Springer-Verlag Limited (2008).
[70] Carlos Pascual-Garcia. “Discrete Modulated CVQKD via the EAT”. https://github.com/CPascualGarcia/DiscreteModulatedCVQKD_EAT.git (2024).
https://github.com/CPascualGarcia/DiscreteModulatedCVQKD_EAT.git
[71] Marco Tomamichel and Anthony Leverrier. “A largely self-contained and complete security proof for quantum key distribution”. Quantum 1, 14 (2017).
https://doi.org/10.22331/q-2017-07-14-14
[72] Omar Fawzi, Li Gao, and Mizanur Rahaman. “Asymptotic equipartition theorems in von neumann algebras” (2023). arXiv:2212.14700.
arXiv:2212.14700
[73] Anthony Leverrier. “Information reconciliation for discretely-modulated continuous-variable quantum key distribution” (2023). arXiv:2310.17548.
arXiv:2310.17548
Cited by
[1] Florian Kanitschar and Christoph Pacher, “Security of Multi-User Quantum Key Distribution with Discrete-Modulated Continuous-Variables”, arXiv:2406.14610, (2024).
[2] Yichen Zhang, Yiming Bian, Zhengyu Li, Song Yu, and Hong Guo, “Continuous-variable quantum key distribution system: Past, present, and future”, Applied Physics Reviews 11 1, 011318 (2024).
[3] Anthony Leverrier, “Information reconciliation for discretely-modulated continuous-variable quantum key distribution”, arXiv:2310.17548, (2023).
[4] Amir Arqand, Thomas A. Hahn, and Ernest Y. -Z. Tan, “Generalized Rényi entropy accumulation theorem and generalized quantum probability estimation”, arXiv:2405.05912, (2024).
[5] Takaya Matsuura, Shinichiro Yamano, Yui Kuramochi, Toshihiko Sasaki, and Masato Koashi, “Refined finite-size analysis of binary-modulation continuous-variable quantum key distribution”, Quantum 7, 1095 (2023).
[6] Shinichiro Yamano, Takaya Matsuura, Yui Kuramochi, Toshihiko Sasaki, and Masato Koashi, “General treatment of Gaussian trusted noise in continuous variable quantum key distribution”, arXiv:2305.17684, (2023).
[7] Florian Kanitschar and Marcus Huber, “A practical framework for analyzing high-dimensional QKD setups”, arXiv:2406.08544, (2024).
[8] Carlos Pascual-García, Stefan Bäuml, Mateus Araújo, Rotem Liss, and Antonio Acín, “Improved finite-size key rates for discrete-modulated continuous variable quantum key distribution under coherent attacks”, arXiv:2407.03087, (2024).
[9] Junyu Zhang, Xiangyu Wang, Fan Xia, Song Yu, and Ziyang Chen, “Multiple-quadrature-amplitude-modulation continuous-variable quantum key distribution realization with a downstream-access network”, Physical Review A 109 5, 052429 (2024).
[10] Jasminder S. Sidhu, Rocco Maggi, Saverio Pascazio, and Cosmo Lupo, “Security of hybrid BB84 with heterodyne detection”, arXiv:2402.16941, (2024).
The above citations are from SAO/NASA ADS (last updated successfully 2024-07-18 15:38:45). The list may be incomplete as not all publishers provide suitable and complete citation data.
Could not fetch Crossref cited-by data during last attempt 2024-07-18 15:38:43: Could not fetch cited-by data for 10.22331/q-2024-07-18-1418 from Crossref. This is normal if the DOI was registered recently.
This Paper is published in Quantum under the Creative Commons Attribution 4.0 International (CC BY 4.0) license. Copyright remains with the original copyright holders such as the authors or their institutions.
- SEO Powered Content & PR Distribution. Get Amplified Today.
- PlatoData.Network Vertical Generative Ai. Empower Yourself. Access Here.
- PlatoAiStream. Web3 Intelligence. Knowledge Amplified. Access Here.
- PlatoESG. Carbon, CleanTech, Energy, Environment, Solar, Waste Management. Access Here.
- PlatoHealth. Biotech and Clinical Trials Intelligence. Access Here.
- Source: https://quantum-journal.org/papers/q-2024-07-18-1418/
- :has
- :is
- :not
- :where
- ][p
- $UP
- 001
- 06
- 07
- 1
- 1.3
- 10
- 11
- 114
- 118
- 12
- 13
- 14
- 15%
- 16
- 17
- 19
- 1949
- 1984
- 1999
- 20
- 2000
- 2001
- 2004
- 2005
- 2006
- 2008
- 2009
- 2011
- 2012
- 2013
- 2014
- 2015
- 2017
- 2018
- 2019
- 2020
- 2021
- 2022
- 2023
- 2024
- 22
- 23
- 24
- 25
- 26%
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 35%
- 36
- 37
- 39
- 40
- 41
- 43
- 49
- 50
- 51
- 53
- 54
- 540
- 58
- 60
- 61
- 62
- 65
- 66
- 67
- 69
- 7
- 70
- 72
- 77
- 8
- 9
- 97
- a
- above
- ABSTRACT
- access
- accumulation
- Adam
- adapting
- advances
- ADvantage
- affiliations
- After
- against
- AL
- alice
- All
- allows
- also
- alt
- among
- amount
- an
- analysis
- analyzing
- and
- Andrew
- annual
- Anthony
- any
- applications
- Apply
- approach
- arbitrary
- ARE
- AS
- aspects
- assumptions
- attack
- Attacks
- attempt
- author
- authors
- AV
- available
- balanced
- barcelona
- based
- basic
- BE
- been
- being
- Bell
- between
- BIAN
- Bing
- bits
- bob
- bounds
- Break
- brown
- by
- cambridge
- CAN
- cao
- Capacity
- Carl
- carlos
- case
- challenge
- challenges
- challenging
- channels
- characterized
- Charles
- chen
- chooses
- chosen
- christian
- class
- COHERENT
- Coin
- Collective
- comes
- comment
- Commons
- Communication
- Communications
- complete
- completely
- composable
- computation
- computational
- Compute
- computer
- computer science
- computers
- computing
- Conference
- connection
- construct
- continuous
- contrary
- contrast
- control
- Convex
- copyright
- correlations
- Corresponding
- could
- cryptography
- Currently
- Daniel
- data
- David
- de
- derive
- Derived
- described
- detected
- Detection
- Devices
- devised
- different
- difficult
- digital
- disciplined
- discord
- discuss
- distributing
- distribution
- do
- dong
- during
- e
- E&T
- eat
- editors
- either
- elements
- encryption
- Engineering
- ENS
- entangled
- entanglement
- eve
- Even
- excess
- existing
- expansion
- extending
- faced
- facing
- fact
- fan
- few
- Figure
- First
- followed
- For
- form
- Foundations
- four
- Framework
- France
- from
- future
- GAO
- General
- generalized
- generally
- generated
- George
- get
- Gilles
- Git
- given
- grant
- harvard
- Have
- henry
- here
- High
- holders
- honest
- Hong
- http
- HTTPS
- hundred
- Hybrid
- i
- IEEE
- if
- image
- implementation
- implementations
- implemented
- improved
- in
- includes
- incompatible
- india
- Infinity
- info
- information
- Infrastructure
- ingredients
- Institute
- institutions
- interesting
- interior
- International
- introducing
- involving
- IT
- ITS
- JavaScript
- jie
- John
- journal
- Key
- keys
- known
- König
- Lam
- largely
- laser
- Last
- learning
- Leave
- Lecture
- left
- Li
- License
- light
- lim
- Limited
- lin
- List
- liu
- Long
- Main
- make
- many
- Marco
- Marcus
- mario
- mark
- Martin
- mathematical
- mathematics
- max-width
- May..
- measurement
- measurements
- measures
- mechanical
- message
- method
- methods
- Michael
- modeling
- Modules
- Month
- more
- most
- namely
- Nature
- Need
- network
- New
- New York
- Nicolas
- Noise
- normal
- Notes
- novel
- number
- obtain
- obtaining
- of
- omar
- on
- ONE
- only
- open
- Operations
- optics
- optimal
- optimization
- or
- order
- original
- Other
- our
- over
- Overcome
- own
- Oxford
- oxford university
- package
- page
- pages
- Paper
- parameter
- parameters
- parties
- past
- patrick
- Paul
- per
- performed
- performs
- Peter
- phase
- phases
- phd
- Philippe
- physical
- Physics
- ping
- plato
- Plato Data Intelligence
- PlatoData
- Point
- poses
- potential
- Practical
- present
- press
- prevents
- previously
- principle
- Proceedings
- processing
- Programming
- Programs
- promising
- proof
- proofs
- properties
- property
- protocol
- protocols
- Prove
- proven
- provide
- provided
- provides
- proving
- public
- Public Key
- published
- publisher
- publishers
- Quantum
- quantum cryptography
- quantum information
- Quantum optics
- quantum physics
- quantum systems
- R
- randomness
- range
- Rate
- Rates
- rather
- readily
- realistic
- realization
- recent
- recently
- reconciliation
- reduction
- references
- refined
- registered
- regret
- relative
- relies
- remains
- representation
- research
- Resources
- restricted
- review
- Reviews
- right
- rigorous
- ROBERT
- ROSA
- round
- rounds
- royal
- rsa
- s
- scheme
- schemes
- Science
- Science and Technology
- SCIENCES
- Secret
- secure
- security
- sends
- set
- setting
- shared
- shift
- Shor
- shown
- siam
- side
- Signal
- significant
- significantly
- Simple
- simpler
- simulate
- single
- smooth
- So
- Society
- Software
- some
- song
- Space
- Spain
- State
- States
- stefan
- Stephen
- Still
- String
- Successfully
- such
- suitable
- surprisingly
- Symposium
- system
- Systems
- Taiwan
- taken
- Task
- Technical
- technique
- Technology
- telecom
- tens
- term
- test
- than
- that
- The
- their
- then
- theoretical
- theory
- thesis
- they
- this
- thomas
- Through
- Title
- to
- todd
- tolerance
- Tony
- tool
- Toolbox
- Transactions
- treatment
- trusted
- two
- Uncertainty
- uncorrelated
- under
- university
- updated
- URL
- us
- use
- used
- useful
- using
- van
- variable
- version
- via
- Victoria
- views
- Virtual
- volume
- von
- W
- wang
- want
- was
- Way..
- we
- weak
- WELL
- whether
- which
- while
- WHO
- wide
- widely
- Winter
- with
- without
- Wolf
- Work
- Wright
- X
- year
- york
- zephyrnet
- Zhao
