Graph Structures for Local Distinguishability of Quantum Product States
Department of Mathematics & Statistics, University of Guelph（圭尔夫大学数学与统计系）；Department of Mathematics & Computer Science, Brandon University（布兰登大学数学与计算机科学系）；Department of Mathematical Sciences, Bentley University（本特利大学数学科学系）
Sooyeong Kim, David W. Kribs, Michael Nathanson, Rajesh Pereira, Sarah Plosker
We consider the problem of distinguishing sets of quantum product states with local operations and classical communication (LOCC). Recent work has used graph theory to identify sets of product states distinguishable with one-way LOCC. We extend these efforts to full two-way LOCC, with the first significant analysis of the set of graphs corresponding to bipartite product states that can be distinguished with two-way protocols after finitely many steps. We derive basic closure properties of the set of distinguishable graphs and identify some classes of graphs that guarantee local distinguishability and some graphs that do not. We also include several examples and forward-looking comments.
It is not always possible to distinguish multipartite orthogonal states if only local operation and classical communication (LOCC) are allowed. We prove that we cannot distinguish the states of an unextendible product basis (UPB) by LOCC even when infinite resources (infinite-dimensional ancillas, infinite number of operations). Moreover we give a necessary and sufficient condition for the LOCC distinguishability of complete product bases.
We consider deeply the relation between the orthogonality and the distinguishability of a set of arbitrary states (including multi-partite states). It is shown that if a set of arbitrary states can be distinguished by local operations and classical communication (LOCC), \QTR{it}{\}each of the states can be written as a linear combination of product vectors such that all product vectors of one of the states are orthogonal to the other states. With this result we then prove a simple necessary condition for LOCC distinguishability of a class of orthogonal states. These conclusions may be useful i…
Local distinguishability of five orthogonal product states on bipartite and tripartite quantum systems
College of Computer Science and Engineering, Shandong University of Science and Technology（山东科技大学计算机科学与工程学院）；Faculty of Information Technology, Beijing University of Technology（北京工业大学信息学部）；College of Mathematics and Systems Science, Shandong University of Science and Technology（山东科技大学数学与系统科学学院）
Local distinguishability of six bipartite orthogonal product states
College of Computer Science and Engineering, Shandong University of Science and Technology（山东科技大学计算机科学与工程学院）；College of Cyberspace Science and Technology, Beijing University of Technology（北京工业大学网络空间技术学院）；College of Mathematics and Systems Science, Shandong University of Science and Technology（山东科技大学数学与系统科学学院）
A statistical distinguishability based on relative entropy characterises the fitness of quantum states for phase estimation. This criterion is employed in the context of a Mach-Zehnder interferometer and used to interpolate between two regimes, of local and global phase distinguishability. The scaling of distinguishability in these regimes with photon number is explored for various quantum states. It emerges that local distinguishability is dependent on a discrepancy between quantum and classical rotational energy. Our analysis demonstrates that the Heisenberg limit is the true upper limit for…
This paper tries to probe the relation between the local distinguishability of orthogonal quantum states and the distillation of entanglement. An new interpretation for the distillation of entanglement and the distinguishability of orthogonal quantum states in terms of information is given, respectively. By constraining our discussion on a special protocol we give a necessary and sufficient condition for the local distinguishability of the orthogonal pure states, and gain the maximal yield of the distillable entanglement. It is shown that the information entropy, the locally distinguishability…
We investigate local distinguishability of quantum states by use of the convex analysis about joint numerical range of operators on a Hilbert space. We show that any two orthogonal pure states are distinguishable by local operations and classical communications, even for infinite dimensional systems. An estimate of the local discrimination probability is also given for some family of more than two pure states.
We completely characterize the condition when a tile structure provides an unextendible product basis (UPB), and construct UPBs of different large sizes in $\mathbb{C}^m\otimes\mathbb{C}^n$ for any $n\geq m\geq 3$. This solves an open problem in [S. Halder et al., Phys. Rev. A 99, 062329 (2019)]. As an application, we show that our UPBs of size $(mn-4\lfloor\frac{m-1}{2}\rfloor)$ in $\mathbb{C}^m\otimes\mathbb{C}^n$ can be perfectly distinguished by local operations and classical communications assisted with a $\lceil\frac{m}{2}\rceil\otimes\lceil\frac{m}{2}\rceil$ maximally entangled state.
An important problem in quantum information is to construct multiqubit unextendible product bases (UPBs). By using the unextendible orthogonal matrices, we construct a 7-qubit UPB of size 11. It solves an open problem in [Quantum Information Processing 19:185 (2020)]. Next, we graph-theoretically show that the UPB is locally indistinguishable in the bipartite systems of two qubits and five qubits, respectively. It turns out that the UPB corresponds to a complete graph with 11 vertices constructed by three sorts of nonisomorphic graphs. Taking the graphs as product vectors, we show that they ar…
Measuring an entangled state of two particles is crucial to many quantum communication protocols. Yet Bell state distinguishability using a finite apparatus obeying linear evolution and local measurement is theoretically limited. We extend known bounds for Bell-state distinguishability in one and two variables to the general case of entanglement in $n$ two-state variables. We show that at most $2^{n+1}-1$ classes out of $4^n$ hyper-Bell states can be distinguished with one copy of the input state. With two copies, complete distinguishability is possible. We present optimal schemes in each case…
Local distinguishability of sets of generalized Bell states (GBSs) is investigated. We first clarify the conditions such that a set of GBSs can be locally transformed to a certain type of GBS set that is easily distinguishable within local operations and one-way classical communication. We then show that, if the space dimension $d$ is a prime, these conditions are necessary and sufficient for sets of $d$ GBSs in $\mathbb{C}^d \otimes \mathbb{C}^d$ to be locally distinguishable. Thus we obtain a simple computable criterion for local distinguishability of sets of $d$ GBSs in prime dimension $d$.
The (im)possibility of local distinguishability of orthogonal multipartite quantum states still remains an intriguing question. Beyond $\mathbb{C}^{3}\otimes\mathbb{C}^{3}$, the problem remains unsolved even for maximally entangled states (MES). So far, the only known condition for the local distinguishability of states is the well-known orthogonality preservation (OP). Using an upper bound on the locally accessible information for bipartite states, we derive a very simple necessary condition for any set of pairwise orthogonal MES in $\mathbb{C}^{d}\otimes \mathbb{C}^{d}$ to be perfectly local…
The principle of local distinguishability states that an arbitrary physical state of a bipartite system can be determined by the combined statistics of local measurements performed on the subsystems. A necessary and sufficient requirement for the local measurements is that each one must be able to distinguish between all pairs of states of the respective subsystems. We show that if the task is changed into the determination of an arbitrary bipartite pure state, then at least in certain cases it is possible to restrict to local measurements which can distintinguish all pure states but not all s…
In this article, we show a sufficient and necessary condition for locally distinguishable bipartite states via one-way local operations and classical communication (LOCC). With this condition, we present some minimal structures of one-way LOCC indistinguishable quantum state sets. As long as an indistinguishable subset exists in a state set, the set is not distinguishable. We also list several distinguishable sets as instances.
We prove that any three linearly independent pure quantum states can always be locally distinguished with nonzero probability regardless of their dimension, entanglement, or multipartite structure. Almost always, all three states can be unambiguously identified. The only exceptional case, where one state is locally knowable but the other two are not, is found among multi-qubit states.
We present a complete characterization for the local distinguishability of orthogonal $2\otimes 3$ pure states except for some special cases of three states. Interestingly, we find there is a large class of four or three states that are indistinguishable by local projective measurements and classical communication (LPCC) can be perfectly distinguishable by LOCC. That indicates the ability of LOCC for discriminating $2\otimes 3$ states is strictly more powerful than that of LPCC, which is strikingly different from the case of multi-qubit states. We also show that classical communication plays a…
We analyze the difference in the local distinguishability among the following three restrictions; (i) Local operations and only one-way classical communications (one-way LOCC) are permitted. (ii) Local operations and two-way classical communications (two-way LOCC) are permitted. (iii) All separable operations are permitted. We obtain two main results concerning the discrimination between a given bipartite pure state and the completely mixed state with the condition that the given state should be detected perfectly. As the first result, we derive the optimal discrimination protocol for a bipart…
Recently, Halder \emph{et al.} [Phys. Rev. Lett. \textbf{122}, 040403 (2019)] proposed the concept strong nonlocality without entanglement: an orthogonal set of fully product states in multipartite quantum systems that is locally irreducible for every bipartition of the subsystems. As the difficulty of the problem, most of the results are restricted to tripartite systems. Here we consider a weaker form of nonlocality called local distinguishability based genuine nonlocality. A set of orthogonal multipartite quantum states is said to be genuinely nonlocal if it is locally indistinguishable for …
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.
In this paper, we mainly study the local distinguishable multipartite quantum states by local operations and classical communication (LOCC) in $m_1\otimes m_2\otimes\ldots\otimes m_n$ , where the quantum system $m_1$ belongs to Alice, $m_2$ belongs to Bob, \ldots and $m_n$ belongs to Susan. We first present the pure tripartite distinguishable orthogonal quantum states by LOCC in $m_1\otimes m_2\otimes m_3$. With the conclusion in $m_1\otimes m_2\otimes m_3$, we prove distinguishability or indistinguishability of some quantum states. At last, we give the $n$-party distinguishable quantum states…
We show that any two different unitary operations acting on an arbitrary multipartite quantum system can be perfectly distinguishable by local operations and classical communication when a finite number of runs is allowed. We then directly extend this result into the case when the number of unitary operations to be discriminated is more than two. Intuitively, our result means that the lost identity of a nonlocal (entangled) unitary operation can be recovered locally, without any use of entanglement or joint quantum operations.
Now, the known ensembles of orthogonal states which are distinguishable by local operators and classical communication (LOCC) satisfy the condition that the sum of Schmidit numbers of the orthogonal states is not bigger than the dimensions of the whole space. A natural question is whether an arbitary ensembles of LOCC-distinguishable orthogonal states satisfies the condition. We first show that, in this paper, the answer is positive. Then we generalize it into multipartite systems, and show that a necessary condition for LOCC-distinguishability of multipartite orthogonal quantum states is that…
We prove a tight and close-to-optimal lower bound on the effectiveness of local quantum measurements (without classical communication) at discriminating any two bipartite quantum states. Our result implies, for example, that any two orthogonal quantum states of a $n_A\times n_B$ bipartite quantum system can be discriminated via local measurements with an error probability no larger than $\frac12 \left(1 - \frac{1}{c \min\{n_A, n_B\}} \right)$, where $1\leq c\leq 2\sqrt2$ is a universal constant, and our bound scales provably optimally with the local dimensions $n_A,n_B$. Mathematically, this i…
We study the problem of distinguishing maximally entangled quantum states by using local operations and classical communication (LOCC). A question of fundamental interest is whether any three maximally entangled states in $\mathbb{C}^d\otimes\mathbb{C}^d (d\geq 4)$ are distinguishable by LOCC. In this paper, we restrict ourselves to consider the generalized Bell states. And we prove that any three generalized Bell states in $\mathbb{C}^d\otimes\mathbb{C}^d (d\geq 4)$ are locally distinguishable.
We show that a set of linearly independent quantum states $\{(U_{m,n}\otimes I)ρ^{AB}(U_{m,n}^{\dagger}\otimes I)\}_{m,n=0}^{d-1}$, where $U_{m,n}$ are generalized Pauli matrices, cannot be discriminated deterministically or probabilistically by local operations and classical communications (LOCC). On the other hand, any $l$ maximally entangled states from this set are locally distinguishable if $l(l-1)\le 2d$. The explicit projecting measurements are obtained to locally discriminate these states. As an example, we show that four Werner states are locally indistinguishable.
A subspace of a multipartite Hilbert space is completely entangled if it contains no product states. Such subspaces can be large with a known maximum size, S, approaching the full dimension of the system, D. We show that almost all subspaces with dimension less than or equal to S are completely entangled, and then use this fact to prove that n random pure quantum states are unambiguously locally distinguishable if and only if n does not exceed D-S. This condition holds for almost all sets of states of all multipartite systems, and reveals something surprising. The criterion is identical for se…
We investigate the possibility of distinguishing a set of mutually orthogonal multipartite quantum states by local operations and classical communication (LOCC). We connect this problem with generators of SU(N) and present a new condition that is necessary for a set of orthogonal states to be locally distinguishable. We show that even in multipartite cases there exists a systematic way to check whether the presented condition is satisfied for a given set of orthogonal states. Based on the proposed checking method, we find that LOCC cannot distinguish three mutually orthogonal states in which t…
In this paper we analyze the (im)possibility of the exact distinguishability of orthogonal multipartite entangled states under {\em restricted local operation and classical communication}. Based on this local distinguishability analysis we propose a new scheme for quantum secret sharing (QSS). Our QSS scheme is quite general and cost efficient compared to other schemes. In our scheme no joint quantum operation is needed to reconstruct the secret. We also present an interesting $(2,n)$-threshold QSS scheme, where any two cooperating players, one from each of two disjoint groups of players, can …
In the context of the quantum mechanical modelling of a measurement process using the Stern-Gerlach setup, we critically examine the relationship between the notion of `distinguishability' of apparatus states defined in terms of the inner product and spatial separation among the emerging wave packets. We show that, in general, the mutual orthogonality of these wave packets does not necessarily imply their unambiguous spatial separation even in the asymptotic limit. A testable scheme is formulated to quantify such departures from `idealness' for a range of relevant parameters.
In the topic of perfect local distinguishability of orthogonal multipartite quantum states, most results obtained so far pertain to bipartite systems whose subsystems are of specific dimensions. In contrast very few results for bipartite systems whose subsystems are of arbitrary dimensions, are known. This is because a rich variety of (algebraic or geometric) structure is exhibited by different sets of orthogonal states owing to which it is difficult to associate some common property underlying them all, i.e., a common property that would play a crucial role in the local distinguishability of …
Relativistic quantum field theory imposes additional fundamental restrictions on the distinguishability of quantum states. Because of the unavoidable delocalization of the quantum field states in the Minkowski space-time, the reliable (with unit probability) distinguishability of orthogonal states formally requires infinite time. For the cryptographic protocols which are finite in time the latter means that the effective ``noise'' is present even in the ideal communication channel because of the non-localizability of the quantum field states.
We investigate the properties of three entanglement measures that quantify the statistical distinguishability of a given state with the closest disentangled state that has the same reductions as the primary state. In particular, we concentrate on the relative entropy of entanglement with reversed entries. We show that this quantity is an entanglement monotone which is strongly additive, thereby demonstrating that monotonicity under local quantum operations and strong additivity are compatible in principle. In accordance with the presented statistical interpretation which is provided, this enta…
We develop two analytic lower bounds on the probability of success p of identifying a state picked from a known ensemble of pure states: a bound based on the pairwise inner products of the states, and a bound based on the eigenvalues of their Gram matrix. We use the latter to lower bound the asymptotic distinguishability of ensembles of n random quantum states in d dimensions, where n/d approaches a constant. In particular, for almost all ensembles of n states in n dimensions, p>0.72. An application to distinguishing Boolean functions (the "oracle identification problem") in quantum computatio…
Suppose a set of $m$-partite, $m\geq3$, pure orthogonal fully separable states is given. We consider the task of distinguishing these states perfectly by local operations and classical communication (LOCC) in different $k$-partitions, $1<k<m$. Based on this task, it is possible to classify the sets of product states into different classes. For tripartite systems, a classification of the sets with explicit examples is presented. Few important cases related to the aforesaid task are also studied when the number of parties, $m\geq4$. These cases never appear for a tripartite system. However, to d…
Nonlocality without entanglement is an interesting field. A manifestation of quantum nonlocality without entanglement is the local indistinguishability of a set of orthogonal product states. In this paper we analyze the character of operators to distinguish a set of full product bases in a multi-partite system, and show that distinguishing perfectly a set of full product bases needs only local projective measurements and classical communication, and these measurements cannot damage each product basis. Employing these conclusions one can discuss local distinguishability of full product bases ea…
In this paper, we consider the problem of discriminating quantum states by local operations and classical communication (LOCC) when an arbitrarily small amount of error is permitted. This paradigm is known as asymptotic state discrimination, and we derive necessary conditions for when two multipartite states of any size can be discriminated perfectly by asymptotic LOCC. We use this new criterion to prove a gap in the LOCC and separable distinguishability norms. We then turn to the operational advantage of using two-way classical communication over one-way communication in LOCC processing. With…
More than two multipartite orthogonal states cannot always be discriminated (with certainty) if only local operations and classical communication (LOCC) are allowed. Using an existing inequality among the measures of entanglement, we show that any three Bell states cannot be discriminated by LOCC. Exploiting the inequality, we calculate the distillable entanglement of a certain class of (4\otimes 4) mixed states.
We show that the possibility of distinguishing between single and two photon detection events, usually not met in the actual experiments, is not a necessary requirement for the proof that the experiments of Alley and Shih [Phys. Rev. Lett. 61, 2921 (1988)], and Ou and Mandel [Phys. Rev. Lett. 61, 50 (1988)], are modulo fair sampling assumption, valid tests of local realism. We also give the critical parameters for the experiments to be unconditional tests of local realism, and show that some other interesting phenomena (involving bosonic type particle indistinguishability) can be observed duri…
We consider the question of perfect local distinguishability of mutually orthogonal bipartite quantum states, with the property that every state can be specified by a unitary operator acting on the local Hilbert space of Bob. We show that if the states can be exactly discriminated by one-way LOCC where Alice goes first, then the unitary operators can also be perfectly distinguished by an orthogonal measurement on Bob's Hilbert space. We give examples of sets of N<=d maximally entangled states in $d \otimes d $ for d=4,5,6 that are not perfectly distinguishable by one-way LOCC. Interestingly fo…
Probabilities of photon counts at the output of a multiport optical device are generalised for optical sources of arbitrary quantum states in partially distinguishable optical modes. For the single-mode photon sources, the generating function for the probabilities is a linear combination of the matrix permanents of positive semi-definite Hermitian matrices, where each Hermitian matrix is a Hadamard product of a submatrix of the multiport matrix and a Hermitian matrix describing partial distinguishability. For the multi-mode sources the generating function is given by an integral of the Husimi …
An orthonormal basis consisting of unentangled (pure tensor) elements in a tensor product of Hilbert spaces is an Unentangled Orthogonal Basis (UOB). In general, for $n$ qubits, we prove that in its natural structure as a real variety, the space of UOB is a bouquet of products of Riemann spheres parametrized by a class of edge colorings of hypercubes. Its irreducible components of maximum dimension are products of $2^n-1$ two-spheres. Using a theorem of Walgate and Hardy, we observe that the UOB whose elements are distinguishable by local operations and classical communication (called locally …
Bell nonlocality can be formulated in terms of a resource theory with local-hidden variable models as resourceless objects. Two such theories are known, one built upon local operations assisted by shared randomness (LOSRs) and the other one allowing, in addition, for prior-to-input classical communication. We show that prior communication, although unable to create nonlocality, leads to wirings not only beyond LOSRs but also not contained in a much broader class of (nonlocality-generating) global wirings. Technically, this is shown by proving that it can improve the statistical distinguishabil…
We explore the intersection of studies in quantum error correction and quantum local operations and classical communication (LOCC). We consider one-way LOCC measurement protocols as quantum channels and investigate their error correction properties, emphasizing an operator theory approach to the subject, and we obtain new applications to one-way LOCC state distinguishability as well as new derivations of some established results. We also derive conditions on when states that arise through the stabilizer formalism for quantum error correction are distinguishable under one-way LOCC.
The are substantial studies on distinguishabilities, especially local distinguishability, of quantum states. It is shown that a necessary condition of a local distinguishable state set is the total Schmidt rank not larger than the system dimension. However, if we view states in a larger system, the restriction will be invalid. Hence, a nature problem is that can indistinguishable states become distinguishable by viewing them in a larger system without employing extra resources. In this paper, we consider this problem for (perfect or unambiguous) LOCC$_{1}$, PPT and SEP distinguishabilities. We…
I consider deterministic distinguishability of a set of orthogonal, bipartite states when only a single copy is available and the parties are restricted to local operations and classical communication, but with the additional requirement that entanglement must be preserved in the process. Several general theorems aimed at characterizing sets of states with which the parties can succeed in such a task are proven. These include (1) a maximum for the number of states when the Schmidt rank of every outcome must be at least a given minimum; (2) an upper bound (equal to the dimension of Hilbert spac…
We study the distinguishability of a particular type of maximally entangled states -- the "lattice states" using a new approach of semidefinite program. With this, we successfully construct all sets of four ququad-ququad orthogonal maximally entangled states that are locally indistinguishable and find some curious sets of six states having interesting property of distinguishability. Also, some of the problems arose from \cite{CosentinoR14} about the PPT-distinguishability of "lattice" maximally entangled states can be answered.
One of the many interesting features of quantum nonlocality is that the states of a multipartite quantum system cannot always be distinguished as well by local measurements as they can when all quantum measurements are allowed. In this work, we characterize the distinguishability of sets of multipartite quantum states when restricted to separable measurements -- those which contain the class of local measurements but nevertheless are free of entanglement between the component systems. We consider two quantities: The separable fidelity -- a truly quantum quantity -- which measures how well we c…
Hypothesis testing is a fundamental issue in statistical inference and has been a crucial element in the development of information sciences. The Chernoff bound gives the minimal Bayesian error probability when discriminating two hypotheses given a large number of observations. Recently the combined work of Audenaert et al. [Phys. Rev. Lett. 98, 160501] and Nussbaum and Szkola [quant-ph/0607216] has proved the quantum analog of this bound, which applies when the hypotheses correspond to two quantum states. Based on the quantum Chernoff bound, we define a physically meaningful distinguishabilit…
It is shown that local distinguishability of orthogonal mixed states can be completely characterized by local distinguishability of their supports irrespective of entanglement and mixedness of the states. This leads to two kinds of upper bounds on the number of perfect LOCC distinguishable orthogonal mixed states. The first one depends only on pure-state entanglement within the supports of the states, and therefore may be easy to compute in many instances. The second bound is optimal in the sense that it optimizes the bounding quantities, not necessarily function of entanglement alone, over al…
P-divisibility conditions on subsystems in quantum dynamics
TCG Centres for Research and Education in Science and Technology (TCG CREST)（科学技术研究与教育中心）；Academy of Scientific and Innovative Research (AcSIR)（科学与创新研究学院）；Ramakrishna Mission Vivekananda Educational and Research Institute（罗摩克里希那使命维韦卡南达教育与研究所）
We analyze quantum states formed as superpositions of an initial pure product state and its image under local unitary evolution, using two measurement-based measures of superposition size: one based on the optimal quantum binary distinguishability of the branches of the superposition and another based on the ratio of the maximal quantum Fisher information of the superposition to that of its branches, i.e., the relative metrological usefulness of the superposition. A general formula for the effective sizes of these states according to the branch distinguishability measure is obtained and applie…
