A framework for structured quantum search

[1]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[2]  M. Garey.  Johnson: computers and intractability: a guide to the theory of np- completeness (freeman , 1979 .

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

[4]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[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]  Alan K. Mackworth.  Constraint Satisfaction , 1985 .

[7]  R. Feynman.  Quantum mechanical computers , 1986 .

[8]  Lawrence Davis,et al.  Genetic Algorithms and Simulated Annealing , 1987 .

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

[10]  Hector J. Levesque,et al.  A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.

[11]  Stuart C. Shapiro,et al.  Encyclopedia of artificial intelligence, vols. 1 and 2 (2nd ed.) , 1992 .

[12]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

[13]  P. Cheeseman,et al.  Computational Complexity And Phase Transitions , 1992, Workshop on Physics and Computation.

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

[15]  Tad Hogg,et al.  Exploiting the Deep Structure of Constraint Problems , 1994, Artif. Intell..

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

[17]  S Kirkpatrick,et al.  Critical Behavior in the Satisfiability of Random Boolean Expressions , 1994, Science.

[18]  Wolfgang Ertel,et al.  Optimal parallelization of Las Vegas algorithms , 1993, Forschungsberichte, TU Munich.

[19]  T. Hogg.  Statistical mechanics of combinatorial search , 1994, Proceedings Workshop on Physics and Computation. PhysComp '94.

[20]  David Deutsch,et al.  The Stabilisation of Quantum ComputationsAndr , 1994 .

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

[22]  Barenco,et al.  Conditional Quantum Dynamics and Logic Gates. , 1995, Physical review letters.

[23]  J. Cirac,et al.  Quantum Computations with Cold Trapped Ions. , 1995, Physical review letters.

[24]  Unruh.  Maintaining coherence in quantum computers. , 1994, Physical review. A, Atomic, molecular, and optical physics.

[25]  Raymond Laflamme,et al.  Quantum Computers, Factoring, and Decoherence , 1995, Science.

[26]  Sleator,et al.  Realizable Universal Quantum Logic Gates. , 1995, Physical review letters.

[27]  Dan R. Vlasie.  The Very Particular Structure of the Very Hard Instances , 1996, AAAI/IAAI, Vol. 1.

[28]  J. Raimond,et al.  Quantum Computing: Dream or Nightmare? , 1996 .

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

[30]  Monasson,et al.  Entropy of the K-satisfiability problem. , 1996, Physical review letters.

[31]  Tad Hogg.  Quantum Computing and Phase Transitions in Combinatorial Search , 1996, J. Artif. Intell. Res..

[32]  Jean-Michel Raimond,et al.  Letters: Future of quantum computing proves to be debatable , 1996 .

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

[34]  Umesh V. Vazirani,et al.  Quantum Complexity Theory , 1997, SIAM J. Comput..

[35]  Timothy F. Havel,et al.  Nuclear magnetic resonance spectroscopy: an experimentally accessible paradigm for quantum computing , 1997, quant-ph/9709001.

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