arXiv subjects

Alex May

Publications and source records attributed to Alex May.

36 records · Page 2Linked to original sources

arXiv2023

Constraints on physical computers in holographic spacetimes

Within the setting of the AdS/CFT correspondence, we ask about the power of computers in the presence of gravity. We show that there are computations on $n$ qubits which cannot be implemented inside of black holes with entropy less than $O(2^n)$. To establish our claim, we argue computations happening inside the black hole must be implementable in a programmable quantum processor, so long as the inputs and description of the unitary to be run are not too large. We then prove a bound on quantum processors which shows many unitaries cannot be implemented inside the black hole, and further show some of these have short descriptions and act on small systems. These unitaries with short descriptions must be computationally forbidden from happening inside the black hole.

hep-th↗

arXiv2023

Code-routing: a new attack on position verification

The cryptographic task of position verification attempts to verify one party's location in spacetime by exploiting constraints on quantum information and relativistic causality. A popular verification scheme known as $f$-routing involves requiring the prover to redirect a quantum system based on the value of a Boolean function $f$. Cheating strategies for the $f$-routing scheme require the prover use pre-shared entanglement, and security of the scheme rests on assumptions about how much entanglement a prover can manipulate. Here, we give a new cheating strategy in which the quantum system is encoded into a secret-sharing scheme, and the authorization structure of the secret-sharing scheme is exploited to direct the system appropriately. This strategy completes the $f$-routing task using $O(SP_p(f))$ EPR pairs, where $SP_p(f)$ is the minimal size of a span program over the field $\mathbb{Z}_p$ computing $f$. This shows we can efficiently attack $f$-routing schemes whenever $f$ is in the complexity class $\text{Mod}_p\text{L}$, after allowing for local pre-processing. The best earlier construction achieved the class L, which is believed to be strictly inside of $\text{Mod}_p\text{L}$. We also show that the size of a quantum secret sharing scheme with indicator function $f_I$ upper bounds entanglement cost of $f$-routing on the function $f_I$.

quant-ph↗

arXiv2022

Pseudonymization at Scale: OLCF's Summit Usage Data Case Study

The analysis of vast amounts of data and the processing of complex computational jobs have traditionally relied upon high performance computing (HPC) systems. Understanding these analyses' needs is paramount for designing solutions that can lead to better science, and similarly, understanding the characteristics of the user behavior on those systems is important for improving user experiences on HPC systems. A common approach to gathering data about user behavior is to analyze system log data available only to system administrators. Recently at Oak Ridge Leadership Computing Facility (OLCF), however, we unveiled user behavior about the Summit supercomputer by collecting data from a user's point of view with ordinary Unix commands. Here, we discuss the process, challenges, and lessons learned while preparing this dataset for publication and submission to an open data challenge. The original dataset contains personal identifiable information (PII) about OLCF users which needed be masked prior to publication, and we determined that anonymization, which scrubs PII completely, destroyed too much of the structure of the data to be interesting for the data challenge. We instead chose to pseudonymize the dataset to reduce its linkability to users' identities. Pseudonymization is significantly more computationally expensive than anonymization, and the size of our dataset, approximately 175 million lines of raw text, necessitated the development of a parallelized workflow that could be reused on different HPC machines. We demonstrate the scaling behavior of the workflow on two leadership class HPC systems at OLCF, and we show that we were able to bring the overall makespan time from an impractical 20+ hours on a single node down to around 2 hours. As a result of this work, we release the entire pseudonymized dataset and make the workflows and source code publicly available.

cs.DC↗

arXiv2022

Complexity and entanglement in non-local computation and holography

Does gravity constrain computation? We study this question using the AdS/CFT correspondence, where computation in the presence of gravity can be related to non-gravitational physics in the boundary theory. In AdS/CFT, computations which happen locally in the bulk are implemented in a particular non-local form in the boundary, which in general requires distributed entanglement. In more detail, we recall that for a large class of bulk subregions the area of a surface called the ridge is equal to the mutual information available in the boundary to perform the computation non-locally. We then argue the complexity of the local operation controls the amount of entanglement needed to implement it non-locally, and in particular complexity and entanglement cost are related by a polynomial. If this relationship holds, gravity constrains the complexity of operations within these regions to be polynomial in the area of the ridge.

