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

Locally undetermined states: characterization and an application in distributed computing

Yuan Feng, Runyao Duan, Mingsheng Ying

Published Aug 21, 2008• 0 citations
OpenAlex

Abstract

Multipartite quantum states that cannot be uniquely determined by their reduced states of all proper subsets of the parties exhibit some inherit ‘high-order ’ correlation. This paper elaborates this issue by giving necessary and sufficient conditions for a pure multipartite state to be locally undetermined, and moreover, characterizing precisely all the pure states sharing the same set of reduced states with it. Interestingly, we find that locally undetermined states have some applications to the well-known consensus problem in distributed computation. To be specific, given some physically separated agents, when communication between them, either classical or quantum, is unreliable and they are not allowed to use local ancillary quantum systems, then there exists a totally correct and completely fault-tolerant protocol for them to reach a consensus if and only if they share a priori a locally undetermined quantum state. 1

Related papers

Locally undetermined states, generalized Schmidt decomposition, and application in distributed computing

Yuan Feng, Runyao Duan, Mingsheng Ying

Multipartite quantum states that cannot be uniquely determined by their reduced states of all proper subsets of the parties exhibit some inherit `high-order' correlation. This paper elaborates this issue by giving necessary and sufficient conditions for a pure multipartite state to be locally undetermined, and moreover, characterizing precisely all the pure states sharing the same set of reduced states with it. Interestingly, local determinability of pure states is closely related to a generalized notion of Schmidt decomposition. Furthermore, we find that locally undetermined states have some applications to the well-known consensus problem in distributed computing. To be specific, given some physically separated agents, when communication between them, either classical or quantum, is unreliable, then there exists a totally correct and completely fault-tolerant protocol for them to reach a consensus if and only if they share a priori a locally undetermined quantum state.

arXiv:0808.2938•Quantum Information and Computation•Nov 1, 2009•1 citation

Distinguishability of Quantum States by Separable Operations

Runyao Duan, Yuan Feng, Yu Xin +1 more

In this paper, we study the distinguishability of multipartite quantum states by separable operations. We first present a necessary and sufficient condition for a finite set of orthogonal quantum states to be distinguishable by separable operations. An analytical version of this condition is derived for the case of(D-1) pure states, whereDis the total dimension of the state space under consideration. A number of interesting consequences of this result are then carefully investigated. Remarkably, we show there exists a large class of 2 otimes 2 separable operations not being realizable by local operations and classical communication. Before our work, only a class of 3 otimes 3 nonlocal separable operations was known [Bennett , Phys. Rev. A 59, 1070 (1999)]. We also show that any basis of the orthogonal complement of a multipartite pure state is indistinguishable by separable operations if and only if this state cannot be a superposition of one or two orthogonal product states, i.e., has an orthogonal Schmidt number not less than three, thus generalize the recent work about indistinguishable bipartite subspaces [Watrous, Phys. Rev. Lett. 95, 080505 (2005)]. Notably, we obtain an explicit construction of indistinguishable subspaces of dimension 7 (or 6) by considering a composite quantum system consisting of two qutrits (resp., three qubits), which is slightly better than the previously known indistinguishable bipartite subspace with dimension 8.

arXiv:0705.0795•IEEE Transactions on Information Theory•Feb 26, 2009•112 citations

Local Distinguishability of Multipartite Orthogonal Quantum States

Jonathan Walgate, Anthony J. Short, Lucién Hardy +1 more

We consider one copy of a quantum system prepared in one of two orthogonal pure states, entangled or otherwise, and distributed between any number of parties. We demonstrate that it is possible to identify which of these two states the system is in by means of local operations and classical communication alone. The protocol we outline is both completely reliable and completely general; it will correctly distinguish any two orthogonal states 100% of the time.

arXiv:quant-ph/0007098•Physical Review Letters•Dec 4, 2000•471 citations

Locally unidentifiable subset of quantum states and its resourcefulness in secret password distribution

Pratik Ghosal, Arkaprabha Ghosal, Subhendu B. Ghosh +1 more

We introduce a stronger form of quantum nonlocality, termed local subset unidentifiability, that arises from the limitation of spatially separated parties to perfectly identify a subset of mutually orthogonal multipartite quantum states, randomly chosen from a larger known set, using local operations and classical communication (LOCC). We show that this nonlocality is stronger than other existing forms of quantum nonlocality, such as local indistinguishability and local unmarkability. If more than one multipartite states from a locally indistinguishable set are distributed between spatially separated parties in a sequentially ordered fashion, then they may or may not mark which state is which using LOCC. However, we show that even when the parties cannot mark the states, they may still locally identify the particular states given to them, though not their order---i.e., they can identify the elements of the given subset of states. Then we prove the existence of such subsets that are not even locally identifiable, thereby manifesting a stronger nonlocality. We also present the genuine version of this nonlocality---genuine subset unidentifiability---where the provided subset remains unidentifiable unless all the parties come together in a common location and perform global measurements. We anticipate potential applications of this nonlocality for future quantum technologies. We discuss one such application in a certain secret password distribution protocol, where this nonlocality outperforms its predecessors as a resource.

arXiv:2209.10954•Physical Review A•May 13, 2024•6 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

Local unitary equivalence and entanglement of multipartite pure states

Barbara Kraus

The necessary and sufficient conditions for the equivalence of arbitrary $n$-qubit pure quantum states under local unitary (LU) operations derived in [B. Kraus, Phys. Rev. Lett. 104, 020504 (2010)] are used to determine the different LU-equivalence classes of up to five-qubit states. Due to this classification new parameters characterizing multipartite entanglement are found and their physical interpretation is given. Moreover, the method is used to derive examples of two $n$-qubit states (with $n>2$ arbitrary) which have the properties that all the entropies of any subsystem coincide; however, the states are neither LU equivalent nor can be mapped into each other by general local operations and classical communication.

arXiv:1005.5295•Physical Review A•Sep 30, 2010•89 citations
Multipartite quantum states that cannot be uniquely determined by their reduced states of all proper subsets of the parties exhibit some inherit ‘high-order ’ correlation. This paper elaborates this issue by giving necessary and sufficient conditions for a pure multipartite state to be locally undetermined, and moreover, characterizing precisely all the pure states sharing the same set of reduced states with it. Interestingly, we find that locally undetermined states have some applications to the well-known consensus problem in distributed computation. To be specific, given some physically separated agents, when communication between them, either classical or quantum, is unreliable and they are not allowed to use local ancillary quantum systems, then there exists a totally correct and completely fault-tolerant protocol for them to reach a consensus if and only if they share a priori a locally undetermined quantum state. 1
Multipartite quantum states that cannot be uniquely determined by their reduced states of all proper subsets of the parties exhibit some inherit `high-order' correlation. This paper elaborates this issue by giving necessary and sufficient conditions for a pure multipartite state to be locally undetermined, and moreover, characterizing precisely all the pure states sharing the same set of reduced states with it. Interestingly, local determinability of pure states is closely related to a generalized notion of Schmidt decomposition. Furthermore, we find that locally undetermined states have some applications to the well-known consensus problem in distributed computing. To be specific, given some physically separated agents, when communication between them, either classical or quantum, is unreliable, then there exists a totally correct and completely fault-tolerant protocol for them to reach a consensus if and only if they share a priori a locally undetermined quantum state.
In this paper, we study the distinguishability of multipartite quantum states by separable operations. We first present a necessary and sufficient condition for a finite set of orthogonal quantum states to be distinguishable by separable operations. An analytical version of this condition is derived for the case of(D-1) pure states, whereDis the total dimension of the state space under consideration. A number of interesting consequences of this result are then carefully investigated. Remarkably, we show there exists a large class of 2 otimes 2 separable operations not being realizable by local operations and classical communication. Before our work, only a class of 3 otimes 3 nonlocal separable operations was known [Bennett , Phys. Rev. A 59, 1070 (1999)]. We also show that any basis of the orthogonal complement of a multipartite pure state is indistinguishable by separable operations if and only if this state cannot be a superposition of one or two orthogonal product states, i.e., has an orthogonal Schmidt number not less than three, thus generalize the recent work about indistinguishable bipartite subspaces [Watrous, Phys. Rev. Lett. 95, 080505 (2005)]. Notably, we obtain an explicit construction of indistinguishable subspaces of dimension 7 (or 6) by considering a composite quantum system consisting of two qutrits (resp., three qubits), which is slightly better than the previously known indistinguishable bipartite subspace with dimension 8.
We introduce a stronger form of quantum nonlocality, termed local subset unidentifiability, that arises from the limitation of spatially separated parties to perfectly identify a subset of mutually orthogonal multipartite quantum states, randomly chosen from a larger known set, using local operations and classical communication (LOCC). We show that this nonlocality is stronger than other existing forms of quantum nonlocality, such as local indistinguishability and local unmarkability. If more than one multipartite states from a locally indistinguishable set are distributed between spatially separated parties in a sequentially ordered fashion, then they may or may not mark which state is which using LOCC. However, we show that even when the parties cannot mark the states, they may still locally identify the particular states given to them, though not their order---i.e., they can identify the elements of the given subset of states. Then we prove the existence of such subsets that are not even locally identifiable, thereby manifesting a stronger nonlocality. We also present the genuine version of this nonlocality---genuine subset unidentifiability---where the provided subset remains unidentifiable unless all the parties come together in a common location and perform global measurements. We anticipate potential applications of this nonlocality for future quantum technologies. We discuss one such application in a certain secret password distribution protocol, where this nonlocality outperforms its predecessors as a resource.
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.
The necessary and sufficient conditions for the equivalence of arbitrary nnn-qubit pure quantum states under local unitary (LU) operations derived in [B. Kraus, Phys. Rev. Lett. 104, 020504 (2010)] are used to determine the different LU-equivalence classes of up to five-qubit states. Due to this classification new parameters characterizing multipartite entanglement are found and their physical interpretation is given. Moreover, the method is used to derive examples of two nnn-qubit states (with n>2n>2n>2 arbitrary) which have the properties that all the entropies of any subsystem coincide; however, the states are neither LU equivalent nor can be mapped into each other by general local operations and classical communication.