- Physical Review Journals
All JournalsPhysics Magazine

Physical Review Research

Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Letter
  • Open Access

Deterministic Grover search with a restricted oracle

Tanay Roy1,*, Liang Jiang2, and David I. Schuster1

  • 1Department of Physics, James Franck Institute, University of Chicago, Chicago, Illinois 60637, USA
  • 2Pritzker School of Molecular Engineering, University of Chicago, Chicago, Illinois 60637, USA

  • *Corresponding author: roytanay@uchicago.edu
PDF

Phys. Rev. Research 4, L022013 – Published 21 April, 2022Erratum Phys. Rev. Research 5, 029002 (2023)

DOI: https://doi.org/10.1103/PhysRevResearch.4.L022013

Abstract

Grover's quantum search algorithm provides a quadratic quantum advantage over classical algorithms across a broad class of unstructured search problems. The original protocol is probabilistic, returning the desired result with significant probability on each query but, in general, requiring several iterations of the algorithm. We present a modified version to return the correct result with certainty without having user control over the quantum search oracle. Our deterministic, two-parameter “D2p” protocol utilizes generalized phase rotations replacing the phase inversions after a standard oracle query. The D2p protocol achieves a 100% success rate in no more than one additional iteration compared to the optimal number of steps as in the original Grover's search enabling the same quadratic speedup. We also provide a visualization using the Bloch sphere for enhanced geometric intuition.

View figure in article

Physics Subject Headings (PhySH)

Erratum

Erratum: Deterministic Grover search with a restricted oracle [Phys. Rev. Research 4, L022013 (2022)]

Tanay Roy, Liang Jiang, and David I. Schuster
Phys. Rev. Research 5, 029002 (2023)

Article Text

References (20)

  1. L. K. Grover, Quantum Mechanics Helps in Searching for a Needle in a Haystack, Phys. Rev. Lett. 79, 325 (1997).
  2. V. Giovannetti, S. Lloyd, and L. Maccone, Quantum Random Access Memory, Phys. Rev. Lett. 100, 160501 (2008).
  3. V. Giovannetti, S. Lloyd, and L. Maccone, Architectures for a quantum random access memory, Phys. Rev. A 78, 052310 (2008).
  4. A. Galindo and M. A. Martín-Delgado, Family of grover's quantum-searching algorithms, Phys. Rev. A 62, 062303 (2000).
  5. G. L. Long, Grover algorithm with zero theoretical failure rate, Phys. Rev. A 64, 022307 (2001).
  6. F. Toyama, W. van Dijk, and Y. Nogami, Quantum search with certainty based on modified grover algorithms: optimum choice of parameters, Quant. Inf. Process. 12, 1897 (2013).
  7. F. M. Toyama, W. van Dijk, Y. Nogami, M. Tabuchi, and Y. Kimura, Multiphase matching in the grover algorithm, Phys. Rev. A 77, 042324 (2008).
  8. T. J. Yoder, G. H. Low, and I. L. Chuang, Fixed-Point Quantum search With an Optimal Number of Queries, Phys. Rev. Lett. 113, 210501 (2014).
  9. P. Li and S. Li, Phase matching in grover's algorithm, Phys. Lett. A 366, 42 (2007).
  10. G. Brassard and P. Hoyer, An exact quantum polynomial-time algorithm for Simon's problem, in Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems (IEEE, Piscataway, NJ, 1997), pp. 12–23.
  11. L. K. Grover, Quantum Computers can Search Rapidly by using Almost Any Transformation, Phys. Rev. Lett. 80, 4329 (1998).
  12. G. Brassard, P. Hoyer, M. Mosca, and A. Tapp, Quantum amplitude amplification and estimation, Contemp. Math. 305, 53 (2002).
  13. A. Ambainis, Quantum search algorithms, ACM SIGACT News 35, 22 (2004).
  14. M. Saeedi and M. Pedram, Linear-depth quantum circuits for n-qubit toffoli gates with no ancilla, Phys. Rev. A 87, 062318 (2013).
  15. H. Kwon and J. Bae, Quantum amplitude-amplification operators, Phys. Rev. A 104, 062438 (2021).
  16. H. Buhrman, C. Durr, M. Heiligman, P. Hoyer, F. Magniez, M. Santha, and R. De Wolf, Quantum algorithms for element distinctness, in Proceedings 16th Annual IEEE Conference on Computational Complexity (IEEE, Piscataway, NJ, 2001), pp. 131–137.
  17. A. Ambainis, Quantum walk algorithm for element distinctness, SIAM J. Comput. 37, 210 (2007).
  18. C. Durr and P. Hoyer, A quantum algorithm for finding the minimum, arXiv:quant-ph/9607014.
  19. S. Aaronson, Lower bounds for local search by quantum arguments, SIAM J. Comput. 35, 804 (2006).
  20. G. Brassard, P. Hoyer, and A. Tapp, Quantum algorithm for the collision problem, in LATIN'98: Theoretical Informatics. LATIN 1998, edited by C. L. Lucchesi and A. V. Moura, Lecture Notes in Computer Science Vol. 1380 (Springer, Berlin/Heidelberg, 2006).

Outline

Information

Phys. Rev. Research 4, L022013– Published 21 April, 2022
  • Received 12 January 2022
  • Accepted 21 March 2022
Crossmark - Check for updates button
Creative Commons Logo

Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.

Published by the American Physical Society

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation