Quantum Foundations

We show that if a massive (or charged) body is put in a quantum superposition of spatially separated states in the vicinity of any (Killing) horizon, the mere presence of the horizon will eventually destroy the coherence of the superposition in a finite time. This occurs because, in effect, the long-range fields sourced by the superposition register on the black hole horizon which forces the emission of entangling “soft gravitons/photons” through the horizon. This enables the horizon to harvest “which path” information about the superposition. We provide estimates of the decoherence time for such quantum superpositions in the presence of a black hole and cosmological horizon. Finally, we further sharpen and generalize this mechanism by recasting the gedankenexperiment in the language of (approximate) quantum error correction. This yields a complementary picture where the decoherence is due to an “eavesdropper” (Eve) in the black hole attempting to obtain "which path" information by measuring the long-range fields of the superposed body. We explicitly compute the quantum fidelity to determine the amount of information such an Eve can obtain and show, by the information-disturbance tradeoff, a direct relationship between the information gained by Eve and the decoherence of the superposition in the exterior. In particular, we show that the decoherence of the superposition corresponds to the "optimal" measurement made by Eve in the black hole interior.

We quantize JT gravity with matter on the spatial interval with two asymptotically AdS boundaries. We consider the von Neumann algebra generated by the right Hamiltonian and the gravitationally dressed matter operators on the right boundary. We prove that the commutant of this algebra is the analogously defined left boundary algebra and that both algebras are type II infinity factors. These algebras provide a precise notion of the entanglement wedge away from the semiclassical limit.

We argue that generic local subregions in semiclassical quantum gravity are associated with von Neumann algebras of type II_1, extending recent work by Chandrasekaran et.al. beyond subregions bounded by Killing horizons. The subregion algebra arises as a crossed product of the type III_1 algebra of quantum fields in the subregion by the flow generated by a gravitational constraint operator. We conjecture that this flow agrees with the vacuum modular flow sufficiently well to conclude that the resulting algebra is type II_\infty, which projects to a type II_1 algebra after imposing a positive energy condition. The entropy of semiclassical states on this algebra can be computed and shown to agree with the generalized entropy by appealing to a first law of local subregions. The existence of a maximal entropy state for the type II_1 algebra is further shown to imply a version of Jacobson’s entanglement equilibrium hypothesis. We discuss other applications of this construction to quantum gravity and holography, including the quantum extremal surface prescription and the quantum focusing conjecture.

In holography, the quantum extremal surface formula relates the entropy of a boundary state to the sum of two terms: the area term and the entropy of bulk fields inside the entanglement wedge. As the bulk effective field theory suffers from UV divergences, the second term must be regularized. It has been conjectured since the work of Susskind and Uglum that the renormalization of Newton’s constant in the area term exactly cancels the difference between different choices of regularization for bulk entropy. In this talk, I will explain how the recent developments on von Neumann algebras appearing in the large N limit of holography allow to prove this claim within the framework of holographic quantum error correction, and to reinterpret it as an instance of the ER=EPR paradigm. This talk is based on the paper arXiv:2302.01938.

It is often the case that interaction with a quantum system does not simply occur between an initial point in time and a final one, but rather over many time steps. In such cases, an interaction at a given time step can have an influence on the dynamics of the system at a much later time. Just as quantum channels model dynamics between two time steps, quantum combs model the more general multi-time dynamics described above, and have accordingly found application in such fields as open quantum systems and quantum cryptography. In this talk, we will consider ensembles of combs indexed by a random variable, dubbed classical-quantum combs, and discuss how much can be learnt about said variable through interacting with the system. We characterise the amount of information gain using the comb min-entropy, an extension of the analogous entropic quantity for quantum states. With combs and the min-entropy in our toolbox, we turn to a number of applications largely inspired by Measurement-Based Quantum Computing (MBQC), including the security analysis of a specific Blind Quantum Computing protocol and some comments regarding learning causal structure.

Zoom Link: https://pitp.zoom.us/j/98315660866?pwd=cWU3RzB6SG9DOGIza1BqV1lqNklvQT09

