Quantum Physics

In the usual operational picture, operations are represented by boxes having inputs and outputs. Further, we usually consider the causally simple case where the inputs are prior to the outputs for each such operation. In this talk (motivated by an attempt to formulate an operational probabilistic field theory) I will consider what I call the "causally complex" situation. Operations are represented by circles. These circles have wires going in and out. Each such wire can represent an input and an output. Further, each operation will have a causal diagram associated with it. The causal structure can be more complicated than the simple case. These circles can be joined together to create new operations. I will discuss conditions on these causally complex operations so that we have positivity (probabilities are non-negative) and causality (to be understood in a time symmetric manner). I will also discuss how these properties compose when we join causally complex operations. Causally complex operations are related to objects in the causaloid formalism as well as to quantum combs.

---

Zoom link https://pitp.zoom.us/j/99425886198?pwd=ODR0VVFzQUJHeER4OVJ2cEo3cVdDQT09

We will present a teleportation protocol which uses the properties of superoscillatory wavefunctions. Then we will briefly introduce a different protocol, the port based teleportation. We will use it to study teleportation over infinitesimally small distances, where the vacuum of a quantum field serves as the source of entanglement. We find that the resulting motion is equivalent to a quantum teleportation-induced Brownian motion. Purifying the interactions, from measurements to unitary operations, leads to motion described by Schrodinger’s equation. Therefore, we find that the notions of teleportation and continuous quantum and classical motion are unified in this sense.

--- 

Zoom link https://pitp.zoom.us/j/93504138534?pwd=VUFPSXpRd2g0TVNxVTNlY3Rxa1ZjUT09

Holography with branes and/or cutoff surfaces presents a promising approach to studying quantum gravity beyond asymptotically anti-de Sitter spacetimes. However, this generalized holography is known to face several inconsistencies, including potential violations of causality and fundamental entropic inequalities. In this talk, we address these challenges by investigating the bulk scattering process and its holographic realization. Specifically, we propose that causality of a radially propagating excitation should be an induced one originating from a fictitious boundary behind the brane/cutoff surface. We present its consistency by checking the connected wedge theorem supported from quantum cryptography and (strong) subadditivity of holographic entanglement entropies. While the induced light cone seemingly permits superluminal signaling, we argue that this causality violation can be an artifact of state preparation in our picture. This talk is based on 2308.00739 [10.1007/JHEP10(2023)104] with Beni Yoshida.

---

Zoom link https://pitp.zoom.us/j/98252951858?pwd=RVNZUjNVM2JkZXRlSXJVbEZ6cUpsUT09

Obtaining a description of cosmology is a central open problem in holography. Studying simple models can help us gain insight on the generic properties of holographic cosmologies. In this talk I will describe the construction of entangled microstates of a pair of holographic CFTs whose dual semiclassical description includes big bang-big crunch AdS cosmologies in spaces without boundaries. The cosmology is supported by inhomogeneous heavy matter and it partially purifies the bulk entanglement of two auxiliary AdS spacetimes. In generic settings, the cosmology is an entanglement island contained in the entanglement wedge of one of the two CFTs. I will then describe the properties of the non-isometric bulk-to-boundary encoding map and comment on an explicit, state-dependent boundary representation of operators acting on the cosmology. Finally, if time allows, I will argue for a non-isometric to approximately-isometric transition of the encoding of "simple" cosmological states as a function of the bulk entanglement, with tensor network toy models of the setup as a guide.

---

Zoom link https://pitp.zoom.us/j/93483219872?pwd=TGpJVVlaNDVGWTN5ZHpkTHp6a2hTZz09

Out of the many lessons quantum mechanics seems to teach us, one is that it seems there are things we cannot experimentally have access to. There is, indeed, a fundamental limit to our ability to experimentally explore the world. In this work we accept this lesson as a fact and we build a general theory based on this principle. We start by assuming the existence of statements whose truth value is not experimentally accessible. That is, there is no way, not even in theory, to directly test if these statements are true or false. We further develop a theory in which experimentally accessible statements are a union of a fixed minimum number of inaccessible statements. For example, the value of truth of the statements a and b is not accessible, but the value of truth of the statement “a or b" is accessible. We do not directly assume probability theory, we exclusively define experimentally accessible and inaccessible statements and build on these notions using the rules of classical logic. We find that an interesting structure emerges. Developing this theory, we relax the logical structure, naturally obtaining a derivation of a constrained quasi-probabilistic theory rich in structure that we name theory of inaccessible information. Surprisingly, the simplest model of theory of inaccessible information is the qubit in quantum mechanics. Along the path for the construction of this theory, we characterise and study a family of multiplicative information measures that we call inaccessibility measures. arXiv:https://arxiv.org/abs/2305.05734

---

Zoom link https://pitp.zoom.us/j/91350754706?pwd=V1dVdGM3Zk9MNkp4VlpCYUoxbXg3UT09

Classical simulation techniques are widely used in quantum computation and condensed matter physics. In this talk I will describe algorithms for classically simulating measurement of an n-qubit quantum state in the standard basis, that is, sampling a bit string from the probability distribution determined by the Born rule. Our algorithms reduce the sampling task (known as weak simulation) to computing poly(n) amplitudes of n-qubit states (strong simulation). Two classes of quantum states are considered: output states of polynomial-size quantum circuits and ground states of local Hamiltonians with an inverse polynomial energy gap. We show that our algorithm can significantly accelerate quantum circuit simulations based on tensor network contraction and low-rank stabilizer decompositions. To sample ground state probability distributions we employ the fixed-node Hamiltonian construction, previously used in Quantum Monte Carlo simulations to address the fermionic sign problem. We implement the proposed sampling algorithm numerically and use it to sample from the ground state of Haldane-Shastry Hamiltonian with up to 56 qubits. 

Joint work with Giuseppe Carleo, David Gosset, and Yinchen Liu

---

Zoom link https://pitp.zoom.us/j/93297869296?pwd=TVpRdVJmU3lWZjVQM3NNKzBucVVRUT09

We report a deterministic and exact protocol to reverse any unknown qubit-unitary and qubit-encoding isometry operations. To avoid known no-go results on universal deterministic exact unitary inversion, we consider the most general class of protocols transforming unknown unitary operations within the quantum circuit model, where the input unitary operation is called multiple times in sequence and fixed quantum circuits are inserted between the calls. In the proposed protocol, the input qubit-unitary operation is called 4 times to achieve the inverse operation, and the output state in an auxiliary system can be reused as a catalyst state in another run of the unitary inversion. This protocol only applies only for qubit-unitary operations, but we extend this protocol to any qubit-encoding isometry operations. We also present the simplification of the semidefinite programming for searching the optimal deterministic unitary inversion protocol for an arbitrary dimension presented by M. T. Quintino and D. Ebler [Quantum 6, 679 (2022)]. We show a method to reduce the large search space representing all possible protocols, which provides a useful tool for analyzing higher-order quantum transformations for unitary operations.

---

Zoom link https://pitp.zoom.us/j/92900413520?pwd=a1JqU1IzMVdSRGQreWJIbEFCT2hWUT09

Quantum systems typically reach thermal equilibrium rather quickly when coupled to an external thermal environment. The usual way of bounding the speed of this process is by estimating the spectral gap of the dissipative generator. However, the gap, by itself, does not always yield a reasonable estimate for the thermalization time in many-body systems: without further structure, a uniform lower bound on it only constraints the thermalization time to be polynomially growing with system size. In this talk, we will discuss that for all 2-local models with commuting Hamiltonians, the thermalization time that one can estimate from the gap is in fact much smaller than direct estimates suggest: at most logarithmic in the system size. This yields the so-called rapid mixing of dissipative dynamics. We will show this result by proving that a finite gap directly implies a lower bound on the modified logarithmic Sobolev inequality (MLSI) for the class of models we consider. The result is particularly relevant for 1D systems, for which we can prove rapid thermalization with a constant decay rate, giving a qualitative improvement over all previous results. It also applies to hypercubic lattices, graphs with exponential growth rate, and trees with sufficiently fast decaying correlations in the Gibbs state. This has consequences for the rate of thermalization towards Gibbs states, and also for their relevant Wasserstein distances and transportation cost inequalities.

