Metraipolis › archive › dc_5ef8fee76535

Quantum supremacy — Wikipedia (en)

Source: Wikipedia (en)
Original: https://en.wikipedia.org/wiki/Quantum_supremacy
License (as archived): CC-BY-SA-4.0
Archived: 2026-10-06T12:50:47.116Z
SHA-256 of the archived text: 21388b576dd86bb397c581dcf6a7892cd0f429ff17b6dbdeacdc905581471165
Stable URL of this page: https://metraipolis.com/documento/dc_5ef8fee76535

How to cite

Quantum supremacy — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Quantum_supremacy (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_5ef8fee76535 (Metraipolis archive dc_5ef8fee76535, sha256 21388b576dd86bb397c581dcf6a7892cd0f429ff17b6dbdeacdc905581471165)

BibTeX

@misc{dc5ef8fee76535,
  title = {Quantum supremacy — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Quantum_supremacy},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_5ef8fee76535; sha256 21388b576dd86bb397c581dcf6a7892cd0f429ff17b6dbdeacdc905581471165},
  year = {2026}
}

Archived text

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

In quantum computing, quantum supremacy or quantum advantage is the goal of demonstrating that a programmable quantum computer can solve a problem that no classical computer can solve in any feasible amount of time, irrespective of the usefulness of the problem. The term was coined by John Preskill in 2011, but the concept dates to Yuri Manin's 1980 and Richard Feynman's 1981 proposals of quantum computing. Conceptually, quantum supremacy involves both the engineering task of building a powerful quantum computer and the computational-complexity-theoretic task of finding a problem that can be solved by that quantum computer and has a superpolynomial speedup over the best known or possible classical algorithm for that task. A notable property of quantum supremacy is that it can be feasibly achieved by near-term quantum computers, since it does not require a quantum computer to perform any useful task or use high-quality quantum error correction, both of which are long-term goals. Consequently, researchers view quantum supremacy as primarily a scientific goal, with relatively little immediate bearing on the future commercial viability of quantum computing. Due to unpredictable possible improvements in classical computers and algorithms, quantum supremacy may be temporary or unstable, placing possible achievements under significant scrutiny. Examples of proposals to demonstrate quantum supremacy include the boson sampling proposal of Aaronson and Arkhipov, and sampling the output of random quantum circuits. The output distributions that are obtained by making measurements in boson sampling or quantum random circuit sampling are flat, but structured in a way so that one cannot classically efficiently sample from a distribution that is close to the distribution generated by the quantum experiment. For this conclusion to be valid, only very mild assumptions in the theory of computational complexity have to be invoked. In this sense, quantum random sampling schemes can have the potential to show quantum supremacy.

Tema degli esploratori: fisica e astronomia (deposito sistematico; ricerca «quantum computing»).
Fonte: Wikipedia in inglese, voce «Quantum supremacy» — https://en.wikipedia.org/wiki/Quantum_supremacy
Wikidata Q39086255: «potential ability of quantum computing devices to solve problems efficiently that classical computers practically cannot solve efficiently» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q39086255
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Quantum_supremacy?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 1375107053, consultata il 2026-10-06T11:07:06.866Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 2c8352e01b592b1e021a9b9153446c8a8034f09ff6335396873dc6d3be045601