The communication complexity of non-signaling distributions
Julien Degorre, Marc Kaplan, Sophie Laplante, Jérémie Roland
备注：
23 pages. V2: major modifications, extensions and additions compared to V1. V3 (21 pages): proofs have been updated and simplified, particularly Theorem 10 and Theorem 22. V4 (23 pages): Section 3.1 has been rewritten (in particular Lemma 10 and its proof), and various minor modifications have been made. V5 (24 pages): various modifications in the presentation
发表信息：
In MFCS'09, LNCS, vol 5734, 270-281 (2009). Quantum Information & Computation, 11(7&8):649-676 (2011)
We study a model of communication complexity that encompasses many well-studied problems, including classical and quantum communication complexity, the complexity of simulating distributions arising from bipartite measurements of shared quantum states, and XOR games. In this model, Alice gets an input x, Bob gets an input y, and their goal is to each produce an output a,b distributed according to some pre-specified joint distribution p(a,b|x,y).
We introduce a new technique based on affine combinations of lower-complexity distributions. Specifically, we introduce two complexity measures, one which gives lower bounds on classical communication, and one for quantum communication. These measures can be expressed as convex optimization problems. We show that the dual formulations have a striking interpretation, since they coincide with maximum violations of Bell and Tsirelson inequalities. The dual expressions are closely related to the winning probability of XOR games. These lower bounds subsume many known communication complexity lower bound methods, most notably the recent lower bounds of Linial and Shraibman for the special case of Boolean functions.
We show that the gap between the quantum and classical lower bounds is at most linear in the size of the support of the distribution, and does not depend on the size of the inputs. This translates into a bound on the gap between maximal Bell and Tsirelson inequality violations, which was previously known only for the case of distributions with Boolean outcomes and uniform marginals.
Finally, we give an exponential upper bound on quantum and classical communication complexity in the simultaneous messages model, for any non-signaling distribution. One consequence is a simple proof that any quantum distribution can be approximated with a constant number of bits of communication.
We consider alternative models to quantum mechanics, that have been proposed in the recent years in order to explain the EPR correlations between two particles. These models allow in principle local hidden variables produced at the source, and some superluminal "hidden communication" (or "influences") to reproduce the non-local correlations. Moving to the case of three particles, we show that these alternative models lead to signaling when "hidden communication" alone is considered as the origin of the correlations.
Assuming perfect detection efficiency, we present an (indeterministic) model for an EPR-Bohm experiment which reproduces the singlet correlations, without contradicting Bell's original locality condition. In this model we allow the probability distribution $ρ_λ$ of the state $λ$ at the source to depend parametrically on the orientation $ξ$ of one of the measuring devices: $ρ_λ(λ,ξ)$. In a Bell experiment, no-signaling between the source and each one of the devices would seem clearly sufficient to rule such an influence; however, not even schemes where the choice of observables takes place duri…
We show that the basic dynamical rules of quantum physics can be derived from its static properties and the condition that superluminal communication is forbidden. More precisely, the fact that the dynamics has to be described by linear completely positive maps on density matrices is derived from the following assumptions: (1) physical states are described by rays in a Hilbert space, (2) probabilities for measurement outcomes at any given time are calculated according to the usual trace rule, (3) superluminal communication is excluded. This result also constrains possible non-linear modificati…
Non-signaling proofs, motivated by quantum computation, have found applications in cryptography and hardness of approximation. An important open problem is characterizing the power of no-signaling proofs. It is known that 2-prover no-signaling proofs are characterized by PSPACE, and that no-signaling proofs with $poly(n)$-provers are characterized by EXP. However, the power of $k$-prover no-signaling proofs, for $2<k<poly(n)$ remained an open problem. We show that $k$-prover no-signaling proofs (with negligible soundness) for $k=O(\sqrt{\log n})$ are contained in PSPACE. We prove this via two …
A bipartite quantum channel represents the interaction between systems, generally allowing for exchange of information. A special class of bipartite channels are the no-signaling ones, which do not allow communication. In Ref. [1] it has been conjectured that all no-signaling channels are mixtures of entanglement-breaking and localizable channels, which require only local operations and entanglement. Here we provide the general realization scheme, giving a counterexample to the conjecture.
We consider a toy model for non-local quantum correlations in which nature resorts to some form of hidden signaling (i.e., signaling between boxes but not available to the users) to generate correlations. We show that if such a model also had memory, the parties would be able to exploit the hidden-signaling and use it to send a message, achieving faster-than-light communication. Given that memory is a resource easily available for any physical system, our results add evidence against hidden signaling as the mechanism behind nature's non-local behavior
We provide a general framework of utilizing the no-signaling principle in derivation of the guessing probability in the minimum-error quantum state discrimination. We show that, remarkably, the guessing probability can be determined by the no-signaling principle. This is shown by proving that in the semidefinite programming for the discrimination, the optimality condition corresponds to the constraint that quantum theory cannot be used for a superluminal communication. Finally, a general bound to the guessing probability is presented in a closed form.
We consider the problem of deriving the no-signaling condition from the assumption that, as seen from a complexity theoretic perspective, the universe is not an exponential place. A fact that disallows such a derivation is the existence of {\em polynomial superluminal} gates, hypothetical primitive operations that enable superluminal signaling but not the efficient solution of intractable problems. It therefore follows, if this assumption is a basic principle of physics, either that it must be supplemented with additional assumptions to prohibit such gates, or, improbably, that no-signaling is…
We argue that the essence of nonclassicality of a bipartite correlation is a positive signal deficit-- the communication cost excess over the available signaling. By this criterion, while violations of Bell-type and contextuality inequalities are necessarily non-classical, some violations of the Leggett-Garg inequality are classical. Further, signaling tends to diminish nonclassical properties, such as intrinsic randomness, no-cloning, complementarity, etc. Signal deficit is shown to have its ultimate origin in intrinsic randomness. A possible analogy of nonclassicality to the metamathematical…
Non-signaling assistance in prepare-and-measure scenarios with classical communication
Instituto de Física Gleb Wataghin, Universidade Estadual de Campinas（坎皮纳斯州立大学格莱布·瓦塔金物理研究所）；Instituto de Matemática, Estatística e Computação Científica, Universidade Estadual de Campinas（坎皮纳斯州立大学数学、统计与科学计算研究所）；Sorbonne Université, CNRS, LIP6（索邦大学法国国家科学研究中心LIP6实验室）；International Centre for Theory of Quantum Technologies, University of Gdańsk（格但斯克大学量子技术理论国际中心）；Naturwissenschaftlich-Technische Fakultät, Universität Siegen（锡根大学自然科学技术学院）
The experimental violation of Bell inequalities using spacelike separated measurements precludes the explanation of quantum correlations through causal influences propagating at subluminal speed. Yet, any such experimental violation could always be explained in principle through models based on hidden influences propagating at a finite speed v>c, provided v is large enough. Here, we show that for any finite speed v with c<v<infinity, such models predict correlations that can be exploited for faster-than-light communication. This superluminal communication does not require access to any hidden …
The impossibility of superluminal communication is a fundamental principle of physics. Here we show that this principle underpins the performance of several fundamental tasks in quantum information processing and quantum metrology. In particular, we derive tight no-signaling bounds for probabilistic cloning and super-replication that coincide with the corresponding optimal achievable fidelities and rates known. In the context of quantum metrology, we derive the Heisenberg limit from the no-signaling principle for certain scenarios including reference frame alignment and maximum likelihood stat…
In any theory satisfying the no-signaling principle correlations generated among spatially separated parties in a Bell-type experiment are subject to certain constraints known as monogamy relations. Recently, in the context of the black hole information loss problem it was suggested that these monogamy relations might be violated. This in turn implies that correlations arising in such a scenario must violate the no-signaling principle and hence can be used to send classical information between parties. Here, we study the amount of information that can be sent using such correlations. To this a…
We investigate a new class of quantum cloning machines that equally duplicate all real states in a Hilbert space of arbitrary dimension. By using the no-signaling condition, namely that cloning cannot make superluminal communication possible, we derive an upper bound on the fidelity of this class of quantum cloning machines. Then, for each dimension d, we construct an optimal symmetric cloner whose fidelity saturates this bound. Similar calculations can also be performed in order to recover the fidelity of the optimal universal cloner in d dimensions.
We show that monogamy of Bell's inequality violations, which is strictly weaker condition than no-signaling is enough to prove security of quantum key distribution. We derive our results for a whole class of monogamy constraints and generalize our results to any theory that communicating parties may have access to. Some of these theories do not respect no-signaling principle yet still allow for secure communication. This proves that no-signaling is only a sufficient condition for the possibility of secure communication, but not the necessary one. We also present some new qualitative results co…
Understanding the role that quantum entanglement plays as a resource in various information processing tasks is one of the crucial goals of quantum information theory. Here we propose a new perspective for studying quantum entanglement: distributed computation of functions without communication between nodes. To formalize this approach, we propose identity games. Surprisingly, despite of no-signaling, we obtain that non-local quantum strategies beat classical ones in terms of winning probability for identity games originating from certain bipartite and multipartite functions. Moreover we show …
Since Bell's theorem, it is known that quantum correlations cannot be described by local variables (LV) alone: if one does not want to abandon classical mechanisms for correlations, a superluminal form of communication among the particles must be postulated. A natural question is whether such a postulate would imply the possibility of superluminal signaling. Here we show that the assumption of finite-speed superluminal communication indeed leads to signaling when no LV are present, and more generally when only LV derivable from quantum statistics are allowed. When the most general LV are allow…
Bit commitment (BC) is an important cryptographic primitive for an agent to convince a mutually mistrustful party that she has already made a binding choice of 0 or 1 but only to reveal her choice at a later time. Ideally, a BC protocol should be simple, reliable, easy to implement using existing technologies, and most importantly unconditionally secure in the sense that its security is based on an information-theoretic proof rather than computational complexity assumption or the existence of a trustworthy arbitrator. Here we report such a provably secure scheme involving only one-way classica…
The quantum channel between two particle detectors provides a prototype framework for the study of wireless quantum communication via relativistic quantum fields. In this article we calculate the classical channel capacity between two Unruh-DeWitt detectors arising from couplings within the perturbative regime. To this end, we identify the detector states which achieve maximal signal strength. We use these results to investigate the impact of relativistic effects on signaling between detectors in inertial and uniformly accelerated motion which communicate via a massless field in Minkowski spac…
In Bell scenario, any nonlocal correlation, shared between two spatially separated parties, can be modeled deterministically either by allowing communications between the two parties or by restricting their free will in choosing the measurement settings. Recently, Bell scenario has been generalized into `semi-quantum' scenario where external quantum inputs are provided to the parties. We show that in `semi-quantum' scenario, entangled states produce correlations whose deterministic explanation is possible only if measurement independence is reduced. Thus in simulating quantum correlation `semi…
We reconsider the concept of multi-prover commitments, as introduced in the late eighties in the seminal work by Ben-Or et al. As was recently shown by Crépeau et al., the security of known two-prover commitment schemes not only relies on the explicit assumption that the provers cannot communicate, but also depends on their information processing capabilities. For instance, there exist schemes that are secure against classical provers but insecure if the provers have quantum information processing capabilities, and there are schemes that resist such quantum attacks but become insecure when con…
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 non-locality on a device independent scenario. That is, we study pairs of non-local boxes that produce their outputs deterministically. It is known that, for these boxes to be non-local, at least one of the boxes' output has to depend on the other party's input via some kind of hidden signaling. We prove that, if the deterministic mechan…
Different ensembles of the same density matrix are indistinguishable within the modern Kolmogorov probability measure theory of quantum random phenomena. We find that changing the framework from the Kolmogorov one to a frequentist-inspired theory of quantum random phenomena -- a la von Mises -- would lift the indistinguishability, and potentially cost us the no-signaling principle (i.e., lead to superluminal communication). We believe that this adds to the recent works on the search for a suitable representation of the state of a quantum system. While erstwhile arguments for potential modifica…
We formulate a series of non-trivial equalities which are satisfied by all no-signaling correlations, meaning that no faster-than-light communication is allowed with the resource of these correlations. All quantum and classical correlations satisfy these equalities since they are no-signaling. By applying these equalities, we provide a general framework for solving the multipartite "guess your neighbor's input" (GYNI) game, which is naturally no-signaling but shows conversely that general no-signaling correlations are actually more non-local than those allowed by quantum mechanics. We confirm …
Bell's theorem implies that any completion of quantum mechanics which uses hidden variables (that is, preexisting values of all observables) must be nonlocal in the Einstein sense. This customarily indicates that knowledge of the hidden variables would permit superluminal communication. Such superluminal signaling, akin to the existence of a preferred reference frame, is to be expected. However, here we provide a protocol that allows an observer with knowledge of the hidden variables to communicate with her own causal past, without superluminal signaling. That is, such knowledge would contradi…
We revise the 'no-signaling' condition for the supraluminal communication between two spatially separated finite quantum systems of arbitrary dimensions, thus generalizing a similar preceding approach for two-qubits: non-linear evolution does not necessarily imply the possibility of supraluminal communication between any sort of finite quantum systems.
A fundamental objective in quantum information science is to determine the cost in classical resources of simulating a particular quantum system. The classical simulation cost is quantified by the signaling dimension which specifies the minimum amount of classical communication needed to perfectly simulate a channel's input-output correlations when unlimited shared randomness is held between encoder and decoder. This paper provides a collection of device-independent tests that place lower and upper bounds on the signaling dimension of a channel. Among them, a single family of tests is shown to…
Large-scale multisource networks have been employed to overcome the practical constraints that entangled systems are difficult to faithfully transmit over large distance or store in long time. However, a full characterization of the multipartite nonlocality of these networks remains out of reach, mainly due to the complexity of multipartite causal models. In this paper, we propose a general framework of Bayesian networks to reveal connections among different causal structures. The present model implies a special star-convex set of non-signaling correlations from multisource networks that allow…
We propose a hidden variable analysis of collapse dynamics in which the state's reduction process may take a finite time $δt$. A full characterization of the model is given for the case of black boxes. By introducing nonlocal perfect correlations to a two black-boxes scenario, it is shown that in order to avoid faster than light communication, the reduction time associated to the system must be strictly null. Furthermore we prove that the result above holds even when there is a time window between the choice of both part's inputs. Our results represent a new evidence of the instantaneous natur…
We consider the problem of deriving the no-signaling condition from the assumption that, as seen from a complexity theoretic perspective, the universe is not an exponential place. A fact that disallows such a derivation is the existence of {\em polynomial superluminal} gates, hypothetical primitive operations that enable superluminal signaling but not the efficient solution of intractable problems. It therefore follows, if this assumption is a basic principle of physics, either that it must be supplemented with additional assumptions to prohibit such gates, or, improbably, that no-signaling is…