---

Zoom link https://pitp.zoom.us/j/91315419731?pwd=TGpFTjlHWEJZVWZkdTh6bDFKMjhQZz09

Supermaps are higher-order transformations taking maps as input.  We consider quantum algorithms implementing supermaps for the input given by unknown Hamiltonian dynamics, which can be regarded as infinitely divisible unitary operations.  We first show a quantum algorithm that approximately but universally transforms black-box Hamiltonian dynamics into controlled Hamiltonian dynamics utilizing a higher-order transformation called neutralization.  Then, we present another universal algorithm that efficiently simulates linear transformations of any Hamiltonian consisting of a polynomial number of terms in system size, using only controlled-Pauli gates and time-correlated randomness.  This algorithm for implementing Hamiltonian supermaps is an instance of quantum functional programming, where the desired function is specified as a concatenation of higher-order quantum transformations. As examples, we demonstrate the simulation of negative time-evolution and time-reversal, and perform a Hamiltonian learning task.

References:

Q. Dong, S. Nakayama, A. Soeda and M. Murao, arXiv:1911.01645v3
T. Odake, Hlér Kristjánsson, A. Soeda M. Murao, arXiv:2303.09788

---

Zoom Link: https://pitp.zoom.us/j/94278362588?pwd=MGszYk9uN1A3K1RTOVhYSGpkL1FQdz09

The Bekenstein bound posits a maximum entropy for matter with finite energy confined to a spacetime region. It is often interpreted as a fundamental limit on the information that can be stored by physical objects. In this work, we test this interpretation by asking whether the Bekenstein bound imposes constraints on a channel's communication capacity, a context in which information can be given a mathematically rigorous and operationally meaningful definition. We first derive a bound on the accessible information and demonstrate that the Bekenstein bound constrains the decoding instead of the encoding. Then we study specifically the Unruh channel that describes a stationary Alice exciting different species of free scalar fields to send information to an accelerating Bob, who is therefore confined to a Rindler wedge and exposed to the noise of Unruh radiation. We show that the classical and quantum capacities of the Unruh channel obey the Bekenstein bound. In contrast, the entanglement-assisted capacity is as large as the input size even at arbitrarily high Unruh temperatures. This reflects that the Bekenstein bound can be violated if we do not properly constrain the decoding operation in accordance with the bound. We further find that the Unruh channel can transmit a significant number of zero-bits, which are communication resources that can be used as minimal substitutes for the classical/quantum bits needed for many primitive information processing protocols, such as dense coding and teleportation. We show that the Unruh channel has a large zero-bit capacity even at high temperatures, which underpins the capacity boost with entanglement assistance and allows Alice and Bob to perform quantum identification. Therefore, unlike classical bits and qubits, zero-bits and their associated information processing capability are not constrained by the Bekenstein bound. (This talk is based on the recent work (https://arxiv.org/abs/2309.07436) with Patrick Hayden.)

---

Zoom link: https://pitp.zoom.us/j/98778081764?pwd=WktjNU84R3NWRXNyVmt1eDVMK2JnUT09

In this informal talk, I shall give a short introduction to the field of higher-order quantum transformations, including its subfield of indefinite causal order. I shall discuss some of the motivations and important results in the field, current research directions and open problems, as well potential applications in quantum information processing.

I will begin by reviewing the general mathematical concept of representation. I will then show that representation theory is more generally applicable than one might expect, for example in quantum foundations, in quantum gravity and in machine learning. In those contexts, I will first talk about the notion of representation underlying phenomena of emergence in quantum gravity. I will then discuss how quantum reference frames might be viewed as representations. Finally, I will talk about how transformer models, such as GPT-4, construct representations of what they learn and, in that light, what it may take for machines to reach AGI or even consciousness.  

---

Zoom link: https://pitp.zoom.us/j/99349397588?pwd=T056VjZXRWZWT28zY3VOZHFDcmQ3QT09