Quantum Information

Quantum error-correcting codes are a key pillar of quantum computing. They allow for the recovery of quantum information in the presence of noise. There are three main ways to depict a quantum code: by the list of codewords, by an encoding circuit, or by a stabilizer tableau. Although the latter is used most often, all three of these have pros and cons. In this talk, I will showcase ZX calculus, a graphical language that can be used to talk about quantum states, circuits, measurements, and importantly, codes. I will demonstrate its power and versatility and showcase a canonical form for states, circuits, and codes. The power of this theorem allows us to compile these quantum objects to a unique, elegant, and simple form which serves as a much better depiction than any of the three methods above.

---

Zoom link https://pitp.zoom.us/j/91431057660?pwd=cW9xKzNXejdIekp3amFacFZ5OHN5dz09

Measuring the temperature of your coffee should not change the amount of coffee in your cup. This holds because the operators representing the coffee’s energy and volume commute. The intuitive assumption that conserved quantities, also known as charges, commute, underpins basic physics derivations, like that of the thermal state's form and Onsager coefficients. Yet, operators' failure to commute plays a key role in quantum theory, e.g. underlying uncertainty relations. Lifting this assumption has spawned a growing subfield of quantum many-body physics [1].

How can one argue that charges’ noncommutation caused a result? To isolate the effects of charges’ noncommutation, we created analogous models that differ in whether their charges commute and discovered more entanglement in the noncommuting-charge model [2]. We further introduce noncommuting charges (an SU(2) symmetry) into monitored quantum circuits, circuits with unitary evolutions and mid-circuit projective measurements. Numerically, we find that the SU(2)-symmetric model has a critical phase in place of the area-law phase typically found in these circuits [3]. I will focus on the results from Ref 2 and 3. Time permitting, I'll briefly explain how one can use Lie Algebra theory to build the Hamiltonians necessary for testing the predictions of noncommuting charge physics [4].

[1] Majidy et al. "Noncommuting conserved charges in quantum thermodynamics and beyond." Nat Rev Phys (2023)
[2] Majidy et al. "Non-Abelian symmetry can increase entanglement entropy.” PRB (2023)
[3] Majidy et al. "Critical phase and spin sharpening in SU(2)-symmetric monitored quantum circuits." PRB (2023)
[4] Yunger Halpern and Majidy “How to build Hamiltonians that transport noncommuting charges in quantum thermodynamics” npj QI (2022)

---

Zoom link https://pitp.zoom.us/j/97193579200?pwd=MkdmbWo1S2lUcUZtUFpORk5VbnFBdz09

Squeezing has proven to be a powerful tool for suppressing noise in bosonic quantum sensing and communication. However, it is fragile and the resulting quantum advantage is extremely vulnerable to loss and noise. In this seminar, I will first overview the method of formulating loss and noise and thereby characterizing the practical quantum advantages. Then I will present our recent progress on entanglement-assisted protocols using two-mode squeezed-vacuum states, which are robust to loss and noise. I will demonstrate the quantum advantages in three scenarios: dark matter search, absorption spectroscopy, and telecommunication. Notably, we derived the ultimate precision limit of noise sensing and dark matter search. As a result, we found the two-mode squeezed vacuum is the optimal quantum source for dark matter search at the limit of strong squeezing. This optimality extends to entanglement-assisted communication. In each of the presented scenarios, entanglement-assisted protocols yield quantum advantages of orders of magnitude over classical protocols.

---

Zoom link https://pitp.zoom.us/j/94873478582?pwd=c1dxNEVtMGx0ZU4vZjRvTU5OakZoUT09

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

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

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

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