Access the full text.
Sign up today, get DeepDyve free for 14 days.
L. Vandersypen, M. Steffen, M. Sherwood, C. Yannoni, G. Breyta, I. State, P. Laboratory, Stanford Center (1999)
Implementation of a three-quantum-bit search algorithmApplied Physics Letters, 76
J. Roland, N. Cerf (2001)
Quantum search by local adiabatic evolutionPhysical Review A, 65
Lov Grover (1996)
A fast quantum mechanical algorithm for database search
Charles Bennett, Ethan Bernstein, G. Brassard, U. Vazirani (1997)
Strengths and Weaknesses of Quantum ComputingSIAM J. Comput., 26
E. Farhi, S. Gutmann (1996)
Analog analogue of a digital quantum computationPhysical Review A, 57
X. Peng, Xi-wen Zhu, X. Fang, M. Feng, Maili Liu, K. Gao (2001)
Experimental implementation of Hogg's algorithm on a three-quantum-bit NMR quantum computerPhysical Review A, 65
D. Aharonov, W. Dam, J. Kempe, Zeph Landau, S. Lloyd, O. Regev (2004)
Adiabatic quantum computation is equivalent to standard quantum computation45th Annual IEEE Symposium on Foundations of Computer Science
Michel Boyer, G. Brassard, P. Hoeyer, A. Tapp (1996)
Tight bounds on quantum searchingProtein Science, 46
Richard Anderson, H. Woll (1997)
Algorithms for the Certified Write-All ProblemSIAM J. Comput., 26
J. Preskill (1997)
Quantum computing: pro and conProceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, 454
A. Romanelli, A. Auyuanet, R. Donangelo (2005)
Quantum search with resonancesPhysica A-statistical Mechanics and Its Applications, 360
J. Sakurai, S. Tuan, R. Newton (1986)
Modern Quantum Mechanics
W. Dam, M. Mosca, U. Vazirani (2001)
How powerful is adiabatic quantum computation?Proceedings 2001 IEEE International Conference on Cluster Computing
M. Steffen, W. Dam, T. Hogg, G. Breyta, I. Chuang (2003)
Experimental implementation of an adiabatic quantum optimization algorithm.Physical review letters, 90 6
E. Farhi, J. Goldstone, S. Gutmann, M. Sipser (2000)
Quantum Computation by Adiabatic EvolutionarXiv: Quantum Physics
Perturbation theory in quantum mechanics studies how quantum systems interact with their environmental perturbations. Harmonic perturbation is a rare special case of time-dependent perturbations in which exact analysis exists. Some important technology advances, such as masers, lasers, nuclear magnetic resonance, etc., originated from it. Here we add quantum computation to this list with a theoretical demonstration. Based on harmonic perturbation, a quantum mechanical algorithm is devised to search the ground state of a given Hamiltonian. The intrinsic complexity of the algorithm is continuous and parametric in both time T and energy E. More precisely, the probability of locating a search target of a Hamiltonian in N-dimensional vector space is shown to be 1/(1 + c N E−2T−2) for some constant c. This result is optimal. As harmonic perturbation provides a different computation mechanism, the algorithm may suggest new directions in realizing quantum computers.
Quantum Information Processing – Springer Journals
Published: Sep 21, 2007
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.