Searcharxiv⌕ Search

arXiv · 2610.37347

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 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.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Yu-Xuan Zhang, Jing-Ling Chen. 2026-10-27. Measurement incompatibility and noiseless quantum codes. https://arxiv.org/abs/2610.37347

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Operator quantum singular value transformation: Spectral mapping, design and topological invariants

Quantum singular value transformation (QSVT) provides a unifying framework for quantum algorithms by applying the polynomials of quantum signal processing (QSP) to block-encoded matrices. We connect this framework with spectral analysis, design and topological protection in condensed matter physics. Extending QSVT beyond matrices to possibly infinite-dimensional operators (operator QSVT), we establish the following. First, it transforms every block of the operator by the QSP polynomials; no singular value decomposition is needed. Second, a spectral mapping theorem determines the full spectrum of the QSVT operator, including continuous spectra, from the embedded operator through the QSP polynomial, allowing spectral analysis without translation invariance. Third, the spectral mapping turns QSP into spectral design: the QSP phases can stretch, fold and separate the bands and place the eigenvalues. Finally, the kernel sectors that conventional QSVT usually sets aside carry a topological index, invariant under the choice of QSP phases, local perturbations and gap-preserving deformations, which guarantees topologically protected states. These results unify two quantum walks: Szegedy's walk from quantum algorithms and the split-step walk from condensed matter physics. Their kernel sectors encode the graph's Euler characteristic and the difference of bulk winding numbers, respectively. For the split-step walk, QSP breaks chiral symmetry but not the topological protection, and can move the protected state into a continuous band to form a bound state in the continuum (BIC).

quant-ph↗

Tensor-network simulation of quantum phase estimation in the von Neumann measurement formulation with DMRG-prepared initial states

The von Neumann measurement formulation of quantum phase estimation [Phys.\ Rev.\ A \textbf{66}, 032314 (2002); Quantum \textbf{5}, 465 (2021)] estimates energies by coupling the system to a discretized pointer register through $\hat H\otimes\hat p$ and reading out the pointer after an inverse quantum Fourier transform. Building on these works, we develop a tensor-network framework for simulating and benchmarking this protocol when the system is initialized in a matrix product state (MPS) pre-trained with the density matrix renormalization group (DMRG). The system and the pointer are represented as a composite MPS, the coupling $\hat H\otimes\hat p$ as a matrix product operator, and the coupled dynamics is evolved with the time-dependent variational principle. This gives direct access to the time-resolved pointer distribution, the recovered energy, and the entanglement generated between system and pointer. We apply the framework to quantum many-body spin systems and to electronic-structure problems. For the systems studied, the pointer readout yields accurate ground-state energy estimates from DMRG-prepared approximate states, even when their variational energies are not fully converged. These states generally contain contributions from both ground and excited eigenstates, with their spectral weights determining the corresponding contributions to the pointer distribution. More accurate initial states also strongly suppress the entanglement generated between system and pointer. We also provide logical and compiled resource estimates for a Suzuki--Trotter realization of the protocol.

quant-ph↗

Robust Preparation of Bell States by Time Boundary Effect

Quantum entanglement is essential for modern quantum information processing. Entanglement gates convert initially non-entangled states into entangled ones by applying time-dependent parametric pulses. While Bell state preparation has been experimentally validated in various platforms, its stability and fidelity are constrained by environmental decoherence and parametric fluctuations. Here, we propose a dynamically robust method for preparing Bell states by leveraging the time boundary effect and momentum-space projective measurements within Su-Schrieffer-Heeger systems. Employing the Lindblad master equation, we theoretically demonstrate that the prepared Bell states exhibit remarkable robustness against both environmental decoherence and parametric time fluctuations, achieving nearly perfect quantum fidelity, with the momentum conservation law governing this robust behavior. This framework based on the time boundary effect is applicable to both fermionic and bosonic excitations, offering a unified paradigm for generating Bell states in quantum computation and communication.

quant-ph↗