Skip to main content
SpringerLink
Log in

A fast quantum algorithm for the affine Boolean function identification

  • Regular Article
  • Published:
The European Physical Journal Plus Aims and scope Submit manuscript

Abstract

Bernstein-Vazirani algorithm (the one-query algorithm) can identify a completely specified linear Boolean function using a single query to the oracle with certainty. The first aim of the paper is to show that if the provided Boolean function is affine, then one more query to the oracle (the two-query algorithm) is required to identify the affinity of the function with certainty. The second aim of the paper is to show that if the provided Boolean function is incompletely defined, then the one-query and the two-query algorithms can be used as bounded-error quantum polynomial algorithms to identify certain classes of incompletely defined linear and affine Boolean functions respectively with probability of success at least 2/3.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. A. Ambainis, J. Comput. Syst. Sci. 64, 750 (2002).

    Article  MATH  MathSciNet  Google Scholar 

  2. S. Maitra, P. Sarkar, Theor. Comput. Sci. 276, 133 (2002).

    Article  MATH  MathSciNet  Google Scholar 

  3. S. Mister, C. Adams, in Workshop on Selected areas in Cryptography (1996).

  4. J. Seberry, X. Zhang, Australas. J. Combin. 9, 21 (1994).

    MATH  MathSciNet  Google Scholar 

  5. B.J. Falkowski, I. Schafer, M. Perkowski, IEEE TCAD 11, 1207 (1992).

    Google Scholar 

  6. P. Porwik, Fund. Inform. 77, 277 (2007).

    MATH  MathSciNet  Google Scholar 

  7. P. Porwik, Comput. Inform. 29, 1073 (2010).

    Google Scholar 

  8. E. Bernstein, U. Vazirani, in Proceedings 25th Annual ACM Symposium on Theory of Computing (ACM, 1993) pp. 11–20.

  9. D. Deutsch, R. Jozsa, Proc. R. Soc. London A 439, 553 (1992).

    Article  ADS  MATH  MathSciNet  Google Scholar 

  10. D.F. Floess, E. Andersson, M. Hillery, arXiv:1006.1423 [quant-ph] (2010).

  11. M. Hillery, E. Andersson, Phys. Rev. A 84, 062326 (2011).

    Article  ADS  Google Scholar 

  12. K. Chakraborty, S. Maitra, arXiv:1306.6195 [quant-ph] (2013).

  13. L.K. Grover, Phys. Rev. Lett. 79, 325 (1997).

    Article  ADS  Google Scholar 

  14. H. Li, L. Yang, arXiv:1404.0611 [quant-ph] (2013).

  15. D. Simon, SIAM J. Comput. 26, 1474 (1994).

    Article  Google Scholar 

  16. R. Cleve, A. Ekert, C. Macchiavello, M. Mosca, Proc. R. Soc. London A 454, 339 (1998).

    Article  ADS  MATH  MathSciNet  Google Scholar 

  17. A. Montanaro, Inform. Process Lett. 112, 438 (2012).

    Article  MATH  MathSciNet  Google Scholar 

  18. A. Younes, J. Miller, Int. J. Electron. 91, 431 (2004).

    Article  Google Scholar 

  19. A. Barenco, C.H. Bennett, R. Cleve, D.P. DiVincenzo, N. Margolus, P. Shor, T. Sleator, J.A. Smolin, H. Weinfurter, Phys. Rev. A 52, 3457 (1995).

    Article  ADS  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computer Science, Faculty of Science, Alexandria University, Alexandria, Egypt

    Ahmed Younes

  2. School of Computer Science, University of Birmingham, B15 2TT, Birmingham, UK

    Ahmed Younes

Authors
  1. Ahmed Younes
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ahmed Younes.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Younes, A. A fast quantum algorithm for the affine Boolean function identification. Eur. Phys. J. Plus 130, 34 (2015). https://doi.org/10.1140/epjp/i2015-15034-4

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1140/epjp/i2015-15034-4

Keywords

Search

Navigation