We present a cryptographic-inspired framework for modeling Bell nonlocal correlations. Drawing inspiration from the renowned de Broglie--Bohm theory, we conceptualize nonlocal boxes as realistic systems featuring instantaneous signaling at the hidden-variable level. By introducing randomness into the distribution of the hidden variable, the superluminal signaling model is made compatible with the operational no-signaling condition. As our design mimics the famous symmetric key encryption system called the one-time pad (OTP), we call this the OTP model for nonlocal boxes. We illustrate the efficacy of this model through various esoteric examples related to the nonclassical nature of nonlocal boxes. In particular, the breakdown of communication complexity using nonlocal boxes can be better understood in this framework. Additionally, we delve into the Van Dam protocol, revealing its connection to homomorphic encryption studied in cryptography. Exploring potential avenues for encapsulating quantum-realizable nonlocal correlations within our framework, we highlight that the information causality principle imposes additional constraints at the hidden-variable level. Present work thus orchestrates the results in classical cryptography to improve our understanding of nonlocal correlations and welcomes further research to this connection.
We present a cryptographic-inspired framework for modeling Bell nonlocal correlations. Drawing inspiration from the renowned de Broglie--Bohm theory, we conceptualize nonlocal boxes as realistic systems featuring instantaneous signaling at the hidden-variable level. By introducing randomness into the distribution of the hidden variable, the superluminal signaling model is made compatible with the operational no-signaling condition. As our design mimics the famous symmetric key encryption system called the one-time pad (OTP), we call this the OTP model for nonlocal boxes. We illustrate the efficacy of this model through various esoteric examples related to the nonclassical nature of nonlocal boxes. In particular, the breakdown of communication complexity using nonlocal boxes can be better understood in this framework. Additionally, we delve into the Van Dam protocol, revealing its connection to homomorphic encryption studied in cryptography. Exploring potential avenues for encapsulating quantum-realizable nonlocal correlations within our framework, we highlight that the information causality principle imposes additional constraints at the hidden-variable level. Present work thus orchestrates the results in classical cryptography to improve our understanding of nonlocal correlations and welcomes further research to this connection.
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.
Quantum mechanics postulates random outcomes. However, a model making the same output predictions but in a deterministic manner would be, in principle, experimentally indistinguishable from quantum theory. In this work we consider such models in the context of nonlocality on a device-independent scenario. That is, we study pairs of nonlocal boxes that produce their outputs deterministically. It is known that, for these boxes to be nonlocal, at least one of the boxes' outputs has to depend on the other party's input via some kind of hidden signaling. We prove that, if the deterministic mechanism is also algorithmic, there is a protocol that, with the sole knowledge of any upper bound on the time complexity of such an algorithm, extracts that hidden signaling and uses it for the communication of information.
The study of quantum correlations is important for fundamental reasons as well as for quantum communication and information processing tasks. On the one hand, it is of tremendous interest to derive the correlations produced by measurements on separated composite quantum systems from within the set of all correlations obeying the no-signaling principle of relativity, by means of information-theoretic principles. On the other hand, an important ongoing research program concerns the formulation of device-independent cryptographic protocols based on quantum nonlocal correlations for the generation of secure keys, and the amplification and expansion of random bits against general no-signaling adversaries. In both these research programs, a fundamental question arises: Can any measurements on quantum states realize the correlations present in pure extremal no-signaling boxes? Here, we answer this question in full generality showing that no nontrivial (not local realistic) extremal boxes of general no-signaling theories can be realized in quantum theory. We then explore some important consequences of this fact.
It is known that statistical predictions of quantum theory do not depend on its interpretation. In particular, an experiment cannot distinguish between the Copenhagen interpretation (involving no hidden variables) and the de Broglie-Bohm interpretation based on nonlocal hidden variables. Quantum cryptographic protocols, such as BB84 or E91, are secure and mutually equivalent as long as one works within the framework of Copenhagen interpretation. But they are inequivalent and insecure if one considers attacks allowed by the de Broglie-Bohm interpretation. The fundametal problem of quantum cryptography is therefore this: Are all the statements about security of quantum protocols based on our belief in one of the two allowed interpretations of quantum mechanics? We show that this is not the case. Ekert-type protocols can be modified in a way that makes them secure even if the de Broglie-Bohm nonlocal hidden variables exist. Bennett-Brassard-type cryptography does not seem to allow for such a correction.
Bell nonlocality is the experimentally testable incompatibility between quantum correlations and explanations based on local hidden variables. Its significance now extends beyond the foundations of quantum mechanics: a Bell-inequality violation can certify entanglement, randomness, measurement incompatibility, and cryptographic security without requiring a detailed model of the devices producing the observed data. This article develops the mathematical structure of Bell experiments and explains its role in device-independent quantum information. Conditional probability distributions are classified into local, quantum, and no-signalling sets; the Clauser-Horne-Shimony-Holt inequality is derived, and its classical, quantum, and algebraic limits are distinguished. Tsirelson’s bound is obtained from the CHSH operator, while Popescu-Rohrlich correlations demonstrate that no-signalling alone does not identify the quantum set. The relation between entanglement and nonlocality is examined through local entangled states, hidden nonlocality, and activation. Nonlocal games, semidefinite relaxations, self-testing, certified randomness, and device-independent quantum key distribution are treated as operational consequences of Bell violation. Particular attention is given to entropy accumulation, finite-data security, loophole-free experiments, and the limitations of device independence. Bell nonlocality emerges as both a foundational separation between classical and quantum causal models and a quantitative resource for cryptographic and informational tasks.