arXiv subjects

Adam R. Brown

Publications and source records attributed to Adam R. Brown.

At least 19 recordsLinked to original sources

arXiv2024

The evaporation of charged black holes

Charged particle emission from black holes with sufficiently large charge is exponentially suppressed. As a result, such black holes are driven towards extremality by the emission of neutral Hawking radiation. Eventually, an isolated black hole gets close enough to extremality that the gravitational backreaction of a single Hawking photon becomes important, and the QFT in curved spacetime approximation breaks down. To proceed further, we need to use a quantum theory of gravity. We make use of recent progress in our understanding of the quantum-gravitational thermodynamics of near-extremal black holes to compute the corrected spectrum for both neutral and charged Hawking radiation, including the effects of backreaction, greybody factors, and metric fluctuations. At low temperatures, large fluctuations in a set of light modes of the metric lead to drastic modifications to neutral particle emission that -- in contrast to the semiclassical prediction -- ensure the black hole remains subextremal. Relatedly, angular momentum constraints mean that, close enough to extremality, black holes with zero angular momentum no longer emit individual photons and gravitons; the dominant radiation channel consists of entangled pairs of photons in angular-momentum singlet states. We also compute the effects of backreaction and metric fluctuations on the emission of charged particles. Somewhat surprisingly, we find that the semiclassical Schwinger emission rate is essentially unchanged despite the fact that the emission process leads to large changes in the geometry and thermodynamics of the throat. We present, for the first time, the full history of the evaporation of a large charged black hole. This corrects the semiclassical calculation, which gives completely wrong predictions for almost the entire evaporation history, even for the crudest observables like the temperature seen by a thermometer.

hep-th↗

arXiv2024

The Channel Capacity of a Relativistic String

I explore the limitations on the capacity of a relativistic channel to transmit power and information that arise because of the finiteness of the transverse speed of light. As a model system, I consider a rope constructed from a fundamental string, for which relativistic invariance is built in. By wiggling one end of the string, both power and information may be transmitted to the other end. I argue that even though an unbounded amount of power and information may be traveling down the string, there is a bound on how much may be transmitted. Further, I conjecture that the two kinds of channel capacity -- power and information -- interfere with each other, so that the only way to transmit the maximum amount of power is to send no information, and vice versa.

hep-th↗

arXiv2023

An Improved Long-Time Bishop-Gromov Theorem Using Shear

The Bishop-Gromov theorem is a comparison theorem of differential geometry that upperbounds the growth of volume of a geodesic ball in a curved space. For many spaces, this bound is far from tight. We identify a major reason the bound fails to be tight: it neglects the effect of shear. By using higher curvature invariants to lowerbound the average shear, we are able to place tighter-than-Bishop-Gromov upperbounds on the late-time growth rates of geodesic balls in homogeneous spaces with non-positive sectional curvature. We also provide concrete guidance on how our theorem can be generalized to inhomogeneous spaces, to spaces with positive sectional curvatures, and to intermediate and short times. In arXiv:2209.09288 we discovered an enhancement to the BG theorem that was strongest at early times, and that relied upon additive properties of families of Jacobi equations; in this paper we find a different enhancement at late times that connects to multiplicative properties of families of Jacobi equations. A novel feature shared by both papers is the consideration of families of equations that are not coupled but whose coefficients are correlated.

math.DG↗

arXiv2022

Enhanced Bishop-Gromov Theorem

The Bishop-Gromov theorem upperbounds the rate of growth of volume of geodesic balls in a space, in terms of the most negative component of the Ricci curvature. In this paper we prove a strengthening of the Bishop-Gromov bound for homogeneous spaces. Unlike the original Bishop-Gromov bound, our enhanced bound depends not only on the most negative component of the Ricci curvature, but on the full spectrum. As a further result, for finite-volume inhomogeneous spaces, we prove an upperbound on the average rate of growth of geodesics, averaged over all starting points; this bound is stronger than the one that follows from the Bishop-Gromov theorem. Our proof makes use of the Raychaudhuri equation, of the fact that geodesic flow conserves phase-space volume, and also of a tool we introduce for studying families of correlated Jacobi equations that we call "coefficient shuffling".

math.DG↗

arXiv2022

The Smallest Interacting Universe

