Overview
Direct Answer
Adiabatic quantum computing is a quantum computation paradigm that solves optimisation problems by gradually transforming a simple initial quantum state into one encoding the solution, leveraging the adiabatic theorem to maintain the system in its ground state throughout the evolution.
How It Works
The process begins with a Hamiltonian whose ground state is easy to prepare, then slowly adjusts system parameters according to a time-dependent schedule to morph this into a problem Hamiltonian whose ground state encodes the optimal solution. If the evolution is sufficiently slow—respecting the adiabatic condition—the quantum system remains in the ground state, and measurement yields the answer. Energy gaps between ground and excited states determine the minimum evolution time required.
Why It Matters
Organisations pursuing quantum advantage in combinatorial optimisation and constraint satisfaction problems find this approach compelling because it naturally avoids certain error modes associated with gate-based quantum circuits. The paradigm offers potential advantage on specific problem classes where classical heuristics plateau, particularly in logistics, finance, and materials science.
Common Applications
Applications include portfolio optimisation, vehicle routing, graph colouring, and protein folding simulation. Industrial sectors investigating this approach span financial services optimisation, supply chain logistics, and pharmaceutical drug discovery.
Key Considerations
Success depends critically on problem-specific tuning of the annealing schedule and susceptibility to spectral gap closing near the solution point, which can necessitate exponentially long evolution times. Current systems remain limited to moderate problem sizes and require careful mapping of classical problems to quantum Hamiltonian form.
Cross-References(1)
More in Quantum Computing
Quantum Approximate Optimisation Algorithm
Hardware & ImplementationA hybrid algorithm designed to solve combinatorial optimisation problems on near-term quantum hardware.
Quantum Annealing
AlgorithmsA quantum computing approach that finds the lowest energy state of a system, useful for optimisation problems.
Quantum Compiler
AlgorithmsSoftware that translates high-level quantum algorithms into sequences of quantum gates executable on specific hardware.
Trapped Ion Qubit
Hardware & ImplementationA qubit implementation using individual ions confined by electromagnetic fields and manipulated by laser beams.
Photonic Quantum Computing
FundamentalsQuantum computing using photons as qubits, manipulated through optical components.
Quantum Operating System
FundamentalsSystem software designed to manage quantum computing resources, schedule operations, and handle error correction.
Bloch Sphere
FundamentalsA geometrical representation of the state space of a single qubit as a point on the surface of a sphere.
Quantum Interference
AlgorithmsThe phenomenon where quantum probability amplitudes combine, allowing quantum algorithms to amplify correct answers and cancel wrong ones.