The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

The Quantum and Classical Streaming Complexity of Quantum and Classical Max-Cut

Published:2022-10 Issue: Volume: Page:
ISSN:
Container-title:2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)
language:
Short-container-title:

Author:

Kallaugher John¹,Parekh Ojas¹

Affiliation:

1. Sandia National Labs,Albuquerque,USA

Funder

Laboratory Directed Research and Development

National Nuclear Security Administration

U.S. Department of Energy

Office of Science

Advanced Scientific Computing Research

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx7/9996589/9996592/09996660.pdf?arnumber=9996660

Reference42 articles.

1. Low-Degree Testing for Quantum States, and a Quantum Entangled Games PCP for QMA

2. The Space Complexity of Recognizing Well-Parenthesized Expressions in the Streaming Model: The Index Function Revisited

3. Guest column

4. Exponential Separation for One-Way Quantum Communication Complexity, with Applications to Cryptography

5. An approximation algorithm for the MAX-2-Local Hamiltonian problem;hallgren;Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques,2020

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

1. Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case;ACM Transactions on Computation Theory;2024-08-27

2. 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

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP