Exponential separation of quantum and classical online space complexity

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn 2006, Issue , 2006, Pages 67-73

  Le Gall, François ^a,b  

^a JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

^b UNIVERSITY OF TOKYO   (Japan)

Author keywords

Communication Complexity; Online Space Complexity; Quantum Computation; Streaming Algorithms

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ONLINE SYSTEMS; PROBLEM SOLVING;

COMMUNICATION COMPLEXITY; ONLINE SPACE COMPLEXITY; QUANTUM COMPUTATION; STREAMING ALGORITHMS;

QUANTUM THEORY;

EID: 33749549986     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1148109.1148119     Document Type: Conference Paper

References (24)

1. S. Aaronson and A. Ambainis. Quantum search of spatial regions. Theory of Computing, 1:47-79, 2005.
2. F. Ablayev. Lower bounds for one-way probabilistic communication complexity and their application to space complexity. Theoretical Computer Science, 157:139-159, 1996.
3. D. Aharonov, A. Kitaev, and N. Nisan. Quantum circuits with mixed states. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 20-30, 1998.
4. J. L. Balcázar, J. Diaz, and J. Gabarró. Structural Complexity I. Springer-Verlag, 1995.
5. Z. Bar-Yossef, T. S. Jayram, and I. Kerenidis. Exponential separation of quantum and classical one-way communication complexity. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pages 128-137, 2004.
6. R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf. Quantum lower bounds by polynomials. Journal of the ACM, 48(4):778-797, 2001.
7. A. Borodin. S. Cook, and N. Pippenger. Parallel computation for well-endowed rings and space-bounded probabilistic machines. Information and Control, 58:113-136, 1983.
8. M. Boyer. G. Brassard, P. Høyer, and A. Tapp. Tight bounds on quantum searching. Fortschritte der Physik, 46(4-5) :493-505, 1998.
9. H. Buhrman, R. Cleve, and A. Wigderson. Quantum vs. classical communication and computation. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 63-68, 1998.
10. H. Buhrman. Quantum computing and communication complexity. Bulletin of the EATCS, 70:131-141, 2000.
11. L. Grover. A fast quantum mechanical algorithm for database search. In Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pages 212-219, 1996.
12. P. Høyer and R. de Wolf. Improved quantum communication complexity bounds for disjointness and equality. In Proceedings of the 19th International Symposium of Theoretical Aspects of Computer Science, pages 299-310, 2002.
13. B. Kalyanasundaram and G. Schnitger. The probabilistic communication complexity of set intersection. SIAM Journal on Discrete Mathematics, 5(4):545-557, 1992.
14. H. Klauck. Quantum communication complexity. In Proceedings of the Workshop on Boolean Functions and Applications at the 27th International Colloquium on Automata, Languages and Programming, pages 241-252, 2000.
15. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997.
16. F. Le Gall. Quantum weakly nondeterministic communication complexity. In Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science, to appear, 2006. Preprint version: Los Alamos e-print archive, quant-ph/0511025.
17. S. Muthukrishnan. Data Streams: Algorithms and Applications. Now Publishers, 2005.
18. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
19. A. Razborov. On the distributional complexity of disjointness. Theoretical Computer Science, 106:385-390, 1992.
20. A. Razborov. Quantum communication complexity of symmetric predicates. Izvestiya Mathematics, 67(1):145-159, 2003.
21. J. Watrous. Space-bounded quantum complexity. Journal of Computer and System Sciences, 59:281-326, 1999.
22. J. Watrous. On the complexity of simulating space-bounded quantum computations. Computational Complexity, 12:48-84, 2003.
23. R. de Wolf. Quantum communication and complexity. Theoretical Computer Science, 287(1):337-352, 2002.
24. R. de Wolf. Nondeterministic quantum query and communication complexity. SIAM Journal on Computing, 32(3):681-699, 2003.