Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2207.13138 · Physical Review A

Multipartite subspaces containing no locally inaccessible information

Sarah Croke

Published Sep 15, 2022• 1 citation
arXivHTMLPDF

Abstract

One notion of nonlocality in quantum theory is the fact that information may be encoded in a composite system in such a way that it is not accessible through local measurements, even with the assistance of classical communication. Thus, contrary to the classical case, there exists information in quantum many-body systems which cannot be accessed locally. We show, however, that, remarkably, two-dimensional subspaces do not have this property: Any physically allowed measurement on information encoded in any two-dimensional subspace, regardless of entanglement or multipartite structure, may be performed locally. Further, this requires only local measurement and feed-forward of classical information, readily achievable in many experimental platforms. As an application to quantum secret sharing we suggest a twist on a well-known quantum information splitting protocol, which ensures that no receiving party ever has access to the full state sent, but parties must work together to perform measurements on the state. These results may have practical applications to the measurement of encoded qubits in, e.g., quantum secret sharing, quantum error correction, and reveal a fundamental property unique to two-dimensional subspaces.

DOI
10.1103/physreva.106.032421

Related papers

Unambiguous discrimination of special sets of multipartite states using local measurements and classical communication

Jihane Mimih, Mark S. Hillery

We initially consider a quantum system consisting of two qubits, which can be in one of two nonorthogonal states $\ensuremath{\mid}{\ensuremath{\Psi}}_{0}⟩$ and $\ensuremath{\mid}{\ensuremath{\Psi}}_{1}⟩$. We distribute the qubits to two parties, Alice and Bob. They each measure their qubits and then compare their measurement results to determine which state they were sent. This procedure is error-free, which implies that it must sometimes fail. In addition, no quantum memory is required; it is not necessary for one of the qubits to be stored until the result of the measurement on the other is known. We consider the cases in which, should failure occur, both parties receive a failure signal or only one does. In the latter case, if the two states share the same Schmidt basis, the states can be discriminated with the same failure probability that would be obtained if the qubits were measured together. This scheme is sufficiently simple that it can be generalized to multipartite qubit, and qudit, states. Applications to quantum secret sharing are discussed. Finally, we present an optical scheme to experimentally realize the protocol in the case of two qubits.

arXiv:quant-ph/0501174•Physical Review A•Jan 20, 2005•13 citations

Unambiguous discrimination of two nonorthogonal multipartite states using local measurements and classical communication (Invited Paper)

Jihane Mimih, Mark S. Hillery

We consider a quantum system of two nonorthogonal bipartite quantum states. We distribute the qubits between two parties, Alice and Bob. They each measure their qubits and then compare their measurement results to determine which state they were sent. This procedure is error-free, which implies that it must sometimes fail. In addition, no quantum memory is required; it is not necessary for one of the qubits to be stored until the result of the measurement on the other is known. We consider the cases in which, should a failure occur, both parties receive a failure signal or only one does. In the latter case, if the two states share the same Schmidt basis, the states can be discriminated with the same failure probability as would be obtained if the qubits were measured together. This scheme is sufficiently simple that it can be generalized to multipartite qubit and qudit states. Applications to quantum secret sharing are discussed.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 23, 2005•0 citations

Several nonlocal sets of multipartite pure orthogonal product states

Saronath Halder

It is known that there exist sets of pure orthogonal product states which cannot be perfectly distinguished by local operations and classical communication (LOCC). Such sets are nonlocal sets which exhibit nonlocality without entanglement. These nonlocal sets can be completable or uncompletable. In this work both completable and uncompletable small nonlocal sets of multipartite orthogonal product states are constructed. Apart from nonlocality, these sets have other interesting properties. In particular, the completable sets lead to the construction of a class of complete orthogonal product bases with the property that if such a basis is given then no state can be eliminated from that basis by performing orthogonality-preserving measurements. On the other hand, an uncompletable set of the present kind contains several Shifts unextendible product bases (UPBs) that belong to qubit subspaces. Identifying these subspace UPBs, it is possible to obtain a class of high-dimensional multipartite bound entangled states. Finally, it is shown that a two-qubit maximally entangled Bell state shared between any two parties is sufficient as a resource to distinguish the states of any completable set (of the above kind) perfectly by LOCC. This constitutes an example where the amount of entanglement, sufficient to accomplish the aforesaid task, depends neither on the dimension of the individual subsystems nor on the number of parties.

