Skip to main content
SpringerLink
Log in

Exact Quantum Query Complexity of \(\text {EXACT}_{k,l}^n\)

  • Conference paper
  • First Online:
SOFSEM 2017: Theory and Practice of Computer Science (SOFSEM 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10139))

Abstract

In the exact quantum query model a successful algorithm must always output the correct function value. We investigate the function that is true if exactly k or l of the n input bits given by an oracle are 1. We find an optimal algorithm (for some cases), and a nontrivial general lower and upper bound on the minimum number of queries to the black box.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Ambainis, A.: Superlinear advantage for exact quantum algorithms. In: Proceedings of the 45th Annual ACM Symposium on Theory of Computing, pp. 891–900. ACM (2013). http://dl.acm.org/citation.cfm?id=2488721

  2. Ambainis, A., Balodis, K., Belovs, A., Lee, T., Santha, M., Smotrovs, J.: Separations in query complexity based on pointer functions. In: Proceedings of the 48th Annual ACM Symposium on Theory of Computing, pp. 800–813. ACM (2016)

    Google Scholar 

  3. Ambainis, A., Iraids, J., Nagaj, D.: Exact quantum query complexity of \(\text{EXACT}_{k,l}^n\). arXiv preprint abs/1608.02374 (2016). http://arxiv.org/abs/1608.02374

  4. Ambainis, A., Iraids, J., Smotrovs, J.: Exact quantum query complexity of EXACT and THRESHOLD. In: TQC, pp. 263–269 (2013)

    Google Scholar 

  5. Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by polynomials. J. ACM 48(4), 778–797 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  6. Brassard, G., Høyer, P.: An exact quantum polynomial-time algorithm for Simon’s problem. In: 1997 Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems, pp. 12–23, June 1997

    Google Scholar 

  7. Cleve, R., Ekert, A., Macchiavello, C., Mosca, M.: Quantum algorithms revisited. Proc. R. Soc. Lond. Ser. A Math. Phys. Eng. Sci. 454(1969), 339–354 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  8. Deutsch, D., Jozsa, R.: Rapid solution of problems by quantum computation. Proc. R. Soc. Lond. A Math. Phys. Eng. Sci. 439(1907), 553–558 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  9. Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: Limit on the speed of quantum computation in determining parity. Phys. Rev. Lett. 81, 5442–5444 (1998). doi:10.1103/PhysRevLett.81.5442

    Article  Google Scholar 

  10. von Zur Gathen, J., Roche, J.R.: Polynomials with two values. Combinatorica 17(3), 345–362 (1997). doi:10.1007/BF01215917

    Article  MathSciNet  MATH  Google Scholar 

  11. Lee, T., Prakash, A., de Wolf, R., Yuen, H.: On the sum-of-squares degree of symmetric quadratic functions. In: Raz, R. (ed.) 31st Conference on Computational Complexity (CCC 2016), Leibniz International Proceedings in Informatics (LIPIcs), vol. 50, pp. 17:1–17:31. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2016). http://drops.dagstuhl.de/opus/volltexte/2016/5838

  12. Midrijānis, G.: Exact quantum query complexity for total boolean functions. arXiv preprint quant-ph/0403168 (2004). http://arxiv.org/abs/quant-ph/0403168

  13. Montanaro, A., Jozsa, R., Mitchison, G.: On exact quantum query complexity. Algorithmica 71(4), 775–796 (2015). doi:10.1007/s00453-013-9826-8

    Article  MathSciNet  MATH  Google Scholar 

  14. Qiu, D., Zheng, S.: Characterizations of symmetrically partial boolean functions with exact quantum query complexity. arXiv preprint abs/1603.06505 (2016). http://arxiv.org/abs/1603.06505

Download references

Acknowledgements

This research was supported by the ERC Advanced Grant MQC, Latvian State Research Programme NexIT Project No. 1, EU FP7 project QALGO, the People Programme (Marie Curie Actions) EU’s 7th Framework Programme under REA grant agreement No. 609427, Slovak Academy of Sciences, and the Slovak Research and Development Agency grant APVV-14-0878 QETWORK.

Author information

Authors and Affiliations

  1. Faculty of Computing, University of Latvia, Raiņa bulvāris 19, Riga, 1586, Latvia

    Andris Ambainis & Jānis Iraids

  2. Institute of Physics, Slovak Academy of Sciences, Dúbravská cesta 9, 845 11, Bratislava, Slovakia

    Daniel Nagaj

Authors
  1. Andris Ambainis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jānis Iraids
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Daniel Nagaj
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jānis Iraids .

Editor information

Editors and Affiliations

  1. TU Dortmund , Dortmund, Germany

    Bernhard Steffen

  2. TU Dresden , Dresden, Germany

    Christel Baier

  3. Eindhoven University of Technology , Eindhoven, The Netherlands

    Mark van den Brand

  4. Alpen Adria University Klagenfurt , Klagenfurt, Austria

    Johann Eder

  5. Lero - Irish Software Research Center , Limerick, Ireland

    Mike Hinchey

  6. Lero - Irish Software Research Center , Limerick, Ireland

    Tiziana Margaria

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Ambainis, A., Iraids, J., Nagaj, D. (2017). Exact Quantum Query Complexity of \(\text {EXACT}_{k,l}^n\) . In: Steffen, B., Baier, C., van den Brand, M., Eder, J., Hinchey, M., Margaria, T. (eds) SOFSEM 2017: Theory and Practice of Computer Science. SOFSEM 2017. Lecture Notes in Computer Science(), vol 10139. Springer, Cham. https://doi.org/10.1007/978-3-319-51963-0_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-51963-0_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-51962-3

  • Online ISBN: 978-3-319-51963-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation