Quantum Information

Quantum information science was initially motivated by questions about information processing. For example, what are the consequences of quantum mechanics for computation? Or for cryptography? More recently, quantum information has also become a perspective through which we can study questions in theoretical physics more broadly, including in condensed matter and quantum gravity. While quantum information considers the constraints of quantum mechanics, there are additional constraints on information implied by relativity. In particular, it is impossible to send information faster than the speed of light. In this talk, I consider constraints on information processing imposed by quantum mechanics and relativity together, and the consequences of these constraints for quantum gravity. Doing so reveals novel aspects of how gravitational degrees of freedom can be recorded into a quantum mechanical system, and how an extra dimension can be recorded into ``holographic'' field theories.

Zoom Link: https://pitp.zoom.us/j/99249375009?pwd=QWZyZzQrNXJwSGYyYTZheGwwaVRndz09

We are used to thinking of there being different types of fault-tolerant gates allowing reliable computation on states in a noisy quantum computer: Some are transversal, some involve measurement and magic states, some involve topological manipulations, etc.  In this talk, we will demonstrate that transversal gates can be seen as a topological effect, and we will propose an over-arching framework for thinking about fault tolerance in terms of fiber bundles over the Grassmanian, the manifold of subspaces of Hilbert space.  The violin will harmonize with the chalkboard to put the talk to music.

Zoom Link: https://pitp.zoom.us/j/97600230984?pwd=NDJ4VjdvUS9palA4YzFnZHBwcnJkUT09

Quantum error correction and symmetries are two key notions in quantum information and physics. The competition between them has fundamental implications in fault-tolerant quantum computing, many-body physics and quantum gravity. We systematically study the competition between quantum error correction and continuous symmetries associated with a quantum code in a quantitative manner. We derive various forms of trade-off relations between the quantum error correction inaccuracy and three types of symmetry violation measures. We introduce two frameworks for understanding and establishing the trade-offs based on the notions of charge fluctuation and gate implementation error. From the perspective of fault-tolerant quantum computing, we demonstrate fundamental limitations on transversal logical gates. We also analyze the behaviors of two near-optimal codes: a parametrized extension of the thermodynamic code, and quantum Reed–Muller codes.

Zoom Link: TBD

We study the entanglement dynamics of quantum many-body systems at long times. For upper bounds, we prove the following: (I) For any geometrically local Hamiltonian on a lattice, starting from a random product state the entanglement entropy is bounded away from the maximum entropy at all times with high probability. (II) In a spin-glass model with random all-to-all interactions, starting from any product state the average entanglement entropy is bounded away from the maximum entropy at all times. We also extend these results to any unitary evolution with charge conservation and to the Sachdev-Ye-Kitaev model. For lower bounds, we say that a Hamiltonian is an ``extensive entropy generator'' if starting from a random product state the entanglement entropy obeys a volume law at long times with overwhelming probability. We prove that (i) any Hamiltonian whose spectrum has non-degenerate gaps is an extensive entropy generator; (ii) in the space of (geometrically) local Hamiltonians, the non-degenerate gap condition is satisfied almost everywhere. These results imply ``unbounded growth of entanglement’’ in many-body localized systems.
References: arXiv:2102.07584 & 2104.02053

Zoom Link: https://pitp.zoom.us/j/96027097746?pwd=R2V2ZktJZUV1VkliN3pzM0IzbGR0UT09

The past decade has seen an explosion of research into resource theories—simple, quantum-information-theoretic models for constrained agents. Resource theories have provided foundational insights about thermodynamics, entanglement, and more. Yet whether resource theories can inform science outside our neighborhood of quantum information theory has been an outstanding question. I will present what is, to my knowledge, the first application of a resource theory to answer a pre-existing question in another field. Molecular switches, or photoisomers, surface across nature and technologies, from our eyes to solar-fuel cells. What probability does a switch have of switching? A general answer defies standard chemistry tools, as photoisomers are small, quantum and far from equilibrium. I will bound the switching probability by modeling a photoisomer within a thermodynamic resource theory. This work has helped pave the path for resource theories to impact science broadly.

References
• NYH and Limmer, Phys. Rev. A 101, 042116 (2020). https://journals.aps.org/pra/
abstract/10.1103/PhysRevA.101.042116
• NYH, in Eddington, Wheeler, and the Limits of Knowledge, Eds. Durham and
Rickles, Springer (2017) arXiv:1509.03873.

Zoom Link: https://pitp.zoom.us/j/99315796008?pwd=dDJBMjR2ckRmdlhtdWJZeHJuNUI1QT09

We generalize the concept of folding from surface codes to CSS codes by considering certain dualities within them. In particular, this gives a general method to implement logical operations in suitable LDPC quantum codes using transversal gates and qubit permutations only. To demonstrate our approach, we specifically consider a [[30, 8, 3]] hyperbolic quantum code called Bring's code. Further, we show that by restricting the logical subspace of Bring's code to four qubits, we can obtain the full Clifford group on that subspace.

Zoom Link: https://pitp.zoom.us/j/94852018243?pwd=RmFHM1QyNS9CK0RMRm5yUEt0MzdSZz09

