TOOLS FOR QUANTUM ALGORITHMS

We present efficient implementations of a number of operations for quantum computers. These include controlled phase adjustments of the amplitudes in a superposition, permutations, approximations of transformations and generalizations of the phase adjustments to block matrix transformations. These operations generalize those used in proposed quantum search algorithms.

[1]  Barenco,et al.  Quantum networks for elementary arithmetic operations. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[2]  Tad Hogg,et al.  HIGHLY STRUCTURED SEARCHES WITH QUANTUM COMPUTERS , 1998 .

[3]  P. Benioff.  Quantum mechanical hamiltonian models of turing machines , 1982 .

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

[5]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[6]  T. Hogg.  A framework for structured quantum search , 1997, quant-ph/9701013.

[7]  E. Knill.  Approximation by Quantum Circuits , 1995 .

[8]  D. Deutsch.  Quantum computational networks , 1989, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[9]  P. Høyer.  Efficient Quantum Transforms , 1997, quant-ph/9702028.

[10]  Lov K. Grover,et al.  Nested quantum search and structured problems , 1998, quant-ph/9806078.

[11]  Robert R. Tucci.  A Rudimentary Quantum Compiler , 1998 .

[12]  P. Benioff.  The computer as a physical system: A microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines , 1980 .