Corpus ID: 5772651

Quantum adiabatic algorithms, small gaps, and different paths

@article{Farhi2011QuantumAA,
  title={Quantum adiabatic algorithms, small gaps, and different paths},
  author={Edward Farhi and Jeffrey Goldstone and David Gosset and Sam Gutmann and Harvey B. Meyer and Peter W. Shor},
  journal={ArXiv},
  year={2011},
  volume={abs/0909.4766}
}
  • Edward Farhi, Jeffrey Goldstone, +3 authors Peter W. Shor
  • Published 2011
  • Mathematics, Physics, Computer Science
  • ArXiv
  • We construct a set of instances of 3SAT which are not solved efficiently using the simplestquantum adiabatic algorithm. These instances are obtained by picking randomclauses all consistent with two disparate planted solutions and then penalizing one ofthem with a single additional clause. We argue that by randomly modifying the beginningHamiltonian, one obtains (with substantial probability) an adiabatic path thatremoves this difficulty. This suggests that the quantum adiabatic algorithm should… CONTINUE READING

    Figures and Topics from this paper.

    Citations

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

    Challenges of adiabatic quantum evaluation of NAND trees

    VIEW 1 EXCERPT
    CITES BACKGROUND

    Adiabatic optimization without local minima

    Simulated Quantum Annealing Can Be Exponentially Faster Than Classical Simulated Annealing

    VIEW 1 EXCERPT

    FILTER CITATIONS BY YEAR

    2009
    2019

    CITATION STATISTICS

    • 1 Highly Influenced Citations

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 23 REFERENCES

    How powerful is adiabatic quantum computation?

    VIEW 1 EXCERPT

    The quantum adiabatic optimization algorithm and local minima

    VIEW 1 EXCERPT