Access the full text.
Sign up today, get DeepDyve free for 14 days.
Apoorva Patel, A. Rahaman (2009)
Search on a Hypercubic Lattice using Quantum Random Walk
J. Böhm, M. Bellec, F. Mortessagne, U. Kuhl, S. Barkhofen, S. Gehler, H. Stöckmann, Iain Foulger, S. Gnutzmann, G. Tanner (2014)
Microwave experiments simulating quantum search and directed transport in artificial graphene.Physical review letters, 114 11
Andrew Childs, J. Goldstone (2003)
Spatial search by quantum walkPhysical Review A, 70
Lov Grover (1997)
Quantum Computers Can Search Rapidly by Using Almost Any TransformationPhysical Review Letters, 80
(1997)
Strengths andweaknesses of quantum computing
Avatar Tulsi (2008)
General framework for quantum search algorithmsPhysical Review A, 86
Apoorva Patel, K. Raghunathan, P. Rungta (2004)
Quantum random walks do not need a coin tossPhysical Review A, 71
Andrew Childs, J. Goldstone (2004)
Spatial search and the Dirac equationPhysical Review A, 70
P. Høyer (2000)
Arbitrary phases in quantum amplitude amplificationPhysical Review A, 62
Avatar Tulsi (2008)
Faster quantum-walk algorithm for the two-dimensional spatial searchPhysical Review A, 78
Iain Foulger, S. Gnutzmann, G. Tanner (2015)
Quantum walks and quantum search on graphene latticesPhysical Review A, 91
S. Aaronson, A. Ambainis (2003)
Quantum search of spatial regions44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
Avatar Tulsi (2015)
Faster quantum searching with almost any diffusion operatorPhysical Review A, 91
A. Ambainis, T. Wong (2015)
Correcting for potential barriers in quantum walk searchQuantum Inf. Comput., 15
J. Preskill (1997)
Reliable quantum computersProceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, 454
Avatar Tulsi (2015)
Postprocessing for speeding up general quantum search algorithmsPhysical Review A, 92
G. Brassard, P. Høyer, M. Mosca, A. Montreal, B. Aarhus, Cacr Waterloo (2000)
Quantum Amplitude Amplification and EstimationarXiv: Quantum Physics
Apoorva Patel, Md. Rahaman (2010)
Search on a Hypercubic Lattice using a Quantum Random Walk: I. d>2
G. Long, Yan Li, Wei Zhang, C. Tu (2000)
Dominant gate imperfection in Grover’s quantum search algorithmPhysical Review A, 61
A. Ambainis, A. Backurs, N. Nahimovs, Raitis Ozols, Alexander Rivosh (2011)
Search by Quantum Walks on Two-Dimensional Grid without Amplitude Amplification
Lov Grover (1997)
Quantum Mechanics Helps in Searching for a Needle in a HaystackPhysical Review Letters, 79
Matthew Falk (2013)
Quantum Search on the Spatial GridarXiv: Quantum Physics
A. Ambainis, J. Kempe, Alexander Rivosh (2004)
Coins make quantum walks faster
Yun Li, Lei Ma, Jie Zhou (2006)
Gate imperfection in the quantum random-walk search algorithmJournal of Physics A: Mathematical and General, 39
A. Ambainis, R. Portugal, Nikolay Nahimov (2013)
Spatial search on grids with minimum memoryQuantum Inf. Comput., 15
G. Long, Yan Li, Wei Zhang, Li Niu (1999)
Phase Matching in Quantum SearchingPhysics Letters A, 262
Andrew Childs, Y. Ge (2014)
Spatial search by continuous-time quantum walks on crystal latticesPhysical Review A, 89
Iain Foulger, S. Gnutzmann, G. Tanner (2013)
Quantum search on graphene lattices.Physical review letters, 112 7
Quantum spatial search has been widely studied with most of the study focusing on quantum walk algorithms. We show that quantum walk algorithms are extremely sensitive to systematic errors. We present a recursive algorithm which offers significant robustness to certain systematic errors. To search N items, our recursive algorithm can tolerate errors of size $$O(1{/}\sqrt{\ln N})$$ O ( 1 / ln N ) which is exponentially better than quantum walk algorithms for which tolerable error size is only $$O(\ln N{/}\sqrt{N})$$ O ( ln N / N ) . Also, our algorithm does not need any ancilla qubit. Thus our algorithm is much easier to implement experimentally compared to quantum walk algorithms.
Quantum Information Processing – Springer Journals
Published: Apr 25, 2016
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.