Stable readout statistics are often taken as evidence for a well-defined physical response, but stability alone need not identify which state quantity has changed. We analyze this issue for finite collections of qubit states measured by binary readouts, focusing on changes in computational-basis population. The central question is when reproducible response data certify the sign or range of an underlying population change. We show that the answer is controlled by the calibrated measurement directions, not by loop consistency alone. For a fully calibrated finite readout family, we derive an exact closed-form interval of all compatible population changes. We also construct a same-record, jointly measurable example in which identical probabilities and accepted loop checks admit positive, zero, and negative population interpretations. When only a diagonal readout gain and a bound on coherence sensitivity are trusted, we obtain the sharp minimax interval and the necessary-and-sufficient sign condition $g>2χ$. These results separate implementation stability from population identifiability and provide analytic benchmarks for qubit readout calibration.
Stable readout statistics are often taken as evidence for a well-defined physical response, but stability alone need not identify which state quantity has changed. We analyze this issue for finite collections of qubit states measured by binary readouts, focusing on changes in computational-basis population. The central question is when reproducible response data certify the sign or range of an underlying population change. We show that the answer is controlled by the calibrated measurement directions, not by loop consistency alone. For a fully calibrated finite readout family, we derive an exact closed-form interval of all compatible population changes. We also construct a same-record, jointly measurable example in which identical probabilities and accepted loop checks admit positive, zero, and negative population interpretations. When only a diagonal readout gain and a bound on coherence sensitivity are trusted, we obtain the sharp minimax interval and the necessary-and-sufficient sign condition g>2χ. These results separate implementation stability from population identifiability and provide analytic benchmarks for qubit readout calibration.
Abstract Learning the Hamiltonian of a quantum processor is important for controlling and certifying quantum devices, but the state preparation and measurement used to probe it are themselves imperfect. Even when exact data identify an interaction uniquely, identifiability alone does not determine finite-data precision. Here we show, for n-qubit Markovian dynamics under geometric regularity conditions, that the local uncertainty of a Hamiltonian coefficient scales either linearly or as the square root of the entrywise error in the generator matrix in the readout gauge. Square-root scaling occurs exactly when a gauge transformation moves the coefficient at first order while noise positivity can be restored at second order, and real noise correlations drive this first-order change. As a consequence, under suitable dynamical and readout conditions, square-root scaling forces uniformly valid confidence intervals from N shots to have expected length Ω(N⁻¹⁄⁴), even for adaptive local experiments. Under a common generator norm bound, estimating this matrix attains this rate up to logarithmic factors. Experiments on three superconducting processors show that additional measurement bases increase the visibility of injected rotations at a matched number of shots. Whether a coupling admits the usual N⁻¹⁄² scaling is therefore set by how noise correlations and positivity constrain its gauge directions.
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 ρ~ in terms of its populations x and coherences y, we show that the observed probability vector z satisfies z=Ax+Cy, 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=Ax 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.
Abstract Accurate control of quantum systems requires a precise measurement of the parameters that govern the dynamics, including control fields and interactions with the environment. Parameters will drift in time and experiments interleave protocols that perform parameter estimation, with protocols that measure the dynamics of interest. Here we specialize to a system made of qubits where the dynamics correspond to a quantum computation. We propose setting aside some qubits, which we call spectator qubits, to be measured periodically during the computation, to act as probes of the changing experimental and environmental parameters. By using control strategies that minimize the sensitivity of the qubits involved in the computation, we can acquire sufficient information from the spectator qubits to update our estimates of the parameters and improve our control. As a result, we can increase the length of experiments where the dynamics of the data qubits are highly reliable. In particular, we simulate how spectator qubits can keep the error level of operations on data qubits below a 10 −4 threshold in two scenarios involving coherent errors: a classical magnetic field gradient dynamically decoupled with sequences of two or four π -pulses, and laser beam instability detected via crosstalk with neighboring atoms in an ion trap.
AbstractRetained measurement records constrain recoverability, but their formation also depends on the available physical controls. We give exact, constructively attained answers to both questions in two specified models. For a balanced nondemolition qubit process with actual binary observer memories unavailable to the decoder, we determine the maximum recovery compatible with average readout accuracy and pair agreement. The finite-record solution includes its feasible region and a common memory-writing and recovery process, without assuming exchangeability of observed records. Under a complete conditional-pairwise-independence promise at fixed informative accuracy, the optimal coherence has a sharp inverse-square-root asymptotic; fully conditionally independent records instead give exponential decay. Thus identical single-record and pair-record calibrations need not justify the product-law recovery bound. We then fix a logical code in four spin-3/2 systems and sequential diagonal contacts with exact controlled-swap endpoints. Hard budgets for net contact action and added spectral control charge yield an exact peak-excursion frontier within a declared quadratic-plus-cubic control class. A single positive-amplitude preparation jointly attains the record, recovery and occupation requirements, connecting the two results through an exact finite-dimensional optimization. A closed three-record example distinguishes fixed complete records from fixed averaged data. Separately calibrated imperfect contacts admit one-sided finite-error extensions. Together, the results characterize both informational compatibility and control-dependent formation through common attaining apparatuses.Preprint status and related materialsAuthor-submitted preprint; not peer reviewed or accepted for publication. This theoretical and computational work addresses the compatibility of retained binary quantum records with optimized accessible-system recovery, and the control-dependent resources required to form those records in a specified spin encoding. The article provides exact finite-record bounds, attainable recovery and resource frontiers, and calibrated finite-error qualifications. The manuscript has been submitted to Foundations of Physics for journal consideration; this Figshare record is not a journal publication. The technical supplement is included as a second PDF in this same record. Related software, verification code, exact certificates, and selected computational evidence are available separately at https://doi.org/10.6084/m9.figshare.34886079 under the MIT licence. When a journal version of record becomes available, a link to its DOI will be added here.AuthorKent Nimmo; Independent Researcher, Vancouver, British Columbia, Canada; ORCID 0009-0003-8503-8891.Reading and related workBrowse Quantum Foundations for related work on records, access and measurement, and Mathematics for exact bounds and certified constructions. The MIT software/certificate archive remains a distinct record from these manuscript PDFs.
Abstract We introduce the problem of stability verification of quantum sources which are non-i.i.d.. The problem consists in ascertaining whether a given quantum source is stable or not, in the sense that it produces always a desired quantum state or if it suffers deviations. Stability is a statistical notion related to the sparsity of errors. This problem is closely related to the problem of quantum verification first proposed by Pallister et al (2018 Phys. Rev. Lett. 120), however, it extends the notion of the original problem. We introduce a family of states that come from these non-i.i.d. sources which we call a Markov state. These sources are more versatile than the i.i.d. ones as they allow statistical deviations from the norm instead of the more coarse previous approach. We prove in theorem 1 that the Markov states are not well described with tensor products over a changing source. In theorem 2 we further provide a lower bound on the trace distance between two Markov states, or conversely, an upper bound on the fidelity between these states. This is a bound on the capacity of determining the stability property of the source, which shows that it is exponentially easier to ascertain this with respect to n, the number of outcomes from the source.
Can a classical channel reproduce the phase signature normally interpreted as evidence for a quantum mediator? We show that it can—if only one conditional direction is measured. This work identifies a one-sided readout loophole in phase-based tests of quantum-mediated interactions and closes it using two direction-resolved Bargmann loops, (\mathcal Z) and (\mathcal Z'). Their product obeys the exact identity (\Delta_{\square}=\mathcal Z(\mathcal Z')^{*}), leading to an additive “record ledger” that reveals where which-path information is deposited. A classical feed-forward channel can hide its record from a one-sided audit, but not from the two-sided construction. We derive a tight separable ceiling that remains unchanged under product-form population imbalance and extend the certification to arbitrary unequal edge coherences through an exact two-qubit PPT semidefinite program. Readout-calibration uncertainty is incorporated through simultaneous Clopper–Pearson confidence regions and a conservative linear-program certificate. For experimental reproducibility, we provide a parameter-complete trapped-ion geometric-phase rehearsal, including pulse parameters, measurement settings, calibration procedures, closure scans, classical controls, and predeclared acceptance criteria. The conclusion is deliberately conditional: the protocol certifies a nonclassical locally mediating channel when the local-mediation premise is independently justified. It does not, by itself, constitute an experimental observation of quantum gravity or exclude every direct or nonlocal matter interaction.