A Quantum Advantage for a Natural Streaming Problem-Reference-Cited by-同舟云学术

A Quantum Advantage for a Natural Streaming Problem

Published:2022-02 Issue: Volume: Page:
ISSN:
Container-title:2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
language:
Short-container-title:

Author:

Kallaugher John¹

Affiliation:

1. The University of Texas at Austin,Department of Computer Science,Austin,USA

Funder

National Science Foundation (NSF)

Sandia National Laboratories

U.S. Department of Energy's National Nuclear Security Administration

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx7/9719594/9719683/09719813.pdf?arnumber=9719813

Reference28 articles.

1. An optimal lower bound on the communication complexity of gap-hamming-distance

2. How Hard Is Counting Triangles in the Streaming Model?

3. An optimal algorithm for triangle counting in the stream;jayaram;Approximation Randomization and Combinatorial Optimization Algorithms and Techniques APPROX/RANDOM 2021 August 16–18 2021 University of Washington Seattle Washington USA (Virtual Conference),2021

4. A hybrid sampling scheme for triangle counting;kallaugher;Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms,2017

5. On randomized one-round communication complexity;kremer;Proceedings of the Twenty-seventh Annual ACM Symposium on Theory of Computing,1995

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Exponential Quantum Space Advantage for Approximating Maximum Directed Cut in the Streaming Model;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Accelerating Quantum Algorithms with Precomputation;Quantum;2024-02-22

3. The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10