HIGHLY STRUCTURED SEARCHES WITH QUANTUM COMPUTERS

@inproceedings{Hogg1998HIGHLYSS,
  title={HIGHLY STRUCTURED SEARCHES WITH QUANTUM COMPUTERS},
  author={Tad Hogg},
  year={1998}
}
A quantum algorithm for a class of highly structured combinatorial search problems is introduced. This algorithm finds a solution in a single step, contrasting with the linear growth in the number of steps required by the best classical algorithms as the problem size increases, and the exponential growth 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… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 29 CITATIONS

Evolving Hogg's Quantum Algorithm Using Linear-Tree GP

VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Single-Step Quantum Search Using Problem Structure Tad Hogg

VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS

Solving Highly Constrained Search Problems with Quantum Computers

  • J. Artif. Intell. Res.
  • 1999
VIEW 11 EXCERPTS
CITES RESULTS, BACKGROUND & METHODS
HIGHLY INFLUENCED