Access the full text.
Sign up today, get DeepDyve free for 14 days.
J. Roland, N. Cerf (2001)
Quantum search by local adiabatic evolutionPhysical Review A, 65
E. Jonckheere, Farooq Ahmad, E. Gutkin (1998)
DIFFERENTIAL TOPOLOGY OF NUMERICAL RANGELinear Algebra and its Applications, 279
张映玉, 胡和平, 路松峰 (2011)
A quantum search algorithm based on partial adiabatic evolutionChinese Physics B, 20
E. Jonckheere, A. Rezakhani, Farooq Ahmad (2013)
Differential topology of adiabatically controlled quantum processesQuantum Information Processing, 12
B. Altshuler, H. Krovi, J. Roland (2009)
Adiabatic quantum optimization fails for random instances of NP-complete problemsArXiv, abs/0908.2782
J. Roland, N. Cerf (2003)
Quantum-circuit model of Hamiltonian search algorithmsPhysical Review A, 68
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
Andrew Childs, E. Farhi, J. Preskill (2001)
Robustness of adiabatic quantum computationPhysical Review A, 65
M. Sarandy, Daniel Lidar (2005)
Adiabatic quantum computation in open systems.Physical review letters, 95 25
Sun Jie, Lu Songfeng, Liu Fang, Y. Liping (2012)
Partial evolution based local adiabatic quantum searchChinese Physics B, 21
N. Dickson, M. Amin (2010)
Does adiabatic quantum optimization fail for NP-complete problems?Physical review letters, 106 5
M. Rao (2003)
Solving a hidden subgroup problem using the adiabatic quantum-computing paradigmPhysical Review A, 67
Jie Sun, Songfeng Lu, Fang Liu (2013)
Partial adiabatic quantum search algorithm and its extensionsQuantum Information Processing, 12
(2000)
Quantum computation by adiabatic evolution. arXiv:quant-ph/0001106
D Aharonov, WV Dam, J Kempe, Z Landau, S Lloyd, O Regev (2007)
Adiabatic quantum computation is equivalent to standard quantum computationSIAM J. Comput., 37
X. Peng, Zeyang Liao, Nanyang Xu, Gan Qin, Xianyi Zhou, D. Suter, Jiangfeng Du (2008)
Quantum adiabatic algorithm for factorization and its experimental implementation.Physical review letters, 101 22
Saurya Das, R. Kobes, G. Kunstatter (2001)
Adiabatic quantum computation and Deutsch's algorithmPhysical Review A, 65
E. Farhi, J. Goldstone, S. Gutmann, Joshua Lapan, A. Lundgren, Daniel Preda (2001)
A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete ProblemScience, 292
Lov Grover (1997)
Quantum Mechanics Helps in Searching for a Needle in a HaystackPhysical Review Letters, 79
(1999)
Quantum Mechanics. Chap. XVII
V. Choi (2010)
Different adiabatic quantum optimization algorithms for the NP-complete exact cover problemProceedings of the National Academy of Sciences, 108
B. Reichardt (2004)
The quantum adiabatic optimization algorithm and local minima
Daniel Lidar (2007)
Towards fault tolerant adiabatic quantum computation.Physical review letters, 100 16
Ari Mizel, Daniel Lidar, M. Mitchell (2006)
Simple proof of equivalence between adiabatic quantum computation and the circuit model.Physical review letters, 99 7
Yazhen Wang (2012)
Quantum Computation and Quantum InformationStatistical Science, 27
Avatar Tulsi (2008)
Adiabatic quantum computation with a one-dimensional projector HamiltonianPhysical Review A, 80
Haverford Scholarship, M. Amin, P. Love, P. Love, C. Truncik (2006)
Thermally assisted adiabatic quantum computation.Physical review letters, 100 6
W. Dam, M. Mosca, U. Vazirani (2001)
How powerful is adiabatic quantum computation?Proceedings 2001 IEEE International Conference on Cluster Computing
In this paper, we first uncover a fact that a partial adiabatic quantum search with $$O(\sqrt{N/M})$$ O ( N / M ) time complexity is in fact optimal, in which $$N$$ N is the total number of elements in an unstructured database, and $$M$$ M ( $$M\ge 1$$ M ≥ 1 ) of them are the marked ones(one) $$(N\gg M)$$ ( N ≫ M ) . We then discuss how to implement a partial adiabatic search algorithm on the quantum circuit model. From the implementing procedure on the circuit model, we can find out that the approximating steps needed are always in the same order of the time complexity of the adiabatic algorithm.
Quantum Information Processing – Springer Journals
Published: Jun 12, 2014
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.