# Quantum Adiabatic Evolution Algorithms with Different Paths

@article{Farhi2002QuantumAE, title={Quantum Adiabatic Evolution Algorithms with Different Paths}, author={E. Farhi and J. Goldstone and S. Gutmann}, journal={arXiv: Quantum Physics}, year={2002} }

In quantum adiabatic evolution algorithms, the quantum computer follows the ground state of a slowly varying Hamiltonian. The ground state of the initial Hamiltonian is easy to construct; the ground state of the final Hamiltonian encodes the solution of the computational problem. These algorithms have generally been studied in the case where the "straight line" path from initial to final Hamiltonian is taken. But there is no reason not to try paths involving terms that are not linear… CONTINUE READING

80 Citations

Different Strategies for Optimization Using the Quantum Adiabatic Algorithm

- Mathematics, Physics
- 2014

57

Experimental implementation of local adiabatic evolution algorithms by an NMR quantum information processor.

- Physics, Medicine
- 2005

22

The travelling salesman problem and adiabatic quantum computation: an algorithm

- Physics, Computer Science
- 2019

6

#### References

##### Publications referenced by this paper.

A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem

- Physics, Medicine
- 2001

1105