quant-ph↗

arXiv2022

The connected wedge theorem and its consequences

In the AdS/CFT correspondence, bulk causal structure has consequences for boundary entanglement. In quantum information science, causal structures can be replaced by distributed entanglement for the purposes of information processing. In this work, we deepen the understanding of both of these statements, and their relationship, with a number of new results. Centrally, we present and prove a new theorem, the $n$-to-$n$ connected wedge theorem, which considers $n$ input and $n$ output locations at the boundary of an asymptotically AdS$_{2+1}$ spacetime described by AdS/CFT. When a sufficiently strong set of causal connections exists among these points in the bulk, a set of $n$ associated regions in the boundary will have extensive-in-N mutual information across any bipartition of the regions. The proof holds in three bulk dimensions for classical spacetimes satisfying the null curvature condition and for semiclassical spacetimes satisfying standard conjectures. The $n$-to-$n$ connected wedge theorem gives a precise example of how causal connections in a bulk state can emerge from large-N entanglement features of its boundary dual. It also has consequences for quantum information theory: it reveals one pattern of entanglement which is sufficient for information processing in a particular class of causal networks. We argue this pattern is also necessary, and give an AdS/CFT inspired protocol for information processing in this setting. Our theorem generalizes the $2$-to-$2$ connected wedge theorem proven in arXiv:1912.05649. We also correct some errors in the proof presented there, in particular a false claim that existing proof techniques work above three bulk dimensions.

hep-th↗

arXiv2021

Bulk private curves require large conditional mutual information

We prove a theorem showing that the existence of "private" curves in the bulk of AdS implies two regions of the dual CFT share strong correlations. A private curve is a causal curve which avoids the entanglement wedge of a specified boundary region $\mathcal{U}$. The implied correlation is measured by the conditional mutual information $I(\mathcal{V}_1:\mathcal{V}_2\,|\,\mathcal{U})$, which is $O(1/G_N)$ when a private causal curve exists. The regions $\mathcal{V}_1$ and $\mathcal{V}_2$ are specified by the endpoints of the causal curve and the placement of the region $\mathcal{U}$. This gives a causal perspective on the conditional mutual information in AdS/CFT, analogous to the causal perspective on the mutual information given by earlier work on the connected wedge theorem. We give an information theoretic argument for our theorem, along with a bulk geometric proof. In the geometric perspective, the theorem follows from the maximin formula and entanglement wedge nesting. In the information theoretic approach, the theorem follows from resource requirements for sending private messages over a public quantum channel.

hep-th↗

arXiv2021

Negative energy enhancement in layered holographic conformal field theories

Using a holographic model, we study quantum field theories with a layer of one CFT surrounded by another CFT, on either a periodic or an infinite direction. We study the vacuum energy density in each CFT as a function of the central charges, the thickness of the layer(s), and the properties of the interfaces between the CFTs. The dual spacetimes in the holographic model include two regions separated by a dynamical interface with some tension. For two or more spatial dimensions, we find that a layer of CFT with more degrees of freedom than the surrounding one can have an anomalously large negative vacuum energy density for certain types of interfaces. The negative energy density (or null-energy density in the direction perpendicular to the interface) becomes arbitrarily large for fixed layer width when the tension of the bulk interface approaches a lower critical value. We argue that in cases where we have large negative energy density, we also have an anomalously high transition temperature to the high-temperature thermal state.

hep-th↗

arXiv2021

Holographic quantum tasks with input and output regions

