Showing 2024 · quant-phShow all
2 papers · 2 filters
quant-ph2024
Improved separation between quantum and classical computers for sampling and functional tasks
Simon C. Marshall, Scott Aaronson, Vedran Dunjko
This paper furthers existing evidence that quantum computers are capable of computations beyond classical computers. Specifically, we strengthen the collapse of the polynomial hier…
quant-ph2024
PDQMA = DQMA = NEXP: QMA With Hidden Variables and Non-collapsing Measurements
Scott Aaronson, Sabee Grewal, Vishnu Iyer +2
We define and study a variant of QMA (Quantum Merlin Arthur) in which Arthur can make multiple non-collapsing measurements to Merlin's witness state, in addition to ordinary collap…