arXiv:1603.08438•Physical Review A•Aug 3, 2018•95 citations

Nonlocality under Computational Assumptions

Khashayar Barooti, Alexandru Gheorghiu, Grzegorz Głuch +1 more

Nonlocality and its connections to entanglement are fundamental features of quantum mechanics that have found numerous applications in quantum information science. A set of correlations is said to be nonlocal if it cannot be reproduced by spacelike-separated parties sharing randomness and performing local operations. An important practical consideration is that the runtime of the parties has to be shorter than the time it takes light to travel between them. One way to model this restriction is to assume that the parties are computationally bounded. We therefore initiate the study of nonlocality under computational assumptions and derive the following results: (a) We define the set $\mathsf{NeL}$ (not-efficiently-local) as consisting of all bipartite states whose correlations arising from local measurements cannot be reproduced with shared randomness and \emph{polynomial-time} local operations. (b) Under the assumption that the Learning With Errors problem cannot be solved in \emph{quantum} polynomial-time, we show that $\mathsf{NeL}=\mathsf{ENT}$, where $\mathsf{ENT}$ is the set of \emph{all} bipartite entangled states (pure and mixed). This is in contrast to the standard notion of nonlocality where it is known that some entangled states, e.g. Werner states, are local. In essence, we show that there exist (efficient) local measurements producing correlations that cannot be reproduced through shared randomness and quantum polynomial-time computation. (c) We prove that if $\mathsf{NeL}=\mathsf{ENT}$ unconditionally, then $\mathsf{BQP}\neq\mathsf{PP}$. In other words, the ability to certify all bipartite entangled states against computationally bounded adversaries gives a non-trivial separation of complexity classes. (d) Using (c), we show that a certain natural class of 1-round delegated quantum computation protocols that are sound against $\mathsf{PP}$ provers cannot exist.

arXiv:2303.02080•Mar 3, 2023•1 citation

Nonlocality without entanglement for multipartite quantum measurements

Satyaki Manna, Debashis Saha

We show that a pair of two-qubit product measurements can be perfectly distinguished when accessed jointly, yet cannot be perfectly distinguished when their local components are distributed between distant parties restricted to local quantum operations and classical communication (LOCC). This establishes a measurement analogue of nonlocality without entanglement that, unlike its state-based counterpart, emerges in a remarkably simple setting. We further uncover a hierarchy of LOCC discrimination strategies: adaptive protocols, in which the probe used at one site may depend on classical information obtained from another, can strictly outperform restricted non-adaptive protocols, as demonstrated by a set of six bipartite qutrit product measurements. We also show that LOCC distinguishability of bipartite measurements can be intrinsically directional, depending on which party initiates the protocol. More generally, we construct pairs of $n$-qubit product measurements that are globally perfectly distinguishable but cannot be perfectly distinguished across any bipartition, even when all parties on either side of the bipartition are allowed arbitrary joint quantum operations. Finally, we show how quantum data hiding based on quantum-process nonlocality without entanglement can be realized using elementary optical components.

quant-pharXiv:2610.02032•Oct 2, 2026•0 citations

Resources for quantum information tasks: from the bipartite to the multipartite scenario

Mafalda L. Almeida

