Search Talks

A number of no-go theorems suggest that theories upholding both unitarity and relativity must deny that events are absolute. I'll show how quantum causal influences allow us to articulate an attractive conception of relational events. This will lead us towards a precise, observer-independent reformulation of quantum theory, in which relational events emerge from causation.

Zoom link: https://pitp.zoom.us/j/98649944363?pwd=Y25NOUROelY2ZmFpVWhTZFErV2MwUT09

While General Relativity has withstood tests on solar system scales, progress in observational cosmology now enables tests on the largest scales. I will present results from our tests of gravity using Dark Energy Survey Year 3 weak lensing and clustering data in addition to a variety of complementary data. One outcome of this analysis was the necessity to further explore lensing consistency so I will present preliminary results of such tests using the latest Cosmic Microwave Background (CMB) lensing data. These analyses are setting the scene for future tests of fundamental physics with CMB and galaxy surveys: I will show expected results and challenges from the Rubin Observatory. I will finally argue for the use of machine learning for theory exploration, to better organize our efforts within the future experimental landscape. As PI is a leading center in outreach, I will end my talk by sharing my experience with science content creation on various social media platforms.

Zoom link: https://pitp.zoom.us/j/96929387143?pwd=WW1CZElpMkN2U1RQUjB3VERxRVQ5dz09

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.