Quantum networks allow in principle for completely novel forms of quantum correlations. In particular, quantum nonlocality can be demonstrated here without the need of having various input settings, but only by considering the joint statistics of fixed local measurement outputs. However, previous examples of this intriguing phenomenon all appear to stem directly from the usual form of quantum nonlocality, namely via the violation of a standard Bell inequality. Here we present novel examples of "quantum nonlocality without inputs", which we believe represent a new form of quantum nonlocality, genuine to networks. Our simplest examples, for the triangle network, involve both entangled states and joint entangled measurements. A generalization to any odd-cycle network is also presented. Finally, we conclude with some open questions. arXiv:1905.04902v1 [quant-ph]
A quantum network consists of independent sources distributing entangled states to distant nodes which can then perform entangled measurements, thus establishing correlations across the entire network. But how strong can these correlations be? Here we address this question, by deriving bounds on possible quantum correlations in a given network. These bounds are nonlinear inequalities that depend only on the topology of the network. We discuss in detail the notably challenging case of the triangle network. Moreover, we conjecture that our bounds hold in general no-signaling theories. In particular, we prove that our inequalities for the triangle network hold when the sources are arbitrary no-signaling boxes which can be wired together. Finally, we discuss an application of our results for the device-independent characterization of the topology of a quantum network.
The network scenario offers interesting new perspectives on the phenomenon of quantum nonlocality. Notably, when considering networks with independent sources, it is possible to demonstrate quantum nonlocality without the need for measurement inputs, i.e., with all parties performing a fixed quantum measurement. Here we aim to find minimal examples of this effect. Focusing on the minimal case of the triangle network, we present examples involving output cardinalities of 3-3-3 and 3-3-2. A key element is a rigidity result for the parity token counting distribution, which represents a minimal example of rigidity for a classical distribution. Finally, we discuss the prospects of finding an example of quantum nonlocality in the triangle network with binary outputs and point out a connection to the Lovasz local lemma.
Quantum secret sharing is a method for sharing a secret quantum state among a number of individuals such that certain authorized subsets of participants can recover the secret shared state by collaboration and other subsets cannot. In this paper, we first propose a method for sharing a quantum secret in a basic (2, 3) threshold scheme, only by using qubits and the 7-qubit CSS code. Based on this (2, 3) scheme, we propose a new (n, n) scheme and we also construct a quantum secret sharing scheme for any quantum access structure by induction. Secondly, based on the techniques of performing quantum computation on 7-qubit CSS codes, we introduce a method that authorized subsets can perform universal quantum computation on this shared state, without the need for recovering it. This generalizes recent attempts for doing quantum computation on (n, n) threshold schemes.
The network scenario offers interesting new perspectives on the phenomenon of quantum nonlocality. Notably, when considering networks with independent sources, it is possible to demonstrate quantum nonlocality without the need for measurements inputs, i.e. with all parties performing a fixed quantum measurement. Here we aim to find minimal examples of this effect. Focusing on the minimal case of the triangle network, we present examples involving output cardinalities of 3 − 3 − 3 and 3 − 3 − 2. Finally, we discuss the prospects of finding an example of quantum nonlocality in the triangle network with binary outputs, and point out a connection to the Lovasz local lemma.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.