Quantum Physics

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

One hundred years after Heisenberg’s Uncertainty Principle, the question of how to make simultaneous measurements of noncommuting observables lingers. I will survey one hundred years of measurement theory, which brings us to the point where we can formulate how to measure any set observables weakly and simultaneously and then concatenate such measurements continuously to determine what is a strong measurement of the same observables. The description of the measurements is independent of quantum states---this we call instrument autonomy---and even independent of Hilbert space---this we call the universal Instrument Manifold Program. But what space, if not Hilbert space? It’s a whole new world: the Kraus operators of an instrument live in a Lie-group manifold generated by the measured observables themselves. I will describe measuring position and momentum and measuring the three components of angular momentum, special cases where the instrument approaches asymptotically a phase-space boundary of the instrumental Lie-group manifold populated by coherent states; these special universal instruments structure any Hilbert space in which they are represented. In contrast, for almost all sets of observables other than these special cases, the universal instrument descends into chaos ... literally. This work was done with Christopher S. Jackson, whose genius and vision inform every aspect.

---

Zoom link https://pitp.zoom.us/j/94135518267?pwd=T2JOL21VaEcrY05KeG1SYTVYdHhxdz09