Space Complexity of Streaming Algorithms on Universal Quantum Computers

@inproceedings{Hu2020SpaceCO,
  title={Space Complexity of Streaming Algorithms on Universal Quantum Computers},
  author={Yanglin Hu and Darya Melnyk and Yuyi Wang and Roger Wattenhofer},
  booktitle={TAMC},
  year={2020}
}
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… 
1 Citations
A Quantum Advantage for a Natural Streaming Problem
  • John Kallaugher
  • Computer Science
    2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
  • 2022
TLDR
This work gives a one-pass quantum streaming algorithm for one of the best-studied problems in classical graph streaming-the triangle counting problem, and uses polynomially less space in certain regions of the parameter space.

References

SHOWING 1-10 OF 29 REFERENCES
Exponential separation of quantum and classical online space complexity
  • F. Gall
  • Computer Science
    SPAA '06
  • 2006
TLDR
This paper introduces a very natural and simple model of a space-bounded quantum online machine and proves an exponential separation of classical and quantum online space complexity, in the bounded-error setting and for a total language.
Exponential Separation of Quantum and Classical Online Space Complexity
TLDR
This paper introduces a very natural and simple model of a space-bounded quantum online machine and proves an exponential separation of classical and quantum online space complexity, in the bounded-error setting and for a total language.
Quantum Computation and Quantum Information (10th Anniversary edition)
TLDR
Containing a wealth of figures and exercises, this well-known textbook is ideal for courses on the subject, and will interest beginning graduate students and researchers in physics, computer science, mathematics, and electrical engineering.
Quantum Online Algorithms with Respect to Space and Advice Complexity
TLDR
It is shown that if the authors allow to use shared entangled qubits (EPR-pairs), then a quantum online algorithm can use half as many advise qubits compared to a classical one and this approach is applied to the well-known Paging Problem.
Efficient discrete approximations of quantum gates
TLDR
Here it is proved that using certain sets of base gates quantum compiling requires a string length that is linear in log 1/e, a result which matches the lower bound from counting volume up to constant factor.
Quantum versus Classical Online Algorithms with Advice and Logarithmic Space
TLDR
It is shown that there are problems that can be better solved by quantum algorithms than classical ones in a case of logarithmic memory, and it is proposed that quantum algorithm has an advantage, even if deterministic algorithm gets advice bits.
Programmable Quantum Gate Arrays
TLDR
It is shown that a universal quantum gate array which can be programmed to perform any unitary operation exists only if one allows the gate array to operate in a probabilistic fashion, and that it is not possible to build a fixed, general purpose quantum computer which can been programmed to Perform an arbitrary quantum computation.
Space-bounded quantum computation
TLDR
It is proved that exact (i.e., accepting with probability 0 or 1) constant-space quantum Turing machines upon which no restrictions on running time are placed can recognize languages that cannot be recognized by any bounded-error constant- space probabilistic Turing machine.
...
1
2
3
...