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:2110.04387 · IEEE Transactions on Information Theory

Maximal Gap Between Local and Global Distinguishability of Bipartite Quantum States

Willian H. G. Corrêa, Ludovico Lami, Carlos Palazuelos

Published Jun 27, 2022• 7 citations
arXivHTMLPDF

Abstract

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 $\frac {1}2 \left ({1 - \frac {1}{c \min \{n_{A}, n_{B}\}} }\right)$ , where $1\leq c\leq 2\sqrt {2}$ is a universal constant, and our bound scales provably optimally with the local dimensions $n_{A},n_{B}$ . Mathematically, this is achieved by showing that the distinguishability norm $\|\cdot \|_{ \mathrm {LO}}$ associated with local measurements satisfies that $\|\cdot \|_{1}\leq 2\sqrt {2} \min \{n_{A},n_{B}\} \|\cdot \|_{ \mathrm {LO}}$ , where $\|\cdot \|_{1}$ is the trace norm.

DOI
10.1109/tit.2022.3186428

Related papers

Tight bounds on the distinguishability of quantum states under separable measurements

Somshubhro Bandyopadhyay, Michael Nathanson

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 can ``clone'' the input state, and the classical probability of success, which simply gives the optimal probability of identifying the state correctly. We obtain lower and upper bounds on the separable fidelity and give several examples in the bipartite and multipartite settings where these bounds are optimal. Moreover the optimal values in these cases can be attained by local measurements. We further show that for distinguishing orthogonal states under separable measurements, a strategy that maximizes the probability of success is also optimal for separable fidelity. We point out that the equality of fidelity and success probability does not depend on an using the optimal strategy, only on the orthogonality of the states. To illustrate this, we present an example where two sets (one consisting of orthogonal states and the other nonorthogonal states) are shown to have the same separable fidelity even though the success probabilities are different.

arXiv:1306.2712•Physical Review A•Nov 12, 2013•25 citations

Locally restricted measurements on a multipartite quantum system: data hiding is generic

Guillaume Aubrun, Cécilia Lancien

We study the distinguishability norms associated to families of locally restricted POVMs on multipartite systems. These norms (introduced by Matthews, Wehner and Winter) quantify how quantum measurements, subject to locality constraints, perform in the task of discriminating two multipartite quantum states. We mainly address the following question regarding the behaviour of these distinguishability norms in the highdimensional regime: On a bipartite space, what are the relative strengths of standard classes of locally restricted measurements? We show that the class of PPT measurements typically performs almost as well as the class of all measurements whereas restricting to local measurements and classical communication, or even just to separable measurements, implies a substantial loss. We also provide examples of state pairs which can be perfectly distinguished by local measurements if (one-way) classical communication is allowed between the parties, but very poorly without it. Finally, we study how many POVMs are needed to distinguish almost perfectly any pair of states on C^d, showing that the answer is exp(Θ(d^2 )).

Quantum Information and Computation•Apr 1, 2015•11 citations

Distinguishing bipartitite orthogonal states using LOCC: Best and worst cases

Michael Nathanson

Two types of results are presented for distinguishing pure bipartite quantum states using local operations and classical communications. We examine sets of states that can be perfectly distinguished, in particular showing that any three orthogonal maximally entangled states in C3⊗C3 form such a set. In cases where orthogonal states cannot be distinguished, we obtain upper bounds for the probability of error using LOCC taken over all sets of k orthogonal states in Cn⊗Cm. In the process of proving these bounds, we identify some sets of orthogonal states for which perfect distinguishability is not possible.

arXiv:quant-ph/0411110•Journal of Mathematical Physics•May 12, 2005•173 citations

Global vs. Product Observables in Bipartite Quantum Systems: The Sharp Bound

Zhi Li, Xiaofei Shi

To probe a bipartite quantum system, one may use arbitrary global operators or restrict to product operators acting separately on the two subsystems. We determine the sharp universal comparison between the resulting norms. For every $z\in M_n\otimes M_m$, we prove $\|z\|_1\leq\sqrt{2}\min\{n,m\}\|z\|_\varepsilon$, where $\|\cdot\|_1$ is the trace norm and $\|\cdot\|_\varepsilon$ is the injective tensor norm associated with the trace norms on $M_n$ and $M_m$. To prove the upper bound, we establish an $L_1$ noncommutative Khintchine inequality whose random coefficients are the entries of a Haar unitary. We also show that the coefficient $\sqrt{2}$ is sharp. As applications, we show that the same sharp constant governs the gap between bipartite correlation measured in trace norm and that measured by a correlation function, and obtain an improved universal upper bound for quantum data hiding. The upper bound has also been formalized and machine-checked in Lean.

