Quantum Information

Simulation of quantum magnetism with AMO systems is now a fully fledged enterprise. In this talk, I will discuss how Rydberg molecular interactions can be exploited to simulate indirect spin-spin coupling, with Rydberg atoms acting as localized impurities. Engineering chiral spin Hamiltonians with Rydberg atoms is also described.

"We present our recent studies on Rydberg atom-Ion interactions and the spatial imaging of a novel type of molecular ion using a high-resolution ion microscope. The ion microscope provides an exceptional spatial and temporal resolution on a single atom level, where a highly tuneable magnification ranging from 200 to over 1500, a resolution better than 200nm and a depth of field of more than 70µm were demonstrated [1]. A pulsed operation mode of the microscope combined with the excellent electric field compensation enables the study of highly excited Rydberg atoms and ion-Rydberg atom hybrid systems. Using the ion microscope, we observed a novel molecular ion, where the bonding mechanism is based on the interaction between the ionic charge and an induced flipping dipole of a Rydberg atom [2]. Furthermore, we could measure the vibrational spectrum and spatially resolve the bond length and the angular alignment of the molecule. The excellent time resolution of the microscope enables probing of the interaction dynamics between the Rydberg atom and the ion. [1] C. Veit, N. Zuber, O. A. Herrera-Sancho, V. S. V. Anasuri, T. Schmid, F. Meinert, R. Löw, and T. Pfau, Pulsed Ion Microscope to Probe Quantum Gases, Phys. Rev. X 11, 011036 (2021). [2] N. Zuber, V. S. V. Anasuri, M. Berngruber, Y.-Q. Zou, F. Meinert, R. Löw, T. Pfau, Spatial imaging of a novel type of molecular ions, Nature 5, 453 (2022)"

While quantum computers are naturally well-suited to implementing linear operations, it is less clear how to implement nonlinear operations on quantum computers. However, nonlinear subroutines may prove key to a range of applications of quantum computing from solving nonlinear equations to data processing and quantum machine learning. Here we develop algorithms for implementing nonlinear transformations of input quantum states. Our algorithms are framed around the concept of a weighted state, a mathematical entity describing the output of an operational procedure involving both quantum circuits and classical post-processing.

Zoom Link: https://pitp.zoom.us/j/92831825506?pwd=T2VUQ2M2QlZERmRmUHZ0T1VOelkzZz09

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

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

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

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 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

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