Exponential separation of quantum and classical online space complexity
From MaRDI portal
Publication:733715
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 set intersection 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 719756 (Why is no real title available?)
- scientific article; zbMATH DE number 1512076 (Why is no real title available?)
- scientific article; zbMATH DE number 1775384 (Why is no real title available?)
- scientific article; zbMATH DE number 1775389 (Why is no real title available?)
- scientific article; zbMATH DE number 2086394 (Why is no real title available?)
- Communication Complexity
- Data streams: algorithms and applications.
- Exponential separations for one-way quantum communication complexity, with applications to cryptography
- Lower bounds for one-way probabilistic communication complexity and their application to space complexity
- Nondeterministic Quantum Query and Communication Complexities
- On quantum and probabilistic communication: Las Vegas and one-way protocols
- On the complexity of simulating space-bounded quantum computations
- On the distributional complexity of disjointness
- Parallel computation for well-endowed rings and space-bounded probabilistic machines
- Quantum Weakly Nondeterministic Communication Complexity
- Quantum communication and complexity.
- Quantum communication complexity of symmetric predicates
- Quantum lower bounds by polynomials
- Quantum search of spatial regions
- Space-bounded quantum complexity
- The Probabilistic Communication Complexity of Set Intersection
Cited in
(9)- Quantum online streaming algorithms with logarithmic memory
- Quantum algorithm for dynamic programming approach for DAGs and applications
- Time-Space Complexity Advantages for Quantum Computing
- Space complexity of streaming algorithms on universal quantum computers
- Quantum Chebyshev's Inequality and Applications
- Quantum online algorithms with respect to space and advice complexity
- Unbounded-error quantum computation with small space bounds
- Deterministic construction of QFAs based on the quantum fingerprinting technique
- Quantum versus classical online streaming algorithms with logarithmic size of memory
This page was built for publication: Exponential separation of quantum and classical online space complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733715)
