Space Complexity of Streaming Algorithms on Universal Quantum Computers

Abstract

Universal quantum computers are the only general purpose quantum computers known that can be implemented as of today. These computers consist of a classical memory component which controls the quantum memory. In this paper, the space complexity of some data stream problems, such as PartialMOD and Equality, is investigated on universal quantum computers. The quantum algorithms for these problems are believed to outperform their classical counterparts. Universal quantum computers, however, need classical bits for controlling quantum gates in addition to qubits. Our analysis shows that the number of classical bits used in quantum algorithms is equal to or even larger than that of classical bits used in corresponding classical algorithms. These results suggest that there is no advantage of implementing certain data stream problems on universal quantum computers instead of classical computers when space complexity is considered.

References in corpus (8)

• Quantum fingerprinting
• Programmable quantum gate arrays
• Efficient Discrete Approximations of Quantum Gates
• Superiority of exact quantum automata for promise problems
• Observation of quantum fingerprinting beating the classical limit
• Quantum Branching Programs and Space-Bounded Nonuniform Quantum Complexity
• Exponential Separation of Quantum and Classical Online Space Complexity
• Quantum Online Algorithms with Respect to Space Complexity

Cited by in corpus (2)

• Shallow Implementation of Quantum Fingerprinting with Application to Quantum Finite Automata
• Unconditionally separating noisy ${\mathsf{QNC}}^0$ from bounded polynomial threshold circuits of constant depth