We show that standard nonlocal boxes, also known as Popescu-Rohrlich machines, are not sufficient to simulate any nonlocal correlations that do not allow signalling. This was known in the multipartite scenario, but we extend the result to the bipartite case. We then generalize this result further by showing that no finite set containing any finite-output-alphabet nonlocal boxes can be a universal set for nonlocality.
We show that standard nonlocal boxes, also known as Popescu-Rohrlich machines, are not sufficient to simulate any nonlocal correlations that do not allow signalling. This was known in the multipartite scenario, but we extend the result to the bipartite case. We then generalize this result further by showing that no finite set containing any finite-output-alphabet nonlocal boxes with uniform outputs can be a universal set for nonlocality.
In view of the remarkable interest raised by the introduction of the so called PR-box we analyze its nonlocal features from the point of view of Parameter and Outcome Dependence.
Understanding the structure of nonlocal correlations is important in many fields ranging from fundamental questions of physics to device-independent cryptography. We present a protocol that can convert extremal two-party--two-input nonlocal no-signaling boxes of any type into any other extremal two-party--two-input nonlocal no-signaling box perfectly. Our results are exact, and even though the number of required boxes cannot be determined in advance, their expected number is finite. Our protocol is adaptive and demonstrates for the first time the usefulness of using no-signaling boxes in diffe…
Correlation boxes are hypothetical systems capable of producing the maximal algebraic violation of Bell inequalities, beyond the quantum bound and without superluminal signaling. The fact that these systems show stronger correlations than those presented by maximally entangled quantum states has been regarded as a demonstration that the former are more nonlocal than the latter. By employing an alternative, consistent measure of nonlocality, we show that this conclusion is not necessarily true. In addition, we find a class of correlation boxes that are less nonlocal than the quantum singlet wit…
We report the first experimental demonstration of distillation of quantum nonlocality, confirming the recent theoretical protocol [\textit{Phys. Rev. Lett. 102, 120401 (2009)}]. Quantum nonlocality is described by a correlation box with binary inputs and outputs, and the nonlocal boxes are realized through appropriate measurements on polarization entangled photon pairs. We demonstrate that nonlocality is amplified by connecting two nonlocal boxes into a composite one through local operations and four-photon coincidence measurements.
The hypothetical nonlocal box (\textsf{NLB}) proposed by Popescu and Rohrlich allows two spatially separated parties, Alice and Bob, to exhibit stronger than quantum correlations. If the generated correlations are weak, they can sometimes be distilled into a stronger correlation by repeated applications of the \textsf{NLB}. Motivated by the limited distillability of \textsf{NLB}s, we initiate here a study of the distillation of correlations for nonlocal boxes that output quantum states rather than classical bits (\textsf{qNLB}s). We propose a new protocol for distillation and show that it asym…
Bell showed 50 years ago that quantum theory is nonlocal via his celebrated inequalities, turning the issue of quantum nonlocality from a matter of taste into a matter of test. Years later, Hardy proposed a test for nonlocality without inequality, which is a kind of "something-versus-nothing" argument. Hardy's test for $n$ particles induces an $n$-partite Bell's inequality with two dichotomic local measurements for each observer, which has been shown to be violated by all entangled pure states. Our first result is to show that the Bell-Hardy inequality arising form Hardy's nonlocality test is …
We define a family of 'no signaling' bipartite boxes with arbitrary inputs and binary outputs, and with a range of marginal probabilities. The defining correlations are motivated by the Klyachko version of the Kochen-Specker theorem, so we call these boxes Kochen-Specker-Klyachko boxes or, briefly, KS-boxes. The marginals cover a variety of cases, from those that can be simulated classically to the superquantum correlations that saturate the Clauser-Horne-Shimony-Holt inequality, when the KS-box is a generalized PR-box (hence a vertex of the `no signaling' polytope). We show that for certain m…
A set of nonlocal correlations that have come to be known as a PR box suggest themselves as a natural unit of nonlocality, much as a singlet is a natural unit of entanglement. We present two results relevant to this idea. One is that a wide class of multipartite correlations can be simulated using local operations on PR boxes only. We show this with an explicit scheme, which has the interesting feature that the number of PR boxes required is related to the computational resources necessary to represent a function defining the multipartite box. The second result is that there are quantum multip…
It is shown that Popescu-Rohrlich nonlocal boxes (beating the Tsirelson bound for Bell inequality) do exist in the existing structures of both quantum and classical theory. In particular, we design an explicit example of measure-and-prepare nonlocal (but no-signaling) channel being the realization of nonlocal and no-signaling Popescu-Rohrlich box within the generalized probabilistic theory of processes. Further we present a post-selection-based spatially non-local implementation and show it does not require truly quantum resources, hence, improving the previously known results. Interpretation …
We propose a class of nonlocal boxes named functional boxes which include a generalization of the Popescu-Rohrlich(PR) box as a special case. We show that every functional box corresponding to an additively inseparable function can make communication complexity trivial and thus seems unlikely to exist in nature. Then we relate general nonlocal boxes to these functional boxes, and derive several limits on them from the principle of information causality.
We show that there is a stronger form of bipartite quantum nonlocality in which systems that never interacted are as nonlocal as allowed by no-signaling. For this purpose, we first show that nonlocal boxes, theoretical objects that violate a bipartite Bell inequality as much as the no-signaling principle allows and which are physically impossible for most scenarios, are feasible if the two parties have 3 measurements with 4 outputs. Then we show that, in this case, entanglement swapping allows us to prepare mixtures of nonlocal boxes using systems that never interacted.
We present a nonlocal construction of universal gates by means of holonomic (geometric) quantum teleportation. The effect of the errors from imperfect control of the classical parameters, the looping variation of which builds up holonomic gates, is investigated. Additionally, the influence of quantum decoherence on holonomic teleportation used as a computational primitive is studied. Advantages of the holonomic implementation with respect to control errors and dissipation are presented.
Reproducing with elementary resources the correlations that arise when a quantum system is measured (quantum state simulation), allows one to get insight on the operational and computational power of quantum correlations. We propose a family of models that can simulate von Neumann measurements in the x-y plane of the Bloch sphere on n-partite GHZ states using only bipartite nonlocal boxes. For the tripartite and fourpartite states, the models use only bipartite nonlocal boxes; they can be translated into classical communication schemes with finite average communication cost.
We prove that there is no finite-alphabet nonlocal box that generates exactly those correlations that can be generated using a maximally entangled pair of qubits. More generally, we prove that if some finite-alphabet nonlocal box is strong enough to simulate arbitrary local projective measurements of a maximally entangled pair of qubits, then that nonlocal box cannot itself be simulated using any finite amount of entanglement. We also give a quantitative version of this theorem for approximate simulations, along with a corresponding upper bound.
Supraquantum nonlocality refers to correlations that are more nonlocal than allowed by quantum theory but still physically conceivable in post-quantum theories, in the sense of respecting the basic no-faster-than-light communication principle. While supraquantum correlations are relatively well understood for finite-dimensional systems, little is known in the infinite-dimensional case. Here, we study supraquantum nonlocality for bipartite systems with two measurement settings and infinitely many outcomes per subsystem. We develop a formalism for generic no-signaling black-box measurement devic…
It is argued that the quantum correlations are not maximally nonlocal to make it possible to control local outcomes from outside spacetime, and quantum mechanics emerges from timeless nonlocality and biased local randomness. This rules out a world described by NL (nonlocal) boxes. A new type of experiments is suggested.
We carry out a thought experiment in an imaginary world. Our world is both local and realistic, yet it violates a Bell inequality more than does quantum theory. This serves to debunk the myth that equates local realism with local hidden variables in the simplest possible manner. Along the way, we reinterpret the celebrated 1935 argument of Einstein, Podolsky and Rosen, and come to the conclusion that they were right in their questioning the completeness of the Copenhagen version of quantum theory, provided one believes in a local-realistic universe. Throughout our journey, we strive to explain…
Characterization and certification of nonlocal correlations is one of the the central topics in quantum information theory. In this work, we develop the detection methods of entanglement and steering based on the universal uncertainty relations and fine-grained uncertainty relations. In the course of our study, the uncertainty relations are formulated in majorization form, and the uncertainty quantifier can be chosen as any convex Schur concave functions, this leads to a large set of inequalities, including all existing criteria based on entropies. We address the question that if all steerable…
Since its publication, Aharonov and Vaidman's three-box paradox has undergone three major advances: i). A non-counterfactual scheme by the same authors in 2003 with strong rather than weak measurements for verifying the particle's subtle presence in two boxes. ii) A realization of the latter by Okamoto and Takeuchi in 2016. iii) A dynamic version by Aharonov et al. in 2017, with disappearance and reappearance of the particle. We now combine these advances together. Using photonic quantum routers the particle acts like a quantum "shutter." It is initially split between Boxes A, B and C, the lat…
We experimentally demonstrate that the nonlocal nature of time-bin entangled photonic qubits persists when one or two qubits of the pair are converted to polarization qubits. This is possible by implementing a novel Universal Time-Bin Qubit Analyzer (UTBA), which, for the first time, allows analyzing time-bin qubits in any basis. We reveal the nonlocal nature of the emitted light by violating the Clauser-Horne-Shimony-Holt inequality with measurement bases exploring all the dimensions of the Bloch sphere. Moreover, we conducted experiments where one qubit is transmitted over a 12.4 km undergro…
Buhrman showed that an efficient communication protocol implies a reliable XOR game protocol. This idea rederives Linial and Shraibman's lower bounds of communication complexity, which was derived by using factorization norms, with worse constant factor in much more intuitive way. In this work, we improve and generalize Buhrman's idea, and obtain a class of lower bounds for classical communication complexity including an exact Linial and Shraibman's lower bound as a special case. In the proof, we explicitly construct a protocol for XOR game from a classical communication protocol by using a co…
In the device-independent approach to quantum information theory, quantum systems are regarded as black boxes which, given an input (the measurement setting), return an output (the measurement result). These boxes are then treated regardless of their actual internal working. In this paper, we develop SWAP, a theoretical concept which, in combination with the tool of semi-definite methods for the characterization of quantum correlations, allows us to estimate physical properties of the black boxes from the observed measurement statistics. We find that the SWAP tool provides bounds orders of mag…
Quantum correlations forms a subset of the set of nonsignaling boxes. This allows us to characterize quantum correlations as a convex combination of the extremal boxes of the nonsignaling polytope which are Popescu-Rohrlich boxes (maximally nonlocal boxes) and local deterministic boxes. There exists multiple decomposition of quantum correlations in the context of the nonsignaling polytope. I find that the existence of Popescu-Rohrlich box decomposition for local boxes associates two notions of discord which capture nonclassicality of quantum correlations originating from Bell nonlocality and E…
Brassard et al. [Phys. Rev. Lett. 96, 250401 (2006)] showed that shared nonlocal boxes with the CHSH probability greater than $\frac{3+\sqrt{6}}6$ yields trivial communication complexity. There still exists the gap with the maximum CHSH probability $\frac{2+\sqrt{2}}4$ achievable by quantum mechanics. It is an interesting open question to determine the exact threshold for the trivial communication complexity. Brassard et al.'s idea is based on the recursive bias amplification by the 3-input majority function. It was not obvious if other choice of function exhibits stronger bias amplification. …
We describe a method for achieving arbitrary 1-qubit gates and controlled-NOT gates within the context of the Single Cooper Pair Box (SCB) approach to quantum computing. Such gates are sufficient to support universal quantum computation. Quantum gate operations are achieved by applying sequences of voltages and magnetic fluxes to single qubits or pairs of qubits. Neither the temporal duration, nor the starting time, of a gate operation is used as a control parameter. As a result, the quantum gates have a constant and known duration, and depend upon standard control parameter sequences regardle…
Spatial separation restricts the set of locally implementable quantum operations on distributed multipartite quantum systems. We propose that indefinite causal structure arising due to quantum superposition of different space-time geometries can be used as an independent universal resource for local implementation of any quantum operation on spatially distributed quantum systems. Consequently, all such quantum tasks that are not accomplishable by local operations and classical communication (LOCC) only also become locally accomplishable. We show that exploiting indefinite causal structure as t…
Center Leo Apostel for Interdisciplinary Studies(里奥·阿波斯泰尔跨学科研究中心);Brussels Free University(布鲁塞尔自由大学)
We work out a classification scheme for quantum modeling in Hilbert space of any kind of composite entity violating Bell's inequalities and exhibiting entanglement. Our theoretical framework includes situations with entangled states and product measurements ('customary quantum situation'), and also situations with both entangled states and entangled measurements ('nonlocal box situation', 'nonlocal non-marginal box situation'). We show that entanglement is structurally a joint property of states and measurements. Furthermore, entangled measurements enable quantum modeling of situations that ar…