Roger Colbeck

A central goal in the foundations of physics is to understand the structure of physical theories, such as quantum theory, from physical principles. This is often explored by considering various information-theoretic principles. Here, we initiate a similar approach considering relativistic causality principles. No superluminal causation (NSC) and no superluminal signaling (NSS) are distinct relativistic principles, requiring respectively that causal influence/the ability of agents to signal are within the future lightcone. After formalizing their distinction, we investigate how well theories constrained by NSC and NSS perform in a task that involves generating nonclassical correlations. We find a spacetime configuration in which this task cannot be achieved in any theory (classical, quantum, or postquantum) satisfying NSC. However, we show that theories violating NSC but satisfying NSS can perfectly achieve the task. We give a protocol that would, in a world allowing superluminal causation, enable its operational certification without violating NSS, in general spacetimes. In the case of (1 + 1)-dimensional Minkowski spacetime, the task remains achievable in a configuration where measurement outcomes occur arbitrarily earlier in time than the settings, allowing a form of certifiable retrocausality without violating NSS. We illustrate our results by linking two different types of nonclassical postquantum resources: PR boxes and jamming. Our work offers insights into the role of different relativistic causality principles in fundamental physics and paves the way for characterizing the information-theoretic structure of theories obeying such principles.

Nonlocal tests on multi-partite quantum correlations form the basis of protocols that certify randomness in a device-independent (DI) way. Such correlations admit a rich structure, making the task of choosing an appropriate test difficult. For example, extremal Bell inequalities are tight witnesses of nonlocality, but achieving their maximum violation places constraints on the underlying quantum system, which can reduce the rate of randomness generation. As a result there is often a trade-off between maximum randomness and the amount of violation of a given Bell inequality. Here, we explore this trade-off for more than two parties. More precisely, we study the maximum amount of randomness that can be certified by correlations with a particular violation of the Mermin-Ardehali-Belinskii-Klyshko (MABK) inequality. For any even number of parties, we find that maximum randomness cannot occur beyond a threshold quantum violation, which increases with the number of parties, and we give a conjectured form of the maximum randomness in terms of the MABK value. We also show that maximum randomness can be obtained for any MABK violation for odd numbers of parties. To obtain our results, we derive new families of Bell inequalities certifying maximum randomness from a technique for randomness certification, which we call "expanding Bell inequalities''. Our technique allows a bipartite Bell expression to be used as a seed, and transformed into a multi-partite Bell inequality tailored for randomness certification, showing how intuition learned in the bipartite case can find use in more complex scenarios.

The discovery of Bell that there exist quantum correlations that cannot be reproduced classically is one of the most important in the foundations of quantum mechanics, as well as having practical implications. Bell's result was originally proven in a simple bipartite causal structure, but analogous results have also been shown in further causal structures. Here we study the only causal structure with six or fewer nodes in which the question of whether or not there exist quantum correlations that cannot be achieved classically was open. In this causal structure we show that such quantum correlations exist using a method that involves imposing additional restrictions on the correlations. This hence completes the picture of which causal structures of up to six nodes support non-classical quantum correlations. We also provide further illustrations of our method using other causal structures.

Correlation self-testing of quantum theory involves identifying a task or set of tasks whose optimal performance can be achieved only by theories that can realise the same set of correlations as quantum theory in every causal structure. Following this approach, previous work has ruled out various classes of generalised probabilistic theories whose joint state spaces have a certain regularity in the sense of a (discrete) rotation symmetry of the bipartite state spaces. Here we consider theories whose bipartite state spaces lack this regularity. We form them by taking the convex hull of all the local states and a finite number of non-local states. We show that a criterion of compositional consistency is needed in such theories: for a measurement effect to be valid, there must exist at least one measurement that it is part of. This goes beyond previous consistency criteria and corresponds to a strengthening of the no-restriction hypothesis. We show that quantum theory outperforms these theories in a task called the adaptive CHSH game, which shows that they can be ruled out experimentally. We further show a connection between compositional consistency and Tsirelson's bound.

Device-independent quantum key distribution allows two users to set up shared cryptographic key without the need to trust the quantum devices used. Doing so requires nonlocal correlations between the users. However, in Farkas et al. [ Phys. Rev. Lett. 127, 050503 (2021)] it was shown that for known protocols nonlocality is not always sufficient, leading to the question of whether there is a fundamental lower bound on the minimum amount of nonlocality needed for any device-independent quantum key distribution implementation. Here, we show that no such bound exists, giving schemes that achieve key with correlations arbitrarily close to the local set. Furthermore, some of our constructions achieve the maximum of 1 bit of key per pair of entangled qubits. We achieve this by studying a family of Bell inequalities that constitute all self-tests of the maximally entangled state with a single linear Bell expression. Within this family there exist nonlocal correlations with the property that one pair of inputs yield outputs arbitrarily close to perfect key. Such correlations exist for a range of Clauser-Horne-Shimony-Holt values, including those arbitrarily close to the classical bound. Finally, we show the existence of quantum correlations that can generate both perfect key and perfect randomness simultaneously, while also displaying arbitrarily small Clauser-Horne-Shimony-Holt violation. This opens up the possibility of a new class of cryptographic protocol.

DOI: https://doi.org/10.1103/PhysRevA.109.029901

Correlation self-testing of a theory addresses the question of whether we can identify the set of correlations realisable in a theory from its performance in a particular information processing task. Applied to quantum theory it aims to identify an information processing task whose optimal performance is achieved only by theories realising the same correlations as quantum theory in any causal structure. In [Phys. Rev. Lett. 125 060406 (2020)] we introduced a candidate task for this, the adaptive CHSH game. Here, we analyse the maximum probability of winning this game in different generalised probabilistic theories. We show that theories with a joint state space given by the minimal or the maximal tensor product are inferior to quantum theory, before considering other tensor products in theories whose elementary systems have various two-dimensional state spaces. For these, we find no theories that outperform quantum theory in the adaptive CHSH game and prove that it is impossible to recover the quantum performance in various cases. This is the first step towards a general solution that, if successful, will have wide-ranging consequences, in particular, enabling an experiment that could rule out all theories in which the set of realisable correlations does not coincide with the quantum set.

Self-testing usually refers to the task of taking a given set of observed correlations that are assumed to arise via a process that is accurately described by quantum theory, and trying to infer the quantum state and measurements. In other words it is concerned with the question of whether we can tell what quantum black-box devices are doing by looking only at their input-output behaviour and is known to be possible in several cases. Here we introduce a more general question: is it possible to self-test a theory, and, in particular, quantum theory? More precisely, we ask whether within a particular causal structure there are tasks that can only be performed in theories that have the same correlations as quantum mechanics in any scenario. We present a candidate task for such a correlation self-test and analyse it in a range of generalised probabilistic theories (GPTs), showing that none of these perform better than quantum theory. A generalisation of our results showing that all non-quantum GPTs are strictly inferior to quantum mechanics for this task would point to a new way to axiomatise quantum theory, and enable an experimental test that simultaneously rules out such GPTs.

Generalized probabilistic theories (GPTs) provide a framework in which a range of possible theories can be examined, including classical theory, quantum theory and those beyond. In general, enlarging the state space of a GPT leads to fewer possible measurements because the additional states give stronger constraints on the set of effects, the constituents of measurements. This can have implications for information processing. In boxworld, for example, a GPT in which any no-signalling distribution can be realised, there is no analogue of a measurement in the Bell basis and hence the analogue of entanglement swapping is impossible. A comprehensive study of measurements on multiple systems in boxworld has been lacking. Here we consider such measurements in detail, distinguishing those that can be performed by interacting with individual systems sequentially (termed wirings), and the more interesting set of those that cannot. We compute all the possible boxworld effects for cases with small numbers of inputs, outputs and parties, identifying those that are wirings. The large state space of boxworld leads to a small effect space and hence the effects of boxworld are widely applicable in GPTs. We also show some possible uses of non-wirings for information processing by studying state discrimination, nonlocality distillation and the boxworld analogue of nonlocality without entanglement. Finally, we connect our results to the study of logically consistent classical processes and to the composition of contextuality scenarios. By enhancing understanding of measurements in boxworld, our results could be useful in studies of possible underlying principles on which quantum theory can be based.