Historically, quantum mechanics has relied on the assumption of non-communicating parties, enforced via space-like separation, to witness the gap between classical and quantum descriptions. This thesis explores the boundaries of the standard Bell non-local scenario, investigating how to preserve this gap when communication is allowed. In particular, this work focuses on restricted communication, multipartite settings, and operator-algebraic formulations. Key contributions of this work include: • Dimensional Constraints: Establishing mathematical maps from standard Bell scenarios to prepare-and-measure scenarios with dimensionally bounded channels, proving that quantum bounds and self-testing properties are preserved. • Cryptographic Constraints: Analyzing compiled non-local games using quantum homomorphic encryption. The research proves asymptotic quantum soundness for all multipartite compiled games and introduces a quantitative hierarchy, similar to the NPA hierarchy, to characterize sequential correlations. • Operational Equivalences: Demonstrating that correlations arising from arbitrary compositions of non-signalling assemblages in multipartite communication schemes always reduce to standard spatial quantum Bell correlations. • Operator-Algebraic Tools: Introducing a novel chain rule for the Radon-Nikodym derivative to dilate chains of completely-positive maps, alongside the construction of a universal C*-algebra for sequential measurements. Overall, the manuscript unifies concepts from quantum foundations, complexity theory, and operator algebras to provide a rigorous mathematical framework for characterizing and certifying multipartite sequential quantum correlations.
Historically, quantum mechanics has relied on the assumption of non-communicating parties, enforced via space-like separation, to witness the gap between classical and quantum descriptions. This thesis explores the boundaries of the standard Bell non-local scenario, investigating how to preserve this gap when communication is allowed. In particular, this work focuses on restricted communication, multipartite settings, and operator-algebraic formulations. Key contributions of this work include: • Dimensional Constraints: Establishing mathematical maps from standard Bell scenarios to prepare-and-measure scenarios with dimensionally bounded channels, proving that quantum bounds and self-testing properties are preserved. • Cryptographic Constraints: Analyzing compiled non-local games using quantum homomorphic encryption. The research proves asymptotic quantum soundness for all multipartite compiled games and introduces a quantitative hierarchy, similar to the NPA hierarchy, to characterize sequential correlations. • Operational Equivalences: Demonstrating that correlations arising from arbitrary compositions of non-signalling assemblages in multipartite communication schemes always reduce to standard spatial quantum Bell correlations. • Operator-Algebraic Tools: Introducing a novel chain rule for the Radon-Nikodym derivative to dilate chains of completely-positive maps, alongside the construction of a universal C*-algebra for sequential measurements. Overall, the manuscript unifies concepts from quantum foundations, complexity theory, and operator algebras to provide a rigorous mathematical framework for characterizing and certifying multipartite sequential quantum correlations.
Non-localité dans les scénarios de communication : hypothèses au-delà de la séparation de type espace Historiquement, la mécanique quantique s'est appuyée sur l'hypothèse de parties ne communiquant pas, imposée par une séparation de genre espace, pour observer l'écart entre les descriptions classiques et quantiques. Cette thèse explore les limites du scénario non local de Bell standard, en étudiant comment préserver cet écart lorsque la communication est autorisée. En particulier, ces travaux se concentrent sur la communication restreinte, les configurations multipartites et les formulations basées sur l'algèbre d'opérateurs. Les principales contributions de ces travaux incluent : • Contraintes dimensionnelles : Établissement de correspondances mathématiques entre les scénarios de Bell standards et les scénarios de préparation et mesure avec des canaux à dimension limitée, prouvant que les limites quantiques et les propriétés d'auto-test sont préservées. • Contraintes cryptographiques : Analyse de jeux non locaux compilés utilisant le chiffrement homomorphe quantique. La recherche prouve la solidité quantique asymptotique pour tous les jeux compilés multipartites et introduit une hiérarchie quantitative, similaire à la hiérarchie NPA, pour caractériser les corrélations séquentielles. • Équivalences opérationnelles : Démonstration que les corrélations issues de compositions arbitraires d'assemblages non signalants dans des schémas de communication multipartites se réduisent toujours aux corrélations quantiques spatiales de Bell standards. • Outils d'algèbre d'opérateurs : Introduction d'une nouvelle règle de composition pour la dérivée de Radon-Nikodym afin de dilater des chaînes d'applications complètement positives, ainsi que la construction d'une C*-algèbre universelle pour les mesures séquentielles. Dans l'ensemble, le manuscrit unifie des concepts issus des fondements de la physique quantique, de la théorie de la complexité et des algèbres d'opérateurs pour fournir un cadre mathématique rigoureux permettant de caractériser et de certifier les corrélations quantiques séquentielles multipartites.
Bell non-locality is a powerful framework to distinguish classical, quantum and post-quantum resources, which relies on non-communicating players. Under which restriction can we have the same separations, if we allow for communication? Non-signalling state assemblages, and the fact that they can always be simultaneously purified, turned out to be the key element to restrict the simplest bipartite communication scenario, the prepare-and-measure, to the standard bipartite Bell scenario. Yet, many distinctive features of quantum theory are genuinely multipartite and cannot be reduced to two-party behaviour. In this work we are interested in extending this simultaneous purification inspired result to all multipartite communication schemes. As a first step, we unify and extend the simultaneous purification result from states to instruments and super-instruments, which are composable structures, and open up the possibility to explore more complex communication scenarios. Our main contribution is to establish that arbitrary compositions of non-signalling assemblages cannot escape the standard spatial quantum Bell correlations set. As a consequence, any interactive quantum realization of correlations outside of this set must involve at least one signalling assemblage of quantum operations, even when the resulting correlations are non-signalling.
In the past few decades, the connections between non-local games arising in quantum information theory and the theory of operator algebras have undergone a phase of significant development. Operator algebras provide a particularly fruitful framework for approaching questions of non-locality in quantum systems, as the input-output behavior of measurements on bipartite quantum systems can be encoded through noncommutative operator algebras and their state spaces. This thesis is the compilation of a series of papers, written by the author in collaboration with Ivan G. Todorov, utilizing this framework by using the theory of operator algebras and completely positive maps to study questions involving non-local games. ☐ Using the simulation paradigm from information theory, we define a quantized version of homomorphisms and isomorphisms between classical hypergraphs, generalizing quantum homomorphisms and isomorphisms of graphs from the literature. We show that these quantum homomorphisms and isomorphisms constitute pre-orders and equivalence relations, respectively. We use quantum homomorphisms of hypergraphs to provide multiple examples of strict separation between correlation classes of varying types. Specializing to the case when our underlying hypergraphs arise from classical non-local games, we define quantum non-local game homomorphisms and isomorphisms. We also show how the existence of a homomorphism or isomorphism of some fixed type between games is reflected in a comparison of optimal and asymptotic game values with respect to this type. These non-local game homomorphisms are defined via a new class of non-signalling correlations which we introduce here. We develop the multivariate tensor product theory in the category of operator systems, which we then use to provide a characterization of game homomorphisms in terms of state spaces for various tensor products of canonically associated operator systems. We then apply these results to the study of synchronous non-local games, defining jointly synchronous correlations and showing how they correspond to tracial states of tensor products of C*-algebras canonically associated to each game party. ☐ We then move to a second level of quantization by proposing a "quantized" notion of hypergraphs (where "quantum" here is in the sense of a non-commutative analogue for a discrete combinatorial object), and introduce quantum homomorphisms between these quantum objects. We provide an initial foray into the properties quantum morphisms between quantum hypergraphs display, showing they satisfy analogous properties to quantum homomorphisms between classical hypergraphs. We also indicate initial connections these quantum homomorphisms between quantum hypergraphs have to the study of quantum input-output games. We end the thesis showing that homomorphisms of a local type between quantum hypergraphs is closely related, and in some cases identical, to the TRO equivalence of finite-dimensionally acting operator spaces canonically associated with each hypergraph. This suggests a quantum information theoretic approach to Morita equivalence in the category of operator spaces.
This thesis explores foundational aspects of quantum information theory and quantum cryptography. First, we investigate quantum correlations in interactive settings, including the CHSH and graph isomorphism games. We aim to distinguish quantum correlations from non-signaling correlations by leveraging the principle of communication complexity. To this end, we employ techniques such as distributed computation, majority-function-based distillation protocols, the algebraic and geometric properties of nonlocal box wirings, and variations of some graph properties such as isomorphism, transitivity, and equitable partitions. This inquiry advances our understanding of non-physical correlations. Second, we address a key open problem in cryptography: the feasibility of unclonable encryption. We aim to construct an encryption scheme that prevents two distant parties from simultaneously obtaining information about a shared encrypted message. We introduce a candidate for unclonable encryption in the plain model, i.e., without assumptions, in working towards an unconditional proof. Our protocol is based on Clifford algebra, utilizing complex Hermitian unitary matrices that anti-commute. For small key sizes, we rigorously prove security using sum-of-squares methods, while for larger key sizes, we provide strong numerical evidence via the NPA hierarchy.
This thesis explores foundational aspects of quantum information theory and quantum cryptography. First, we investigate quantum correlations in interactive settings, including the CHSH and graph isomorphism games. We aim to distinguish quantum correlations from non-signaling correlations by leveraging the principle of communication complexity. To this end, we employ techniques such as distributed computation, majority-function-based distillation protocols, the algebraic and geometric properties of nonlocal box wirings, and variations of some graph properties such as isomorphism, transitivity, and equitable partitions. This inquiry advances our understanding of non-physical correlations. Second, we address a key open problem in cryptography: the feasibility of unclonable encryption. We aim to construct an encryption scheme that prevents two distant parties from simultaneously obtaining information about a shared encrypted message. We introduce a candidate for unclonable encryption in the plain model, i.e. without assumptions, in working towards an unconditional proof. Our protocol is based on Clifford algebra, utilizing complex Hermitian unitary matrices that anti-commute. For small key sizes, we rigorously prove security using sum-of-squares methods, while for larger key sizes, we provide strong numerical evidence via the NPA hierarchy.
Bell non-locality is a fundamental feature of quantum mechanics whereby measurements performed on “spatially separated” quantum systems can exhibit correlations that cannot be understood as revealing predetermined values. This is a special case of the more general phenomenon of “quantum contextuality”, which says that such correlations can occur even when the measurements are not necessarily on separate quantum systems, but are merely “compatible” (i.e. commuting). Crucially, while any non-local game yields an experiment that demonstrates quantum advantage by leveraging the “spatial separation” of two or more devices (and in fact several such demonstrations have been conducted successfully in recent years), the same is not true for quantum contextuality: finding the contextuality analogue of such an experiment is arguably one of the central open questions in the foundations of quantum mechanics. In this work, we show that an arbitrary contextuality game can be compiled into an “operational test of contextuality” involving a single quantum device, by only making the assumption that the device is computationally bounded. Our work is inspired by the recent work of Kalai et al. (STOC '23) that converts any non-local game into a classical test of quantum advantage with a single device. The central idea in their work is to use cryptography to enforce spatial separation within subsystems of a single quantum device. Our work can be seen as using cryptography to enforce “temporal separation”, i.e. to restrict communication between sequential measurements. Beyond contextuality, we employ our ideas to design a “proof of quantumness” that, to the best of our knowledge, is arguably even simpler than the ones proposed in the literature so far.