Skip to main content
SpringerLink
Log in

Exponential Separation of Quantum and Classical Online Space Complexity

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

Although quantum algorithms realizing an exponential time speed-up over the best known classical algorithms exist, no quantum algorithm is known performing computation using less space resources than classical algorithms. In this paper, we study, for the first time explicitly, space-bounded quantum algorithms for computational problems where the input is given not as a whole, but bit by bit. We show that there exist such problems that a quantum computer can solve using exponentially less work space than a classical computer. More precisely, we introduce a very natural and simple model of a space-bounded quantum online machine and prove an exponential separation of classical and quantum online space complexity, in the bounded-error setting and for a total language. The language we consider is inspired by a communication problem (the disjointness function) that Buhrman, Cleve and Wigderson used to show an almost quadratic separation of quantum and classical bounded-error communication complexity. We prove that, in the framework of online space complexity, the separation becomes exponential.

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.

Institutional subscriptions

Similar content being viewed by others

References

  1. Aaronson, S., Ambainis, A.: Quantum search of spatial regions. Theory Comput. 1, 47–79 (2005)

    Article  MathSciNet  Google Scholar 

  2. Ablayev, F.: Lower bounds for one-way probabilistic communication complexity and their application to space complexity. Theor. Comput. Sci. 157, 139–159 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  3. Aharonov, D., Kitaev, A., Nisan, N.: Quantum circuits with mixed states. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 20–30 (1998)

  4. Ambainis, A., Freivalds, R.: 1-way quantum finite automata: strengths, weaknesses and generalizations. In: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pp. 332–341 (1998)

  5. Balcázar, J.L., Diaz, J., Gabarró, J.: Structural Complexity I. Springer, Berlin (1995)

    Google Scholar 

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

    MATH  Google Scholar 

  7. Borodin, A., Cook, S., Pippenger, N.: Parallel computation for well-endowed rings and space-bounded probabilistic machines. Inf. Control 58, 113–136 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  8. Boyer, M., Brassard, G., Høyer, P., Tapp, A.: Tight bounds on quantum searching. Fortschr. Phys. 46(4–5), 493–505 (1998)

    Article  Google Scholar 

  9. Buhrman, H.: Quantum computing and communication complexity. Bull. EATCS 70, 131–141 (2000)

    MATH  MathSciNet  Google Scholar 

  10. Buhrman, H., Cleve, R., Watrous, J., de Wolf, R.: Quantum fingerprinting. Phys. Rev. Lett. 87(16), 167902 (2001)

    Article  Google Scholar 

  11. Buhrman, H., Cleve, R., Wigderson, A.: Quantum vs. classical communication and computation. In: Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pp. 63–68 (1998)

  12. Gavinsky, D., Kempe, J., Kerenidis, I., Raz, R., de Wolf, R.: Exponential separations for one-way quantum communication complexity, with applications to cryptography. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pp. 516–524 (2007)

  13. Grover, L.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp. 212–219 (1996)

  14. Høyer, P., de Wolf, R.: Improved quantum communication complexity bounds for disjointness and equality. In: Proceedings of the 19th International Symposium of Theoretical Aspects of Computer Science, pp. 299–310 (2002)

  15. Kalyanasundaram, B., Schnitger, G.: The probabilistic communication complexity of set intersection. SIAM J. Discret. Math. 5(4), 545–557 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  16. Klauck, H.: Quantum communication complexity. In: Proceedings of the Workshop on Boolean Functions and Applications at the 27th International Colloquium on Automata, Languages and Programming, pp. 241–252 (2000)

  17. Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)

    MATH  Google Scholar 

  18. Le Gall, F.: Quantum weakly nondeterministic communication complexity. In: Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science, pp. 658–669 (2006)

  19. Muthukrishnan, S.: Data Streams: Algorithms and Applications. Now Publishers, Hanover (2005)

    MATH  Google Scholar 

  20. Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)

    MATH  Google Scholar 

  21. Razborov, A.: On the distributional complexity of disjointness. Theor. Comput. Sci. 106, 385–390 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  22. Razborov, A.: Quantum communication complexity of symmetric predicates. Izv. Math. 67(1), 145–159 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  23. Watrous, J.: Space-bounded quantum complexity. J. Comput. Syst. Sci. 59, 281–326 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  24. Watrous, J.: On the complexity of simulating space-bounded quantum computations. Comput. Complex. 12, 48–84 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  25. de Wolf, R.: Quantum communication and complexity. Theor. Comput. Sci. 287(1), 337–352 (2002)

    Article  MATH  Google Scholar 

  26. de Wolf, R.: Nondeterministic quantum query and communication complexity. SIAM J. Comput. 32(3), 681–699 (2003)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo, 113-0033, Japan

    François Le Gall

  2. ERATO-SORST Quantum Computation and Information Project, Japan Science and Technology Agency, 5-28-3 Hongo, Bunkyo-ku, Tokyo, 113-0033, Japan

    François Le Gall

Authors
  1. François Le Gall
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to François Le Gall.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Le Gall, F. Exponential Separation of Quantum and Classical Online Space Complexity. Theory Comput Syst 45, 188–202 (2009). https://doi.org/10.1007/s00224-007-9097-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-007-9097-3

Keywords

Search

Navigation