Quantum Algorithms
| dc.creator | Mosca, Michele | |
| dc.date | 2008-08-04 | |
| dc.date.accessioned | 2026-07-07T09:54:31Z | |
| dc.date.available | 2026-07-07T09:54:31Z | |
| dc.description | This article surveys the state of the art in quantum computer algorithms, including both black-box and non-black-box results. It is infeasible to detail all the known quantum algorithms, so a representative sample is given. This includes a summary of the early quantum algorithms, a description of the Abelian Hidden Subgroup algorithms (including Shor's factoring and discrete logarithm algorithms), quantum searching and amplitude amplification, quantum algorithms for simulating quantum mechanical systems, several non-trivial generalizations of the Abelian Hidden Subgroup Problem (and related techniques), the quantum walk paradigm for quantum algorithms, the paradigm of adiabatic algorithms, a family of ``topological'' algorithms, and algorithms for quantum tasks which cannot be done by a classical computer, followed by a discussion. | |
| dc.description | 71 pages, 1 figure, to appear in the Springer Encyclopedia of Complexity and Systems Science | |
| dc.identifier | https://arxiv.org/abs/0808.0369 | |
| dc.identifier | http://arxiv.org/abs/0808.0369 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/166341 | |
| dc.subject | Quantum Physics | |
| dc.title | Quantum Algorithms | |
| dc.type | text |