Measurement incompatibility and noiseless quantum codes
Abstract
We construct a rank-one minimal informationally complete measurement (MIC) with an invertible dual operator and prove that, for arbitrary finite input and output dimensions, a channel universally preserves measurement incompatibility if and only if its input space contains a noiseless code subspace of the full output dimension. Preserving the compatibility threshold of a finite family of binary measurements already guarantees such a code. Furthermore, for every $d\ge2$, there exists a family of ...
Description / Details
We construct a rank-one minimal informationally complete measurement (MIC) with an invertible dual operator and prove that, for arbitrary finite input and output dimensions, a channel universally preserves measurement incompatibility if and only if its input space contains a noiseless code subspace of the full output dimension. Preserving the compatibility threshold of a finite family of binary measurements already guarantees such a code. Furthermore, for every , there exists a family of binary measurements that is incompatible on the full space but compatible after compression to any proper subspace. These results resolve the conjecture of Chitambar and Zhang and the existence question posed by Uola and coauthors. We also give an explicit construction of exact encodings and show that, for a sufficiently small shift in the compatibility threshold, the transmission error of an approximate encoding is bounded by a constant times the square of the shift. These results establish a connection between measurement compatibility, quantum steering, and quantum error correction.
Source: arXiv:2610.37347v1 - http://arxiv.org/abs/2610.37347v1 PDF: https://arxiv.org/pdf/2610.37347v1 Original Link: http://arxiv.org/abs/2610.37347v1
Please sign in to join the discussion.
No comments yet. Be the first to share your thoughts!
Oct 28, 2026
Quantum Computing
Quantum Physics
0