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:2608.06235

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

Zhi Li, Xiaofei Shi

quant-phmath.FASubmitted Aug 6, 2026• Announced Aug 7, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

Related papers

Maximal Gap Between Local and Global Distinguishability of Bipartite Quantum States

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

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.

arXiv:2110.04387•IEEE Transactions on Information Theory•Jun 27, 2022•7 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

Quantum Communication Complexity and Nonlocality of Bipartite Quantum Operations.

Yufan Zhu

This dissertation is motivated by the following fundamental questions: (a) are there any exponential gaps between quantum and classical communication complexities? (b) what is the role of entanglement in assisting quantum communications? (c) how to characterize the nonlocality of quantum operations? We study four specific problems below. 1. The communication complexity of the Hamming Distance problem. The Hamming Distance problem is for two parties to determine whether or not the Hamming distance between two n-bit strings is more than a given threshold. We prove tighter quantum lower bounds in the general two-party, interactive communication model. We also construct an efficient classical protocol in the more restricted Simultaneous Message Passing model, improving previous results. 2. The Log-Equivalence Conjecture. A major open problem in communication complexity is whether or not quantum protocols can be exponentially more efficient than classical ones for computing a total Boolean function in the two-party, interactive model. The answer is believed to be No. Razborov proved this conjecture for the most general class of functions so far. We prove this conjecture for a broader class of functions that we called block-composed functions. Our proof appears to be the first demonstration of the dual approach of the polynomial method in proving new results. 3. Classical simulations of bipartite quantum measurement. We define a new ix concept that measures the nonlocality of bipartite quantum operations. From this measure, we derive an upper bound that shows the limitation of entanglement in reducing communication costs. 4. The maximum tensor norm of bipartite superoperators. We define a maximum tensor norm to quantify the nonlocality of bipartite superoperators. We show that a bipartite physically realizable superoperator is bi-local if and only if its maximum tensor norm is 1. Furthermore, the estimation of the maximum tensor norm can also be used to prove quantum lower bounds on communication complexities.

•Jan 1, 2008•0 citations

A Sharp Quantum Information-Combining Bound for Rank-One-Block and Qubit Side Information

Kias Henry

Hirche and Reeb conjectured a sharp erasure-channel upper bound for the entropy of the XOR of independent uniform bits with arbitrary quantum side information. We establish this bound for a noncommuting class of binary classical–quantum ensembles: one average-state/signal pair admits an orthogonal decomposition into signed rank-one signal blocks, while the other acts on a qubit with an arbitrary traceless Hermitian signal. The principal analytic ingredient is a Schur-convexity theorem for symmetrized even-order qubit resolvent trace kernels. Combined with a positive-association principle for uniform Dirichlet vectors under majorization, this yields tensor-product resolvent-moment inequalities at every even order. A positive entropy-moment representation and Chebyshev association then establish the sharp conditional-entropy inequality. Additional corollaries cover two arbitrary-dimensional rank-one-block ensembles and gauge-balanced higher-rank signal blocks. The manuscript provides complete analytical proofs, including the simplex association and trace-kernel results, together with reproducible deterministic verification of the finite trace algebra and numerical tests on physically admissible noncommuting quantum ensembles. The results establish the sharp Hirche–Reeb information-combining inequality for the stated structural classes. The unrestricted conjecture for arbitrary quantum side information remains open.

•Nov 4, 2026•0 citations

Maximum observable correlation for a bipartite quantum system

Michael J. W. Hall, Erika Andersson, Thomas Brougham

The maximum observable correlation between the two components of a bipartite quantum system is a property of the joint density operator, and is achieved by making particular measurements on the respective components. For pure states it corresponds to making measurements diagonal in a corresponding Schmidt basis. More generally, it is shown that the maximum correlation may be characterized in terms of a correlation basis for the joint density operator, which defines the corresponding (nondegenerate) optimal measurements. The maximum coincidence rate for spin measurements on two-qubit systems is determined to be $(1+s)∕2$, where $s$ is the spectral norm of the spin correlation matrix, and upper bounds are obtained for $n$-valued measurements on general bipartite systems. It is shown that the maximum coincidence rate is never greater than the computable cross norm measure of entanglement, and a much tighter upper bound is conjectured. Connections with optimal state discrimination and entanglement bounds are briefly discussed.

arXiv:quant-ph/0609076•Physical Review A•Dec 18, 2006•10 citations

Tensor Norms and the Classical Communication Complexity of Nonlocal Quantum Measurement

Yaoyun Shi, Yufan Zhu

We initiate the study of quantifying nonlocality of a bipartite measurement by the minimum amount of classical communication required to simulate the measurement. We derive general upper bounds in terms of some tensor norms of the measurement operator. As applications, we show that (a) if the amount of communication is a constant, then quantum and classical communication protocols with an unlimited amount of shared entanglement or shared randomness compute the same class of functions; and (b) it requires only a constant amount of communication to classically generate an approximation of the output distribution resulting from local measurements on an entangled quantum state, as long as the number of measurement outcomes is a constant.

arXiv:quant-ph/0511071•SIAM Journal on Computing•Jan 1, 2008•20 citations
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.
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.
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}.
This dissertation is motivated by the following fundamental questions: (a) are there any exponential gaps between quantum and classical communication complexities? (b) what is the role of entanglement in assisting quantum communications? (c) how to characterize the nonlocality of quantum operations? We study four specific problems below. 1. The communication complexity of the Hamming Distance problem. The Hamming Distance problem is for two parties to determine whether or not the Hamming distance between two n-bit strings is more than a given threshold. We prove tighter quantum lower bounds in the general two-party, interactive communication model. We also construct an efficient classical protocol in the more restricted Simultaneous Message Passing model, improving previous results. 2. The Log-Equivalence Conjecture. A major open problem in communication complexity is whether or not quantum protocols can be exponentially more efficient than classical ones for computing a total Boolean function in the two-party, interactive model. The answer is believed to be No. Razborov proved this conjecture for the most general class of functions so far. We prove this conjecture for a broader class of functions that we called block-composed functions. Our proof appears to be the first demonstration of the dual approach of the polynomial method in proving new results. 3. Classical simulations of bipartite quantum measurement. We define a new ix concept that measures the nonlocality of bipartite quantum operations. From this measure, we derive an upper bound that shows the limitation of entanglement in reducing communication costs. 4. The maximum tensor norm of bipartite superoperators. We define a maximum tensor norm to quantify the nonlocality of bipartite superoperators. We show that a bipartite physically realizable superoperator is bi-local if and only if its maximum tensor norm is 1. Furthermore, the estimation of the maximum tensor norm can also be used to prove quantum lower bounds on communication complexities.
Hirche and Reeb conjectured a sharp erasure-channel upper bound for the entropy of the XOR of independent uniform bits with arbitrary quantum side information. We establish this bound for a noncommuting class of binary classical–quantum ensembles: one average-state/signal pair admits an orthogonal decomposition into signed rank-one signal blocks, while the other acts on a qubit with an arbitrary traceless Hermitian signal. The principal analytic ingredient is a Schur-convexity theorem for symmetrized even-order qubit resolvent trace kernels. Combined with a positive-association principle for uniform Dirichlet vectors under majorization, this yields tensor-product resolvent-moment inequalities at every even order. A positive entropy-moment representation and Chebyshev association then establish the sharp conditional-entropy inequality. Additional corollaries cover two arbitrary-dimensional rank-one-block ensembles and gauge-balanced higher-rank signal blocks. The manuscript provides complete analytical proofs, including the simplex association and trace-kernel results, together with reproducible deterministic verification of the finite trace algebra and numerical tests on physically admissible noncommuting quantum ensembles. The results establish the sharp Hirche–Reeb information-combining inequality for the stated structural classes. The unrestricted conjecture for arbitrary quantum side information remains open.
The maximum observable correlation between the two components of a bipartite quantum system is a property of the joint density operator, and is achieved by making particular measurements on the respective components. For pure states it corresponds to making measurements diagonal in a corresponding Schmidt basis. More generally, it is shown that the maximum correlation may be characterized in terms of a correlation basis for the joint density operator, which defines the corresponding (nondegenerate) optimal measurements. The maximum coincidence rate for spin measurements on two-qubit systems is determined to be (1+s)∕2(1+s)∕2(1+s)∕2, where sss is the spectral norm of the spin correlation matrix, and upper bounds are obtained for nnn-valued measurements on general bipartite systems. It is shown that the maximum coincidence rate is never greater than the computable cross norm measure of entanglement, and a much tighter upper bound is conjectured. Connections with optimal state discrimination and entanglement bounds are briefly discussed.
We initiate the study of quantifying nonlocality of a bipartite measurement by the minimum amount of classical communication required to simulate the measurement. We derive general upper bounds in terms of some tensor norms of the measurement operator. As applications, we show that (a) if the amount of communication is a constant, then quantum and classical communication protocols with an unlimited amount of shared entanglement or shared randomness compute the same class of functions; and (b) it requires only a constant amount of communication to classically generate an approximation of the output distribution resulting from local measurements on an entangled quantum state, as long as the number of measurement outcomes is a constant.