Quantum Information

Assuming the polynomial hierarchy is infinite, we prove a sufficient condition for determining if uniform and polynomial size quantum circuits over a non-universal gate set are not efficiently classically simulable in the weak multiplicative sense. Our criterion exploits the fact that subgroups of SL(2; C) are essentially either discrete or dense in SL(2; C). Using our criterion, we give a new proof that both instantaneous quantum polynomial (IQP) circuits and conjugated Clifford circuits (CCCs) afford a quantum advantage. We also prove that both commuting CCCs and CCCs over various fragments of the Clifford group afford a quantum advantage, which settles two questions of Bouland, Fitzsimons, and Koh. Our results imply that circuits made of just U \otimes U-conjugated CZ gates afford a quantum advantage for almost all single-qubit unitaries U.

I will present a unified framework for understanding the statistics and anomalies of excitations—ranging from particles to higher-dimensional objects—in quantum lattice systems. We introduce a general method to compute the quantized statistics of Abelian excitations in arbitrary dimensions via Berry phases of locality-preserving symmetry operations, uncovering novel statistics for membrane excitations. These statistics correspond to quantum anomalies of generalized global symmetries and imply obstructions to gauging, enforcing long-range entanglement. In particular, we show that anomalous higher-form symmetries enforce intrinsic long-range entanglement, meaning that fidelity with any SRE states must exhibit exponential decay, unlike ordinary (0-form) symmetry anomalies. As an application, we identify a new example of (3+1)D mixed-state topological order with fermionic loop excitations, characterized by a breakdown of remote detectability linked to higher-form symmetry anomalies.