Search Talks

In 2020 our Oxford-based Quantinuum team performed Quantum Natural Language Processing (QNLP) on IBM quantum hardware [1, 2].  Key to having been able to achieve what is conceived as a heavily data-driven task, is the observation that quantum theory and natural language are governed by much of the same compositional structure -- a.k.a. tensor structure.  

 

Hence our language model is in a sense quantum-native, and we provide an analogy with simulation of quantum systems in terms of algorithmic speed-up [forthcoming].  Meanwhile we have made all our software available open-source, and with support [github.com/CQCL/lambeq].    

 

The compositional match between natural language and quantum extends to other domains than language, and argue that a new generation of AI can emerge when fully pushing this analogy, while exploiting the completeness of categorical quantum mechanics / ZX-calculus [3, 4, 5] for novel reasoning purposes that go hand-in-hand with modern machine learning.

 

[1]     B. Coecke, G. De Felice, K. Meichanetzidis and A. Toumi (2020) Foundations for Near-Term Quantum Natural Language Processing.  https://arxiv.org/abs/2012.03755

[2]     R. Lorenz, A. Pearson, K. Meichanetzidis, D. Kartsaklis and B. Coecke (2020) QNLP in Practice: Running Compositional Models of Meaning on a Quantum Computer.  https://arxiv.org/abs/2102.12846

[3]     B. Coecke and A. Kissinger (2017) Picturing Quantum Processes. A first course on quantum theory and diagrammatic reasoning.  Cambridge University Press.

[4]     B. Coecke, D. Horsman, A. Kissinger and Q. Wang (2021) Kindergarten quantum mechanics graduates (...or how I learned to stop gluing LEGO together and love the ZX-calculus).  https://arxiv.org/abs/2102.10984

[5]     B. Coecke and S. Gogioso (2022) Quantum in Pictures.  Quantinuum, 2023.

Zoom Link: https://pitp.zoom.us/j/92333285960?pwd=MlpJSklmMlVlUlRTTWhsNjc2T2Y4QT09

The notorious exponential complexity of quantum problems can be avoided for systems with limited correlations. For example, states of one-dimensional systems with bounded entanglement are approximable by matrix product states. We consider fermionic systems, where correlations can be defined as deviations from Gaussian states. Heuristically, one expects a link between compact non-Gaussian ansatzes and bounded fermionic correlations. This connection, however, has not been rigorously demonstrated. Our work resolves this conceptual gap.

We focus on pure states with a fixed number of fermions. Generalizing the so-called Plücker relations, we introduce k-particle correlation measures ω_k. The vanishing of ω_k at a constant k defines a class H_k of states with limited correlations. These sets H_k are nested, ranging from Gaussian for k=1 to the full n-fermion Hilbert space H for k=n+1. States in H_{k=O(1)} can be represented using a non-Gaussian ansatz of polynomial size. Classes H_k have physical meaning, containing all truncated perturbation series around Gaussian states. We also identify non-perturbative examples of states in H_{k=O(1)}, by a numerical study of excited states in the 1D Hubbard model. Finally, we discuss the information-theoretic implications of our results for the widely used coupled-cluster ansatz.

Zoom Link: TBD

In this talk I will present recent results about the computational complexity of determining homology groups of simplicial complexes, a fundamental task in computational topology. In arXiv:2209.11793 we showed that this decision problem is QMA1-hard. Moreover, we showed that a version of the problem satisfying a suitable promise is contained in QMA. This suggests that the seemingly classical problem may in fact be quantum mechanical. In fact, we were able to significantly strengthen this by showing that the problem remains QMA1-hard in the case of clique complexes, a family of simplicial complexes specified by a graph which is relevant to the problem of topological data analysis. The proof combines a number of techniques from Hamiltonian complexity and homological algebra, and is inspired by a link with supersymmetric quantum mechanics. In this talk I will focus on how the link with supersymmetry inspired the result, and explain the intuition behind the proof.

Recently, Akers et al. proposed a non-isometric holographic map from the interior of a black hole to its exterior. Within this model, we study properties of the black hole S-matrix, which are in principle accessible to observers who stay outside the black hole. Specifically, we investigate a scenario in which an infalling agent interacts with radiation both outside and inside the black hole. Because the holographic map involves postselection, the unitarity of the S-matrix is not guaranteed in this scenario, but we find that unitarity is satisfied to very high precision if suitable conditions are met. If the internal black hole dynamics is described by a pseudorandom unitary transformation, and if the operations performed by the infaller have computational complexity scaling polynomially with the black hole entropy, then the S-matrix is unitary up to corrections that are superpolynomially small in the black hole entropy. Furthermore, while in principle quantum computation assisted by postselection can be very powerful, we find under similar assumptions that the S-matrix of an evaporating black hole has polynomial computational complexity.

The JLMS formula is a cornerstone in our understanding of bulk reconstruction in holographic theories of quantum gravity, best interpreted as a quantum error-correcting code. Moreover, recent work has highlighted the importance of understanding holography as an approximate and perhaps non-isometric code. In this work, we construct an enlarged code subspace for the bulk theory that contains multiple non-perturbatively different background geometries. In such a large holographic code, we carefully derive an approximate version of the JLMS formula from an approximate FLM formula for a class of nice states. We do not assume that the code is isometric, but interestingly find that approximate FLM forces the code to be approximately isometric. Furthermore, we show that the bulk modular Hamiltonian of the entanglement wedge makes important contributions to the JLMS formula and cannot in general be neglected even when the bulk state is semiclassical. Nevertheless, when acting on states with the same background geometry, we find that the modular flow is well approximated by the area flow which takes the geometric form of a boundary-condition-preserving kink transform. We also generalize the results to higher derivative gravity, where area is replaced by the geometric entropy. We conjecture that a Lorentzian definition of the geometric entropy is equivalent to its original, Euclidean definition, and we verify this conjecture in a dilaton theory with higher derivative couplings. Thus we find that the flow generated by the geometric entropy takes the universal form of a boundary-condition-preserving kink transform.

We construct approximately local observables, or "overlapping qubits", using non-isometric maps and show that processes in local effective theories can be spoofed with a quantum system with fewer degrees of freedom, similar to our expectation in holography. Furthermore, the spoofed system naturally deviates from an actual local theory in ways that can be identified with features in quantum gravity. For a concrete example, we construct two MERA toy models of de Sitter space-time and explain how the exponential expansion in global de Sitter can be spoofed with many fewer quantum degrees of freedom and that local physics may be approximately preserved for an exceedingly long time before breaking down. Conceptually, we comment on how approximate overlapping qubits connect Hilbert space dimension verification, degree-of-freedom counting in black holes and holography, approximate locality in quantum gravity, non-isometric codes, and circuit complexity.

In this paper, we explore the possibility of building a quantum memory that is robust to thermal noise using large N matrix quantum mechanics models. First, we investigate the gauged SU(N) matrix harmonic oscillator and different ways to encode quantum information in it. By calculating the mutual information between the system and a reference which purifies the encoded information, we identify a transition temperature, Tc, below which the encoded quantum information is protected from thermal noise for a memory time scaling as N^2. Conversely, for temperatures higher than T_c, the information is quickly destroyed by thermal noise. Second, we relax the requirement of gauge invariance and study a matrix harmonic oscillator model with only global symmetry. Finally, we further relax even the symmetry requirement and propose a model that consists of a large number N^2 of qubits, with interactions derived from an approximate SU(N) symmetry. In both ungauged models, we find that the effects of gauging can be mimicked using an energy penalty to give a similar result for the memory time. The final qubit model also has the potential to be realized in the laboratory.

The Sachdev-Ye-Kitaev (SYK) model is a simple toy model of holography that has seen widespread study in the area of quantum gravity. It is particularly notable for its feasibility of simulation on near-term quantum devices. Recently, Swingle et al. introduced a sparsified version of the SYK model and analyzed its holographic properties, which are remarkably robust to deletion of Majorana interaction terms. Here we analyze its spectral and quantum chaotic properties as they pertain to holography as well as how they scale with sparsity and system size through large scale numerics. We identify at least two transition points at which features of chaos and holography are lost as the model is sparsified, and above which all important features are preserved, which may serve as guidelines for future experiments to simulate quantum gravity. Additionally, we apply these analyses to the SYK model that was recently experimentally simulated on the Google Sycamore quantum processor, which itself was a highly sparsified SYK model obtained through a machine learning algorithm incorporating mutual information signatures of a traversable wormhole.

66 - It has been proposed that the exponential decay and subsequent power law saturation of out-of-time-order correlation functions can be universally described by collective 'scramblon' modes. We develop this idea from a path integral perspective in several examples, thereby establishing a general formalism. After reformulating previous work on the Schwarzian theory and identity conformal blocks in two-dimensional CFTs relevant for systems in the infinite coupling limit with maximal quantum Lyapunov exponent, we focus on theories with sub-maximal chaos: we study the large-q limit of the SYK quantum dot and chain, both of which are amenable to analytical treatment at finite coupling. In both cases we identify the relevant scramblon modes, derive their effective action, and find bilocal vertex functions, thus constructing an effective description of chaos. The final results can be matched in detail to stringy corrections to the gravitational eikonal S-matrix in holographic CFTs, including a stringy Regge trajectory, bulk to boundary propagators, and multi-string effects that are unexplored holographically.