A Quantum Advantage for a Natural Streaming Problem.

Kallaugher, John

doi:10.1109/FOCS52979.2021.00091

Title: A Quantum Advantage for a Natural Streaming Problem.

Conference · Mon Nov 01 00:00:00 EDT 2021

DOI:https://doi.org/10.1109/FOCS52979.2021.00091· OSTI ID:1897703

Kallaugher, John

Abstract not provided.

View Conference

Cite

Export

Save

Research Organization:: Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

Sponsoring Organization:: USDOE National Nuclear Security Administration (NNSA)

DOE Contract Number:: NA0003525

OSTI ID:: 1897703

Report Number(s):: SAND2021-14339C; 701506

Resource Relation:: Conference: Proposed for presentation at the 62nd Annual IEEE Symposium on Foundations of Computer Science (FOCS) held February 7-10, 2022 in Denver, Colorado United States of America

Country of Publication:: United States

Language:: English

References (14)

An optimal lower bound on the communication complexity of gap-hamming-distance Chakrabarti, Amit; Regev, Oded Proceedings of the forty-third annual ACM symposium on Theory of computing https://doi.org/10.1145/1993636.1993644	conference	June 2011
On randomized one-round communication complexity Kremer, Ilan; Nisan, Noam; Ron, Dana Proceedings of the twenty-seventh annual ACM symposium on Theory of computing - STOC '95 https://doi.org/10.1145/225058.225277	conference	January 1995
Dense quantum coding and quantum finite automata Ambainis, Andris; Nayak, Ashwin; Ta-Shma, Amnon Journal of the ACM, Vol. 49, Issue 4 https://doi.org/10.1145/581771.581773	journal	July 2002
Streaming Universal Distortion-Free Entanglement Concentration Blume-Kohout, Robin; Croke, Sarah; Gottesman, Daniel IEEE Transactions on Information Theory, Vol. 60, Issue 1 https://doi.org/10.1109/TIT.2013.2292135	journal	January 2014
Quantum Online Algorithms with Respect to Space and Advice Complexity Khadiev, K.; Khadieva, A.; Mannapov, I. Lobachevskii Journal of Mathematics, Vol. 39, Issue 9 https://doi.org/10.1134/S1995080218090421	journal	November 2018
Exponential separation of quantum and classical online space complexity Le Gall, François Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures https://doi.org/10.1145/1148109.1148119	conference	July 2006
The Space Complexity of Recognizing Well-Parenthesized Expressions in the Streaming Model: The Index Function Revisited Jain, Rahul; Nayak, Ashwin IEEE Transactions on Information Theory, Vol. 60, Issue 10 https://doi.org/10.1109/TIT.2014.2339859	journal	October 2014
Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography Gavinsky, Dmitry; Kempe, Julia; Kerenidis, Iordanis SIAM Journal on Computing, Vol. 38, Issue 5 https://doi.org/10.1137/070706550	journal	January 2009
The quantum complexity of approximating the frequency moments Montanaro, Ashley Quantum Information and Computation, Vol. 16, Issue 13&14 https://doi.org/10.26421/QIC16.13-14-5	journal	October 2016
The space complexity of approximating the frequency moments Alon, Noga; Matias, Yossi; Szegedy, Mario Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 https://doi.org/10.1145/237814.237823	conference	January 1996
Probabilistic counting algorithms for data base applications Flajolet, Philippe; Nigel Martin, G. Journal of Computer and System Sciences, Vol. 31, Issue 2 https://doi.org/10.1016/0022-0000(85)90041-8	journal	October 1985
Quantum branching programs and space-bounded nonuniform quantum complexity Sauerhoff, Martin; Sieling, Detlef Theoretical Computer Science, Vol. 334, Issue 1-3 https://doi.org/10.1016/j.tcs.2004.12.031	journal	April 2005
The Coin Problem with Applications to Data Streams Braverman, Mark; Garg, Sumegha; Woodruff, David P. 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) https://doi.org/10.1109/FOCS46700.2020.00038	conference	November 2020
Quantum automata and quantum grammars Moore, Cristopher; Crutchfield, James P. Theoretical Computer Science, Vol. 237, Issue 1-2 https://doi.org/10.1016/S0304-3975(98)00191-1	journal	April 2000

Similar Records

A Quantum Advantage for a Natural Streaming Problem.

Conference · Sat Jan 01 00:00:00 EST 2022 · OSTI ID:1897703

Kallaugher, John

A Quantum Advantage for a Natural Streaming Problem.

Conference · Fri Apr 01 00:00:00 EDT 2022 · OSTI ID:1897703

Kallaugher, John

A Quantum Advantage for a Natural Streaming Problem.

Conference · Sun May 01 00:00:00 EDT 2022 · OSTI ID:1897703

Kallaugher, John

Title: A Quantum Advantage for a Natural Streaming Problem.

Citation Formats

References (14)

Similar Records

Related Subjects