Adiabatic Quantum Computation
A model of quantum computing that solve problems by slowly evolving a system from a known ground state to a final ground state that encodes the solution.
Adiabatic Quantum Computation (AQC) is a model of quantum computation that leverages quantum mechanical principles to solve computational problems. It is based on the adiabatic theorem, which states that if a quantum system starts in its ground state (lowest energy state) and its Hamiltonian (an operator representing the total energy of the system) is changed slowly enough, the system will remain in its instantaneous ground state throughout the evolution. The process begins by preparing a quantum system in the easily achievable ground state of a simple initial Hamiltonian, H_initial. Then, the Hamiltonian is slowly evolved over time towards a final Hamiltonian, H_final, whose ground state encodes the solution to the computational problem. The evolution is governed by a time-dependent Hamiltonian, H(t) = (1-s)H_initial + sH_final, where s progresses from 0 to 1. If the evolution is sufficiently slow (adiabatic), the system will end up in the ground state of H_final. The computation is completed by measuring the final state of the system. AQC is particularly well-suited for solving optimization problems, such as the Traveling Salesperson Problem or finding the ground state of complex molecular systems. A key advantage is its potential robustness against certain types of noise and decoherence compared to gate-based quantum computation, as long as the energy gap between the ground state and the first excited state remains sufficiently large during the evolution. The primary trade-off is the requirement for slow evolution, which can lead to long computation times, and the challenge of maintaining adiabaticity, especially for problems with small energy gaps. The physical implementation often involves superconducting qubits.
graph LR
Center["Adiabatic Quantum Computation"]:::main
Pre_linear_algebra["linear-algebra"]:::pre --> Center
click Pre_linear_algebra "/terms/linear-algebra"
Center --> Child_quantum_annealing["quantum-annealing"]:::child
click Child_quantum_annealing "/terms/quantum-annealing"
Rel_quantum_computing["quantum-computing"]:::related -.-> Center
click Rel_quantum_computing "/terms/quantum-computing"
Rel_superconducting_qubits["superconducting-qubits"]:::related -.-> Center
click Rel_superconducting_qubits "/terms/superconducting-qubits"
Rel_qubit["qubit"]:::related -.-> Center
click Rel_qubit "/terms/qubit"
classDef main fill:#7c3aed,stroke:#8b5cf6,stroke-width:2px,color:white,font-weight:bold,rx:5,ry:5;
classDef pre fill:#0f172a,stroke:#3b82f6,color:#94a3b8,rx:5,ry:5;
classDef child fill:#0f172a,stroke:#10b981,color:#94a3b8,rx:5,ry:5;
classDef related fill:#0f172a,stroke:#8b5cf6,stroke-dasharray: 5 5,color:#94a3b8,rx:5,ry:5;
linkStyle default stroke:#4b5563,stroke-width:2px;
🧠 Knowledge Check
🧒 Explain Like I'm 5
🚀 Imagina que quieres encontrar el camino más corto en un laberinto. La computación cuántica adiabática es como empezar con una pelota rodando suavemente en un túnel simple y, muy lentamente, vas doblando y modificando ese túnel hasta que se parezca al laberinto. La pelota, al moverse despacio, siempre se queda en la parte más baja del túnel, que ahora te muestra el camino más corto.
🤓 Expert Deep Dive
Adiabatic quantum computation (AQC) is a paradigm for solving computational problems by leveraging the adiabatic theorem of quantum mechanics. The process begins with a system initialized in the ground state of a simple, easily prepared Hamiltonian, $H_0$. This initial Hamiltonian is then slowly evolved over time into a final Hamiltonian, $H_f$, whose ground state encodes the solution to the problem of interest. The evolution is governed by a time-dependent Hamiltonian $H(t) = (1-s(t))H_0 + s(t)H_f$, where $s(t)$ is a parameter that increases from 0 to 1 over the computation time $T$. The adiabatic theorem states that if the evolution is sufficiently slow (i.e., $T$ is large enough, or the minimum energy gap between the ground state and the first excited state throughout the evolution is not too small), the system will remain in its instantaneous ground state. Therefore, if $H_f$ is designed such that its ground state corresponds to the solution of a computational problem (e.g., the minimum of an energy landscape for optimization problems), AQC can find that solution. This approach is closely related to the quantum annealing process, often implemented on specialized hardware like D-Wave's quantum annealers, but AQC is a more general theoretical framework that can be applied to a broader class of problems beyond those directly mappable to Ising models.