Abstract
We present a general quantum deletion algorithm that deletes M marked states from an N-item quantum database with arbitrary initial distribution. The general behavior of this algorithm is analyzed, and analytic result is given. When the number of marked states is no more than \(\tfrac{{3N}} {4}\), this algorithm requires just a single query, and this achieves exponential speedup over classical algorithm.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Deutsch D, Josza R. Rapid solution of problems by quantum computation. Proc Royal Soc London A, 1992, 439: 553–558
Shor P. Algorithms for quantum computation: Discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on the Foundations of Computer Science, 1994. 124–134
Grover L K. A fast quantum mechanical algorithm for database search. In: Proceedings of the Symposium on the Foundations of Computer Science, 1996. 212–219
Bennett C H, Bernstein E, Vazirani U, et al. Strengths and weakesses of quantum computing. SIAM J Comput, 1997, 26: 1510–1523
Simon D. On the power of quantum computation. In: Proceedings of 35th Annual Symposium on Foundations of Computer Science, 1994. 116–123
Fu X Q, Bao W S, Zhou C, et al. t-Bit semiclassical quantum Fourier transform. Chin Sci Bull, 2012, 57: 119–124
Wang X, Bao WS, Fu X Q. A quantum algorithm for searching a target solution of fixed weight. Chin Sci Bull, 2011, 56: 484–488
Fu X Q, Bao W S, Zhou C. Speeding up implementation for Shor’s factorization quantum algorithm. Chin Sci Bull, 2010, 55: 3648–3653
Zhong P C, Bao W S. Quantum mechanical meet-in-the-middle search algorithm for triple-DES. Chin Sci Bull, 2010, 55: 321–325
Hao L, Li J L, Long G L. Eavesdropping in a quantum secret sharing protocol based on Grover algorithm and its solution. Sci China Phys Mech Astron, 2010, 53: 491–495
Hao L, Liu D, Long G L. An N/4 fixed-point duality quantum search algorithm. Sci China Phys Mech Astron, 2010, 53: 1765–1768
Hao L, Long G L. Experimental implementation of a fixed-point duality quantum search algorithm in the nuclear magnetic resonance quantum system. Sci China Phys Mech Astron, 2011, 54: 936–941
Page L, Brin S, Motwani R, et al. The pagerank citation ranking: Bringing order to the web. Technical Report. Stanford Digital Libraries, 1998
Brin S, Page L. The anatomy of a large-scale hypertextual Web search engine. Comput Networks ISDN Syst, 1998, 30: 107–117
Freadman M L, Tarjan R E. Fibonacci heaps and their uses in improved network optimization algorithms. J Assoc Comput Mach, 1987, 34: 596–615
Abuaiadh D, Kingston J H. Are Fibonacci heaps optimal? In: Proceedings of Algorithms and Computation 5th International Symposium, 1994. 442–450
Liu Y, Long G L. Deleting a marked basis-state from an even superposition of all basis-states with a single query. Int J Quant Inform, 2009, 7: 567–572
Long G L, Sun Y. Efficient scheme for initializing a quantum register with an arbitrary superposed state. Phys Rev A, 2001, 64: 014303
Long G L, Zhang W L, Li Y S, et al. Arbitrary phase rotation of the marked state can not be used for Grover’s quantum search algorithm. Commun Theor Phys, 1999, 32: 335–338
Long G L, Li Y S, Zhang WL, et al. Phase matching in quantum searching. Phys Lett A, 1999, 262: 27–34
Long G L, Xiao L, Sun Y. Phase matching condition for quantum search with a generalized quantum database. Phys Lett A, 2002, 294: 143–152
Long G L. Grover algorithm with zero theoretical rate. Phys Rev A, 2001, 64: 022301
Long G L, Tu C C, Li Y S, et al. An SO(3) picture for quantum searching. J Phys A, 2001, 34: 861–866
Long G L, Liu Y. Search an unsorted database with quantum mechanics. Front Comput Sci China, 2007, 1: 247–271
Boyer M, Brassard G, Hoyer P, et al. Tight bounds on quantum searching. In: Proceedings of the 4th Workshop on Physics and Computation, 1996. 36–43
Author information
Authors and Affiliations
Corresponding author
Additional information
This article is published with open access at Springerlink.com
Rights and permissions
This article is published under an open access license. Please check the 'Copyright Information' section either on this page or in the PDF for details of this license and what re-use is permitted. If your intended use exceeds what is permitted by the license or if you are unable to locate the licence and re-use information, please contact the Rights and Permissions team.
About this article
Cite this article
Liu, Y., Ouyang, X. A quantum algorithm that deletes marked states from an arbitrary database. Chin. Sci. Bull. 58, 2329–2333 (2013). https://doi.org/10.1007/s11434-013-5885-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11434-013-5885-0