The co-emergence of locality between the Hamiltonian and initial state of the universe is studied in a simple toy model. We hypothesize a fundamental loss functional for the combined Hamiltonian and quantum state and minimize it by gradient descent. This minimization yields a tensor product structure simultaneously respected by both the Hamiltonian and the state, suggesting that locality can emerge by a process analogous to spontaneous symmetry breaking. We discuss the relevance of this program to the arrow of time problem. In our toy model, we interpret the emergence of a tensor factorization as the appearance of individual degrees of freedom within a previously undifferentiated (raw) Hilbert space. Earlier work [5, 6] looked at the emergence of locality in Hamiltonians only, and found strong numerical confirmation of that raw Hilbert spaces of $\dim = n$ are unstable and prefer to settle on tensor factorization when $n=pq$ is not prime, and in [6] even primes were seen to "factor" after first shedding a small summand, e.g. $7=1+2\cdot 3$. This was found in the context of a rather general potential functional $F$ on the space of metrics $\{g_{ij}\}$ on $\mathfrak{su}(n)$, the Lie algebra of symmetries. This emergence of qunits through operator-level spontaneous symmetry breaking (SSB) may help us understand why the world seems to consist of myriad interacting degrees of freedom. But understanding why the universe has an initial Hamiltonian $H_0$ with a many-body structure is of limited conceptual value unless the initial state, $|\psi_0\rangle$, is also structured by this tensor decomposition. Here we adapt $F$ to become a functional on $\{g,|\psi_0\rangle\}=(\text{metrics})\times (\text{initial states})$, and find SSB now produces a conspiracy between $g$ and $|\psi_0\rangle$, where they simultaneously attain low entropy by settling on the same qubit decomposition.

hep-th↗

arXiv2022

Beyond the Imitation Game: Quantifying and extrapolating the capabilities of language models

Language models demonstrate both quantitative improvement and new qualitative capabilities with increasing scale. Despite their potentially transformative impact, these new capabilities are as yet poorly characterized. In order to inform future research, prepare for disruptive new model capabilities, and ameliorate socially harmful effects, it is vital that we understand the present and near-future capabilities and limitations of language models. To address this challenge, we introduce the Beyond the Imitation Game benchmark (BIG-bench). BIG-bench currently consists of 204 tasks, contributed by 450 authors across 132 institutions. Task topics are diverse, drawing problems from linguistics, childhood development, math, common-sense reasoning, biology, physics, social bias, software development, and beyond. BIG-bench focuses on tasks that are believed to be beyond the capabilities of current language models. We evaluate the behavior of OpenAI's GPT models, Google-internal dense transformer architectures, and Switch-style sparse transformers on BIG-bench, across model sizes spanning millions to hundreds of billions of parameters. In addition, a team of human expert raters performed all tasks in order to provide a strong baseline. Findings include: model performance and calibration both improve with scale, but are poor in absolute terms (and when compared with rater performance); performance is remarkably similar across model classes, though with benefits from sparsity; tasks that improve gradually and predictably commonly involve a large knowledge or memorization component, whereas tasks that exhibit "breakthrough" behavior at a critical scale often involve multiple steps or components, or brittle metrics; social bias typically increases with scale in settings with ambiguous context, but this can be improved with prompting.

cs.CL↗

arXiv2022

Polynomial Equivalence of Complexity Geometries