Quantum physics provides results at information processing tasks that are unattainable by any classical theory. The aim of this thesis is to identify and characterize quantum entanglement and quantum nonlocality, the key resources used at quantum information protocols. We consider the problem of finding better experimental schemes to detect entangled states. For that, we study approximate physical realizations to non-physical processes, which provide the most efficient method to identify entanglement. We prove that many of these physical approximations have a simple experimental implementation. We then study characterization of quantum nonlocality. We introduce a method using the multipartite scenario, where more than two parties are involved, which provides several results on bipartite and multipartite quantum nonlocality. First, we prove that there exist quantum states which contain full multipartite nonlocality, which consist of the strongest kind of nonlocality. then, we prove that the combined use of several copies of a state can activate its nonlocal properties. In particular, this holds for bipartite and genuine multipartite nonlocality. Finally, we characterize quantum nonlocality by distinguishing it from stronger-than-quantum nonlocality. We construct a multipartite game for which classical and quantum players perform equally well, but for which supre-quantum players can sometimes provide an advantage. Our results suggest that physical resources might obbey a generalized no-signaling principle ( according to which ther's no instantaneous communication).

•Jan 1, 2010•0 citations
One notion of nonlocality in quantum theory is the fact that information may be encoded in a composite system in such a way that it is not accessible through local measurements, even with the assistance of classical communication. Thus, contrary to the classical case, there exists information in quantum many-body systems which cannot be accessed locally. We show, however, that, remarkably, two-dimensional subspaces do not have this property: Any physically allowed measurement on information encoded in any two-dimensional subspace, regardless of entanglement or multipartite structure, may be performed locally. Further, this requires only local measurement and feed-forward of classical information, readily achievable in many experimental platforms. As an application to quantum secret sharing we suggest a twist on a well-known quantum information splitting protocol, which ensures that no receiving party ever has access to the full state sent, but parties must work together to perform measurements on the state. These results may have practical applications to the measurement of encoded qubits in, e.g., quantum secret sharing, quantum error correction, and reveal a fundamental property unique to two-dimensional subspaces.
We initially consider a quantum system consisting of two qubits, which can be in one of two nonorthogonal states $\ensuremath{\mid}{\ensuremath{\Psi}}_{0}⟩$ and $\ensuremath{\mid}{\ensuremath{\Psi}}_{1}⟩$. We distribute the qubits to two parties, Alice and Bob. They each measure their qubits and then compare their measurement results to determine which state they were sent. This procedure is error-free, which implies that it must sometimes fail. In addition, no quantum memory is required; it is not necessary for one of the qubits to be stored until the result of the measurement on the other is known. We consider the cases in which, should failure occur, both parties receive a failure signal or only one does. In the latter case, if the two states share the same Schmidt basis, the states can be discriminated with the same failure probability that would be obtained if the qubits were measured together. This scheme is sufficiently simple that it can be generalized to multipartite qubit, and qudit, states. Applications to quantum secret sharing are discussed. Finally, we present an optical scheme to experimentally realize the protocol in the case of two qubits.
We consider a quantum system of two nonorthogonal bipartite quantum states. We distribute the qubits between two parties, Alice and Bob. They each measure their qubits and then compare their measurement results to determine which state they were sent. This procedure is error-free, which implies that it must sometimes fail. In addition, no quantum memory is required; it is not necessary for one of the qubits to be stored until the result of the measurement on the other is known. We consider the cases in which, should a failure occur, both parties receive a failure signal or only one does. In the latter case, if the two states share the same Schmidt basis, the states can be discriminated with the same failure probability as would be obtained if the qubits were measured together. This scheme is sufficiently simple that it can be generalized to multipartite qubit and qudit states. Applications to quantum secret sharing are discussed.
It is known that there exist sets of pure orthogonal product states which cannot be perfectly distinguished by local operations and classical communication (LOCC). Such sets are nonlocal sets which exhibit nonlocality without entanglement. These nonlocal sets can be completable or uncompletable. In this work both completable and uncompletable small nonlocal sets of multipartite orthogonal product states are constructed. Apart from nonlocality, these sets have other interesting properties. In particular, the completable sets lead to the construction of a class of complete orthogonal product bases with the property that if such a basis is given then no state can be eliminated from that basis by performing orthogonality-preserving measurements. On the other hand, an uncompletable set of the present kind contains several Shifts unextendible product bases (UPBs) that belong to qubit subspaces. Identifying these subspace UPBs, it is possible to obtain a class of high-dimensional multipartite bound entangled states. Finally, it is shown that a two-qubit maximally entangled Bell state shared between any two parties is sufficient as a resource to distinguish the states of any completable set (of the above kind) perfectly by LOCC. This constitutes an example where the amount of entanglement, sufficient to accomplish the aforesaid task, depends neither on the dimension of the individual subsystems nor on the number of parties.
Nonlocality and its connections to entanglement are fundamental features of quantum mechanics that have found numerous applications in quantum information science. A set of correlations is said to be nonlocal if it cannot be reproduced by spacelike-separated parties sharing randomness and performing local operations. An important practical consideration is that the runtime of the parties has to be shorter than the time it takes light to travel between them. One way to model this restriction is to assume that the parties are computationally bounded. We therefore initiate the study of nonlocality under computational assumptions and derive the following results: (a) We define the set NeL\mathsf{NeL}NeL (not-efficiently-local) as consisting of all bipartite states whose correlations arising from local measurements cannot be reproduced with shared randomness and \emph{polynomial-time} local operations. (b) Under the assumption that the Learning With Errors problem cannot be solved in \emph{quantum} polynomial-time, we show that NeL=ENT\mathsf{NeL}=\mathsf{ENT}NeL=ENT, where ENT\mathsf{ENT}ENT is the set of \emph{all} bipartite entangled states (pure and mixed). This is in contrast to the standard notion of nonlocality where it is known that some entangled states, e.g. Werner states, are local. In essence, we show that there exist (efficient) local measurements producing correlations that cannot be reproduced through shared randomness and quantum polynomial-time computation. (c) We prove that if NeL=ENT\mathsf{NeL}=\mathsf{ENT}NeL=ENT unconditionally, then BQP≠PP\mathsf{BQP}\neq\mathsf{PP}BQP=PP. In other words, the ability to certify all bipartite entangled states against computationally bounded adversaries gives a non-trivial separation of complexity classes. (d) Using (c), we show that a certain natural class of 1-round delegated quantum computation protocols that are sound against PP\mathsf{PP}PP provers cannot exist.
We show that a pair of two-qubit product measurements can be perfectly distinguished when accessed jointly, yet cannot be perfectly distinguished when their local components are distributed between distant parties restricted to local quantum operations and classical communication (LOCC). This establishes a measurement analogue of nonlocality without entanglement that, unlike its state-based counterpart, emerges in a remarkably simple setting. We further uncover a hierarchy of LOCC discrimination strategies: adaptive protocols, in which the probe used at one site may depend on classical information obtained from another, can strictly outperform restricted non-adaptive protocols, as demonstrated by a set of six bipartite qutrit product measurements. We also show that LOCC distinguishability of bipartite measurements can be intrinsically directional, depending on which party initiates the protocol. More generally, we construct pairs of nnn-qubit product measurements that are globally perfectly distinguishable but cannot be perfectly distinguished across any bipartition, even when all parties on either side of the bipartition are allowed arbitrary joint quantum operations. Finally, we show how quantum data hiding based on quantum-process nonlocality without entanglement can be realized using elementary optical components.
Quantum physics provides results at information processing tasks that are unattainable by any classical theory. The aim of this thesis is to identify and characterize quantum entanglement and quantum nonlocality, the key resources used at quantum information protocols. We consider the problem of finding better experimental schemes to detect entangled states. For that, we study approximate physical realizations to non-physical processes, which provide the most efficient method to identify entanglement. We prove that many of these physical approximations have a simple experimental implementation. We then study characterization of quantum nonlocality. We introduce a method using the multipartite scenario, where more than two parties are involved, which provides several results on bipartite and multipartite quantum nonlocality. First, we prove that there exist quantum states which contain full multipartite nonlocality, which consist of the strongest kind of nonlocality. then, we prove that the combined use of several copies of a state can activate its nonlocal properties. In particular, this holds for bipartite and genuine multipartite nonlocality. Finally, we characterize quantum nonlocality by distinguishing it from stronger-than-quantum nonlocality. We construct a multipartite game for which classical and quantum players perform equally well, but for which supre-quantum players can sometimes provide an advantage. Our results suggest that physical resources might obbey a generalized no-signaling principle ( according to which ther's no instantaneous communication).