Skip to main content
Springer Nature Link
Log in

Sure Success Partial Search

  • Published:
Quantum Information Processing Aims and scope Submit manuscript

Partial search has been proposed recently for finding the target block containing a target element with fewer queries than the full Grover search algorithm which can locate the target precisely. Since such partial searches will likely be used as subroutines for larger algorithms their success rate is important. We propose a partial search algorithm which achieves success with unit probability.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Deutsch D. (1985). Proc. Roy. Soc. Lond. Ser. A 400(1818):97–117

    Article  MATH  ADS  MathSciNet  Google Scholar 

  2. Deutsch D., Jozsa R. (1992). Proc. Roy. Soc. Lond. Ser. A 439(1907):553–558

    Article  MATH  ADS  MathSciNet  Google Scholar 

  3. Shor P.W. (1997). SIAM J. on Comput 26(5):1484–1509

    Article  MATH  MathSciNet  Google Scholar 

  4. L. Grover, in Proceedings of 28th Annual Symposium on the Theory of Computing (STOC), (Philadelphia, Pennsylvania, USA, 1996), pp. 212–219, quant-ph/9605043.

  5. Korepin V.E., Grover L.K. (2006). Quantum Inform. Process 5(1):3 quant-ph/0504157.

    Article  MathSciNet  Google Scholar 

  6. L. K. Grover and J. Radhakrishnan, in Proceedings of the 17th annual ACM Symposium on Parallelism in Algorithms and Architectures, (SPAA), (Las Vegas, Nevada, USA, 2005), pp. 186–194, quant-ph/0407122.

  7. Korepin V.E. (2005). J. Phys. A Math. Gen 38:L731–758

    Article  MATH  ADS  MathSciNet  Google Scholar 

  8. Korepin V.E., Liao J. (2006). Quantum Inform. Process 5(3):209 quant-ph/0510179.

    Article  MATH  MathSciNet  Google Scholar 

  9. P. Høyer, Phys. Rev. A 62, 052304 (2000).

    Google Scholar 

  10. Sun Y., Long G.-L., Li X. (2002). Phys. Let. A 294:143

    Article  MATH  ADS  MathSciNet  Google Scholar 

  11. G. Brassard, P. Høyer, M. Mosca, and A. Tapp, quant-ph/0005055, May 2000. in Quantum Computation and Information, Contemporary Mathematics Series Millenium Volume, ed. S. J. Lomonaco (AMS, providence, RI, 2002), Vol. 305, pp. 53–74 (2002).

  12. S. L. Braunstein, B.-S. Choi, S. Maitra, D. Chakrabarti, S. Ghosh, and P. Mukhopadhyay, quant-ph/0410043.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of York, York, Y010 5DD, UK

    Byung-Soo Choi, Thomas A. Walker & Samuel L. Braunstein

Authors
  1. Byung-Soo Choi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas A. Walker
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Samuel L. Braunstein
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Byung-Soo Choi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Choi, BS., Walker, T.A. & Braunstein, S.L. Sure Success Partial Search. Quantum Inf Process 6, 1–8 (2007). https://doi.org/10.1007/s11128-006-0037-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11128-006-0037-y

Keywords

Pacs

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy