Quantum communication for wireless wide-area networks

In this paper, a quantum routing mechanism is proposed to teleport a quantum state from one quantum device to another wirelessly even though these two devices do not share EPR pairs mutually. This results in the proposed quantum routing mechanism that can be used to construct the quantum wireless networks. In terms of time complexity, the proposed mechanism transports a quantum bit in time almost the same as the quantum teleportation does regardless of the number of hops between the source and destination. From this point of view, the quantum routing mechanism is close to optimal in data transmission time. In addition, in order to realize the wireless communication in the quantum domain, a hierarchical network architecture and its corresponding communication protocol are developed. Based on these network components, a scalable quantum wireless communication can be achieved.

[1]  Dharma P. Agrawal,et al.  Introduction to Wireless and Mobile Systems , 2002 .

[2]  Alexei Y. Kitaev,et al.  Quantum measurements and the Abelian Stabilizer Problem , 1995, Electron. Colloquium Comput. Complex..

[3]  Ashwin Nayak,et al.  On communication over an entanglement-assisted quantum channel , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[4]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[5]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[6]  Charles H. Bennett,et al.  Purification of noisy entanglement and faithful teleportation via noisy channels. , 1995, Physical review letters.

[7]  Frederic T. Chong,et al.  Building quantum wires: the long and the short of it , 2003, 30th Annual International Symposium on Computer Architecture, 2003. Proceedings..

[8]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[9]  Pieter H. Hartel,et al.  Reasoning about Grover's quantum search algorithm using probabilistic wp , 1999, TOPL.

[10]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[11]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[12]  Andris Ambainis,et al.  Extracting quantum entanglement (general entanglement purification protocols) , 2001, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[13]  Adam D. Smith,et al.  Authentication of quantum messages , 2001, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[14]  A. Barenco.  A universal two-bit gate for quantum computation , 1995, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[15]  Lov K. Grover,et al.  Quantum computation , 1999, Proceedings Twelfth International Conference on VLSI Design. (Cat. No.PR00013).

[16]  Charles H. Bennett,et al.  Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels. , 1993, Physical review letters.

[17]  DiVincenzo.  Two-bit gates are universal for quantum computation. , 1994, Physical review. A, Atomic, molecular, and optical physics.

[18]  I. M. Tsai,et al.  Digital switching in the quantum domain , 2002 .

[19]  Andris Ambainis,et al.  Dense quantum coding and quantum finite automata , 2002, JACM.

[20]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[21]  Sy-Yen Kuo,et al.  Quantum Boolean circuit approach for searching an unordered database , 2002, Proceedings of the 2nd IEEE Conference on Nanotechnology.