A previously developed quantum search algorithm for solving 1-SAT problems in a single step is generalized to apply to a range of highly constrained k-SAT problems. We identify a bound on the number of clauses in satisfiability problems for which the generalized algorithm can find a solution in a constant number of steps as the number of variables increases. This performance contrasts with the linear growth in the number of steps required by the best classical algorithms, and the exponential number required by classical and quantum methods that ignore the problem structure. In some cases, the algorithm can also guarantee that insoluble problems in fact have no solutions, unlike previously proposed quantum search algorithms.
|
7716
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
556
|
A new method for solving hard satisfiability problems
– Selman, Levesque, et al.
- 1992
|
|
468
|
Where the really hard problems are
– Cheeseman, Kanefsky, et al.
- 1991
|
|
412
|
Algorithms for quantum computation: Discrete log and factoring
– Shor
- 1994
|
|
332
|
Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
– Minton, Johnston, et al.
- 1992
|
|
324
|
Quantum theory, the Church-Turing principle and the universal quantum computer
– Deutsch
- 1985
|
|
264
|
Quantum complexity theory
– Bernstein, Vazirani
- 1993
|
|
243
|
Constraint Satisfaction
– Mackworth
- 1987
|
|
123
|
Quantum computational networks
– Deutsch
- 1989
|
|
115
|
Quantum mechanics helps in searching for a needle in a haystack, Phys
– Grover
- 1997
|
|
111
|
Critical behavior in the satisfiability of random Boolean expressions
– Kirkpatrick, Selman
- 1994
|
|
106
|
Quantum mechanical computers
– Feynman
- 1985
|
|
102
|
Quantum computation
– BERTHIAUME
- 1996
|
|
92
|
Quantum measurements and the Abelian Stabilizer Problem
– Kitaev
- 1995
|
|
88
|
Scheme for reducing decoherence in quantum computer memory, Phys
– Shor
- 1995
|
|
77
|
The hardest constraint problems: A double phase transition
– Hogg, Williams
- 1994
|
|
57
|
Tight bounds on quantum searching
– Boyer, Brassard, et al.
- 1996
|
|
56
|
Graphical Evolution – An Introduction to the Theory of Random Graphs, Wiley-Interscience
– Palmer
- 1985
|
|
48
|
A potentially realizable quantum computer
– Lloyd
- 1993
|
|
47
|
Quantum mechanical hamiltonian models of turing machines
– Benioff
- 1982
|
|
46
|
Phase transitions and the search problem
– Hogg, Huberman, et al.
- 1996
|
|
40
|
Feynman lectures on computation
– Feynman
- 1996
|
|
33
|
Combinatorial Algorithms for Computers and Calculators
– Nijenhuis, Wilf
- 1978
|
|
30
|
Quantum computation
– DiVincenzo
- 1995
|
|
25
|
Maintaining coherence in quantum computers
– Unruh
- 1995
|
|
23
|
Nuclear magnetic resonance spectroscopy: An experimentally accessible paradigm for quantum computing, eprint quant-ph/9709001
– Cory, Price, et al.
- 1997
|
|
22
|
Experimental realization of a quantum algorithm, Nature 393
– Chuang, Vandersypen, et al.
- 1998
|
|
22
|
Resilient quantum computation
– Knill, Laflamme, et al.
- 1998
|
|
20
|
Is Quantum Mechanically Coherent Computation Useful
– Landauer
- 1994
|
|
15
|
Quantum computing and phase transitions in combinatorial search
– Hogg
- 1996
|
|
12
|
Quantum computers can search arbitrarily large databases by a single query in Phys
– Grover
- 1997
|
|
11
|
Experimental quantum teleportation
– Bouwmeester, Pan, et al.
- 1997
|
|
11
|
Quantum computers and intractable (NP -complete) computing problems. Physical Review A48
– Čern´y
- 1993
|
|
10
|
Crystal lattice quantum computer
– Yamaguchi, Yamamoto
- 1999
|
|
9
|
Conditional quantum dynamics and logic gates
– Barenco, Deutsch, et al.
- 1995
|
|
9
|
The Fundamental Physical Limits of Computation
– Bennett, Landauer
- 1985
|
|
8
|
Entropy of the Ksatisfiability problem
– Monasson, Zecchina
- 1996
|
|
8
|
Realizable universal quantum logic gates
– Sleator, Weinfurter
- 1995
|
|
7
|
Nested quantum search and NP-complete problems
– Cerf, Grover, et al.
- 1998
|
|
7
|
QED: The Strange Theory of Light and Matter
– Feynman
- 1985
|
|
6
|
Incomplete thoughts about incomplete satisfiability procedures
– Tsuji, Gelder
- 1993
|
|
5
|
Monte Carlo simulation of quantum computation
– Cerf, Koonin
- 1998
|
|
5
|
Local search methods for quantum computers.” quantph/9802043
– Hogg, Yanik
- 1998
|
|
5
|
Single quantum querying of a database
– Terhal, Smolin
- 1997
|
|
4
|
The Principles of Quantum Mechanics (4th edition
– Dirac
- 1958
|
|
4
|
On the Stupid Algorithm for Satisfiability
– Gent
- 1998
|
|
4
|
Quantum computing: Dream or nightmare
– Haroche, Raimond
- 1996
|
|
4
|
A framework for structured quantum search
– Hogg
- 1998
|
|
2
|
Future of quantum computing proves to be debatable
– Monroe, Wineland
- 1996
|
|
1
|
Quantum counting. Los Alamos preprint quant-ph/9805082
– Brassard, Hoyer
- 1998
|
