A practical framework to utilize quantum search

In this paper we propose a practical framework to utilize quantum computers in the future. To the best of our knowledge, this is the first paper to show a concrete usage of quantum computation in general programming. In our framework, we can utilize a quantum computer as a coprocessor to speed-up some parts of a program that runs on a classical computer. To do so, we propose several new ideas and techniques, such as a practical method to design a large quantum circuits for search problems and an efficient quantum comparator.

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

[2]  Anas N. Al-Rabadi,et al.  A General Decomposition for Reversible Logic , 2001 .

[3]  Jeff W. Sanders,et al.  Quantum Programming , 2000, MPC.

[4]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

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

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

[7]  Igor L. Markov,et al.  Smaller two-qubit circuits for quantum communication and computation , 2004, Proceedings Design, Automation and Test in Europe Conference and Exhibition.

[8]  Luciano Serafini,et al.  Toward an architecture for quantum programming , 2001, ArXiv.