Quantum switching and quantum merge sorting

This paper proposes a quantum switching architecture that can dynamically permute each input quantum data to its destination port to avoid using the fully connected networks. In addition, in order to reduce the execution time of the quantum switching, an efficient quantum merge sorting (QMS) algorithm that provides a parallel quantum computation is also developed. The quantum switching utilizes the QMS algorithm as a subroutine so that the total running time can be reduced to polylogarithmic time. Furthermore, to evaluate the feasibility of the quantum switching, we also define three different kinds of performance factors that can be used to estimate the complexity in implementation and the time delay in execution for quantum instruments. From the evaluation results, it can be seen that the proposed quantum switching is feasible in practice.

[1]  Hartmut Klauck,et al.  Quantum time-space tradeoffs for sorting , 2002, STOC '03.

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

[3]  Martin Nilsson,et al.  Parallel Quantum Computation and Quantum Codes , 2001, SIAM J. Comput..

[4]  J. Cirac,et al.  Quantum repeaters based on entanglement purification , 1998, quant-ph/9808065.

[5]  Rahul Ratan,et al.  A Quantum Self-Routing Packet Switch , 2004 .

[6]  R. Landauer,et al.  Irreversibility and heat generation in the computing process , 1961, IBM J. Res. Dev..

[7]  Sheng-Tzong Cheng,et al.  Quantum communication for wireless wide-area networks , 2005, IEEE Journal on Selected Areas in Communications.

[8]  Jan Neerbek,et al.  Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness , 2002, Algorithmica.

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

[10]  I. M. Tsai,et al.  Experimental Realization of an NMR Quantum Switch , 2004 .

[11]  Andris Ambainis,et al.  A better lower bound for quantum algorithms searching an ordered list , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[12]  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..

[13]  Sartaj Sahni,et al.  Parallel permutation and sorting algorithms and a new generalized connection network , 1982, JACM.

[14]  Barenco,et al.  Elementary gates for quantum computation. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[15]  Hartmut Klauck,et al.  Quantum and classical strong direct product theorems and optimal time-space tradeoffs , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[16]  Jan Neerbek,et al.  Quantum Complexities of Ordered Searching, Sorting, and Element Distinctness , 2001, ICALP.

[17]  A. John Arul.  Impossibility of comparing and sorting quantum states , 2001 .

[18]  D. Dieks.  Communication by EPR devices , 1982 .

[19]  N. Gisin,et al.  Quantum cryptography , 1998 .

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

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

[22]  W. Wootters,et al.  A single quantum cannot be cloned , 1982, Nature.

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

[24]  Biham,et al.  Quantum cryptographic network based on quantum memories. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[25]  Chien-Cheng Tseng,et al.  Quantum full adder and subtractor , 2002 .

[26]  S. Braunstein,et al.  Quantum computation , 1996 .

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

[28]  Gilles Brassard,et al.  Quantum Cryptography , 2005, Encyclopedia of Cryptography and Security.

[29]  S Lloyd,et al.  A Potentially Realizable Quantum Computer , 1993, Science.

[30]  M. Sipser,et al.  Invariant quantum algorithms for insertion into an ordered list , 1999, quant-ph/9901059.