




















Abstract:Readout error models for noisy quantum devices almost universally assume that measurement noise is classical: the measurement statistics are obtained from the ideal computational-basis populations by a column-stochastic assignment matrix $A$. This description is equivalent to assuming that the effective positive-operator-valued measurement (POVM) is diagonal in the measurement basis, and therefore completely insensitive to quantum coherences. We relax this assumption and derive a fully general expression for the observed measurement probabilities under arbitrary completely positive trace-preserving (CPTP) noise preceding a computational-basis measurement. Writing the ideal post-circuit state $\tilde{\rho}$ in terms of its populations $x$ and coherences $y$, we show that the observed probability vector $z$ satisfies $z = A x + C y$, where $A$ is the familiar classical assignment matrix and $C$ is a coherence-response matrix constructed from the off-diagonal matrix elements of the effective POVM in the computational basis. The classical model $z = A x$ arises if and only if all POVM elements are diagonal; in this sense $C$ quantifies accessible information about coherent readout distortions and interference between computational-basis states, all of which are invisible to models that retain only $A$. Our numerical experiments show that incorporating $C$ into readout recovery can improve fidelity over classical inversion and enable selective Pauli twirling with exponentially reduced circuit overhead. This work therefore provides a natural, fully general framework for coherence-sensitive readout modeling on current and future quantum devices.
| Comments: | 10 pages |
| Subjects: | Quantum Physics (quant-ph); Mathematical Physics (math-ph) |
| MSC classes: | 81P15 |
| Cite as: | arXiv:2512.13949 [quant-ph] |
| (or arXiv:2512.13949v2 [quant-ph] for this version) | |
| https://doi.org/10.48550/arXiv.2512.13949 arXiv-issued DOI via DataCite |
From: Zachariah Malik [view email]
[v1]
Mon, 15 Dec 2025 23:04:33 UTC (25 KB)
[v2]
Fri, 22 May 2026 04:12:29 UTC (45 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。