quant-pharXiv:2608.06235•Aug 7, 2026•0 citations

On Optimal Quantum Data Hiding and Maximal Separable Ball

Zhi Li

Quantum data hiding asks how much distinguishing power can be lost when global measurements are restricted to local measurements and classical communication. In this work, we establish sharp results and improved bounds for several natural classes of restricted measurements. For bipartite systems on $\mathbb C^n\otimes\mathbb C^m$, we prove that the optimal data-hiding ratios against separable and LOCC measurements are both $\min\{n,m\}$. This result follows from a stronger result that, for every $2\le p\le\infty$, the largest centered Schatten $p$-ball whose associated binary measurements are implementable by finite-round LOCC has radius $\min\{n,m\}^{2/p-1}$. This strengthens the classic separable-ball theorems, while also providing an explicit finite-round LOCC implementation. For Alice-first one-way LOCC with Alice's local dimension equal to $n$, we prove that the optimal ratio is $(1+o(1))n$, with the upper bound obtained from a Gaussian rank-one POVM. For local operations without communication, we improve the universal upper bound to $(π\sqrt3/4+o(1))\min\{n,m\}$.

quant-pharXiv:2608.06308•Aug 7, 2026•0 citations

On the Chernoff distance for asymptotic LOCC discrimination of bipartite quantum states

William Matthews, Andreas Winter

Motivated by the recent discovery of a quantum Chernoff theorem for asymptotic state discrimination, we investigate the distinguishability of two bipartite mixed states under the constraint of local operations and classical communication (LOCC), in the limit of many copies. While for two pure states a result of Walgate et al. shows that LOCC is just as powerful as global measurements, data hiding states (DiVincenzo et al.) show that locality can impose severe restrictions on the distinguishability of even orthogonal states. Here we determine the optimal error probability and measurement to discriminate many copies of particular data hiding states (extremal d times d Werner states) by a linear programming approach. Surprisingly, the single-copy optimal measurement remains optimal for n copies, in the sense that the best strategy is measuring each copy separately, followed by a simple classical decision rule. We also put a lower bound on the bias with which states can be distinguished by separable operations. This is a shortened version of a paper [1] recently submitted to Communications in Mathematical Physics; here the proofs have been omitted.

