On Quantum Algorithms

Simple item page
dc.creatorCleve, R.
dc.creatorEkert, A.
dc.creatorHenderson, L.
dc.creatorMacchiavello, C.
dc.creatorMosca, M.
dc.date1999-03-17
dc.date.accessioned2026-07-07T06:16:18Z
dc.date.available2026-07-07T06:16:18Z
dc.descriptionQuantum computers use the quantum interference of different computational paths to enhance correct outcomes and suppress erroneous outcomes of computations. In effect, they follow the same logical paradigm as (multi-particle) interferometers. We show how most known quantum algorithms, including quantum algorithms for factorising and counting, may be cast in this manner. Quantum searching is described as inducing a desired relative phase between two eigenvectors to yield constructive interference on the sought elements and destructive interference on the remaining terms.
dc.description15 pages, 8 figures
dc.identifierhttps://arxiv.org/abs/quant-ph/9903061
dc.identifierhttp://arxiv.org/abs/quant-ph/9903061
dc.identifierComplexity 4 (1998) 33
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/94019
dc.subjectQuantum Physics
dc.titleOn Quantum Algorithms
dc.typetext

Files

Collections

arXiv