Loss-and-Noise Tolerant Single-Shot Quantum Coin Flipping

Abstract:

To make quantum coin flipping protocols more practical, we propose a new method that makes single-shot quantum coin flipping (SS-QCF) protocols tolerant of loss and noise. First, we present a new SS-QCF protocol which is a modification version of the previous one by Berlín et al.[ Phys. Rev. A Vol. 80 (2009), p. 062321]. Next, we prove that our protocol performs well against loss and noise. It shows that the presented protocol is able to be applied in real-world channels.

• Periodical: Applied Mechanics and Materials (Volumes 496-500)
• Pages: 2332-2337
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.496-500.2332
• Online since: January 2014
• Authors: Sheng Bo Huang, Sheng Zhang*, Jun Bo Chen, Ding Yi Ji, Jin Liu, Wen Ye
• Keywords: Quantum Coin Flipping, Quantum Cryptography, Quantum Information

References

[1] M. Blum, in: Advances in Cryptology: A Report on CRYPTO'81, Santa Barbara, California(1981), p.11–15.

[2] C. Bennett, G. Brassard, et al., in Proceedings of IEEE International Conference on Computers, Systems and Signal Processing , Bangalore, India(1984), p.175.

[3] D. Mayers: Phys. Rev. Lett. Vol. 78 (1997), p.3414.

[4] H. K. Lo and H. F. Chau: Physica D Vol. 120 (1998), p.177.

[5] D. Aharonov, A. Ta-Shma, U. Vazirani, and A. C. -C. Yao, in: Proceedings of 32nd Annual ACM Symposium on Theory of Computing, Portland, OR( 2000), p.705–714.

DOI: 10.1145/335305.335404

[6] A. Ambainis: J. Comput. Syst. Sci. Vol. 68 (2004), p.398.

[7] G. Berlín, G. Brassard, F. Bussières, and N. Godbout, Phys. Rev. A Vol. 80 (2009), p.062321.

[8] N. Aharon, S. Massar, and J. Silman: Phys. Rev. A Vol. 82 (2010), p.052307.

[9] R. W. Spekkens and T. Ruldolph: Quant. Inf. Comput. Vol. 2 (2002), p.66.

[10] R. W. Spekkens and T. Rudolph: Phys. Rev. A Vol. 65(2001), p.012310.

[11] A. Kitaev (Original paper is unpublished, an explicit restatement can be found in Ref.

[13] .

[12] A. Chailloux and I. Kerenidis, in Proceedings of 50th Annual IEEE Symposium on the Foundations of Computer Science, Atlanta, GA(2009), p.527.

DOI: 10.1109/focs.2009.71

[13] C. Mochon, Arxiv preprint arXiv: 0711. 4114 (2007).

[14] R. W. Spekkens and T. Rudolph: Phys. Rev. Lett. Vol. 89, No. 22 (2002), p.227901.

[15] A. Ambainis, Arxiv preprint arXiv: quant-ph/0204063 (2002).

[16] I. Kerenidis and A. Nayak: Inf. Process. Lett. Vol. 89, No. 3 (2004), p.131.

[17] C. Mochon, in: Proceedings of 45th Annual IEEE Symposium on the Foundations of Computer Science, Rome(2004), p.2.

[18] C. Mochon: Phys. Rev. A Vol. 72, No. 2 (2005), p.022341.

[19] A. Ambainis, H. Buhrman, Y. Dodis, and H. Röhrig, in: Proceedings of 19th Annual IEEE Symposium on Computational Complexity , Amherst, MA( 2004), p.250.

DOI: 10.1109/ccc.2004.1313848

[20] M. Ganz, Arxiv preprint arXiv: 0910. 4952 (2009).

[21] N. Gisin, S. Fasel, B. Kraus, H. Zbinden, and G. Ribordy: Phys. Rev. A Vol. 73(2006), p.022320.

[22] V. Makarov, A. Anisimov, and J. Skaar: Phys. Rev. A Vol. 74 (2006), p.022313.

[23] J. Barrett and S. Massar: Phys. Rev. A Vol. 69 (2004), p.022322.

[24] J. Barrett and S. Massar: Phys. Rev. A Vol. 70(2004), p.052310.

[25] A. Chailloux, Arxiv preprint arXiv: 1009. 0044 (2011).