Grover's Quantum Search Algorithm and Mixed States

1

[1]  R. Jozsa,et al.  SEPARABILITY OF VERY NOISY MIXED STATES AND IMPLICATIONS FOR NMR QUANTUM COMPUTING , 1998, quant-ph/9811018.

[2]  Andris Ambainis,et al.  Quantum lower bounds by quantum arguments , 2000, STOC '00.

[3]  Noam Nisan,et al.  Quantum circuits with mixed states , 1998, STOC '98.

[4]  Richard Jozsa.  Searching in Grover's Algorithm , 1999 .

[5]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[6]  Gilles Brassard,et al.  Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..

[7]  U. Toronto,et al.  Analysis of generalized Grover quantum search algorithms using recursion equations , 2000, quant-ph/0010077.

[8]  T. Toffoli,et al.  Conservative logic , 2002, Collision-Based Computing.

[9]  Christof Zalka.  GROVER'S QUANTUM SEARCHING ALGORITHM IS OPTIMAL , 1997, quant-ph/9711070.

[10]  G. Brassard,et al.  Quantum Amplitude Amplification and Estimation , 2000, quant-ph/0005055.

[11]  I. Chuang,et al.  Quantum Computation and Quantum Information: Bibliography , 2010 .

[12]  G. Long,et al.  Dominant Gate Imperfection in Grover's Quantum Search Algorithm , 2001 .

[13]  Lov K. Grover.  How fast can a quantum computer search , 1998 .

[14]  Lov K. Grover.  Quantum Search on Structured Problems , 1998, QCQC.

[15]  Lov K. Grover.  Quantum Mechanics Helps in Searching for a Needle in a Haystack , 1997, quant-ph/9706033.

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

[17]  Ronald de Wolf,et al.  Quantum lower bounds by polynomials , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[18]  V. Smirnov,et al.  Linear algebra and group theory , 1961 .

[19]  S Bose,et al.  Communication capacity of quantum computation. , 2000, Physical review letters.

[20]  Daniel R. Simon,et al.  On the power of quantum computation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[21]  Shor,et al.  Scheme for reducing decoherence in quantum computer memory. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[22]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[23]  P. Høyer.  Arbitrary phases in quantum amplitude amplification , 2000, quant-ph/0006031.

[24]  J. Preskill.  Work: Quantum Information and Computation , 1998 .

[25]  Colin P. Williams,et al.  Generalized quantum search with parallelism , 1999, quant-ph/9904049.

[26]  Whitfield Diffie,et al.  New Directions in Cryptography , 1976, IEEE Trans. Inf. Theory.

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

[28]  Markus Grassl,et al.  Generalized Grover Search Algorithm for Arbitrary Initial Amplitude Distribution , 1998, QCQC.

[29]  Peter W. Shor,et al.  Fault-tolerant quantum computation , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[30]  Lov K. Grover.  Quantum Computers Can Search Rapidly by Using Almost Any Transformation , 1998 .

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

[32]  Yang Sun,et al.  General Phase Matching Condition for Quantum Searching , 2001 .

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

[34]  Gilles Brassard,et al.  Tight bounds on quantum searching , 1996, quant-ph/9605034.