Quantum tasks are quantum computations with inputs and outputs occurring at specified spacetime locations. Considering such tasks in the context of AdS/CFT has led to novel constraints relating bulk geometry and boundary entanglement. In this article we consider tasks where inputs and outputs are encoded into extended spacetime regions, rather than the points previously considered. We show that this leads to stronger constraints than have been derived in the point based setting. In particular we improve the connected wedge theorem, appearing earlier in 1912.05649, by finding a larger bulk region whose existence implies large boundary correlation. As well, we show how considering extended input and output regions leads to non-trivial statements in Poincaré-AdS$_{2+1}$, a setting where the point-based connected wedge theorem is always trivial.

hep-th↗

arXiv2021

Quantum tasks require islands on the brane

In recent work, it was argued that quantum computations with inputs and outputs distributed in spacetime, or quantum tasks, impose constraints on entanglement in holographic theories. The resulting constraint was named the connected wedge theorem and can verified by a direct bulk proof using focusing arguments in general relativity. In this article we extend this work to the context of AdS/BCFT, where an end-of-the-world brane is present in the bulk. By considering quantum tasks which exploit information localized to the brane, we find a new connected wedge theorem. We apply this theorem to brane models of black holes, where it relates the formation of islands in the Ryu-Takayanagi formula to causal features of the ambient spacetime. In particular, we find that if the black hole interior is causally connected to the radiation system through the ambient spacetime, then an island forms. For constant tension branes in pure AdS the converse also holds.

hep-th↗

arXiv2021

Interpolating between multi-boundary wormholes and single-boundary geometries in holography

The recent paper 1809.01197 described how states of a holographic CFT can be approximated by states of a large collection of non-interacting BCFTs, such that the dual of the new system accurately approximates an arbitrarily large causal patch of the original geometry. In this paper, we first describe in more detail the geometries dual to such discrete BCFT systems, emphasizing that they are multi-boundary wormholes in which it is not possible to move causally between different asymptotic regions. By reintroducing couplings between the BCFTs in various ways, we show that the wormholes can be made traversable, giving an intermediate class of geometries that interpolate between the multi-boundary wormhole and the original geometry that it approximates.

hep-th↗

arXiv2021

Distributing bipartite quantum systems under timing constraints

In many quantum information processing protocols, entangled states shared among parties are an important resource. In this article, we study how bipartite states may be distributed in the context of a quantum network limited by timing constraints. We explore various tasks that plausibly arise in this context, and characterize the achievability of several of these in settings where only one-way communication is allowed. We provide partial results in the case where two-way communication is allowed. This builds on earlier work on summoning single and bipartite systems.

quant-ph↗

arXiv2020

Holographic scattering requires a connected entanglement wedge

In AdS/CFT, there can exist local 2-to-2 bulk scattering processes even when local scattering is not possible on the boundary; these have previously been studied in connection with boundary correlation functions. We show that boundary regions associated with these scattering configurations must have $O(1/G_N)$ mutual information, and hence a connected entanglement wedge. One of us previously argued for this statement from the boundary theory using operational tools in quantum information theory. We improve that argument to make it robust to small errors and provide a proof in the bulk using focusing arguments in general relativity. We also provide a direct link to entanglement wedge reconstruction by showing that the bulk scattering region must lie inside the connected entanglement wedge. Our construction implies the existence of nonlocal quantum computation protocols that are exponentially more efficient than the optimal protocols currently known.

hep-th↗

arXiv2019

Quantum tasks in holography

We consider an operational restatement of the holographic principle, which we call the principle of asymptotic quantum tasks. Asymptotic quantum tasks are quantum information processing tasks with inputs given and outputs required on points at the boundary of a spacetime. The principle of asymptotic quantum tasks states that tasks which are possible using the bulk dynamics should coincide with tasks that are possible using the boundary. We extract consequences of this principle for holography in the context of asymptotically AdS spacetimes. We argue for a novel connection between bulk causal structure and the phase transition in the boundary mutual information. Further, we note a connection between holography and quantum cryptography, where the problem of completing asymptotic quantum tasks has been studied earlier. We study the cryptographic and AdS/CFT approaches to completing asymptotic quantum tasks and consider the efficiency with which they replace bulk classical geometry with boundary entanglement.