Every unitary map with a factorisation of domain and codomain into subsystems has a well-defined causal structure given by the set of influence relations between its input and output subsystems. A causal decomposition of a unitary map U is, roughly, one that makes all there is to know about U in terms of causal structure evident and understandable in compositional terms. We'll argue that this is more than just about drawing more intuitive pictures for the causal structure of U -- it is about really understanding it at all. Now, it has been known for a while that decompositions in terms of ordinary circuit diagrams do not suffice to this end and that at least so called 'extended circuit diagrams', or 'routed circuit diagrams' are necessary, revealing a close connection between causal structure and algebraic structures that involve a particular interplay of direct sum and tensor product. Though whether or not these sorts of routed circuit diagrams suffice has been an open question since. I will give an introduction and overview of this business of causal decompositions of unitary maps, and share what is an on-going thriller.

Zoom link:  https://pitp.zoom.us/j/95689128162?pwd=RFNqWlVHMFV0RjRaakszSTBsWkZkUT09

Causal reasoning is vital for effective reasoning in many domains, from healthcare to economics. In medical diagnosis, for example, a doctor aims to explain a patient’s symptoms by determining the diseases causing them. This is because causal relations, unlike correlations, allow one to reason about the consequences of possible treatments and to answer counterfactual queries. In this talk I will present two recent causal inference projects done with my collaborators deriving new algorithms to solve problems that arise when applying causal inference in the real world.

"Linear structural equation models relate random variables of interest via a linear equation system that features stochastic noise. The models are naturally represented by directed graphs whose edges indicate non-zero coefficients in the linear equations. In this talk I will report on progress on combinatorial conditions for parameter identifiability in models with latent (i.e., unobserved) variables. Identifiability holds if the coefficients associated with the edges of the graph can be uniquely recovered from the covariance matrix they define. Paper: https://doi.org/10.1214/22-AOS2221 or https://arxiv.org/abs/2201.04457"

In a recent paper, Chaturvedi et al considered the interesting idea of routed Bell experiments. These are Bell experiments where Bob can measure his quantum particles at two distinct locations, one close to the source and another far away. This can be accomplished in the lab by using a switch that directs Bob's quantum particle either to the nearby measurement device or to the distant one, depending on a classical input chosen by Bob. Chaturvedi et al argue that there exists in such experiments a tradeoff between short-range and long-range correlations and that high-quality CHSH tests close to the source (which are achievable with current technology) lower the requirements for witnessing nonlocality faraway from the source, and in particular increase their tolerance to particle losses. We critically review their results and present a simple counterexample to it. We then introduce a class of hybrid quantum-classical models, which we refer to as "short-range quantum models". These models suitably capture the tradeoff between short-range and long-range correlations in routed Bell experiments. Using our definition, we explore new nonlocal tests in which high-quality short-range correlations lead to weakened conditions for long-range tests. Although we do find improvements, they are significantly smaller than those claimed by CVP.

"Many relevant tasks in Quantum Information processing can be expressed as polynomial optimization problems over states and operators. In the earlier talk by David, we saw that this is also the case for certain (quantum) causal compatibility and causal optimization problems. This talk will focus on several closely related semidefinite programming (SDP) hierarchies that have recently been shown to be complete for such polynomial optimization problems [arxiv:2110.14659, 2212.11299, 2301.12513]. We give a high-level overview of the techniques and mathematics that are needed for proving such statements. In particular, we will see a version of a Quantum De Finetti theorem, as well as a sketch of a constructive proof of convergence for the SDP hierarchies. Afterwards, these results are linked back to the causal compatibility problem to conclude that such SDP hierarchies are complete for a certain type of causal structures known as tree networks."

"Is there a complete semi-definite programming hierarchy for quantum causal problems? We divide the question into two parts. First: Can quantum causal problems be expressed as polynomial optimization problems (this talk). Second: Can this class of polynomial optimizations be solved by means of SDPs (Laurens' talk). The optimizations we consider here are ""polynomial"" in two ways. They are over the unknown observable algebra of the hidden systems, which are specified by non-commutative polynomials in a set of generators. But they also involve independence constraints, which are commutative polynomials in the state. A hierarchy of such polynomial tests is complete if one can construct a quantum model for any observed distribution that passes all of them. We've recently had some success in finding such constructions, but also ran into problems in the general case [1, 2]. I give a high-level presentation of the state of the play. [1] https://arxiv.org/abs/2110.14659 [2] https://arxiv.org/abs/2212.11299"