The Page curve describing the radiation entropy of a unitarily evaporating black hole has recently been obtained by new calculations based on the replica trick. We analyse the discrepancy between these and Hawking's original conclusions from a quantum information theory viewpoint, using in particular the quantum de Finetti theorem. The theorem implies the existence of extra information, W, which is neither part of the black hole nor the radiation, but plays the role of a reference. The entropy obtained via the replica trick can then be identified to be the entropy S(R|W) of the radiation conditioned on the reference W, whereas Hawking's original result corresponds to the non-conditional entropy S(R). The entropy S(R|W), which mathematically is an ensemble average, gains an operational meaning in an experiment with N independently prepared black holes: for large N, it equals the regularized entropy of their joint radiation, S(R_1…R_N)/N. The discrepancy between this entropy and S(R) implies that the black holes are correlated, that is geometrically captured by the replica wormholes. In total, I will give three different interpretations of the radiation entropy calculated via the replica trick. Furthermore, I will briefly discuss the implications of ensemble interpretation in light of free probability theory, which offers the tools to deal with the effect of replica symmetry breaking in a refined calculation of the radiation entropy. (Based on the joint work (https://arxiv.org/abs/2110.14653) with Renato Renner.)

Zoom Link: https://pitp.zoom.us/j/93221648666?pwd=TkwrS0pMYjlLa090WCtCYjd0Nk9RZz09

Fracton models provide examples of novel gapped quantum phases of matter that host intrinsically immobile excitations and therefore lie beyond the conventional notion of topological order. Here, we calculate optimal error thresholds for quantum error correcting codes based on fracton models. By mapping the error-correction process for bit-flip and phase-flip noises into novel statistical models with Ising variables and random multi-body couplings, we obtain models that exhibit an unconventional subsystem symmetry instead of a more usual global symmetry. We perform large-scale parallel tempering Monte Carlo simulations to obtain disorder-temperature phase diagrams, which are then used to predict optimal error thresholds for the corresponding fracton code. Remarkably, we found that the X-cube fracton code displays a minimum error threshold (7.5%) that is much higher than 3D topological codes such as the toric code (3.3%), or the color code (1.9%). This result, together with the predicted absence of glass order at the Nishimori line, shows great potential for fracton phases to be used as quantum memory platforms. If time allows, I will also present some of our more recent progress on fractons.

Reference: arXiv:2112.05122.

Zoom Link: https://pitp.zoom.us/j/97053396111?pwd=Ny9tK295dGVacENJMzg0aHRObjZEZz09

Quantum complexity is emerging as a key property of many-body systems, including black holes, topological materials, and early quantum computers. A state's complexity quantifies the number of computational gates required to prepare the state from a simple tensor product. The greater a state's distance from maximal complexity, or ``uncomplexity,'' the more useful the state is as input to a quantum computation. Separately, resource theories -- simple models for agents subject to constraints -- are burgeoning in quantum information theory. We unite the two domains, confirming Brown and Susskind's conjecture that a resource theory of uncomplexity can be defined. The allowed operations, fuzzy operations, are slightly random implementations of two-qubit gates chosen by an agent. We formalize two operational tasks, uncomplexity extraction and expenditure. Their optimal efficiencies depend on an entropy that we engineer to reflect complexity. We also present two monotones, uncomplexity measures that decline monotonically under fuzzy operations, in certain regimes. This work unleashes on many-body complexity the resource-theory toolkit from quantum information theory.

Zoom Link: https://pitp.zoom.us/j/96197686002?pwd=R2dPbTY3TEMxQWdESWpYeno3VDlOZz09

The sustained storage, transmission, or processing of quantum information will likely be a non-equilibrium process that requires monitoring the system and applying some form of feedback to produce fault-tolerance.  In this talk, I will discuss a class of models based on random quantum circuits with intermediate measurements that display a similar phenomenology to standard models for fault-tolerance, including the existence of a threshold, but with several helpful simplifications.  However, naïve realizations of the threshold require an exponential number of repetitions of the experiment to fully explore the output space of the intermediate measurements.  Recently, it has been proposed that this problem can be circumvented by developing efficient entanglement “decoders” that have close parallels to quantum error correction decoders.  We show how to leverage modern machine learning tools to devise a neural network decoder to detect the phase transition. We then study the complexity and scalability of this approach and discuss how it can be utilized to detect entanglement phase transitions in generic experiments.

Zoom Link: https://pitp.zoom.us/j/99123641139?pwd=VmkyR3BSNWF5bURVYmFVakp0ZkNRZz09

Many-electron problems pose some of the greatest challenges in computational science, with important applications across many fields of modern science. Fermionic quantum Monte Carlo (QMC) methods are among the most powerful approaches to these problems. However, they can be severely biased when controlling the fermionic sign problem using constraints, as is necessary for scalability. Here we propose an approach that combines constrained QMC with quantum computing tools to reduce such biases. We experimentally implement our scheme using up to 16 qubits in order to unbias constrained QMC calculations performed on chemical systems with as many as 120 orbitals. These experiments represent the largest chemistry simulations performed on quantum computers (more than doubling the size of prior electron correlation calculations), while obtaining accuracy competitive with state-of-the-art classical methods. Our results demonstrate a new paradigm of hybrid quantum-classical algorithm, surpassing the popular variational quantum eigensolver in terms of potential towards the first practical quantum advantage in ground state many-electron calculations.