hep-th↗

arXiv2019

Localizing and excluding quantum information; or, how to share a quantum secret in spacetime

When can quantum information be localized to each of a collection of spacetime regions, while also excluded from another collection of regions? We answer this question by defining and analyzing the localize-exclude task, in which a quantum system must be localized to a collection of authorized regions while also being excluded from a set of unauthorized regions. This task is a spacetime analogue of quantum secret sharing, with authorized and unauthorized regions replacing authorized and unauthorized sets of parties. Our analysis yields the first quantum secret sharing scheme for arbitrary access structures for which the number of qubits required scales polynomially with the number of authorized sets. We also study a second related task called state-assembly, in which shares of a quantum system are requested at sets of spacetime points. We fully characterize the conditions under which both the localize-exclude and state-assembly tasks can be achieved, and give explicit protocols. Finally, we propose a cryptographic application of these tasks which we call party-independent transfer.

quant-ph↗

arXiv2018

The holographic entropy zoo

We study the holographic dual of a two parameter family of quantities known as the $α$-$z$ divergences. Many familiar information theoretic quantities occur within this family, including the relative entropy, fidelity, and collision relative entropy. We find explicit bulk expressions for the boundary divergences to second order in a state perturbation whenever $α$ is an integer and $z\geq0$, as well as when $z\in\{0,\infty\}$ and $α\in \mathbb{R}$. Our results apply for perturbations around an arbitrary background state and in any dimension, under the assumption of the equality of bulk and boundary modular flows.

hep-th↗

arXiv2017

Thesis: Tensor networks for dynamic spacetimes

Tensor networks give simple representations of complex quantum states. They have proven useful in the study of condensed matter systems and conformal fields, and recently have provided toy models of AdS/CFT. Underlying the tensor network - AdS/CFT connection is the association of a graph geometry with the tensor network. In the context of the AdS/CFT correspondence tensor network models have so far been limited to describing static spacetimes. In this thesis we look to extend tensor network models of AdS/CFT by describing the geometry of a dynamic spacetime using a tensor network. We provide a review of tensor networks in the context of AdS/CFT to motivate this extension, before proposing modifications of holographic tensor network models that capture features of AdS/CFT with dynamic spacetimes. This thesis includes the results of arXiv submission 1611.06220, along with a review of the relevant literature.

hep-th↗

arXiv2017

Tensor networks for dynamic spacetimes

Existing tensor network models of holography are limited to representing the geometry of constant time slices of static spacetimes. We study the possibility of describing the geometry of a dynamic spacetime using tensor networks. We find it is necessary to give a new definition of length in the network and propose a definition based on the mutual information. We show that by associating a set of networks with a single quantum state and making use of the mutual information based definition of length, a network analogue of the maximin formula can be used to calculate the entropy of boundary regions.

hep-th↗

arXiv2016

Summoning Information in Spacetime, or Where and When Can a Qubit Be?

One of the most important properties of quantum information, and the one ultimately responsible for its cryptographic applications, is that it can't be copied. That statement, however, is not completely accurate. While the no-cloning theorem of quantum mechanics prevents quantum information from being copied in space, the reversibility of microscopic physics actually requires that the information be copied in time. In spacetime as a whole, therefore, quantum information is widely replicated but in a restricted fashion. We fully characterize which regions of spacetime can all hold the same quantum information. Because quantum information can be delocalized through quantum error correction and teleportation, it need not follow well-defined trajectories. Instead, replication of the information in any configuration of spacetime regions not leading to violations of causality or the no-cloning principle is allowed. To demonstrate this, we answer the operational question of exactly when the information can be summoned to a set of spacetime points, showing how to do so efficiently using a combination of teleportation and codeword-stabilized quantum codes. This provides a simple and complete description of where and when a qubit can be located in spacetime, revealing a remarkable variety of possibilities.

quant-ph↗