4 papers · 1 filter
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…
On Bounded Advice Classes
Simon Marshall, Casper Gyurik, Vedran Dunjko
Advice classes in computational complexity have frequently been used to model real-world scenarios encountered in cryptography, quantum computing and machine learning, where some c…
Petersson norms of Borcherds theta lifts to O(1, 8n+1) with applications to injectivity and sup-norm bounds
Simon Marshall, Hiroaki Narita, Ameya Pitale
We give an explicit formula for the Petersson norms of theta lifts from Maass cusp forms of level one to cusp forms on orthogonal groups O(1,8n+1). Our formula explicitly determine…
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…