Quantum Annealing
Definition pending verification.
Quantum annealing is a metaheuristic optimization algorithm that leverages quantum mechanical effects, specifically quantum fluctuations and superposition, to find the global minimum of a given objective function. It is designed to solve complex combinatorial optimization problems, which are characterized by a vast number of possible solutions where finding the optimal one is computationally challenging for classical algorithms. The process begins by initializing a quantum system in a state of easy-to-prepare superposition, representing all possible solutions simultaneously. Then, a time-evolving Hamiltonian is applied, which gradually transforms the system's initial state into a final state whose ground state (lowest energy state) corresponds to the optimal solution of the problem. During this evolution, quantum tunneling allows the system to overcome energy barriers that might trap classical annealing algorithms in local minima. The 'annealing' aspect refers to the slow, gradual change in the system's parameters, analogous to the physical process of annealing in metallurgy where a material is heated and slowly cooled to reduce defects. While promising for certain classes of problems, quantum annealers are specialized hardware and their performance advantage over classical algorithms is still an active area of research and depends heavily on the specific problem structure.
graph LR
Center["Quantum Annealing"]:::main
Pre_computer_science["computer-science"]:::pre --> Center
click Pre_computer_science "/terms/computer-science"
Rel_antimatter_propulsion["antimatter-propulsion"]:::related -.-> Center
click Rel_antimatter_propulsion "/terms/antimatter-propulsion"
Rel_arpanet["arpanet"]:::related -.-> Center
click Rel_arpanet "/terms/arpanet"
Rel_artificial_consciousness["artificial-consciousness"]:::related -.-> Center
click Rel_artificial_consciousness "/terms/artificial-consciousness"
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;
🧒 Wyjaśnij jak 5-latkowi
Imagine trying to find the lowest point in a bumpy landscape. Quantum annealing is like letting a ball roll downhill, but it can also 'tunnel' through small hills instead of just getting stuck in the nearest dip, helping it find the very lowest valley.
🤓 Expert Deep Dive
Quantum annealing is a specialized computational paradigm designed to solve optimization problems, particularly those that can be mapped to finding the ground state of an Ising Hamiltonian. The process begins by preparing a system of qubits in a uniform superposition of all possible states, typically by applying a transverse magnetic field, $\Gamma(t) = -\sum_i \sigma_x^i$. This initial state represents an equal probability distribution across the solution space. The system then evolves under a time-dependent Hamiltonian, $H(t) = A(t)H_P + B(t)H_D$, where $H_P$ is the problem Hamiltonian encoding the optimization problem (e.g., QUBO matrix), and $H_D$ is the driver Hamiltonian (often the transverse field). The annealing schedule involves gradually decreasing the strength of the driver Hamiltonian $A(t)$ while simultaneously increasing the strength of the problem Hamiltonian $B(t)$, such that $A(0) \gg B(0)$ and $A(T) \ll B(T)$ for a total annealing time $T$. According to the adiabatic theorem, if the evolution is slow enough (adiabatic), the system will remain in its instantaneous ground state. Thus, starting from the ground state of $H_D$ (a superposition), the system evolves towards the ground state of $H_P$, which corresponds to the optimal solution of the encoded problem. Quantum tunneling allows the system to overcome energy barriers that might trap classical annealing methods in local minima. The final state of the qubits, read out at time $T$, is then interpreted as the solution to the optimization problem. For a QUBO problem represented by $H_P = \sum_{i