Adiabatic quantum computation

From Wikipedia, the free encyclopedia

It has been suggested that this article or section be merged into adiabatic theorem. (Discuss)

Adiabatic Quantum Computation relies on the adiabatic theorem to do calculations.^[1] First, a complex Hamiltonian is found whose ground state describes the solution to the problem of interest. Next, a system with a simple Hamiltonian is prepared and initialized to the ground state. Finally, the simple Hamiltonian is adiabatically evolved to the complex Hamiltonian. By the adiabatic theorem, the system remains in the ground state, so at the end the state of the system describes the solution to the problem.

[edit] References

v • d • e Quantum computing General Qubit • Quantum computer • Quantum information • Quantum programming • Quantum virtual machine • Timeline of quantum computing Quantum communication Quantum channel • Quantum cryptography • Quantum teleportation • LOCC • Entanglement distillation Quantum algorithms Universal quantum simulator • Deutsch-Jozsa algorithm • Grover's search • Shor's factorization • Simon's Algorithm • (BQP) Quantum computing models Quantum circuit (quantum gate) • One-way quantum computer (cluster state) • Adiabatic quantum computation Decoherence prevention Quantum error correction • Topological quantum computer Physical implementations Quantum optics Linear optics QC • Cavity QED Ultracold atoms Trapped ion quantum computer • Optical lattice Spin-based Nuclear magnetic resonance (NMR) quantum computing • Kane QC • Loss-DiVincenzo (quantum dot) QC Other Superconducting quantum computing (Charge qubit • Flux qubit) • Nitrogen-vacancy center