QMA and the Power of “Positivity”

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,800
Published on ● Video Link: https://www.youtube.com/watch?v=B-UfzWhLyD8


Duration: 51:55
454 views
7

Kunal Marwaha (University of Chicago)
https://simons.berkeley.edu/talks/kunal-marwaha-university-chicago-2023-07-12
Quantum Summer Cluster Workshop

We study a variant of QMA where quantum proofs have non-negative amplitudes in both completeness and soundness. This class was introduced by Jeronimo and Wu [STOC '23] to understand QMA(2). We show that this variant is very powerful even without considering multiple unentangled quantum provers. In fact, QMA+ with some constant gap is equal to NEXP, even though QMA+ with some other constant gap is equal to QMA.



Other Videos By Simons Institute for the Theory of Computing


2023-07-19Applications of Bit Commitments in a Quantum World
2023-07-19Pseudorandomness: From Quantum States to Binary Strings
2023-07-19Introduction to Quantum Cryptography Without One-Way Functions
2023-07-15Approaching the Quantum Singleton Bound with Approximate Error Correction
2023-07-14Improved Machine Learning Algorithm for Predicting Ground State Properties
2023-07-14Learning Beyond Stabilizer States
2023-07-14Quantum Commitments and Black Hole Radiation Decoding
2023-07-14Geometry, Entropy and Complexity in Quantum Gravity (Part II)
2023-07-14Geometry, Entropy and Complexity in Quantum Gravity (Part I)
2023-07-13Dissipative State Preparation and the Dissipative Quantum Eigensolver
2023-07-13QMA and the Power of “Positivity”
2023-07-13Compiled Nonlocal Games: From CHSH to BQP Verification
2023-07-12Making the Leap to Quantum PCPs
2023-07-12How Simulating Balls and Springs Captures the Power of Quantum Computing
2023-07-12Quantum Algorithms for Approximating Partition Functions
2023-07-12Quantum Gibbs Sampling
2023-07-11Quantum Advantage with Shallow Clifford Circuits
2023-07-11Utility, Computational Cost, and Effective Quantum Volume of NISQ Experiments
2023-07-11A Phase Transition in Linear Cross-Entropy Benchmarking
2023-07-11Validated Quantum Advantage via Bell Sampling
2023-07-11Verifiable Quantum Supremacy: What I Hope Will Be Done


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Quantum Summer Cluster Workshop
Kunal Marwaha