arXiv Analytics

Sign in

arXiv:1110.4276 [quant-ph]AbstractReferencesReviewsResources

Calculating Unknown Eigenvalues with a Quantum Algorithm

Xiao-Qi Zhou, Pruet Kalasuwan, Timothy C. Ralph, Jeremy L. O'Brien

Published 2011-10-19Version 1

Quantum algorithms are able to solve particular problems exponentially faster than conventional algorithms, when implemented on a quantum computer. However, all demonstrations to date have required already knowing the answer to construct the algorithm. We have implemented the complete quantum phase estimation algorithm for a single qubit unitary in which the answer is calculated by the algorithm. We use a new approach to implementing the controlled-unitary operations that lie at the heart of the majority of quantum algorithms that is more efficient and does not require the eigenvalues of the unitary to be known. These results point the way to efficient quantum simulations and quantum metrology applications in the near term, and to factoring large numbers in the longer term. This approach is architecture independent and thus can be used in other physical implementations.

Related articles: Most relevant | Search more
arXiv:quant-ph/0004092 (Published 2000-04-24, updated 2000-05-03)
Quantum games and quantum algorithms
arXiv:quant-ph/0408013 (Published 2004-08-03, updated 2004-10-07)
A quantum algorithm for examining oracles
arXiv:0810.4968 [quant-ph] (Published 2008-10-28, updated 2009-03-25)
Quantum Algorithms Using the Curvelet Transform