Metraipolis › archive › dc_b08a16dffaac

Quantum annealing — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Quantum_annealing
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T16:51:48.656Z
SHA-256 of the archived text
ba8d960dd0e186c4c47f2de4308d42bc56e4689c9b15712ba74efec5cceebe5a
Stable URL of this page
https://metraipolis.com/documento/dc_b08a16dffaac

How to cite

Quantum annealing — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Quantum_annealing (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_b08a16dffaac (Metraipolis archive dc_b08a16dffaac, sha256 ba8d960dd0e186c4c47f2de4308d42bc56e4689c9b15712ba74efec5cceebe5a)
BibTeX
@misc{dcb08a16dffaac,
  title = {Quantum annealing — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Quantum_annealing},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_b08a16dffaac; sha256 ba8d960dd0e186c4c47f2de4308d42bc56e4689c9b15712ba74efec5cceebe5a},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Quantum_annealing. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Quantum annealing (QA) is an optimization process for finding the global minimum of a given objective function over a given set of candidate solutions (candidate states), by a process using quantum fluctuations. Quantum annealing is used mainly for problems where the search space is discrete (combinatorial optimization problems) with many local minima, such as finding the ground state of a spin glass or solving QUBO problems, which can encode a wide range of problems like Max-Cut, graph coloring, SAT or the traveling salesman problem. The term "quantum annealing" was first proposed in 1988 by B. Apolloni, N. Cesa Bianchi and D. De Falco as a quantum-inspired classical algorithm. It was formulated in its present form by T. Kadowaki and H. Nishimori (ja) in 1998, though an imaginary-time variant without quantum coherence had been discussed by A. B. Finnila, M. A. Gomez, C. Sebenik and J. D. Doll in 1994. Quantum annealing starts from a quantum-mechanical superposition of all possible states (candidate states) with equal weights. Then the system evolves following the time-dependent Schrödinger equation, a natural quantum-mechanical evolution of physical systems. The amplitudes of all candidate states keep changing, realizing a quantum parallelism, according to the time-dependent strength of the transverse field, which causes quantum tunneling between states or essentially tunneling through peaks. If the rate of change of the transverse field is slow enough, the system stays close to the ground state of the instantaneous Hamiltonian (also see adiabatic quantum computation). If the rate of change of the transverse field is accelerated, the system may leave the ground state temporarily but produce a higher likelihood of concluding in the ground state of the final problem Hamiltonian, i.e., Diabatic quantum computation. The transverse field is finally switched off, and the system is expected to have reached the ground state of the classical Ising model of spin glass that corresponds to the solution to the original optimization problem. A foundational study of the transverse Ising spin glass model was made by B. K. Chakrabarti in 1981. An experimental demonstration of the success of quantum annealing for random magnets was reported immediately after the initial theoretical proposal. Quantum annealing has also been proven to provide a fast Grover oracle for the square-root speedup in solving many NP-complete problems.

Tema degli esploratori: fisica e astronomia (deposito sistematico; ricerca «quantum computing»).
Fonte: Wikipedia in inglese, voce «Quantum annealing» — https://en.wikipedia.org/wiki/Quantum_annealing
Wikidata Q938141 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q938141
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Quantum_annealing?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1375118778, consultata il 2026-10-07T16:20:00.433Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: c72eead52b48940d82225ee3b2bd5020f4011f61e760876a7ec85085336890af