arXiv:2609.40266
Compatibility of quantum instruments
Chloe Kim, Yujie Zhang, Eric Chitambar, Marius Junge, Felix Leditzky
Abstract
Measurement compatibility asks whether a family of quantum measurements can be simulated by one parent measurement followed by classical post-processing. We extend this measurement compatibility to the notion of \emph{$d$-compatibility} for measurements, channels, and instruments whose parent passes a $d$-dimensional quantum system and unlimited classical information to the post-processing. We formulate $d$-compatibility as a common linear factorization of operator spaces and operator systems and show that $d$-compatible families form a closed set, even with infinitely many settings and a separable infinite-dimensional input. To certify $d$-incompatibility, we define the compatibility functional as the smallest product of completely bounded norms over common factorizations through a $d$-dimensional register. Using factorization theory of operator spaces, we show that measure-and-prepare channels defined in terms of mutually unbiased bases and pinching channels defined in terms of Heisenberg-Weyl operators are $d$-incompatible in certain regimes of $d$. We also link $d$-compatibility of multi-instruments to the preparability of Choi assemblages using channel-state duality, and use this connection to show that for bipartite states the (in)compatibility of instruments can be used to certify Schmidt numbers and the implementability of the instrument using one-way LOCC protocols. Finally, our compatibility functional also bounds the generalized robustness of compatibility, which we interpret through a memory-bounded nontransient preparation game.
AI Summary
The paper studies the quantum memory needed to implement a family of measurements, channels, or instruments when the setting arrives after the input. A family is $d$-compatible if every member factors through one common parent retaining a $d$-dimensional quantum register and unrestricted classical information. This differs from broadcasting-based channel compatibility; for measurements, $d=1$ recovers joint measurability. The framework expresses compatibility through operator-space and operator-system factorizations. Ultraproduct arguments establish closedness under componentwise operator-norm convergence, allowing arbitrary settings and separable, potentially infinite-dimensional inputs, but requiring finite-dimensional outputs and finitely many instrument outcomes. Completely bounded and completely positive factorization functionals yield dual witness criteria; the latter characterizes $d$-compatibility exactly. For pinching channels onto $k$ mutually unbiased bases in dimension $n$, witnesses give $\gamma_{d,\mathrm{cb}}\geq\sqrt{k/d}(1-1/n)$, excluding $d<k(1-1/n)^2$. A separate algebraic argument shows that just the computational- and Fourier-basis pinching channels require $d\geq n$, although each is entanglement breaking. In finite dimensions, compatibility is equivalent to preparability of the Choi assemblage from a common source of Schmidt number at most $d$, and to a corresponding one-way LOCC implementation. Convex duality identifies $1+\mathcal R_d$ with the maximal preparation-game advantage over memory-$d$ strategies. The generalized robustness satisfies $\mathcal R_d\leq n/d-1$, attained by the identity channel, and $1+\mathcal R_d\leq\gamma_{d,\mathrm{cp}}$. The criteria, Choi characterization, and game duality remain finite-dimensional; infinite-dimensional outputs and continuous-variable extensions are left open. The definition also coincides with independently studied finite-dimensional instrument simulability.
Error found: The abstract states closure without output restrictions, whereas the proved closure results require finite-dimensional quantum outputs and finitely many classical outcomes, and infinite-dimensional quantum outputs are explicitly left open.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.