Space Complexity of Streaming Algorithms on Universal Quantum Computers
Authors:
- 9 October 2020
- book chapter
- Published by Springer Nature
- p. 275-286
Abstract
No abstract availableKeywords
All Related Versions
This publication has 17 references indexed in Scilit:
- Quantum Online Algorithms with Respect to Space and Advice ComplexityLobachevskii Journal of Mathematics, 2018
- Observation of Quantum Fingerprinting Beating the Classical LimitPhysical Review Letters, 2016
- Very Narrow Quantum OBDDs and Width Hierarchies for Classical OBDDs2014
- Superiority of exact quantum automata for promise problemsInformation Processing Letters, 2012
- Exponential separations for one-way quantum communication complexity, with applications to cryptography2007
- On the computational power of probabilistic and quantum branching programInformation and Computation, 2005
- Efficient discrete approximations of quantum gatesJournal of Mathematical Physics, 2002
- Quantum FingerprintingPhysical Review Letters, 2001
- The space complexity of approximating the frequency moments1996
- Efficient randomized pattern-matching algorithmsIBM Journal of Research and Development, 1987