8 papers
Tool Use Enables Undetectable Steganography in Multi-Agent LLM Systems
Jimmy Laurence Rippin, Simon C. Marshall, David Demitri Africa +1
Increasingly autonomous agentic AI systems pose novel multi-agent risks, such as secret collusion via covert communication channels. The natural defence to these collusion attempts…
Debate is efficient with your time
Jonah Brown-Cohen, Geoffrey Irving, Simon C. Marshall +3
AI safety via debate uses two competing models to help a human judge verify complex computational tasks. Previous work has established what problems debate can solve in principle,…
Uniform bounds and uncertainty for asymptotics of representations of -adic
Rahul Dalal, Mathilde Gerbelli-Gauthier, Simon Marshall
We prove two results on the growth of dimensions of fixed vectors of representations of -adic under principal congruence subgroups: First, a uniform bound on th…
Quantum machine learning advantages beyond hardness of evaluation
Riccardo Molteni, Simon C. Marshall, Vedran Dunjko
The most general examples of quantum learning advantages involve data labeled by cryptographic or intrinsically quantum functions, where classical learners are limited by the infea…
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…