An exciting promise of quantum simulators is to enable a first-principles look into the real-time dynamics of matter after high-energy collisions of hadrons and nuclei, which mimic conditions in the early universe. To realize such a promise, first the gauge theories of the Standard Model should be mapped to quantum simulators. Then complex initial states, in the form of moving wave packets of composite (bound) states of elementary constituents, need to be prepared. While much progress has happened in the former in recent years, developments in the latter are just starting to gain momentum. In this talk, I will provide three examples from our recent work to demonstrate concrete proposals and algorithms for hadronic wave-packet preparations in confining models, from Ising spin systems to the low-dimensional abelian lattice gauge theories. These examples involve a range of platforms, from (solid-state and atomic) analogue quantum simulators to digital quantum computers. I will further present results for numerical studies of expected scattering outcomes, and conditions for observing inelastic channels, along with a demonstration of a high-fidelity meson wave packet generated on a trapped-ion quantum computer.
Tag - Theoretical computer science
The steady states of Markovian processes can be written as extremal eigenvectors of a matrix (e.g., a quantum channel) that generates the dynamics. Unlike ground states of Hamiltonians, however, the gap of the channel does not necessarily control relaxation to the ground state. I will argue that this discrepancy is precisely what allows non-trivial gapped phases of Lindbladians to exist. I will discuss an alternative criterion for deciding whether two Lindbladians (and their steady states) are in the same phase. I will show that this criterion implies many of the properties one would naturally demand of a phase, such as the persistence of any long-range order and the analytic evolution of correlation functions within a phase.
This is a 32-lecture course, with each lecture being about 45 minutes, given by Chris Godsil. Note that the 17th lecture was not recorded, but slides are at least available for it. The other 31 lectures are still of interest, but this needs to be known.
This course will provide an introduction to problems in quantum computing that can be studied using tools from algebraic graph theory. The quantum topics will relate to quantum walks and to quantum homomorphisms, automorphisms and colouring. The tools from algebraic graph theory include graphs automorphisms and homomorphisms, spectral decomposition and generating functions.
Prerequisites: I will assume a solid background in linear algebra and knowledge of what a permutation group is. Other topics will be covered in class, or in the notes. I will assume the knowledge of physics I had when I started on this topic, that is, no knowledge.
Multi-photon states can play an important role for optical quantum information, but producing these effectively can be challenging. Most commonly, independent photon pairs are produced by downconversion and then combined probabilistically, using post-selection to obtain the desired multi-photon state. This dependence on post-selection limits the suitability of the resulting states for some application. An alternative approach is to use cascaded downconversion: by sending photons produced with downconversion into a second non-linear crystal to be downconverted again, it is possible to produce photon triplets directly. In this talk, I will present work from my group and others exploring this novel process and discuss current research directions aiming to make cascaded downconversion more useful for state generation and beyond.
Starting from a simple deterministic model, we show that the asymptotic outcomes (as time goes to infinity) of both shallow and deep neural networks such as those used in BloombergGPT to generate economic time series are exactly the Nash equilibria of a non-potential game. We then analyse deep neural network algorithms that converge to these equilibria. The approach is extended to federated deep neural networks between clusters of regional servers and on-device clients. Finally, the variational inequalities behind large language models including encoder-decoder related transformers are established.
Thousands of papers have been written about quantum metrology, but few have acknowledged the reality that quantum sensors such as gravitational-wave detectors are dynamical systems and the signals are often time-varying. This talk presents fundamental quantum limits to such sensors, as well as measurements to achieve them. For the task of noise spectroscopy with an optical interferometer, I show the surprising result that spectral photon counting can be far superior to homodyne detection. This idea has recently been adopted by Caltech scientists, who will build an experiment based on the idea to detect signatures of quantum gravity under the GQuEST project.
Transformers can be trained to solve problems of mathematics. I present two recent applications, in mathematics and physics: predicting integer sequences, and discovering the properties of scattering amplitudes in a close relative of quantum chromodynamics. Problems of mathematics can also help understand transformers. Using two examples from linear algebra and integer arithmetic, I show that model predictions can be explained, that trained models do not confabulate, and that carefully choosing the training distributions can help achieve better, and more robust, performance.
High-dimensional quantum states are desirable for the study of complex quantum systems and the development of quantum technologies. Yet, their implementation can be challenging as it is their characterization. In the first part of this talk, I will focus on recent progress in the generation of high-dimensional quantum states in photonic circuits. I will show how this approach can make the implementation of large quantum states flexible and scalable by exploiting the intrinsic advantages of integrated devices. In the second part of the talk, I will deal with the more general problem of characterizing large quantum systems. Specifically, I will present some recent results on the study of multi-qubit systems by means of threshold quantum state tomography, an approach that can significantly reduce the number of measurements necessary to reconstruct the whole state density matrix.
The conditional expectation is an essential concept in probability theory and a basic tool in Bayesian estimation, as it allows one to infer hidden variables from observations in an optimal sense. Many have tried to generalize the concept for quantum mechanics, but the literature on the subject remains fragmented, confusing, and controversial. This talk presents a formalism of generalized conditional expectations that unifies most of the previous approaches. I also show how a certain version of the generalized conditional expectation can be useful for the study of quantum estimation. For example, it leads to a quantum Rao-Blackwell theorem, which may be used to improve the design of a quantum sensor in the same way the classical theorem can improve an estimator.
A linear code is a vector subspace of 𝔽qn, where 𝔽q is a finite field with q elements. The family of linear error-correcting codes are specially important when one is attempting to transmit messages across a noisy communication channel. Data can be corrupted in transmission or storage by a variety of undesirable phenomenon, such as radio interference, electrical noise, scratch, etc.. It is useful to have a way to detect and correct such data corruption. An error-correcting code can correct more errors larger is its minimum distance. This course aims to introduce a family of error-correcting codes, the Algebraic Geometry Codes, and show how to use the theory of semigroups to improve the minimum distance of the code. This construction of codes make use of a function field in one variable over a finite field. We will show how the local information in one or two rational places, the knowledge of the semigroup in these places, can be used to improve the minimum distance of the code.

You must be logged in to post a comment.