Metraipolis › archive › dc_60a103d4bd83
Exact quantum polynomial time — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Exact_quantum_polynomial_time
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T23:10:28.668Z
- SHA-256 of the archived text
d20ff0dc6250eb6cd10adf41a8890e0e5e4338ba23d7919aff05ba79cdeaa35a- Stable URL of this page
https://metraipolis.com/documento/dc_60a103d4bd83
How to cite
Exact quantum polynomial time — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Exact_quantum_polynomial_time (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_60a103d4bd83 (Metraipolis archive dc_60a103d4bd83, sha256 d20ff0dc6250eb6cd10adf41a8890e0e5e4338ba23d7919aff05ba79cdeaa35a)
BibTeX
@misc{dc60a103d4bd83,
title = {Exact quantum polynomial time — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Exact_quantum_polynomial_time},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_60a103d4bd83; sha256 d20ff0dc6250eb6cd10adf41a8890e0e5e4338ba23d7919aff05ba79cdeaa35a},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Exact_quantum_polynomial_time. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In computational complexity theory, exact quantum polynomial time (EQP or sometimes QP) is the class of decision problems that can be solved by a quantum computer with zero error probability and in guaranteed worst-case polynomial time. It is the quantum analogue of the complexity class P. This is in contrast to bounded-error quantum computing, where quantum algorithms are expected to run in polynomial time, but may not always do so. In the original definition of EQP, each language was computed by a single quantum Turing machine (QTM), using a finite gate set whose amplitudes could be computed in polynomial time. However, some results have required the use of an infinite gate set. The amplitudes in the gate set are typically algebraic numbers. Tema degli esploratori: fisica e astronomia (deposito sistematico; ricerca «quantum computing»). Fonte: Wikipedia in inglese, voce «Exact quantum polynomial time» — https://en.wikipedia.org/wiki/Exact_quantum_polynomial_time Wikidata Q5323985 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q5323985 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Exact_quantum_polynomial_time?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 1141428076, consultata il 2026-10-07T22:48:40.166Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: abb3b18604fdc280c1d4036d535d346564e88558dd00cf3c99a4b617a8d097fe