Searcharxiv⌕ Search

arXiv subjects

Ben T. McDonough

Publications and source records attributed to Ben T. McDonough.

4 recordsLinked to original sources

Bridging Classical and Quantum Information Scrambling with the Operator Entanglement Spectrum

Universal features of chaotic quantum dynamics underlie our understanding of thermalization in closed quantum systems and the complexity of quantum computations. Reversible automaton circuits, comprised of classical logic gates, have emerged as a tractable means to study such dynamics. Despite generating no entanglement in the computational basis, these circuits nevertheless capture many features expected from fully quantum evolutions. In this work, we demonstrate that the differences between automaton dynamics and fully quantum dynamics are revealed by the operator entanglement spectrum, much like the entanglement spectrum of a quantum state distinguishes between the dynamics of states under Clifford and Haar random circuits. While the operator entanglement spectrum under random unitary dynamics is governed by the eigenvalue statistics of random Gaussian matrices, we show evidence that under random automaton dynamics it is described by the statistics of Bernoulli random matrices, whose entries are random variables taking values $0$ or $1$. We study the crossover between automaton and generic unitary operator dynamics as the automaton circuit is doped with gates that introduce superpositions, namely Hadamard or $R_x = e^{-i\fracπ{4}X}$ gates. We find that a constant number of superposition-generating gates is sufficient to drive the operator dynamics to the random-circuit universality class, similar to earlier results on Clifford circuits doped with $T$ gates. This establishes the operator entanglement spectrum as a useful tool for probing the chaoticity and universality class of quantum dynamics.

quant-ph↗

Calderbank-Shor-Steane codes on group-valued qudits

Calderbank-Shor-Steane (CSS) codes are a versatile quantum error-correcting family built out of commuting $X$- and $Z$-type checks. We introduce CSS-like codes on $G$-valued qudits for any finite group $G$ that reduce to qubit CSS codes for $G = \mathbb{Z}_2$ yet generalize the Kitaev quantum double model for general groups. The $X$-checks of our group-CSS codes correspond to left and/or right multiplication by group elements, while $Z$-checks project onto solutions to group word equations. We describe quantum-double models on oriented two-dimensional CW complexes (which need not cellulate a manifold) and prove that, when $G$ is non-Abelian and simple, every $G$-covariant group-CSS code with suitably upper-bounded $Z$-check weight and lower-bounded $Z$-distance reduces to a CW quantum double. We describe the codespace and logical operators of CW quantum doubles via the same intuition used to obtain logical structure of surface codes. We obtain distance bounds for codes on non-Abelian simple groups from the graph underlying the CW complex, and construct intrinsically non-Abelian code families with asymptotically optimal rate and distances. Adding "ghost vertices" to the CW complex generalizes quantum double models with defects and rough boundary conditions whose logical structure can be understood without reference to non-Abelian anyons or defects. Several non-invertible symmetry-protected topological states, both with ordinary and higher-form symmetries, are the unique codewords of simply-connected CW quantum doubles with a single ghost vertex.

quant-ph↗

Lieb-Robinson bounds with exponential-in-volume tails

Lieb-Robinson bounds demonstrate the emergence of locality in many-body quantum systems. Intuitively, Lieb-Robinson bounds state that with local or exponentially decaying interactions, the correlation that can be built up between two sites separated by distance $r$ after a time $t$ decays as $\exp(vt-r)$, where $v$ is the emergent Lieb-Robinson velocity. In many problems, it is important to also capture how much of an operator grows to act on $r^d$ sites in $d$ spatial dimensions. Perturbation theory and cluster expansion methods suggest that at short times, these volume-filling operators are suppressed as $\exp(-r^d)$ at short times. We confirm this intuition, showing that for $r > vt$, the volume-filling operator is suppressed by $\exp(-(r-vt)^d/(vt)^{d-1})$. This closes a conceptual and practical gap between the cluster expansion and the Lieb-Robinson bound. We then present two very different applications of this new bound. Firstly, we obtain improved bounds on the classical computational resources necessary to simulate many-body dynamics with error tolerance $ε$ for any finite time $t$: as $ε$ becomes sufficiently small, only $ε^{-O(t^{d-1})}$ resources are needed. A protocol that likely saturates this bound is given. Secondly, we prove that disorder operators have volume-law suppression near the "solvable (Ising) point" in quantum phases with spontaneous symmetry breaking, which implies a new diagnostic for distinguishing many-body phases of quantum matter.

quant-ph↗

Non-perturbatively slow spread of quantum correlations in non-resonant systems

Strong disorder often has drastic consequences for quantum dynamics. This is best illustrated by the phenomenon of Anderson localization in non-interacting systems, where destructive quantum wave interference leads to the complete absence of particle and information transport over macroscopic distances. In this work, we investigate the extent to which strong disorder leads to provably slow dynamics in many-body quantum lattice models. We show that in any spatial dimension, strong disorder leads to a non-perturbatively small velocity for ballistic information transport under unitary quantum dynamics, almost surely in the thermodynamic limit, in every many-body state. In these models, we also prove the existence of a "prethermal many-body localized regime", where entanglement spreads logarithmically slowly, up to non-perturbatively long time scales. More generally, these conclusions hold for all models corresponding to quantum perturbations to a classical Hamiltonian obeying a simple non-resonant condition. Deterministic non-resonant models are found, including spin systems in strong incommensurate lattice potentials. Consequently, quantum dynamics in non-resonant potentials is asymptotically easier to simulate on both classical or quantum computers, compared to a generic many-body system.

cond-mat.dis-nn↗