IEEE Information Theory Workshop (ITW)•May 1, 2008•9 citations
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 nA×nBn_{A}\times n_{B}nA​×nB​ bipartite quantum system can be discriminated via local measurements with an error probability no larger than 12(1−1cmin⁡{nA,nB})\frac {1}2 \left ({1 - \frac {1}{c \min \{n_{A}, n_{B}\}} }\right)21​(1−cmin{nA​,nB​}1​) , where 1≤c≤221\leq c\leq 2\sqrt {2}1≤c≤22​ is a universal constant, and our bound scales provably optimally with the local dimensions nA,nBn_{A},n_{B}nA​,nB​ . Mathematically, this is achieved by showing that the distinguishability norm ∥⋅∥LO\|\cdot \|_{ \mathrm {LO}}∥⋅∥LO​ associated with local measurements satisfies that ∥⋅∥1≤22min⁡{nA,nB}∥⋅∥LO\|\cdot \|_{1}\leq 2\sqrt {2} \min \{n_{A},n_{B}\} \|\cdot \|_{ \mathrm {LO}}∥⋅∥1​≤22​min{nA​,nB​}∥⋅∥LO​ , where ∥⋅∥1\|\cdot \|_{1}∥⋅∥1​ is the trace norm.
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 can ``clone'' the input state, and the classical probability of success, which simply gives the optimal probability of identifying the state correctly. We obtain lower and upper bounds on the separable fidelity and give several examples in the bipartite and multipartite settings where these bounds are optimal. Moreover the optimal values in these cases can be attained by local measurements. We further show that for distinguishing orthogonal states under separable measurements, a strategy that maximizes the probability of success is also optimal for separable fidelity. We point out that the equality of fidelity and success probability does not depend on an using the optimal strategy, only on the orthogonality of the states. To illustrate this, we present an example where two sets (one consisting of orthogonal states and the other nonorthogonal states) are shown to have the same separable fidelity even though the success probabilities are different.
We study the distinguishability norms associated to families of locally restricted POVMs on multipartite systems. These norms (introduced by Matthews, Wehner and Winter) quantify how quantum measurements, subject to locality constraints, perform in the task of discriminating two multipartite quantum states. We mainly address the following question regarding the behaviour of these distinguishability norms in the highdimensional regime: On a bipartite space, what are the relative strengths of standard classes of locally restricted measurements? We show that the class of PPT measurements typically performs almost as well as the class of all measurements whereas restricting to local measurements and classical communication, or even just to separable measurements, implies a substantial loss. We also provide examples of state pairs which can be perfectly distinguished by local measurements if (one-way) classical communication is allowed between the parties, but very poorly without it. Finally, we study how many POVMs are needed to distinguish almost perfectly any pair of states on C^d, showing that the answer is exp(Θ(d^2 )).
Two types of results are presented for distinguishing pure bipartite quantum states using local operations and classical communications. We examine sets of states that can be perfectly distinguished, in particular showing that any three orthogonal maximally entangled states in C3⊗C3 form such a set. In cases where orthogonal states cannot be distinguished, we obtain upper bounds for the probability of error using LOCC taken over all sets of k orthogonal states in Cn⊗Cm. In the process of proving these bounds, we identify some sets of orthogonal states for which perfect distinguishability is not possible.
To probe a bipartite quantum system, one may use arbitrary global operators or restrict to product operators acting separately on the two subsystems. We determine the sharp universal comparison between the resulting norms. For every z∈Mn⊗Mmz\in M_n\otimes M_mz∈Mn​⊗Mm​, we prove ∥z∥1≤2min⁡{n,m}∥z∥ε\|z\|_1\leq\sqrt{2}\min\{n,m\}\|z\|_\varepsilon∥z∥1​≤2​min{n,m}∥z∥ε​, where ∥⋅∥1\|\cdot\|_1∥⋅∥1​ is the trace norm and ∥⋅∥ε\|\cdot\|_\varepsilon∥⋅∥ε​ is the injective tensor norm associated with the trace norms on MnM_nMn​ and MmM_mMm​. To prove the upper bound, we establish an L1L_1L1​ noncommutative Khintchine inequality whose random coefficients are the entries of a Haar unitary. We also show that the coefficient 2\sqrt{2}2​ is sharp. As applications, we show that the same sharp constant governs the gap between bipartite correlation measured in trace norm and that measured by a correlation function, and obtain an improved universal upper bound for quantum data hiding. The upper bound has also been formalized and machine-checked in Lean.
Quantum data hiding asks how much distinguishing power can be lost when global measurements are restricted to local measurements and classical communication. In this work, we establish sharp results and improved bounds for several natural classes of restricted measurements. For bipartite systems on Cn⊗Cm\mathbb C^n\otimes\mathbb C^mCn⊗Cm, we prove that the optimal data-hiding ratios against separable and LOCC measurements are both min⁡{n,m}\min\{n,m\}min{n,m}. This result follows from a stronger result that, for every 2≤p≤∞2\le p\le\infty2≤p≤∞, the largest centered Schatten ppp-ball whose associated binary measurements are implementable by finite-round LOCC has radius min⁡{n,m}2/p−1\min\{n,m\}^{2/p-1}min{n,m}2/p−1. This strengthens the classic separable-ball theorems, while also providing an explicit finite-round LOCC implementation. For Alice-first one-way LOCC with Alice's local dimension equal to nnn, we prove that the optimal ratio is (1+o(1))n(1+o(1))n(1+o(1))n, with the upper bound obtained from a Gaussian rank-one POVM. For local operations without communication, we improve the universal upper bound to (π3/4+o(1))min⁡{n,m}(π\sqrt3/4+o(1))\min\{n,m\}(π3​/4+o(1))min{n,m}.
Motivated by the recent discovery of a quantum Chernoff theorem for asymptotic state discrimination, we investigate the distinguishability of two bipartite mixed states under the constraint of local operations and classical communication (LOCC), in the limit of many copies. While for two pure states a result of Walgate et al. shows that LOCC is just as powerful as global measurements, data hiding states (DiVincenzo et al.) show that locality can impose severe restrictions on the distinguishability of even orthogonal states. Here we determine the optimal error probability and measurement to discriminate many copies of particular data hiding states (extremal d times d Werner states) by a linear programming approach. Surprisingly, the single-copy optimal measurement remains optimal for n copies, in the sense that the best strategy is measuring each copy separately, followed by a simple classical decision rule. We also put a lower bound on the bias with which states can be distinguished by separable operations. This is a shortened version of a paper [1] recently submitted to Communications in Mathematical Physics; here the proofs have been omitted.