This paper proves the polynomial equivalence of a broad class of definitions of quantum computational complexity. We study right-invariant metrics on the unitary group -- often called `complexity geometries' following the definition of quantum complexity proposed by Nielsen -- and delineate the equivalence class of metrics that have the same computational power as quantum circuits. Within this universality class, any unitary that can be reached in one metric can be approximated in any other metric in the class with a slowdown that is at-worst polynomial in the length and number of qubits and inverse-polynomial in the permitted error. We describe the equivalence classes for two different kinds of error we might tolerate: Killing-distance error, and operator-norm error. All metrics in both equivalence classes are shown to have exponential diameter; all metrics in the operator-norm equivalence class are also shown to give an alternative definition of the quantum complexity class BQP. My results extend those of Nielsen et al., who in 2006 proved that one particular metric is polynomially equivalent to quantum circuits. The Nielsen et al. metric is incredibly highly curved. I show that the greatly enlarged equivalence class established in this paper also includes metrics that have modest curvature. I argue that the modest curvature makes these metrics more amenable to the tools of differential geometry, and therefore makes them more promising starting points for Nielsen's program of using differential geometry to prove complexity lowerbounds.

quant-ph↗

arXiv2021

A Quantum Complexity Lowerbound from Differential Geometry

The Bishop-Gromov bound -- a cousin of the focusing lemmas that Hawking and Penrose used to prove their black hole singularity theorems -- is a differential geometry result that upperbounds the rate of growth of volume of geodesic balls in terms of the Ricci curvature. In this paper, I apply the Bishop-Gromov bound to Nielsen's complexity geometry to prove lowerbounds on the quantum complexity of a typical unitary. For a broad class of penalty schedules, the typical complexity is shown to be exponentially large in the number of qubits. This technique gives results that are tighter than all known lowerbounds in the literature, as well as establishing lowerbounds for a much broader class of complexity geometry metrics than has hitherto been bounded. For some metrics, I prove these lowerbounds are tight. This method realizes the original vision of Nielsen, which was to apply the tools of differential geometry to study quantum complexity.

hep-th↗

arXiv2021

Universality in long-distance geometry and quantum complexity

In physics, two systems that radically differ at short scales can exhibit strikingly similar macroscopic behaviour: they are part of the same long-distance universality class. Here we apply this viewpoint to geometry and initiate a program of classifying homogeneous metrics on group manifolds by their long-distance properties. We show that many metrics on low-dimensional Lie groups have markedly different short-distance properties but nearly identical distance functions at long distances, and provide evidence that this phenomenon is even more robust in high dimensions. An application of these ideas of particular interest to physics and computer science is complexity geometry--the study of quantum computational complexity using Riemannian geometry. We argue for the existence of a large universality class of definitions of quantum complexity, each linearly related to the other, a much finer-grained equivalence than typically considered. We conjecture that a new effective metric emerges at larger complexities that describes a broad class of complexity geometries, insensitive to various choices of microscopic penalty factors. We discuss the implications for recent conjectures in quantum gravity.

hep-th↗

arXiv2021

Quantum Gravity in the Lab: Teleportation by Size and Traversable Wormholes, Part II

In [1] we discussed how quantum gravity may be simulated using quantum devices and gave a specific proposal -- teleportation by size and the phenomenon of size-winding. Here we elaborate on what it means to do 'Quantum Gravity in the Lab' and how size-winding connects to bulk gravitational physics and traversable wormholes. Perfect size-winding is a remarkable, fine-grained property of the size wavefunction of an operator; we show from a bulk calculation that this property must hold for quantum systems with a nearly-AdS_2 bulk. We then examine in detail teleportation by size in three systems: the Sachdev-Ye-Kitaev model, random matrices, and spin chains, and discuss prospects for realizing these phenomena in near-term quantum devices.

quant-ph↗

arXiv2019

Playing Pool with $|\psi \rangle$: from Bouncing Billiards to Quantum Search

In "Playing Pool with $\pi$", Galperin invented an extraordinary method to learn the digits of $\pi$ by counting the collisions of billiard balls. Here I demonstrate an exact isomorphism between Galperin's bouncing billiards and Grover's algorithm for quantum search. This provides an illuminating way to visualize Grover's algorithm.

quant-ph↗

arXiv2019

The Python's Lunch: geometric obstructions to decoding Hawking radiation

According to Harlow and Hayden [arXiv:1301.4504] the task of distilling information out of Hawking radiation appears to be computationally hard despite the fact that the quantum state of the black hole and its radiation is relatively un-complex. We trace this computational difficulty to a geometric obstruction in the Einstein-Rosen bridge connecting the black hole and its radiation. Inspired by tensor network models, we conjecture a precise formula relating the computational hardness of distilling information to geometric properties of the wormhole - specifically to the exponential of the difference in generalized entropies between the two non-minimal quantum extremal surfaces that constitute the obstruction. Due to its shape, we call this obstruction the "Python's Lunch", in analogy to the reptile's postprandial bulge.

hep-th↗

arXiv2019

Quantum Gravity in the Lab: Teleportation by Size and Traversable Wormholes

With the long-term goal of studying models of quantum gravity in the lab, we propose holographic teleportation protocols that can be readily executed in table-top experiments. These protocols exhibit similar behavior to that seen in the recent traversable wormhole constructions of [1,2]: information that is scrambled into one half of an entangled system will, following a weak coupling between the two halves, unscramble into the other half. We introduce the concept of teleportation by size to capture how the physics of operator-size growth naturally leads to information transmission. The transmission of a signal through a semi-classical holographic wormhole corresponds to a rather special property of the operator-size distribution we call size winding. For more general systems (which may not have a clean emergent geometry), we argue that imperfect size winding is a generalization of the traversable wormhole phenomenon. In addition, a form of signalling continues to function at high temperature and at large times for generic chaotic systems, even though it does not correspond to a signal going through a geometrical wormhole, but rather to an interference effect involving macroscopically different emergent geometries. Finally, we outline implementations feasible with current technology in two experimental platforms: Rydberg atom arrays and trapped ions.

quant-ph↗

arXiv2019

The Complexity Geometry of a Single Qubit

The computational complexity of a quantum state quantifies how hard it is to make. `Complexity geometry', first proposed by Nielsen, is an approach to defining computational complexity using the tools of differential geometry. Here we demonstrate many of the attractive features of complexity geometry using the example of a single qubit, which turns out to be rich enough to be illustrative but simple enough to be illuminating.

