- Physical Review Journals
All JournalsPhysics Magazine

Physical Review Research

Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Open Access

General theory of quantum fingerprinting network

Ji-Qian Qin1, Jing-Tao Wang1, Yun-Long Yu1, and Xiang-Bin Wang1,2,3,4,*

  • 1State Key Laboratory of Low Dimensional Quantum Physics, Department of Physics, Tsinghua University, Beijing 100084, China
  • 2Shanghai Branch, CAS Center for Excellence and Synergetic Innovation Center in Quantum Information and Quantum Physics, University of Science and Technology of China, Shanghai 201315, China
  • 3Jinan Institute of Quantum Technology, SAICT, Jinan 250101, China
  • 4Shenzhen Institute for Quantum Science and Engineering, and Physics Department, Southern University of Science and Technology, Shenzhen 518055, China

  • *xbwang@mail.tsinghua.edu.cn
PDF

Phys. Rev. Research 3, 033039 – Published 9 July, 2021

DOI: https://doi.org/10.1103/PhysRevResearch.3.033039

Abstract

The purpose of fingerprinting is to compare long messages with low communication complexity. Compared with its classical version, quantum fingerprinting can realize exponential reduction in communication complexity. Recently, multiparty quantum fingerprinting is studied to determine whether the messages from many parties are all the same. However, the complete relationships among them, including which ones are the same, are more general for future applications. Here, we propose the relationship state G to describe all possible relationships among N messages. Based on this, we provide a general quantum fingerprinting network and then take the four-party quantum fingerprinting protocol as an example for detailed analysis. We take the full parameter optimization for the quantum fingerprinting protocol through asymmetric channel. The method of encoding more than one bit on each coherent state is used to further improve the performance of our protocol. Compared with other protocols, our protocol provides more relationships among different parties with only linear increase in communication complexity.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (21)

  1. C. H. Bennett and G. Brassard, Quantum cryptography: Public key distribution and coin tossing, in Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing (IEEE, Piscataway, NJ, 1984), pp. 175–179.
  2. N. Gisin, G. G. Ribordy, W. Tittel, and H. Zbinden, Quantum cryptography, Rev. Mod. Phys. 74, 145 (2002).
  3. X.-B. Wang, T. Hiroshima, A. Tomita, and M. Hayashi, Quantum information with Gaussian states, Phys. Rep. 448, 1 (2007).
  4. N. Gisin and R. Thew, Quantum communication, Nat. Photon. 1, 165 (2007).
  5. V. Scarani, H. Bechmann-Pasquinucci, N. J. Cerf, M. Dusek, N. Lutkenhaus, and M. Peev, The security of practical quantum key distribution, Rev. Mod. Phys. 81, 1301 (2009).
  6. S. Pirandola, U. L. Andersen, L. Banchi, M. Berta, D. Bunandar, R. Colbeck, D. Englund, T. Gehring, C. Lupo, and C. Ottaviani, Advances in quantum cryptography, Adv. Opt. Photon. 12, 1012 (2020).
  7. F. Xu, X. Ma, Q. Zhang, H.-K. Lo, and J.-W. Pan, Secure quantum key distribution with realistic devices, Rev. Mod. Phys. 92, 025002 (2020).
  8. H. Buhrman, R. Cleve, S. Massar, and R. deWolf, Nonlocality and communication complexity, Rev. Mod. Phys. 82, 665 (2010).
  9. H. Buhrman, W. vanDam, P. Hoyer, and A. Tapp, Multiparty quantum communication complexity, Phys. Rev. A 60, 2737 (1999).
  10. I. Newman and M. Szegedy, Public vs. private coin flips in one round communication games, in Proceedings of the 28th Annual ACM Symposium on Theory of Computing (ACM, Philadelphia, United States, 1996), pp. 561–570.
  11. L. Babai and P. G. Kimmel, Randomized simultaneous messages: Solution of a problem of Yao in communication complexity, in Proceedings of the 12th Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No. 97CB36072) (IEEE Computer Society, USA, 1997), pp. 239–246.
  12. H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf, Quantum fingerprinting, Phys. Rev. Lett. 87, 167902 (2001).
  13. S. Massar, Quantum fingerprinting with a single particle, Phys. Rev. A 71, 012310 (2005).
  14. A. C.-C. Yao, Some complexity questions related to distributive computing (preliminary report), in Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing (ACM, New York, NY, USA, 1979), pp. 209–213.
  15. J. M. Arrazola and N. Lutkenhaus, Quantum fingerprinting with coherent states and a constant mean number of photons, Phys. Rev. A 89, 062305 (2014).
  16. F. H. Xu, J. M. Arrazola, K. Wei, W. Wang, P. Palaciosavila, C. Feng, S. Sajeed, N. Lutkenhaus, and H. Lo, Experimental quantum fingerprinting with weak coherent pulses, Nat. Commun. 6, 8735 (2015).
  17. J.-Y. Guan, F. Xu, H.-L. Yin, Y. Li, W.-J. Zhang, S.-J. Chen, X.-Y. Yang, L. Li, L. X. You, T. Y. Chen, Z. Wang, Q. Zhang, and J. W. Pan, Observation of quantum fingerprinting beating the classical limit. Phys. Rev. Lett. 116, 240502 (2016).
  18. B. Lovitz and N. Lutkenhaus, Families of quantum fingerprinting protocols, Phys. Rev. A 97, 032340 (2018).
  19. X. Zhong, F. Xu, H.-K. Lo, and L. Qian, Efficient experimental quantum fingerprinting with wavelength division multiplexing, arXiv:2005.06049 (2020).
  20. H. Gómez-Sousa, Multiparty quantum fingerprinting with weak coherent pulses: Circuit design and protocol analysis, New J. Phys. 22, 113004 (2020).
  21. O. Fischer, R. Oshman, and U. Zwick, Public vs. private randomness in simultaneous multiparty communication complexity, in Proceedings of the 23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO'16), Helsinki, Finland, July 19–21 (Springer International Publishing, Cham, 2016), pp. 60–74.

Outline

Information

Phys. Rev. Research 3, 033039– Published 9 July, 2021
  • Received 16 November 2020
  • Revised 7 April 2021
  • Accepted 14 June 2021
Crossmark - Check for updates button
Creative Commons Logo

Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.

Published by the American Physical Society

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation