Quantum Foundations

Tsirelson’s problem involves two agents, Alice and Bob, who apply measurements on the same quantum system, K. It asks whether commutation, i.e., independence of whether Alice or Bob measures first, is sufficient to conclude that Alice and Bob’s measurements can be factorised so that they act non-trivially only on distinct subsystems of K. In this talk, I will present a “fully quantum generalisation” of this problem, where Alice and Bob’s measurements are replaced by operations on K that may depend on additional quantum inputs and produce quantum outputs. As for Tsirelson’s original problem, it turns out that commutation indeed implies factorisation, provided that all relevant systems are finite-dimensional.

This is joint work with Ramona Wolf; preprint available at arXiv:2308.05792.

---

 Zoom link https://pitp.zoom.us/j/99031410183?pwd=MzVoQXpPSll6bFp1b1g3U2J4U21rZz09

Activation of Bell nonlocality refers to the phenomenon where some entangled mixed states that admit a local hidden variable model in the standard Bell scenario nevertheless reveal their nonlocal nature in more exotic measurement scenarios. It has recently been shown that by broadcasting the subsystems of a bipartite quantum state, one can activate Bell nonlocality and significantly improve noise tolerance bounds for device-independent and semi-device-independent entanglement certification, with a single copy of the state and local measurements. In this talk I will review the state of the art on activation of nonlocality and existence of local hidden variable models, introduce the broadcasting technique and outline several interesting results and research directions.

---

Zoom link  https://pitp.zoom.us/j/91214624839?pwd=dXNUOERLMldScjczemlaSUhFbFNWQT09

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

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

It is often the case that interaction with a quantum system does not simply occur between an initial point in time and a final one, but rather over many time steps. In such cases, an interaction at a given time step can have an influence on the dynamics of the system at a much later time. Just as quantum channels model dynamics between two time steps, quantum combs model the more general multi-time dynamics described above, and have accordingly found application in such fields as open quantum systems and quantum cryptography. In this talk, we will consider ensembles of combs indexed by a random variable, dubbed classical-quantum combs, and discuss how much can be learnt about said variable through interacting with the system. We characterise the amount of information gain using the comb min-entropy, an extension of the analogous entropic quantity for quantum states. With combs and the min-entropy in our toolbox, we turn to a number of applications largely inspired by Measurement-Based Quantum Computing (MBQC), including the security analysis of a specific Blind Quantum Computing protocol and some comments regarding learning causal structure.

Zoom Link: https://pitp.zoom.us/j/98315660866?pwd=cWU3RzB6SG9DOGIza1BqV1lqNklvQT09

Every unitary map with a factorisation of domain and codomain into subsystems has a well-defined causal structure given by the set of influence relations between its input and output subsystems. A causal decomposition of a unitary map U is, roughly, one that makes all there is to know about U in terms of causal structure evident and understandable in compositional terms. We'll argue that this is more than just about drawing more intuitive pictures for the causal structure of U -- it is about really understanding it at all. Now, it has been known for a while that decompositions in terms of ordinary circuit diagrams do not suffice to this end and that at least so called 'extended circuit diagrams', or 'routed circuit diagrams' are necessary, revealing a close connection between causal structure and algebraic structures that involve a particular interplay of direct sum and tensor product. Though whether or not these sorts of routed circuit diagrams suffice has been an open question since. I will give an introduction and overview of this business of causal decompositions of unitary maps, and share what is an on-going thriller.

Zoom link:  https://pitp.zoom.us/j/95689128162?pwd=RFNqWlVHMFV0RjRaakszSTBsWkZkUT09

There are numerous properties of quantum states that one might be interested in characterizing, including statistical moments of observables such as expectations or variances, or more generally purities, entropies, probabilities, eigenvalues, symmetries, marginals, etc. Given a fixed collection of properties, the realizability problem aims to determine which value-assignments to those properties are jointly exhibited by at least one quantum state. In addition to the decision problem of realizability, one might also be interested in quantifying what proportion of quantum states possesses those property values. 

Any property of a quantum state can always, at least in principle, be estimated empirically by suitably measuring an ensemble of many independently and identically prepared copies of that quantum state. The particular sequence of positive operator valued measures which estimates a given property is known as a property estimation scheme. The purpose of this talk is to discuss a strategy for tackling realizability problems by studying the large deviation behaviour of property estimation schemes.

The key idea of this approach is the following:
A given collection of properties is realized by a quantum state if and only if a random quantum state occasionally produces that collection of properties as estimates.
Under suitable conditions, this observation leads to a complete hierarchy of necessary conditions for realizability.

Zoom link:  https://pitp.zoom.us/j/91945653382?pwd=QTZqSnpjYjlxYndqaHZwN2lES1h1Zz09

The theory of polynomial optimisation considers a polynomial objective function subject to countable many polynomial constraints. In a seminal contribution Navascués, Pironio and Acín (NPA) generalised a previous result from Lassere, allowing for its application in quantum information theory by considering its non-commutative variant. Non-commutative variables are represented as bounded operators on potentially infinite dimensional Hilbert spaces. These infinite-dimensional non-commutative polynomials optimisation (NPO) problems are recast as a complete hierarchy of semidefinite programming (SDP) relaxations by a suitable partitioning of the underlying spaces.

The reformulation into convex optimisation problems allows for numerical analysis. We focus on an operator theoretical approach to the NPA hierarchy and show its equiv-
alence to the original NPA hierarchy. To do so, we introduce the necessary mathematical preliminaries from operator algebra theory and semidefinite programming. We conclude by showing how certain relations on operators translate to SDP relaxations yielding drastically reduced problem sizes.

Zoom Link: https://pitp.zoom.us/j/98583295694?pwd=SlcvNG90RzFrODBKSHNaUi84bG9DZz09

Abstract: TBD

Zoom Link: https://pitp.zoom.us/j/95212522185?pwd=eWx4R3o3cmZISmtPY0xwMmdxc2EzZz09

Bell's theorem proves that quantum theory is inconsistent with local physical models and, from the perspective of causal inference, it can be seen as the impossibility of providing a classical causal explanation to quantum correlations. Bell's theorem has propelled research in the foundations of quantum theory and quantum information science. In the last decade, the investigation of nonlocality has moved beyond Bell's theorem to consider more complicated causal structures allowing for communication between the parts and involving several independent sources which distribute shares of physical systems in a network. For the case of three observable variables, it is known that there are three non-trivial causal networks. Two of those, are known to give rise to quantum non-classicality: the instrumental and the triangle scenarios. In this talk, we introduce new tools to tackle the compatibility problem in the general framework of Bayesian networks and explore the remaining non-trivial network, which we call the Evans scenario. We do not solve its main open problem –whether quantum non-classical correlations can arise from it – but give a significant step in this direction by proving that post-quantum correlations, analogous to the Popescu-Rohrlich box, do violate the constraints imposed by a classical description of Evans causal structure.

Zoom Link: https://pitp.zoom.us/j/98549320714?pwd=QVllZXNpZTFqekI1ZVUrK3ZLdnRjZz09

No-go theorems (Bell, Kochen-Specker, …) formally show the departure of quantum theory from classical theory. These are formulated in the framework of ontological models and, if one accepts such framework, entail that quantum theory involves problematic (“fine-tuned”) properties. I will argue that the lesson to take from the no-go theorems is to abandon the framework of ontological models as the way to model reality. I will analyze what I believe to be the unnatural assumptions of such framework and I will propose a way to change it. The basic principle of the new notion of reality I propose is that for something to exist is for something to be recorded. I will motivate the principle and explore its consequences. In order to implement such proposal into a precise theory-independent mathematical framework I will make use of point-free topological spaces (locales). I will discuss why this new proposal should be promising for understanding quantum theory and I will present several open questions.

Zoom link:  https://pitp.zoom.us/j/91292006884?pwd=V2EzaEw5Z3NRUGd4cVdSRnlOOWFVZz09