activity
20242026
most citedRandom ensembles of symplectic and unitary states are indistinguishable

1 citations · 1 across the 11 of their papers we have counts for

collaborators
Showing 2026 · quant-phShow all

10 papers · 2 filters

quant-ph2026

Free fermionic black holes as polarised mirrors

Maureen Krumtünger, Maxwell West

Understanding the speed with which various classes of quantum systems can scramble information is a key goal of quantum information theory, with relevance to both fundamental physi…

quant-ph2026

Fermionic Gaussianity can be tested with mode-independent sample-complexity

Maxwell West, Martin Larocca

Deciding whether an unknown quantum state either belongs to, or is far from, a given family of states is a natural question of quantum information theory. In many such cases, there…

quant-ph2026

Practical fermionic shadows enabled by improved sample-complexity bounds

Maxwell West, Su Yeon Chang, Luke Coffman +2

Classical shadow tomography is widely touted as supplying a family of methods for extracting information from quantum systems with polynomially scaling sample-complexities. In the…

quant-ph2026

Strong matchgate designs in nearly optimal depth

Maxwell West, M. Cerezo, Martin Larocca

Understanding the resources required to generate approximately random unitaries over various groups is a natural goal of quantum information theory. With respect to one notion of a…

quant-ph2026

Sample-optimal learning of stabilizer states

Rebecca Chang, Matthias C. Caro, Martin Larocca +1

It is well-known that learning a pure -qubit stabilizer state both requires, and can be accomplished with, access to a number of copies of linear in .…

quant-ph2026

Ambient unitaries don't enable shallow group designs

Maxwell West, M. Cerezo, Martin Larocca

Characterising the efficiency with which designs over various subsets of the unitary group may be constructed is an important goal of quantum information theory. While it is now kn…

quant-ph2026

Particle-preserving fermionic shadows with mode-independent sample complexity

Maxwell West, M. Cerezo, Martin Larocca

We consider the problem of learning expectation values of particle-preserving operators with respect to an unknown -particle -mode fermionic state via classical shadows. Our…

quant-ph2026

Classical shadows over symmetric spaces

Rebecca Chang, Maureen Krumtünger, Martin Larocca +1

Efficiently learning expectation values of unknown quantum states via classical shadows has become an important primitive in both theoretical and experimental aspects of quantum co…

quant-ph2026

Classical shadows with arbitrary group representations

Maxwell West, Frederic Sauvage, Aniruddha Sen +6

Classical shadows (CS) has recently emerged as an important framework to efficiently predict properties of an unknown quantum state. A common strategy in CS protocols is to paramet…

quant-ph2026

On the average-case complexity of learning states from the circular and Gaussian ensembles

Maxwell West

Studying the complexity of states sampled from various ensembles is a central component of quantum information theory. In this work we establish the average-case hardness of learni…