A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors

Simple item page
dc.creatorAbrams, Daniel S.
dc.creatorLloyd, Seth
dc.date1998-07-24
dc.date.accessioned2026-07-07T12:33:25Z
dc.date.available2026-07-07T12:33:25Z
dc.descriptionWe describe a new polynomial time quantum algorithm that uses the quantum fast fourier transform to find eigenvalues and eigenvectors of a Hamiltonian operator, and that can be applied in cases (commonly found in ab initio physics and chemistry problems) for which all known classical algorithms require exponential time. Applications of the algorithm to specific problems are considered, and we find that classically intractable and interesting problems from atomic physics may be solved with between 50 and 100 quantum bits.
dc.description10 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/9807070
dc.identifierhttp://arxiv.org/abs/quant-ph/9807070
dc.identifierPhys.Rev.Lett.83:5162-5165,1999
dc.identifierdoi:10.1103/PhysRevLett.83.5162
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/217120
dc.subjectQuantum Physics
dc.titleA quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
dc.typetext

Files

Collections

arXiv