hep-th↗

arXiv2018

The Case of the Missing Gates: Complexity of Jackiw-Teitelboim Gravity

The Jackiw-Teitelboim (JT) model arises from the dimensional reduction of charged black holes. Motivated by the holographic complexity conjecture, we calculate the late-time rate of change of action of a Wheeler-DeWitt patch in the JT theory. Surprisingly, the rate vanishes. This is puzzling because it contradicts both holographic expectations for the rate of complexification and also action calculations for charged black holes. We trace the discrepancy to an improper treatment of boundary terms when naively doing the dimensional reduction. Once the boundary term is corrected, we find exact agreement with expectations. We comment on the general lessons that this might hold for holographic complexity and beyond.

hep-th↗

arXiv2018

Falling Toward Charged Black Holes

The growth of the "size" of operators is an important diagnostic of quantum chaos. In arXiv:1802.01198 [hep-th] it was conjectured that the holographic dual of the size is proportional to the average radial component of the momentum of the particle created by the operator. Thus the growth of operators in the background of a black hole corresponds to the acceleration of the particle as it falls toward the horizon. In this note we will use the momentum-size correspondence as a tool to study scrambling in the field of a near-extremal charged black hole. The agreement with previous work provides a non-trivial test of the momentum-size relation, as well as an explanation of a paradoxical feature of scrambling previously discovered by Leichenauer [arXiv:1405.7365 [hep-th]]. Naively Leichenauer's result says that only the non-extremal entropy participates in scrambling. The same feature is also present in the SYK model. In this paper we find a quite different interpretation of Leichenauer's result which does not have to do with any decoupling of the extremal degrees of freedom. Instead it has to do with the buildup of momentum as a particle accelerates through the long throat of the Reissner-Nordstrom geometry.

hep-th↗

arXiv2017

The Thin-Wall Approximation in Vacuum Decay: a Lemma

The 'thin-wall approximation' gives a simple estimate of the decay rate of an unstable quantum field. Unfortunately, the approximation is uncontrolled. In this paper I show that there are actually two different thin-wall approximations and that they bracket the true decay rate: I prove that one is an upper bound and the other a lower bound. In the thin-wall limit, the two approximations converge. In the presence of gravity, a generalization of this lemma provides a simple sufficient condition for non-perturbative vacuum instability.

hep-th↗

arXiv2017

Hyperinflation

A model of cosmological inflation is proposed in which field space is a hyperbolic plane. The inflaton never slow-rolls, and instead orbits the bottom of the potential, buoyed by a centrifugal force. Though initial velocities redshift away during inflation, in negatively curved spaces angular momentum naturally starts exponentially large and remains relevant throughout. Quantum fluctuations produce perturbations that are adiabatic and approximately scale invariant; strikingly, in a certain parameter regime the perturbations can grow double-exponentially during horizon crossing.

hep-th↗