betaFeedback

WorksComputer Science

Live Noise Fingerprints for Quantum Program Analysis

Abstract

Quantum programs are probabilistic in nature, and noisy execution due to current imperfect hardware further complicates their analysis. In this paper, we study abstract semantics for analysing quantum programs under these conditions. We introduce noise fingerprints, compact descriptions of the observable effects of noise relative to a finite interface of input states and output measurements. We use them to define our abstract domain with respect to the concrete noise-related behaviour. We relate the concrete and abstract domains through a probabilistic Galois connection, extending the Galois-connection framework to distribution-valued interpretations. We study the resulting abstraction in terms of observational soundness, conciseness, efficiency, and ability to adapt to changing noise. We show that polynomial-size interfaces yield exponentially smaller fingerprints than full noise models while preserving the chosen observations, and that fingerprint distance characterises the largest observational discrepancy over the chosen interface. Further, we develop ChanShadow, which reuses noise fingerprints of commonly used short program fragments to analyse noisy execution of whole programs and provides a uniform finite-sample error bound. We construct working examples showing how fingerprints support program analysis. We evaluate fingerprint precision, representation cost, measurement requirements, and behaviour under noise drift. On a synthetic benchmark, fingerprints retain (99±1)%(99 \pm 1)\% of the noise strength information of a full noise model. On simulated noise drift, reusing earlier measurements reduces the number of fresh measurement rounds needed to reach an error tolerance of 0.100.10 by a factor of 2.32.3 at 95%95\% confidence and by a factor of 2727 under the median-error criterion.

Introduction

Quantum software engineering and development rely on noisy quantum computer infrastructures [6, 36, 40]. Noisy executions pose a challenge to quantum program testing by making failures harder to attribute [35] and limiting the applicability of existing testing methods [46]. For example, noise can change which faults a test suite appears to detect in mutation testing [16] and lead to misjudgements about program behaviour in measurement-based validation [49]. The implications extend beyond testing: noise can itself cause incorrect program behaviour [21, 23, 51].

Consequently, a growing body of work on testing, debugging, and program analysis recognises noise as a challenge [8, 20, 24, 29, 32, 37], explores machine learning to mitigate its effects [35], considers statevector-based validation [49], evaluates comparison metrics under noise [16], and develops analyses that explicitly account for noise [5, 38]. Further, developers already account for noise when designing algorithms, requiring development environments that support simulation and analysis of noisy execution [22, 32, 52]: The noise behaviour observed at this stage feeds directly into code development [35, 40] and into optimisation and transpilation decisions [27, 33, 36].

Authors’ Contact Information: Avner Bensoussan, King’s College London, London, United Kingdom; Karine Even-Mendoza, King’s College London, London, United Kingdom; Debalina Banerjee, University of Oxford, Oxford, United Kingdom, [email protected]; Elena Chachkarova, King’s College London, London, United Kingdom; Sophie Fortz, Inria, Univ. Rennes, CNRS, IRISA, Rennes, France; Vasileios Klimis, Queen Mary University of London, London, United Kingdom; Mohammad Reza Mousavi, King’s College London, London, United Kingdom. Nonetheless, when noise changes, existing techniques can require substantial rework: recalibrating detection thresholds [16], adapting learned models to the device and circuit [35], or repeating verification with an updated noise model [38]. This exposes a real difficulty as the effective noise of a noisy backend is opaque, drifts—sometimes within hours [31]—and differs across platforms. Even when two frameworks expose the same named noise model with the same nominal parameters, their effective behaviour diverges due to implementation details, compilation passes, numerical precision, and backend-specific modelling details [5, 17, 24] (e.g. The results in [5] showed non-negligible divergence of same programs [44] under the same circuit representation between Qiskit and Cirq under the same IBM Boston noise profile).

To reason about these differences, we need a model of how noisy execution environments affect the program. One such model represents a small phase error caused by noise as an extra gate in the program’s gate sequence [23]. For example, the ideal program P=H(q0);CX(q0,q1)P = H(q_0); CX(q_0, q_1) can become in noisy execution environment

Pnoisy=H(q0);Rz(0.30)(q0);CX(q0,q1).(1)P_{\mathrm{noisy}} = H(q_0); R_z(0.30)(q_0); CX(q_0, q_1). \tag*{(1)}

Whether the additional phase rotation of 0.30 radians error is detectable depends on how noise is modelled and which properties of program behaviour the analysis considers, as we discuss in § 2. Eq. (1) example isolates a specific effect of noise.

In this paper, we suggest modelling noise in the execution environment as a quantum channel, a mathematical map describing how noise transforms a quantum state, not just a noise phase rotation. This reflects current practice in quantum software development, where practitioners reason about noise through its effects on observed program behaviour, such as changes in measured expectation values and their statistics [19, 35]—rather than internal noise mechanisms [3, 25]. Yet a full description of a noisy quantum channel grows exponentially with the number of qubits [5, 28], making it impractical to compute, store, or compare during routine development, even when the analysis concerns only a few observations. A developer often asks a more specific question. Did a change affect the outputs used by a test or an intermediate behaviour that helps explain a final failure? Adding to this, a change in noise can require rebuilding the model or rerunning the analysis from scratch. What is missing is a sound, compact abstraction that captures the channel’s effects on the relevant observations, is inexpensive to obtain, and can be updated as noise changes.

Our Contribution: An abstract domain for noisy channels. We study the semantic problem of constructing tractable abstractions of noisy quantum channels: Given a finite set of observations, how can we summarise channel behaviour while preserving properties of interest?

We model noisy quantum executions using quantum channels, i.e. Completely Positive Trace-Preserving (CPTP) maps from input states to output states. A pure state can be written as a ket vector ∣x⟩|x\rangle. A density matrix ρ\rho can represent a pure or a mixed state. We select observations before characterising the channel. Each observation pairs a prepared input with a property measured at the output. The resulting finite table is an observation profile, or noise fingerprint. Thus, environments with similar entries behave similarly on the experiments of these entries and may differ on other inputs or output measurements. This is the core idea behind our abstraction of a quantum channel: an interface-relative noise fingerprint as an abstract semantics for noisy quantum execution, leveraging the idea that reasoning about and comparing noisy executions often requires only the observations relevant to the properties under study. Nonetheless, the selected observations determine the fingerprint’s scope, and the sample size determines the analysis’s accuracy. Building an abstract model for each property of interest addresses a gap in existing methods, reducing analysis reruns as code changes and noise drifts.

This is, at its core, a problem of abstract interpretation [11, 12]. We cast the effective noise of a channel as an abstract domain whose elements are noise fingerprints: finite abstractions of channel behaviour defined by an experiment interface XX. The abstraction αX\alpha_X maps a concrete channel Λ\Lambda to its exact fingerprint on interface XX. Probabilistic concretisation γP\gamma_P maps an abstract fingerprint FF to a probability distribution over concrete channels. Its expected channel is γˉP(F)\bar{\gamma}_P(F). Together, α\alpha and γP\gamma_P form a probabilistic Galois connection (definition 9) that reduces to the classical one when every concretisation is a point mass. Separately, a finite-shot protocol induces a distribution αT\alpha_T over measured fingerprints1, whose (ε,δ)(\varepsilon, \delta) guarantee is part of estimation efficiency (definition 12).

We study four properties of the abstraction that guide the design (§3) and evaluation (§5) of our framework: (i) observational soundness, that the measured abstraction and tolerance-based concretisation satisfy a probabilistic coverage guarantee and that observable behaviour is stable under changes in the abstract domain; (ii) conciseness, that the abstraction compresses the exponential concrete domain objects while retaining the observable information of interest; (iii) estimation efficiency, that fingerprints are cheap to construct and to use; and (iv) adaptiveness, that they respond continuously and incrementally to changes in the underlying noise across platforms, configurations, and time. The framework admits arbitrary experiment interfaces. In our evaluation, we instantiate the framework with the interface X=S×OX = S \times O, consisting of reference states (SS) and observables (OO), where a fingerprint records the corresponding expectation-value deviations. This is one instantiation, built on the results of SimShadow [5].

To summarise, the main contributions of the paper are:

  • Program-level working examples. We illustrate our analysis on a simple program (§2). In Appendix (§A.1), we motivate using fingerprints to check compiler optimisations, assess test portability, and support debugging. Our artifact includes a Jupyter notebook for reproducibility, accepting QASM programs as input.

  • Fingerprints as an abstract domain. We model noise fingerprints as an observational abstraction of CPTP channels over a finite interface (§3).

  • Extending the notion of Galois connection to a probabilistic setting. We introduce probabilistic Galois connections to randomized, empirically estimated abstractions (§3).

  • A classical-shadow construction (CHANSᴴᴀᴅᴏᴡ). We instantiate the abstract domain with αshadow\alpha_{\mathrm{shadow}}, a parallel classical-shadow estimator with a logarithmic sample-complexity guarantee, and a non-parametric semidefinite program concretisation γshadow\gamma_{\mathrm{shadow}} (§4).

  • Evaluation against theoretical bounds. We establish exponential compression and (poly)logarithmic sample complexity, and observe tight soundness bounds for amplitude and phase damping and incremental convergence at the predicted rate in simulation (§5).

  • Expert verification and identifiability. Threats to validity and limitations are discussed in § 6. We verify that fingerprints reproduce the physically correct per-noise signatures and can separate noise families and expose real cross-platform discrepancies (Appendix, §A.5).

Background and Motivation

We briefly review quantum computing basics [39], with further details in §A.2. A pure quantum state is a unit vector ∣ψ⟩|\psi\rangle in a complex Hilbert space, with dual ⟨ψ∣=∣ψ⟩†\langle\psi| = |\psi\rangle^\dagger. Gates such as HH and CXCX are unitary operators. An nn-qubit (mixed) state is represented by a density matrix ρ∈C2n×2n\rho\in\mathbb{C}^{2^n \times2^n}, with ρ=∣ψ⟩⟨ψ∣\rho= |\psi\rangle\langle\psi| in the pure case. An observable OO is a Hermitian operator whose eigenvalues are the possible measurement outcomes. The expected result of measuring OO in state ρ\rho is Tr⁡(Oρ)\operatorname{Tr}(O\rho), which equals ⟨ψ∣O∣ψ⟩\langle\psi|O|\psi\rangle for a pure state ∣ψ⟩|\psi\rangle. A quantum channel Λ\Lambda is a function from input density matrices to output density matrices; e.g. Qiskit’s Kraus documentation gives the function explicitly (see also Appendix § 11.2.2). For example, the Kraus matrices for Qiskit Aer phase-damping give the following single-qubit function, where pp is the phase-damping parameter:

Λp((abcd))=(a1−p b1−p cd).\Lambda_p\left(\begin{pmatrix} a & b \\ c & d \end{pmatrix}\right)=\begin{pmatrix} a & \sqrt{1-p}\,b \\ \sqrt{1-p}\,c & d \end{pmatrix}.

Example of Testing under Noise. Consider the program PP above executed from the initial state ∣00⟩\lvert00\rangle. Ideally, the program prepares a Bell state, in which the two qubits are correlated. We use three test assertions, one for each of the Pauli observables ZZZZ, XXXX, and YYYY. Together, they measure output correlations in the computational and superposition bases.

Now consider two execution environments for the same program. Environment A is a baseline configuration, with depolarising noise and amplitude damping after each gate. Environment B has the same noise settings but adds the phase rotation as in PnoisyP_{\mathrm{noisy}} (eq. (1)) to the baseline noise model. To compare the two executions, consider how much each measured property deviates from its ideal value. For the input ∣00⟩\lvert00\rangle, these deviations are:

ZZZZXXXXYYYY
Environment A−0.1152-0.1152−0.1288-0.12880.12880.1288
Environment B−0.1152-0.1152−0.1677-0.16770.16770.1677

The two environments behave identically with respect to ZZZZ, but differ by 0.0389 on both XXXX and YYYY. With a comparison tolerance of ε=0.02\varepsilon= 0.02, the difference is therefore observable. The phase rotation leaves the population check unchanged but affects the correlations measured in the superposition bases.

The choice of checks matters. Suppose the same program is tested using only population measurements, such as ZZZZ, ZIZI, and IZIZ. The two environments then have a distance of 0.0000 on these checks and would be considered equivalent. This does not mean that their behaviour is identical: the selected measurements simply do not expose the difference. The same environmental change can therefore be relevant to one test and invisible to another.

This example illustrates how our framework supports comparisons between execution environments. Detailed examples with further scenarios are available in §A.1 and the replication package.

Interface-Relative Semantics and Abstraction Properties

This section gives noise fingerprints a precise semantic meaning by describing a channel through a finite interface of experiments. The resulting fingerprint is exact with respect to that interface but makes no claim about behaviour the interface cannot observe. We define the interface and exact fingerprint, relate abstract and concrete domains via an expectation-based probabilistic Galois connection, and formulate four properties: soundness, conciseness, estimation efficiency, and adaptiveness, guiding the construction and evaluation throughout the paper.

Experiment Interfaces and Exact Fingerprints

Definition 1 (Quantum Channel). A quantum channel on nn qubits is a completely positive, trace-preserving (CPTP) linear map on density matrices. We write Cn\mathcal{C}_n for the set of such channels. Further details, including the Kraus representation, are given in Appendix § 11.2.2.

An experiment prepares a reference state, applies the channel under study, and measures an observable. An analysis chooses in advance which such experiments are relevant.

Definition 2 (Experiment Interface). Let S={ρ1,…,ρk}S = \{\rho_1,\ldots,\rho_k\} be reference density operators on the nn-qubit space and let O={O1,…,Om}O = \{O_1,\ldots,O_m\} be Hermitian observables with ∥Oj∥op≤1\lVert O_j\rVert_{\mathrm{op}} \le1. The experiment interface is X=S×OX = S \times O. A fingerprint over XX is a function F:X→RF : X \to\mathbb{R} (equivalently, a k×mk \times m matrix), with one entry F(ρ,O)F(\rho,O) for each experiment that prepares ρ\rho, applies the channel, and measures OO.

Definition 3 (Exact Interface Fingerprint). For Λ∈C\Lambda\in C, define its exact fingerprint by

αX(Λ)(ρ,O)=Tr⁡[OΛ(ρ)]−Tr⁡[Oρ],(ρ,O)∈X.\alpha_X(\Lambda)(\rho,O) = \operatorname{Tr}[O\Lambda(\rho)] - \operatorname{Tr}[O\rho], \qquad(\rho,O) \in X.

This deterministic value is the deviation from the ideal identity execution; finite-shot measurements yield a random estimate F^\widehat{F}.

Definition 4 (Fingerprint Distance). For two fingerprints over the same interface XX, their distance is

dX(F1,F2)=∥F1−F2∥∞=max⁡x∈X∣F1(x)−F2(x)∣.d_X(F_1,F_2) = \lVert F_1 - F_2\rVert_\infty= \max_{x \in X} \lvert F_1(x) - F_2(x)\rvert.

An interface can be refined by adding experiments. If X⊆X′X \subseteq X', the fingerprint over XX is the restriction of the fingerprint over X′X' to the smaller interface. We write

F⊑FF′iffX⊆X′ and F=F′∣X.(2)F \sqsubseteq_F F' \quad\text{iff} \quad X \subseteq X' \text{ and } F = F'|_X. \tag*{(2)}

Thus, refinement retains all previously recorded observations and adds new observable information.

Definition 5 (Concrete and Abstract Domains). The concrete domain (C,⊑C)(C,\sqsubseteq_C) consists of the CPTP maps on nn qubits, equipped with an information order. The abstract domain (AX,⊑A)(A_X,\sqsubseteq_A) consists of fingerprints over XX, also equipped with an information order. The abstraction map αX:C→AX\alpha_X : C \to A_X sends a channel to its exact interface fingerprint, namely the expectation-value deviations that unlimited repetitions of the selected experiments would reveal.

The concrete and abstract orders used in our probabilistic Galois-connection instance are specified in § 4.4. The exact fingerprint itself does not depend on those orders or on a particular measurement procedure.

Probabilistic Concretisation

A fingerprint is an abstract description of a channel. To relate this description to concrete channels, we use a probabilistic concretisation: an abstract element may denote a distribution over concrete objects rather than a single object. This extends the classical Galois-connection formulation while retaining an order-theoretic relationship through the expectation of the distribution.

Definition 6 (Galois Connection). Let (C,⊑C)(C,\sqsubseteq_C) and (A,⊑A)(A,\sqsubseteq_A) be partially ordered sets. Maps α:C→A\alpha: C \to A and γ:A→C\gamma: A \to C form a Galois connection if, for every c∈Cc \in C and a∈Aa \in A,

α(c)⊑Aa⟺c⊑Cγ(a).\alpha(c) \sqsubseteq_A a \quad\Longleftrightarrow\quad c \sqsubseteq_C \gamma(a).

Let CC be a subset of a real vector space, and let D(C)\mathcal{D}(C) denote the set of probability distributions over CC whose expectation exists and belongs to CC (see §A.3).

Definition 7 (Point Mass). For any c∈Cc \in C, the point mass at cc, denoted by [c][c], is the probability distribution over CC defined, for every measurable set B⊆CB \subseteq C, by

[c](B)={1if c∈B,0otherwise.[c](B) = \begin{cases} 1 & \text{if } c \in B,\\ 0 & \text{otherwise.} \end{cases}

In particular, if Y∼[c]Y \sim[c], then E[Y]=c\mathbb{E}[Y] = c.

Definition 8 (Probabilistic Concretisation). A probabilistic concretisation is a map γP:A→D(C)\gamma_P : A \to\mathcal{D}(C). Its expected concretisation is the map γˉP:A→C\bar{\gamma}_P : A \to C defined by

γˉP(a)=E[Y],Y∼γP(a).\bar{\gamma}_P(a) = \mathbb{E}[Y], \qquad Y \sim\gamma_P(a).

The distribution γP(a)\gamma_P(a) captures uncertainty about which concrete object corresponds to an abstract element—for example, modelling a noisy channel as a random mixture of ideal operations. Its expected concretisation is a concrete element and can thus be compared using the concrete order.

Definition 9 (Probabilistic Galois Connection). The pair (α,γP)(\alpha,\gamma_P) is an expectation-based probabilistic Galois connection if, for every c∈Cc \in C and a∈Aa \in A,

α(c)⊑Aa⟺c⊑CγˉP(a).\alpha(c) \sqsubseteq_A a \quad\Longleftrightarrow\quad c \sqsubseteq_C \bar{\gamma}_P(a).

Theorem 1 (Generalisation of the classical connection). (1) If (α,γP)(\alpha,\gamma_P) is a probabilistic Galois connection, then (α,γˉP)(\alpha,\bar{\gamma}_P) is a classical Galois connection. (2) If (α,γ)(\alpha,\gamma) is a classical Galois connection, then (α,γP)(\alpha,\gamma_P) with γP(a)=[γ(a)]\gamma_P(a) = [\gamma(a)] is a probabilistic Galois connection.

Proof. For (1), the defining law of definition 9 is precisely the classical Galois law for α\alpha and γˉP\bar{\gamma}_P. For (2), the expectation of the point mass [γ(a)][\gamma(a)] is γ(a)\gamma(a), so the probabilistic law reduces to the classical one. □

The classical definition is therefore recovered exactly when every concretisation is a point mass. The probabilistic law depends on γP\gamma_P only through its expected value: distributions with the same expectation are indistinguishable under this order-theoretic relation. As in the classical case, instantiating the law with a=α(c)a = \alpha(c) gives c⊑CγˉP(α(c))c \sqsubseteq_C \bar{\gamma}_P(\alpha(c)).

Observational Soundness

The semantic guarantee of a fingerprint is relative to its experiment interface. For two channels, define their observational discrepancy over XX by

Δobs(Λ1,Λ2)=max⁡(ρ,O)∈X∣Tr⁡[OΛ1(ρ)]−Tr⁡[OΛ2(ρ)]∣.\Delta_{\mathrm{obs}}(\Lambda_1,\Lambda_2) = \max_{(\rho,O) \in X} \left|\operatorname{Tr}[O\Lambda_1(\rho)] - \operatorname{Tr}[O\Lambda_2(\rho)]\right|.

The ideal expectation in the fingerprint definition is common to both channels and therefore cancels when their fingerprints are compared.

Theorem 2 (Exact observational soundness). For any Λ1,Λ2∈C\Lambda_1,\Lambda_2 \in C,

∥αX(Λ1)−αX(Λ2)∥∞=max⁡(ρ,O)∈X∣Tr⁡[OΛ1(ρ)]−Tr⁡[OΛ2(ρ)]∣=Δobs(Λ1,Λ2).\left\|\alpha_X(\Lambda_1) - \alpha_X(\Lambda_2)\right\|_\infty= \max_{(\rho,O) \in X} \left|\operatorname{Tr}[O\Lambda_1(\rho)] - \operatorname{Tr}[O\Lambda_2(\rho)]\right| = \Delta_{\mathrm{obs}}(\Lambda_1,\Lambda_2).

Proof. For every (ρ,O)∈X(\rho,O) \in X, subtracting the two entries of the fingerprints cancels the common ideal term Tr⁡[Oρ]\operatorname{Tr}[O\rho]. Taking the maximum absolute value over XX gives the stated equality. □

Consequently, fingerprints at distance at most ε\varepsilon represent channels whose outcomes differ by at most ε\varepsilon on every experiment in XX. Equal fingerprints imply observational equivalence on that interface. They do not imply equivalence under experiments outside it: distinguishing such channels requires refining the interface as in eq. (2).

The observational distance is also bounded by the operational channel distance.

Definition 10 (Lipschitz Continuity). The abstraction αX\alpha_X is Lipschitz-continuous with constant LL if

∥αX(Λ1)−αX(Λ2)∥∞≤L∥Λ1−Λ2∥⋄.\left\|\alpha_X(\Lambda_1) - \alpha_X(\Lambda_2)\right\|_\infty\leq L\left\|\Lambda_1 - \Lambda_2\right\|_\diamond.

for all channels Λ1,Λ2\Lambda_1,\Lambda_2, where ∥⋅∥⋄\|\cdot\|_\diamond is the diamond norm, the standard operational distance between channels [4, 47, 48].

Proposition 1 (Diamond-norm upper bound). For the normalised observables of definition 2, the exact fingerprint abstraction is Lipschitz-continuous with L≤1L \le1:

∥αX(Λ1)−αX(Λ2)∥∞≤∥Λ1−Λ2∥⋄.\left\|\alpha_X(\Lambda_1)-\alpha_X(\Lambda_2)\right\|_\infty\le\left\|\Lambda_1-\Lambda_2\right\|_\diamond.

Proof. Per input state ρ\rho and observable OO with ∥O∥op≤1\left\|O\right\|_{\mathrm{op}} \le1, the expectation-value difference is bounded by the operational distinguishability of the two channel outputs, and hence by the diamond norm of Λ1−Λ2\Lambda_1-\Lambda_2. Taking the maximum over the selected pairs (ρ,O)∈X(\rho,O) \in X proves the claim. □

The bound is interface-relative: the diamond norm takes a supremum over all admissible inputs (including inputs entangled with an ancillary system), whereas the fingerprint takes a maximum only over the selected states and observables. The two distances can therefore coincide for some channel pairs and differ for others.

The abstraction must satisfy four complementary properties, stated in the remaining of this section, independently of any particular measurement protocol used to estimate a fingerprint.

Conciseness

A general CPTP map acting on nn qubits requires Θ(16n)\Theta(16^n) real parameters. A fingerprint instead stores one scalar for each state–observable pair in XX.

Definition 11 (Conciseness). The abstraction is concise if its representation size is negligible relative to a full channel representation. For the interface X=S×OX = S \times O,

∣αX(Λ)∣=∣S∣⋅∣O∣=∣X∣,dim⁡(Cn)=Θ(16n),\left|\alpha_X(\Lambda)\right| = |S| \cdot|O| = |X|,\qquad\dim(\mathcal{C}_n) = \Theta(16^n),

where Cn\mathcal{C}_n is the set of channels on nn-qubit systems.

Storage cost scales linearly with interface size, independent of the channel space’s intrinsic dimension. If the interface grows polynomially with the number of qubits, the fingerprint is exponentially smaller than a full channel representation. This intentional compression preserves only the interface-selected observations, not all possible channel behaviour. Refining the interface keeps existing entries and adds observable information, increasing representation size accordingly.

Estimation Efficiency

A compact abstract representation is not sufficient if obtaining it requires an excessive number of measurements. We therefore state estimation efficiency as a requirement on the distribution of measured fingerprints, independently of any particular estimator.

Definition 12 (Estimation Efficiency). Let αT(Λ)\alpha_T(\Lambda) be the distribution of fingerprints of Λ\Lambda obtained using TT measurement rounds. The abstraction admits efficient estimation if, for every accuracy ε>0\varepsilon> 0 and failure probability δ∈(0,1)\delta\in(0,1), a number of rounds TT polynomial in ∣X∣|X|, 1/ε1/\varepsilon and log⁡(1/δ)\log(1/\delta), together with polynomial classical post-processing, ensures that for every channel Λ\Lambda,

Pr⁡F∼αT(Λ)[∥F−αX(Λ)∥∞≤ε]≥1−δ.\Pr_{F\sim\alpha_T(\Lambda)}\left[\left\|F-\alpha_X(\Lambda)\right\|_\infty\le\varepsilon\right] \ge1-\delta.

The tolerance ε\varepsilon bounds the largest entrywise error, while δ\delta bounds the probability that the complete fingerprint exceeds that tolerance. The probability is over measurement outcomes, not over channels. A probabilistic guarantee allows rare deviations to be accounted for through δ\delta rather than forcing the tolerance to cover every possible measurement outcome. For a measured fingerprint FF, its uniform estimation error DΛ(F)D_\Lambda(F) is given by

DΛ(F)=∥αX(Λ)−F∥∞.D_\Lambda(F)=\left\|\alpha_X(\Lambda)-F\right\|_\infty.

Proposition 2 (Tolerance at a given confidence). (1) If every αT(Λ)\alpha_T(\Lambda) is a point mass, the guarantee of definition 12 does not depend on δ\delta. (2) The guarantee holds for (ε,δ)(\varepsilon,\delta) if and only if, for every Λ\Lambda, ε\varepsilon is at least the (1−δ)(1-\delta)-quantile of DΛD_\Lambda under αT(Λ)\alpha_T(\Lambda).

Proof. For (1), under a point mass, the event has probability either zero or one, and 1−δ>01-\delta>0. For (2), the required condition is Pr⁡[DΛ≤ε]≥1−δ\Pr[D_\Lambda\le\varepsilon] \ge1-\delta, which is equivalent to ε\varepsilon being at least the corresponding quantile (see §A.3).

For comparison, if a protocol estimates one entry by the mean of TT independent outcomes in [a,b][a,b], Hoeffding’s inequality gives δ=2e−2Tε2/(b−a)2\delta=2e^{-2T\varepsilon^2/(b-a)^2}. For outcomes in [−1,1][-1,1], T=1000T=1000 and ε=0.1\varepsilon=0.1 give δ≈0.013\delta\approx0.013. A concrete construction must additionally state the computational and measurement resources needed to achieve its uniform guarantee; § 4 provides such a construction.

Adaptiveness and Stability

Noise can evolve over time, so useful fingerprints should change continuously with the underlying channel and should be updatable as additional observations arrive. We separate continuity of the exact abstraction from convergence of its estimator.

Definition 13 (Continuity). The abstraction is continuous if small perturbations in Λ\Lambda induce small changes in αX(Λ)\alpha_X(\Lambda) under the uniform norm ∥⋅∥∞\lVert\cdot\rVert_\infty.

Continuity ensures that gradual changes in device noise produce gradual changes in the exact fingerprint rather than abrupt discontinuities.

Definition 14 (Incremental Estimator Convergence). Let α^T\hat{\alpha}_T be an empirical fingerprint estimator based on TT rounds. The estimator has incremental convergence if its expected uniform error satisfies:

E[∥α^T−αX(Λ)∥∞]=O(1T)\mathbb{E}\left[\lVert\hat{\alpha}_T-\alpha_X(\Lambda)\rVert_\infty\right]=O\left(\frac{1}{\sqrt{T}}\right)

This is the usual statistical convergence rate as additional samples are collected under a fixed channel; it does not guarantee that observations collected before a channel change remain unbiased for the new one. The effect of reusing stale observations is evaluated under controlled drift in § 5.4.1.

Definition 15 (Robustness). The abstraction is robust if an estimation error of at most ε\varepsilon implies that the corresponding observable deviations are bounded by ε\varepsilon:

∥α^−αX(Λ)∥∞≤ε⟹observable deviations are bounded by ε.\lVert\hat{\alpha}-\alpha_X(\Lambda)\rVert_\infty\le\varepsilon\quad\Longrightarrow\quad\text{observable deviations are bounded by }\varepsilon.

By theorem 2, this robustness property is interface-relative: it applies to every experiment in XX, and makes no claim about observations omitted from the interface.

ChanShadow: Fingerprint Construction via Classical Shadows

This section instantiates the exact fingerprint abstraction αX\alpha_X (defined in § 3) as αshadow\alpha_{\mathrm{shadow}} using classical shadows [19] and the live-fingerprinting workflow in [5]. The construction has three components: a finite probe suite instantiates the experiment interface; shared randomised measurements estimate all observables jointly; and a median-of-means estimator provides a uniform finite-sample guarantee. Reusing a single measurement ensemble per reference state and for all observables amortises acquisition across the interface and enables fingerprint refreshing under changing noise. Channel reconstruction from a fingerprint is optional (See Appendix, §A.4).

Probe Suite: Instantiating the Interface

An experiment interface X=S×OX = \mathcal{S} \times\mathcal{O} (definition 2) is determined by its reference states, observables, and the locality of those observables. We use the maximum Pauli weight:

w⋆=max⁡O∈Ow(O)w^\star= \max_{O \in\mathcal{O}} w(O)

where w(O)w(O) is the number of non-identity factors in a Pauli string OO. A Pauli String is a tensor product with one operator per qubit, chosen from II, XX, YY, and ZZ. For example, ZZIZZI means Z⊗Z⊗IZ \otimes Z \otimes I.

Reference states. The probe suite used in this work is adapted from [5]. It combines three types of reference states, each exposing different aspects of noise:

  • computational-basis states (e.g. ∣0⋯0⟩|0 \cdots0\rangle and ∣1⋯1⟩|1 \cdots1\rangle), which expose population errors;

  • product superposition states (e.g. ∣+⟩∣0⟩|+\rangle|0\rangle and ∣0⟩∣−⟩|0\rangle|-\rangle), which expose coherence errors;

  • entangled states (e.g. ∣Φ+⟩|\Phi^+\rangle), which expose correlated multi-qubit errors.

Observables and interface size. The observable set consists of bounded-weight Pauli strings

O=⨂qPq,Pq∈{I,X,Y,Z},O = \bigotimes_q P_q, \qquad P_q \in\{I, X, Y, Z\},

including two-qubit correlators. For k=∣S∣k = |S| reference states and m=∣O∣m = |O| observables, the interface is X=S×OX = S \times O, thus ∣X∣=k⋅m|X| = k \cdot m.

The values of kk, mm, and w⋆w^\star are design parameters. They can be chosen to match the diagnostic objective while keeping the interface finite. The experiments below use the relevant finite instantiations or subsets of this probe-suite design, as specified in each experimental setup.

Shared Classical-Shadow Measurements

Fix a reference state ρi=∣ψi⟩⟨ψi∣∈S\rho_i = |\psi_i\rangle\langle\psi_i| \in S. Applying the channel under test Λ∈C\Lambda\in C produces the state Λ(ρi)\Lambda(\rho_i). We collect TT independent measurement rounds for each reference state. In every round, all nn qubits are measured in parallel in independently sampled single-qubit Pauli bases.

For round tt, sample a product basis

U(t)=⨂q=1nUq(t).U^{(t)} = \bigotimes_{q=1}^{n} U_q^{(t)}.

where each Uq(t)U_q^{(t)} is drawn uniformly from {H,HS†,I}\{H, HS^\dagger, I\}, rotating the XX, YY, or ZZ eigenbasis onto the computational basis. Measure U(t)Λ(ρi)U(t)†U^{(t)}\Lambda(\rho_i)U^{(t)\dagger} in the computational basis, obtaining a bitstring b(t)∈{0,1}nb^{(t)} \in\{0,1\}^{n} and its associated eigenvalue signs s(t)∈{+1,−1}ns^{(t)} \in\{+1,-1\}^{n}. The corresponding classical-shadow snapshot is

ρ^i(t)=⨂q=1n(3Uq(t)†∣bq(t)⟩⟨bq(t)∣Uq(t)−I).\widehat{\rho}_i^{(t)} = \bigotimes_{q=1}^{n} \left(3U_q^{(t)\dagger}|b_q^{(t)}\rangle\langle b_q^{(t)}|U_q^{(t)}-I\right).

which is the inverse of the single-qubit measurement channel applied independently on each qubit [19]. The snapshot is an unbiased estimator of the post-channel state:

E[ρ^i(t)]=Λ(ρi).\mathbb{E}[\widehat{\rho}_i^{(t)}] = \Lambda(\rho_i).

Consequently, for every observable OjO_j, the single-round score

o^ij(t)=Tr⁡(Ojρ^i(t))\widehat{o}_{ij}^{(t)} = \operatorname{Tr}\left(O_j\widehat{\rho}_i^{(t)}\right)

Algorithm 1 αshadow\alpha_{\mathrm{shadow}}: shared classical-shadow fingerprint of a channel Λ\Lambda

Require: Reference states S={ρi}i=1kS = \{\rho_i\}_{i=1}^{k}, Pauli observables O={Oj}j=1mO = \{O_j\}_{j=1}^{m}, rounds TT per reference state, and number of batches KK

Ensure: Estimated fingerprint F^∈Rk×m\widehat{F} \in\mathbb{R}^{k \times m}

  1. for each reference state ρi∈S\rho_i \in S do

  2. Prepare ρi\rho_i and apply Λ\Lambda

  3. for t=1t = 1 to TT do ▸ One shared round measures all qubits in parallel

  4. Sample a product Pauli basis U(t)=⨂qUq(t)U^{(t)} = \bigotimes_q U_q^{(t)} independently on each qubit

  5. Measure U(t)Λ(ρi)U(t)†U^{(t)}\Lambda(\rho_i)U^{(t)\dagger} in the computational basis, obtaining s(t)∈{±1}ns^{(t)} \in\{\pm1\}^{n}

  6. end for

  7. for each observable Oj=⨂qPq∈OO_j = \bigotimes_q P_q \in O do ▸ Reuse the same TT rounds for every observable

  8. Compute the scores o^ij(t)\widehat{o}_{ij}^{(t)} using eq. (3)

  9. μ^ij←MedianOfMeans⁡({o^ij(t)}t=1T,K)\widehat{\mu}_{ij} \leftarrow\operatorname{MedianOfMeans}(\{\widehat{o}_{ij}^{(t)}\}_{t=1}^{T}, K) using eq. (5)

  10. F^ij←μ^ij−⟨ψi∣Oj∣ψi⟩\widehat{F}_{ij} \leftarrow\widehat{\mu}_{ij} - \langle\psi_i \mid O_j \mid\psi_i\rangle using eq. (6)

  11. end for

  12. end for

  13. return F^\widehat{F}

is unbiased for Tr⁡[OjΛ(ρi)]\operatorname{Tr}[O_j\Lambda(\rho_i)]. For a Pauli string Oj=⨂qPqO_j = \bigotimes_q P_q, the score has the closed form

o^ij(t)={∏q:Pq≠I3sq(t),if the sampled basis matches Pq for every q with Pq≠I,0,otherwise.(3)\widehat{o}_{ij}^{(t)} = \begin{cases} \prod_{q:P_q\ne I} 3s_q^{(t)}, & \text{if the sampled basis matches }P_q\text{ for every }q\text{ with }P_q\ne I,\\ 0, & \text{otherwise.} \end{cases} \tag*{(3)}

Its single-round variance is the shadow norm of OjO_j:

Var⁡(o^ij(t))=3w(Oj)−Tr⁡(OjΛ(ρi))2.(4)\operatorname{Var}(\widehat{o}_{ij}^{(t)}) = 3^{w(O_j)}-\operatorname{Tr}(O_j\Lambda(\rho_i))^2. \tag*{(4)}

Crucially, the same TT snapshots {ρ^i(t)}t=1T\{\widehat{\rho}_i^{(t)}\}_{t=1}^{T} are reused to estimate every observable Oj∈OO_j \in O. Measurement is therefore amortised across the mm observables rather than repeated separately for each one. Since the scores in eq. (3) can have heavy tails for higher-weight observables, we aggregate them using the median-of-means estimator [19].

We partition the TT rounds into KK equal batches, average the scores within each batch, and take the median of the batch means μ^ij\widehat{\mu}_{ij}, for statistical robustness [5], thus

μ^ij=median⁡1≤b≤K(KT∑t∈batch bo^ij(t)),K=⌈2log⁡(2∣X∣δ)⌉.(5)\widehat{\mu}_{ij} = \operatorname{median}_{1\le b\le K}\left(\frac{K}{T}\sum_{t\in\text{batch }b}\widehat{o}_{ij}^{(t)}\right),\qquad K=\left\lceil2\log\left(\frac{2|X|}{\delta}\right)\right\rceil. \tag*{(5)}

Deviation Fingerprint and Estimation Guarantee

Each entry records the deviation of the estimated output expectation from its ideal, noiseless value. For the prepared pure state ρi=∣ψi⟩⟨ψi∣\rho_i = |\psi_i\rangle\langle\psi_i|, the empirical fingerprint entry is

F^ij=μ^ij−μijideal,where μijideal=⟨ψi∣Oj∣ψi⟩.(6)\widehat{F}_{ij}=\widehat{\mu}_{ij}-\mu_{ij}^{\mathrm{ideal}},\qquad\text{where }\mu_{ij}^{\mathrm{ideal}}=\langle\psi_i|O_j|\psi_i\rangle. \tag*{(6)}

Collecting these entries gives F^∈RX\widehat{F}\in\mathbb{R}^{X}, an estimate of the exact fingerprint αX(Λ)\alpha_X(\Lambda) defined in definition 3. The construction is denoted by αshadow\alpha_{\mathrm{shadow}}; its output is random because it depends on the sampled measurement bases and outcomes.

While the single-round score is unbiased, it is generally not the case for the median of means. For example, for Λ(ρ)=∣0⟩⟨0∣\Lambda(\rho)=|0\rangle\langle0| and O=ZO=Z, a single round returns 3 with probability 1/31/3 and 0 otherwise, giving the median of three one-round batches expectation 7/97/9 rather than 1. All guarantees below rely on the estimator’s concentration bound, not unbiasedness.

The exact semantic guarantee for this abstraction was established in theorem 2: the exact fingerprint distance equals the largest observational discrepancy over XX. The role of the shadow construction is to estimate that exact fingerprint with a finite measurement budget.

Proposition 3 (Uniform estimation guarantee of αshadow\alpha_{\mathrm{shadow}}). Fix an accuracy ε>0\varepsilon> 0, confidence level 1−δ1-\delta, and a probe suite whose observables have maximum Pauli weight w⋆w^{\star}. With

T=O(3w⋆ε−2log⁡(∣X∣δ))T = O\left(3^{w^{\star}}\varepsilon^{-2}\log\left(\frac{|X|}{\delta}\right)\right)

classical-shadow rounds per reference state and the median-of-means estimator of eq. (5), the empirical fingerprint satisfies the following, with probability at least 1−δ1-\delta:

∥αshadow(Λ)−αX(Λ)∥∞≤ε.\left\|\alpha_{\mathrm{shadow}}(\Lambda)-\alpha_X(\Lambda)\right\|_{\infty}\leq\varepsilon.

The factor 3w⋆3^{w^{\star}} captures the dependence on the maximum Pauli weight, with w⋆w^{\star} fixed by design in our probe suites. The following corollary gives the explicit tolerance used in the evaluation.

Corollary 3 (Estimation guarantee of ChanShadow). Let αT(Λ)\alpha_T(\Lambda) be the distribution of αshadow(Λ)\alpha_{\mathrm{shadow}}(\Lambda) computed from TT rounds per reference state with KK median-of-means batches. Then the guarantee of definition 12 holds for

ε(T,δ)=34⋅3w⋆⌊T/K⌋1ε2whereK=⌈2log⁡(2∣X∣δ)⌉.\varepsilon(T,\delta)=\sqrt{\frac{34\cdot3^{w^{\star}}}{\lfloor T/K\rfloor}\frac{1}{\varepsilon^2}} \qquad\text{where}\qquad K=\left\lceil2\log\left(\frac{2|X|}{\delta}\right)\right\rceil.

Proof. With batches of at least ⌊T/K⌋≥34⋅3w⋆/ε2\lfloor T/K\rfloor\geq34\cdot3^{w^{\star}}/\varepsilon^2 rounds, the median-of-means guarantee of [19] (Theorem 1; the shadow norm of a weight-ww Pauli observable is 3w3^w) gives uniform error at most ε\varepsilon with probability at least 1−δ1-\delta. The choice of KK allocates failure probability at most δ/k\delta/k to the mm observables for each of the kk reference states; a union bound over the states gives total failure probability at most δ\delta. This is the condition of definition 12. □

The certified tolerance is conservative. By proposition 2, the smallest valid tolerance is the (1−δ)(1-\delta)-quantile of the uniform estimation error, which we measure in § 5.2.1.

Information Orders and the Pauli-Channel Concretisation

We instantiate the information orders of definition 5 using the orders of Coecke and Martin [10]. Under these orders, the completely mixed state is least informative and pure states are maximal.

Orders on states. For probability vectors, the Bayesian order is defined by x⊑yx\sqsubseteq y if some permutation makes both xx and yy non-increasing and xiyi+1≤xi+1yix_i y_{i+1}\leq x_{i+1}y_i for every ii. The uniform distribution is its least element and point masses are maximal. For two outcomes, this reduces to

x⊑yiffy1≤x1≤12or12≤x1≤y1.x\sqsubseteq y\quad\text{iff}\quad y_1\leq x_1\leq\frac{1}{2}\quad\text{or}\quad\frac{1}{2}\leq x_1\leq y_1.

For density matrices, the spectral order r⊑sr\sqsubseteq s requires that rr and ss admit a common eigenbasis in which their eigenvalue lists satisfy the Bayesian order. Requiring commutation is necessary for this to define an information order [10].

Orders on channels and fingerprints. Channels are ordered by their outputs on the reference states:

Λ1⊑CΛ2iffΛ1(ρ)⊑Λ2(ρ) in the spectral order for every ρ∈S.\Lambda_1\sqsubseteq_C\Lambda_2\quad\text{iff}\quad\Lambda_1(\rho)\sqsubseteq\Lambda_2(\rho)\text{ in the spectral order for every }\rho\in\mathcal{S}.

Channels with equal outputs on every probe are identified. Each experiment (ρ,O)(\rho,O) with a Pauli observable has two outcomes, so a fingerprint entry determines a two-outcome distribution. Fingerprints are ordered entrywise by the Bayesian order on these distributions. Writing E=Tr⁡[OΛ(ρ)]E=\operatorname{Tr}[O\Lambda(\rho)] for the expectation value behind an entry, this order is

E1⊑E2iffE1E2≥0 and ∣E1∣≤∣E2∣,E_1 \sqsubseteq E_2 \quad\text{iff} \quad E_1E_2 \ge0 \text{ and } \lvert E_1\rvert\le\lvert E_2\rvert,

so noise moves expectation values towards zero without changing their sign.

Probabilistic concretisation for Pauli channels. A single-qubit Pauli channel

Λ(ρ)=(1−px−py−pz)ρ+pxXρX+pyYρY+pzZρZ\Lambda(\rho) = (1-p_x-p_y-p_z)\rho+ p_xX\rho X + p_yY\rho Y + p_zZ\rho Z

is a random mixture of unitary channels. We take that mixture as its probabilistic concretisation:

γP(a)=(1−px−py−pz)[I]+px[X]+py[Y]+pz[Z],\gamma_P(a) = (1-p_x-p_y-p_z)[I] + p_x[X] + p_y[Y] + p_z[Z],

where [U][U] is the point mass at the unitary channel ρ↦UρU†\rho\mapsto U\rho U^\dagger. The rates are determined by the fingerprint. In particular, if qPq_P is the probability that the +1+1 eigenstate of PP is found flipped in its own basis, then qZ=px+pyq_Z=p_x+p_y, qX=py+pzq_X=p_y+p_z and qY=px+pzq_Y=p_x+p_z, which determine (px,py,pz)(p_x,p_y,p_z). The expected concretisation γˉP(a)\bar{\gamma}_P(a) is the Pauli channel with these rates.

Proposition 4 (Galois law for Pauli channels). On the single-qubit interface of §4.1, with CC the set of Pauli channels and A=αX(C)A=\alpha_X(C), the pair (αX,γP)(\alpha_X,\gamma_P) is a probabilistic Galois connection, and for every Pauli channel Λ\Lambda we have

γˉP(αX(Λ))=Λ.\bar{\gamma}_P(\alpha_X(\Lambda))=\Lambda.

Proof. A Pauli channel maps each Pauli eigenstate ρ\rho to a state diagonal in the eigenbasis of ρ\rho, with spectrum (1−q,q)(1-q,q), where qq is the total rate of errors that anticommute with the corresponding Pauli operator. Outputs of two Pauli channels on ρ\rho therefore commute, and their spectral order is the Bayesian order of these spectra, which are the outcome distributions of measuring ρ\rho in its own basis. Measuring either of the other two Pauli observables gives the uniform distribution for every Pauli channel. Hence αX(Λ1)⊑AαX(Λ2)\alpha_X(\Lambda_1)\sqsubseteq_A\alpha_X(\Lambda_2) iff Λ1⊑CΛ2\Lambda_1\sqsubseteq_C\Lambda_2. The flip probabilities determine the rates, so γˉP(αX(Λ))=Λ\bar{\gamma}_P(\alpha_X(\Lambda))=\Lambda and αX(γˉP(a))=a\alpha_X(\bar{\gamma}_P(a))=a for every a∈Aa\in A. The probabilistic Galois law follows. □

For channels that are not Pauli channels, including amplitude damping and the hardware-calibrated models, outputs on some probes do not commute. Distinct channels are then incomparable in the spectral order, and the law holds only trivially. § 5.2.1 evaluates both cases.

Measurement and Post-Processing Cost

Each reference state requires its own set of measurement rounds. By proposition 3, the total number of measurements is

O(∣S∣⋅3w⋆⋅ε−2log⁡(∣X∣δ)).O\left(|S|\cdot3^{w^\star}\cdot\varepsilon^{-2}\log\left(\frac{|X|}{\delta}\right)\right).

Classical post-processing to construct the fingerprint requires O(T∣X∣)O(T|X|) operations, with the measurement budget scaling in the number of reference states while records for each state are shared across all observables in the interface. The direct workflow stores only ∣X∣|X| scalar deviations, avoiding the construction of a full 2n×2n2^n\times2^n density or 4n×4n4^n\times4^n Choi matrix. Channel reconstruction via Choi-matrix optimisation is not required for fingerprint comparison, but is described in §A.4.

Evaluation

We evaluate the concrete construction αshadow\alpha_{\mathrm{shadow}} against the abstraction properties defined in § 3. The evaluation combines exact calculations from channel representations with empirical estimates obtained from randomized measurements. It is organised around four questions, each targeting a different aspect of the abstraction, with Table 1 mapping each question to its formal property, metric, and theoretical target:

RQProperty (Def.)MetricTheoretical target
RQ1Soundness (Def. 9, Thm. 2, Def. 10)law; coverage; ρ(Dabs,D⋄)\rho(D_{\mathrm{abs}},D_{\diamond}); LLlaw holds; cov. ≥1−δ\ge1-\delta; L≤1L \le1, high ρ\rho
RQ2Conciseness (definition 11)∣X∣|X| vs 16n16^n; RinfoR_{\mathrm{info}}exp. compression, Rinfo≈1R_{\mathrm{info}} \approx1
RQ3Efficiency (definition 12)TT vs ∣X∣|X|O(ε−2log⁡∣X∣)O(\varepsilon^{-2}\log|X|)
RQ4Adaptiveness (definitions 13 to 15)∥Λ^T−ΛT∥⋄\lVert\widehat{\Lambda}_T-\Lambda_T\rVert_{\diamond}, slopeO(T−1/2)O(T^{-1/2}), ΔT≪Tcold\Delta_T \ll T_{\mathrm{cold}}

Table 1. RQs: the formal property each targets, the metric used, and the theoretical target from § 3.

  • RQ1 (Observational fidelity). How accurately does fingerprint distance represent the observable discrepancy between concrete channels, and how reliable are finite-shot fingerprints?

  • RQ2 (Conciseness). How does the representation size compare with a full channel representation, and how much information about the tested noise parameters is retained?

  • RQ3 (Measurement efficiency). How does the number of shared measurement rounds required for a uniform error target grow with the interface size?

  • RQ4 (Adaptation under drift). When noise changes, how does estimation converge, and when does reusing previous snapshots reduce the fresh measurement cost?

Experimental Methodology

Analytic and Empirical Tracks

We use a dual-track design. The analytic track computes exact fingerprints directly from the Kraus representation of the underlying quantum channel (eq. (10)). For RQ1 and RQ4, channel distances are additionally computed using the diamond norm ∥Λ1−Λ2∥⋄\lVert\Lambda_1-\Lambda_2\rVert_{\diamond}, evaluated by the Watrous Semi-Definite Program (SDP) [47].

The empirical track runs the classical-shadow estimator αshadow\alpha_{\mathrm{shadow}} of algorithm 1, with parallel single-qubit Pauli measurements and median-of-means aggregation. For RQ1, RQ3, and RQ4, empirical fingerprints are compared against Kraus-derived fingerprints; RQ2 uses Kraus-derived fingerprints directly. Where reported, the information-retention ratio is estimated with the Kraskov–Stögbauer–Grassberger kk-nearest-neighbour mutual-information estimator [26], and optional channel reconstruction uses the constrained SDP defined in §A.4, eq. (11).

Reference Implementation and Testbed

We simulate states and channels as double-precision density matrices, and represent quantum channels by their Kraus decompositions (eq. (10)). Unless stated otherwise, the baseline is the identity channel and the noise channels are depolarising, amplitude damping, and phase damping, assembled at the qubit level. The exact diamond norm is obtained from the Watrous SDP [47] using an interior-point convex solver. The information-retention ratio uses the Kraskov–Stögbauer–Grassberger estimator [26].

Experiment interface. The interface X=S×OX=S\times O follows the probe-suite design of § 4.1. The single-qubit experiments use computational-basis and product-superposition reference states together with the Pauli observables XX, YY, and ZZ. Multi-qubit experiments additionally use entangled reference states and bounded-weight Pauli strings, with ∥O∥op≤1\lVert O\rVert_{\mathrm{op}} \le1. Unless an experiment states otherwise, the maximum observable weight is w⋆=2w^{\star}=2.

Replication protocol. Experiments involving empirical fingerprint estimation (RQ1, RQ3, and RQ4) are repeated independently 50 times to quantify sampling variability. Empirical results are reported as mean ±\pm standard deviation where applicable. Shot budgets apply only to experiments involving empirical estimation; each question-specific budget is stated below.

Artifact and execution environment. All experiments are implemented in a self-contained reference package released as the accompanying anonymised artifact, with fixed dependency versions and random seeds, a containerised environment, and an automated test suite for reproducibility. Experiments were executed on an Apple MacBook Pro with an M1 Pro processor and 32 GB RAM.

Question-Specific Setups

Unless stated otherwise, the program PP is a single Hadamard gate. For parameterised noise channels, pp denotes the channel-strength parameter (e.g. the depolarising probability), with the range specified by the experiment.

RQ1: Observational fidelity. We first evaluate soundness in a controlled one-qubit setting. The baseline is the noiseless channel, and the noise channel is single-qubit depolarising noise. We sweep the depolarising rate pp over 30 equally spaced values in [0,0.40][0, 0.40]. For each value, we compute the exact fingerprint and estimate an empirical fingerprint from 1500 measurement shots. The empirical fingerprint distance is summarised by its mean and standard deviation and compared with the analytical diamond distance between the noiseless and depolarising channels.

RQ2: Conciseness. We evaluate conciseness through representation scaling and information retention. For scaling, we compare fingerprint-interface growth with the size of the concrete channel representation for n∈{1,…,7}n \in\{1, \ldots, 7\} qubits. For information retention, we compute fingerprints directly from the Kraus representations of the parameterised noise channels over 10 equally spaced parameter values in [0.05,0.35][0.05, 0.35].

RQ3: Measurement efficiency. We use depolarising noise with strength p=0.15p = 0.15. The interface size ∣X∣|X| is varied by increasing the number of reference states while keeping the observable set fixed to the three single-qubit Pauli observables. The shot budget is varied over (50,100,200,350,…,3500)(50, 100, 200, 350, \ldots, 3500) to measure how the required number of rounds changes as the interface grows.

RQ4: Adaptation under drift. We simulate a time-varying depolarising channel whose noise strength p(t)p(t) increases linearly with time. The interface is fixed at ∣X∣=18|X| = 18, comprising 6 reference states and 3 single-qubit Pauli observables. We compare full fingerprint recomputation with incremental updates. For an update, the ToldT_{\mathrm{old}} snapshots collected before drift (the fingerprint at t=0t = 0) are pooled with TnewT_{\mathrm{new}} fresh snapshots from the post-drift channel using the count-weighted estimator implemented in the evaluation code. Because old snapshots come from the pre-drift channel, their contribution introduces bias relative to the post-drift fingerprint. We report the smallest TnewT_{\mathrm{new}} that restores the target accuracy.

Expert-Signature Verification Protocol

Expert-signature verification complements RQ1 by testing whether fingerprints reproduce the expected physical signatures of different noise processes, rather than just preserving channel distances (as measured in RQ1).

Numeric compliance with the abstraction bounds does not establish that a fingerprint reflects physically expected noise behaviour. We therefore apply a falsifiable, estimator-independent check in the style of metamorphic testing [42]: for each noise channel, domain knowledge predicts which state–observable pairs should show the largest deviations and which should remain invariant. The oracle directly encodes the expected physical behaviour of each noise channel.

Definition 16 (Expert signature and verification). For a noise channel MM, an expert signature is a pair (LM,ZM)(\mathcal{L}_M,\mathcal{Z}_M) of disjoint subsets of XX: the salient pairs LM\mathcal{L}_M should show a large deviation, while the invariant pairs ZM\mathcal{Z}_M should show none. Writing F=αX(ΛM)F = \alpha_X(\Lambda_M), the concrete domain passes verification for MM at thresholds (τ,τ0)(\tau,\tau_0) if

min⁡(ρ,O)∈LM∣FρO∣≥τmax⁡(ρ,O)∈X∣FρO∣andmax⁡(ρ,O)∈ZM∣FρO∣≤τ0.\min_{(\rho,O)\in\mathcal{L}_M} |F_{\rho O}| \ge\tau\quad\max_{(\rho,O)\in X} |F_{\rho O}| \quad\text{and} \quad\max_{(\rho,O)\in\mathcal{Z}_M} |F_{\rho O}| \le\tau_0.

We instantiate the two-qubit interface with states {∣00⟩,∣11⟩,∣10⟩,∣01⟩,∣++⟩,∣+1⟩,∣0−⟩,∣Φ+⟩}\{|00\rangle, |11\rangle, |10\rangle, |01\rangle, |++\rangle, |+1\rangle, |0-\rangle, |\Phi^+\rangle\} and Pauli observables {ZZ,XY,YY,ZI,IZ,IX,XI,XZ}\{ZZ, XY, YY, ZI, IZ, IX, XI, XZ\}. We write ∣q0q1⟩|q_0q_1\rangle for a computational-basis state and use the convention that an observable ABAB acts as AA on qubit 0 and BB on qubit 1. Expert signatures follow from the standard physical arguments [39]: depolarising noise contracts Pauli expectations, so it is salient when the state is a stabiliser of the observable (∣⟨O⟩∣=1|\langle O\rangle| = 1) and invariant when ⟨O⟩=0\langle O\rangle= 0; amplitude damping relaxes ∣1⟩|1\rangle to ∣0⟩|0\rangle, so its population signatures appear on ZZ-type observables of the excited qubit; and phase damping erases coherences, so it affects X/YX/Y-type observables of superposition and entangled states. We use τ=0.5\tau= 0.5, τ0=10−6\tau_0 = 10^{-6}, and channels at rate 0.1. Fingerprints are computed exactly, so the verdict is independent of measurement noise.

Results

The exact-distance results (RQ1) establish what the interface preserves; RQ2-RQ4 measure the cost and practical behaviour of constructing and updating the corresponding fingerprints.

RQ1: Observational Fidelity

Figure 1 compares abstract and concrete distances for all within-family pairs generated from p∈{0.05,0.10,0.15,0.20,0.25,0.30}p \in\{0.05, 0.10, 0.15, 0.20, 0.25, 0.30\}, where pp is the strength parameter for depolarising, amplitude-damping, and phase-damping channels. The abstract and concrete distances correlate at ρ=0.98\rho= 0.98, and the realised Lipschitz constant is L=1.00L = 1.00. This matches the upper bound of proposition 1.

Abstract distance versus SDP diamond distance for depolarising, amplitude-damping, and phase-damping channel pairs

Figure 1. RQ1 Abstract vs Concrete: abstract distance vs SDP diamond distance for all within-family channel pairs. Amplitude- and phase-damping pairs attain the soundness bound (L=1L = 1, solid); depolarising pairs lie exactly on L=2/3L = 2/3 (dashed), as the depolarising worst case is off the interface.

The bound is attained for the amplitude- and phase-damping families: for these channels, the selected interface contains the diamond-norm worst-case direction and Dabs=D⋄D_{\mathrm{abs}} = D_{\diamond}. For depolarising noise, the ratio is exactly 2/32/3, since Dabs=∣Δp∣D_{\mathrm{abs}} = |\Delta p| while D⋄=32∣Δp∣D_{\diamond} = \frac{3}{2}|\Delta p|; the diamond-norm worst case lies outside the selected interface. The restricted-interface experiment illustrates the same limitation directly: two channels can have abstract distance 0 on X′X' while their diamond distance is 0.163. Thus, soundness is exact relative to the interface, not a claim of global channel equivalence.

Probabilistic Galois connection. On the single-qubit interface, we verify the law of definition 9 using the information orders and random-unitary concretisation of § 4.4. Over 6,724 pairs of 82 Pauli channels (random rates, depolarising, and dephasing families), the law holds in every case, with 0 violations. 1,691 pairs are non-trivially unordered, and the expected concretisation reconstructs every channel exactly. For 43 other channels (amplitude damping, IBM-calibrated, and random), abstract and concrete orders agree on all 1,849 pairs, but only trivially: no two distinct channels are ordered (0 ordered pairs), as their outputs on some probes do not commute.

Finite-shot coverage. We test the (ε,δ)(\varepsilon, \delta) guarantee of theorem 3 on two interfaces: ∣X∣=18|X| = 18 with w⋆=1w^\star= 1, and the 117-entry two-qubit suite with w⋆=2w^\star= 2. The test uses four channels (depolarising, amplitude damping, phase damping, and IBM-calibrated), δ∈{0.05,0.01}\delta\in\{0.05, 0.01\}, T∈{2000,8000,32000}T \in\{2000, 8000, 32000\}, and 48 configurations with 1000 (one-qubit) or 400 (two-qubit) independent sessions each.

The certified tolerance is valid. The measured fingerprint lies within the certified tolerance in every session (minimum coverage 1.000), and the Clopper–Pearson lower bound exceeds 1−δ1-\delta in every configuration. The certified tolerances are conservative: they range from 0.21 to 1.79 (and from 0.21 to 0.45 at T=32000T=32000), exceeding the empirical (1−δ)(1-\delta)-quantile—the smallest valid tolerance by proposition 2—by a factor of 4.8–6.7.

The guarantee is informative at a tight tolerance. Calibrating ε\varepsilon as the (1−δ)(1-\delta)-quantile on half of the sessions and evaluating coverage on the other half gives mean held-out coverage 0.957 for δ=0.05\delta=0.05 and 0.990 for δ=0.01\delta=0.01, close to the nominal 1−δ1-\delta.

The check has power. A per-entry Gaussian interval ignoring the union over the interface violates the condition in 24 of 24 two-qubit configurations (coverage 0.00–0.03), confirming that the guarantee concerns the complete fingerprint rather than its individual entries.

Finally, over 20 sessions, the channel selected by γshadow\gamma_{\mathrm{shadow}} is never farther in ℓ2\ell_2 from αX(Λ)\alpha_X(\Lambda) than the measured fingerprint itself; the maximum ratio is 0.896 ≤1\le1, as theorem 4 predicts. The reconstruction and its guarantee are given in §A.4 of the appendix.

RQ2: Conciseness and Information Retention

Figure 2 compares the size of the fingerprint interface with the full channel representation as the number of qubits increases. The compression ratio is annotated at each qubit count.

Full channel dimension and fingerprint-interface size for qubit systems

Figure 2. RQ2 Representation Size. Comparison of the full channel dimension (16n16^n) and fingerprint-interface size (∣X∣|X|) for n=2n = 2–66 qubits on a logarithmic scale. Annotations report the compression ratio 16n/∣X∣16^n/|X|.

Table 2 reports fingerprint size relative to the 16n16^n-dimensional channel representation. The compression ratio follows directly from the representation sizes: at n=6n=6, the fingerprint is 81,049×\times smaller than the full channel representation.

nn∣X∣|X|16n16^nCompression
2632564×\times
3664,09662×\times
410565,536624×\times
51521,048,5766,899×\times
620716,777,21681,049×\times

Table 2. RQ2: interface size ∣X∣|X| compared with the full channel dimension 16n16^n.

The more substantive question is how much information about the tested noise parameter survives this compression. On the synthetic single-qubit distribution of § 5.1.1, the fingerprint retains nearly all information about noise strength pp than the full Choi matrix carries: the bootstrap mutual-information ratio is Rinfo=0.99±0.01R_{\mathrm{info}}=0.99\pm0.01, and within-type parameter regression achieves R2=0.96R^2=0.96. These values concern recovery of pp on this finite distribution; they do not establish distribution-free information preservation for arbitrary channels or program outputs.

As a negative control, equal-dimension PCA embeddings and Gaussian random projections achieve the same retention (R2=0.96R^2=0.96, invariant across projection seeds). The fingerprint’s advantage is therefore not generic optimality but that it preserves the exact, physically interpretable slice selected by XX.

RQ3: Measurement Efficiency

Figure 3 (left) reports the number of rounds per reference state required to achieve uniform error below ε=0.15\varepsilon=0.15 with confidence 0.95 as a function of ∣X∣|X|. Using the literal estimator of algorithm 1, the required rounds grow substantially more slowly than the interface: as ∣X∣|X| grows by 6.7×, required rounds increase by only 1.6–2.0×, giving fitted exponent β=0.33±0.05\beta= 0.33 \pm0.05 (range 0.23–0.38) — well below the linear baseline (β=1\beta= 1) and consistent with O(log⁡∣X∣)O(\log|X|) theoretical rate over the tested range.

Three-panel plots showing literal-shadow rounds, estimator convergence, and IBM channel reconstruction

Figure 3. RQ3-RQ4’s Results: RQ3 (leftmost). Literal-shadow rounds per state for error at most ε=0.15\varepsilon= 0.15 with confidence 0.95, vs interface size ∣X∣|X|, six seeds (faint points) and their mean. The measured growth (β=0.33±0.05\beta= 0.33 \pm0.05) sits far below the independent baseline (O(∣X∣)O(|X|), dashed) and close to the logarithmic reference (dotted). RQ4 (right two). Estimator convergence at the T−1/2T^{-1/2} rate (mean error, six seeds) in the mid-plot, and diamond error of the γshadow\gamma_{\mathrm{shadow}} reconstruction of a hardware-informed IBM-Boston channel vs budget in the right plot.

The confidence requirement increases the budget but does not steepen its growth. Under the typical-case (median) criterion, the largest interface requires 2,369 rounds rather than 5,366, with β=0.42±0.08\beta= 0.42 \pm0.08. Full process tomography, which scales as 16n16^n, overtakes the other strategies near n≈3n \approx3–4; beyond n=5n = 5, tomography is intractable and the fingerprint is the only feasible option among the compared approaches. The exponent is fitted over a 6.7× range in ∣X∣|X| and is interpreted as consistent with logarithmic scaling, not as an asymptotic measurement.

Estimator fidelity and variance. We verify that αshadow\alpha_{\mathrm{shadow}} implements the Huang–Kueng–Preskill estimator used in the analysis. Across 162 (state, observable, channel, n∈{1,2}n \in\{1, 2\}) cases, the maximum single-shot bias at T=2×104T = 2 \times10^4 is 0.039, consistent with zero up to Monte-Carlo error. The measured single-round variance matches the shadow-norm expression 3w(O)−Tr⁡(OΛ(ρ))23^{w(O)} - \operatorname{Tr}(O\Lambda(\rho))^2 of eq. (4) to two significant figures; representative values are reported in Table 3. With snapshots shared across observables, the rounds needed for a fixed uniform error grow as O(log⁡m)O(\log m) in the number of observables mm: for weight-1 observables at n=4n = 4 and error at most 0.20 with confidence 0.95, m∈{2,4,8,12}m \in\{2, 4, 8, 12\} requires T∈{800,800,800,1600}T \in\{800, 800, 800, 1600\} rounds (typical case: {200,400,400,400}\{200, 400, 400, 400\}).

SS, OOwwTheoryEmpirical
∣+⟩|+\rangle, ZZ13.003.01
∣+⟩|+\rangle, XX12.002.00
∣Φ+⟩|\Phi^+\rangle, ZZZZ28.007.98
∣Φ+⟩|\Phi^+\rangle, XXXX28.008.03

Table 3. RQ3: Single-round variance of classical-shadow estimator (eq. (3)) with experiment pairs (ρ,O)(\rho,O) (Col. S,O) vs shadow norm 3w−⟨O⟩23^w-\langle O\rangle^2 (eq. (4)) (Col. Theory); Col. Empirical is at T=4×104T=4\times10^4. ww is as in § 4.1.

Extended scaling to eight qubits. The main efficiency experiment varies the number of reference states while retaining the three single-qubit Pauli observables. We additionally evaluate the literal product-factorised sampler at larger system sizes, using product reference states and weight-≤2\leq2 observables (§A.6.1 details the construction and exact ground truths). In this experiment, rounds to reach uniform error ε=0.15\varepsilon= 0.15 at confidence 0.95 increase from 3,153 to 8,290 while the interface grows by 38×, from ∣X∣=8|X| = 8 to $|X| = 304. The pooled exponent is β=0.28\beta= 0.28 (within-size exponents range 0.08–0.25), providing additional evidence over a range 5.7× wider than the n≤2n \leq2 measurement. The experiment is restricted to product instances; entangled probes are retained in the n≤2n \leq2 suites.

Q4: Adaptation Under Noise Drift

We report estimator convergence, the behaviour of optional channel reconstruction, and the effect of reusing measurements collected before a channel change (i.e., the direct test of drift-aware updating).

Estimator convergence. Figure 3 (middle) shows estimator error as a function of the number of rounds TT over six independent runs. The abstraction is continuous, with ∥αt+1−αt∥∞≤2.0 δt\lVert\alpha_{t+1} - \alpha_t \rVert_\infty\leq2.0\,\delta_t in the physical drift δt\delta_t (definition 13). The empirical estimator converges with log–log slope −0.500±0.006-0.500 \pm0.006 over six seeds, matching the O(T−1/2)O(T^{-1/2}) rate of definition 14.

Optional channel reconstruction. Figure 3 (right) reports the diamond-norm reconstruction error for the general γshadow\gamma_{\mathrm{shadow}} reconstruction. Applying the non-parametric concretisation of eq. (11) to a hardware-calibrated IBM channel reduces the diamond reconstruction error from 0.173±0.0160.173 \pm0.016 at T=200T = 200 to 0.025±0.0010.025 \pm0.001 at T=12,800T = 12{,}800 rounds (mean ±\pm std, over three seeds of six repetitions each). This reconstruction is optional and not required for fingerprint comparison.

Reusing snapshots after drift. After a drift step with fingerprint displacement 0.0500.050, pooling 1,600 stale snapshots with fresh observations restores accuracy ε=0.10\varepsilon= 0.10 at confidence 0.950.95, using 1,539±1671{,}539 \pm167 fresh rounds per state versus 3,469 for a cold start (≈2.3×\approx2.3\times saving; median criterion: 54 vs. 1,480, ≈27×\approx27\times saving). The stale snapshots alone bring the median error close to ε\varepsilon, but their own sampling noise means that reaching ε\varepsilon in 95% of sessions still requires many fresh rounds. Stale measurements are not discarded after drift: their bias is bounded by the fingerprint drift and is diluted by pooling. The appendix further characterises the drift range over which this trade-off is beneficial.

Discussion

Table 4 summarises the theoretical bounds together with the corresponding empirical measurements. Every measured quantity satisfies its predicted bound, and the soundness and Lipschitz bounds are attained where the theory predicts tightness. Although generic equal-dimension sketches retain comparable information, the fingerprint remains interpretable in terms of physically meaningful probe outcomes rather than latent coordinates. Note that several reported quantities are mathematical consequences of the construction rather than empirical findings. We have flagged them as such: the compression ratio is a counting fact (the empirical content is retention), and the exact-soundness gap is an algebraic identity confirmed to machine precision.

Property (Def.)Theoretical boundMeasuredVerdict
Galois law (definition 9)law, Pauli channels0 violations in 6,724 pairsholds
Obs. soundness (theorem 2)Dabs=ΔobsD_{\mathrm{abs}} = \Delta_{\mathrm{obs}}gap 1.1×10−161.1 \times10^{-16}holds (exact)
Lipschitz (definition 10)L≤1L \le1L=1.00L = 1.00 (AD/PD), 2/32/3 (dep)holds, tight on AD/PD
Conciseness (definition 11)∣X∣≪16n\lvert X\rvert\ll16^n81,049×81{,}049\times, Rinfo≈1R_{\mathrm{info}} \approx1holds
Efficiency (definition 12)T=O(ε−2log⁡∣X∣)T = O(\varepsilon^{-2}\log\lvert X\rvert)β=0.33±0.05\beta= 0.33 \pm0.05holds
Adaptiveness (definition 14)O(T−1/2)O(T^{-1/2})slope −0.500±0.006-0.500 \pm0.006holds
Robustness (definition 15)∥Λ^T−ΛT∥⋄→0\lVert\widehat{\Lambda}_T - \Lambda_T\rVert_{\diamond} \to00.173→0.0250.173 \to0.025holds

Table 4. Compliance of αshadow\alpha_{\mathrm{shadow}} with the § 3 bounds.

Threats to validity

Next, we discuss the main threats to validity. The appendix (§A) reports additional experiments extending the evaluation to larger systems and hardware-inspired settings.

Internal validity. The reference implementation was validated against the formal development by encoding and testing every definition and proposition, confirming that stated (in)equalities hold during execution and reducing the risk that findings are implementation artefacts (see also Appendix §A.5). All stochastic quantities were replicated over five independent seeds (reported mean ±\pm std); the fine-grid protocol of § 5.1.1 supersedes an earlier coarser budget quantisation.

Construct validity. The concrete-domain limitations are measured §A.7.4: the detectability and readout floors, the first-order blindness to coherent ZZZZ crosstalk, the blind subspace induced by finite experiment interfaces, and the drift region in which warm-starting remains beneficial. Expert signatures are currently hand-specified for a two-qubit suite; scaling their verification to larger nn requires generating signatures from the channel’s Pauli-transfer-matrix action, which we leave to future work.

External validity. The efficiency exponent is fit over a 6.7× range in ∣X∣|X| and is consistent with, not a proof of, logarithmic scaling. All channels are synthetic or IBM-calibrated rather than live device data; the ibm_boston profile uses the platform’s published medians for two-qubit and readout error, with Heron-class constants for T1T_1, T2T_2, and single-qubit error. An on-device comparison is left to future work. Robustness under realistic conditions was assessed via a configurable noise framework and stress protocols covering detectability, non-Pauli errors, blindness, and drift validity; results are reported in Appendix § 11.§ 7. The limitations discussed below (§ 6.2) concern the framework itself rather than this particular instantiation.

Generalisability. We assessed scalability (w.r.t. the number of qubits) by introducing scalable ground truths and a product-factorised literal sampler; we report constructions and results in Appendix § 11.§ 6. We evaluated discriminability beyond the channels used in the main evaluation (RQ1–RQ4) via Frobenius distances within and between noise families and across platforms. The mean within-family fingerprint distance is 0.0009 versus 0.7806 between families (876× separation), confirming that distinct noise mechanisms occupy well-separated regions of F\mathcal{F}.

Cross-platform distances between two independent simulator backends (Qiskit and Cirq), on IBM Boston and Quantinuum H2 profiles (Figure 4), range from approximately 0.008 to 0.012 across the three noise families. The bootstrap standard errors are at most 0.0008 (minimum distance-to-uncertainty ratio 11×), confirming that the residual platform discrepancy is measurable rather than estimator noise. Fingerprints thus support both noise-family attribution and platform discrepancy analysis.

Cross-platform fingerprint distances between two simulator backends per noise family

Figure 4. Cross-platform fingerprint distances between two simulator backends per noise family, with bootstrap standard errors.

Limitations

The abstraction’s discriminative power depends on the chosen experimental interface. While the framework does not mandate a single canonical interface, it specifies the properties any admissible one must satisfy (soundness, conciseness, efficiency, adaptiveness), and the interface should be selected to match the goals of the intended analysis.

Since the abstraction is inferred from measurement outcomes rather than derived from a channel’s mathematical description, it is applicable to real hardware where the exact model is unknown. However, the resulting fingerprint retains dependence on the chosen interface and the finite measurement budget, so repeated evaluations of the same channel may yield slightly different fingerprints; the soundness definitions of § 3.3 explicitly account for this variability.

The (ε,δ)(\varepsilon,\delta) guarantee of definition 12 bounds the probability that a measured fingerprint deviates from its exact interface profile by more than ε\varepsilon. For the fixed four-prefix illustration, a union bound converts profile-level coverage into simultaneous distance intervals (Appendix, § 11.§ 1). This does not extend to comparing full measurement distributions across environments or to end-to-end debugging workflows with data-dependent checkpoint selection, compiler alignment, and total acquisition cost; formalising such an extended contract remains future work.

Finally, the expert validation uses observables containing identity gates (e.g. ZIZI, IXIX), whose meaning depends on how idle qubits are realised by the execution platform. In our evaluation, channels are represented via Kraus operators and such observables are interpreted algebraically as tensor-product operators, so the reported results are valid under that representation. In realistic execution settings, such as those in Appendix § 11.§ 7, this distinction becomes relevant, and extending the evaluation methodology accordingly is left to future work.

Related Work

Characterising a device versus answering an analysis query. Quantum process tomography, gate-set tomography, and randomised benchmarking characterise channels or summarise error rates [7, 9, 30], but answer a different question from ours: what can a particular analysis observe about two execution environments? A complete channel description answers arbitrary such queries at high cost; a benchmark statistic is cheaper but need not distinguish the behaviours selected by an analysis. Our fingerprint records the values of a declared, finite experiment interface, and its guarantee is relative to that interface. Classical shadows reduce the measurements needed to estimate many observable properties [1, 2, 19], and have been applied to process tomography via Choi-representation estimation [28]. We use the classical-shadow estimator for a narrower, analysis-directed purpose: the interface is fixed before acquisition, and one shared measurement record estimates all coordinates with an explicit finite-shot confidence bound.

Noise-aware testing and empirical fingerprints. Device “noise fingerprints” have been used for identification and drift tracking [31]. The closest precursor introduced live fingerprints to compare noisy simulators [5]. We build on this by making the abstraction boundary explicit: equality and distance mean agreement and discrepancy on the selected observations, interface extension refines what can be distinguished, and finite-shot estimation provides probabilistic coverage guarantees. Our implementation also reuses a shared randomized measurement record across observables instead of collecting separate batches per coordinate. Related work targets complementary aims: noise-aware property-based testing reduces spurious assertion failures [35, 42], simulator fuzzing searches for behavioural inconsistencies [24], and delta debugging identifies sources of quantum regressions [43]. Our prefix example highlights the first observed difference between configurations but is not a general fault-localization method.

Abstract interpretation and uncertainty. Classical and quantum abstract interpretations provide a language for relating tractable representations to concrete behaviour [12, 15, 41, 50], supporting program-state analysis and correctness. Here, the concrete object is the noisy channel induced by the execution environment, and the abstractions are observations tailored to a software-analysis task. Probabilistic abstract interpretation already addresses reasoning over quantitative and uncertain systems [13, 34]. Our probabilistic Galois connection follows the order-theoretic framework of probabilistic abstract interpretation: concretisation yields a distribution over channels, compared by expected value (definition 9), using orders from Coecke and Martin [10]. Finally, we distinguish two limits: the (ε,δ)(\varepsilon,\delta) bound of definition 12 controls measurement error for a fixed channel, whereas information loss outside the interface is an intentional design choice, not a finite-sampling artefact.

Conclusion and Future Research Avenues

We presented noise fingerprints as an interface-relative semantic abstraction for noisy quantum executions, separating the concrete semantics of a noisy channel from the finite observational interface through which a programmer, testing tool, or analysis is observed. A fingerprint is thus not merely an empirical summary but the abstract denotation of a noisy execution with respect to a chosen set of reference states and observables. The abstraction yields a formal reasoning framework: exact fingerprints are complete for the chosen interface, empirical fingerprints provide statistically controlled approximations, and interface refinement monotonically increases observational precision. Classical shadows enable efficient implementation, delivering compact behavioural summaries without the cost of full process tomography.

AI Use

Claude (Anthropic) helped reorganise the existing replication package and check that the manuscript’s claims matched the reported results. Claude and ChatGPT (OpenAI) assisted with manuscript clarity and the LaTeX formatting of formal definitions. The authors reviewed the outputs. Neither tool implemented ChanShadow, generated or modified data, ran simulations, or performed statistical analyses.

Data-Availability Statement

An anonymised artifact accompanies this submission. It contains the ChanShadow reference implementation, the notebooks and scripts used to conduct the experiments, fixed dependency versions, random seeds, a containerised execution environment, and an automated test suite. The artifact is intended to support reproduction of the channel-level simulations, fingerprint estimation experiments, and supplementary evaluations reported in this paper.

The evaluation uses simulated quantum channels and hardware-inspired noise profiles derived from published calibration information; it does not include measurements collected directly from physical quantum hardware. Consequently, the artifact reproduces the simulation-based results and does not provide an on-device validation of the proposed approach.

The anonymised artifact is available at https://zenodo.org/records/23414157.

The authors intend to submit the artifact for the PLDI 2027 Artifact Evaluation process.

Appendix

This appendix collects material that supports the formal development and main evaluation without interrupting their presentation. It includes the worked program-level example (§A.1), probability and quantum-computing background, the optional Choi-matrix reconstruction procedure, extended scaling experiments, and hardware-inspired stress tests. The additional experiments characterise both the regimes in which the interface is informative and the limitations that arise when relevant behaviour is not represented by the selected probes.

Worked Examples 2-5: Noise-Aware Analysis with ChanShadow

The artifact includes a Jupyter notebook that uses noise fingerprints to check compiler optimisations, assess test portability, and locate observable differences during debugging. To try the analyses on another program, set MY_PROGRAM to its source code in OpenQASM format. We briefly describe all three analyses in the anonymised notebook before presenting here the noise-aware differential debugging in detail.

Each example could form the basis of a follow-up paper building on the formalism developed here, which we leave to future work.

Compiler Optimisation. Is this pass semantics-preserving on this machine? An optimisation that preserves ideal semantics can change observable behaviour under noise. We compare the fingerprints of a baseline execution and a candidate execution that models the effect of an optimisation. If their distance exceeds the analysis tolerance, the tool emits a warning identifying the input and observable with the largest discrepancy.

See Section 5 of worked_example.ipynb in the anonymised artefact for details and instructions on running this part.

Test Portability. A test suite was validated against one realisation. Can it be trusted on a new backend or after calibration drifts? We use the suite’s inputs and observables to compare executions across environments. The fingerprint distance gives the largest change in the quantities the suite observes. For the Bell program, tests of population miss the phase rotation, which measurements in the superposition bases can reveal.

See Sections 5-6 of worked_example.ipynb in the anonymised artefact for details and instructions on running this part.

Debugging. A test fails on one realisation and passes on another. Which gate should we investigate? We compare fingerprints at successive program prefixes and report the first prefix whose discrepancy exceeds the tolerance. In the miscalibrated-gate example, the discrepancy first appears after the first CX, giving the developer a concrete place to investigate.

See Section 7 of worked_example.ipynb in the anonymised artefact for details and instructions on running this part.

Noise-Aware Differential Debugging. This section presents a supplementary program-level worked example illustrating how a finite observation interface can guide inspection of two noisy realisations of the same program. Unlike the two-qubit motivation in § 2, this example uses a three-qubit program with four operations and examines the observed discrepancy at successive program prefixes. Its purpose is to illustrate a possible debugging workflow and, in particular, the distinction between the first observed threshold crossing and causal fault localisation.

Program and concrete realisations. The three-qubit source program is

P=H(q0); CX(q0,q1); T(q2); CX(q1,q2).P = H(q_0); \ CX(q_0,q_1); \ T(q_2); \ CX(q_1,q_2).

Write PjP_j for its first jj gates and Λb,j\Lambda_{b,j} for the input-to-output channel realised by PjP_j in configuration b∈{A,D}b \in\{A,D\}. Thus Λb,j\Lambda_{b,j}, not the gate name or the source text, is the concrete object compared at checkpoint jj. The ideal prefix has unitary UjU_j, the same in both configurations. The notebook represents Λb,j\Lambda_{b,j} as a 43×434^3 \times4^3 superoperator, containing 163=409616^3 = 4096 matrix entries.

Both configurations apply one-qubit depolarising noise with rate p1=0.020p_1 = 0.020 after a one-qubit gate, followed by amplitude damping with rate γ=0.01\gamma= 0.01 on that gate’s target. After a CXCX, they apply the same sequence independently to each participating qubit, but with a two-qubit-gate depolarising rate p2=0.05p_2 = 0.05 in A and p2=0.09p_2 = 0.09 in D. These are the notebook’s illustrative gate-noise parameters, not a calibration of a named physical backend. Its depolarising and damping channels are specified by

Dp(ρ)=(1−3p4)ρ+p4∑Q∈{X,Y,Z}QρQ.\mathcal{D}_p(\rho) = \left(1-\frac{3p}{4}\right)\rho+ \frac{p}{4}\sum_{Q\in\{X,Y,Z\}}Q\rho Q.
K0=(1001−γ),K1=(0γ00),K_0=\begin{pmatrix}1&0\\0&\sqrt{1-\gamma}\end{pmatrix},\qquad K_1=\begin{pmatrix}0&\sqrt{\gamma}\\0&0\end{pmatrix},
Aγ(ρ)=∑r=01KrρKr†.\mathcal{A}_\gamma(\rho)=\sum_{r=0}^{1}K_r\rho K_r^\dagger.

For each gate, the realised channel first applies its ideal unitary and then the applicable Aγ∘Dp\mathcal{A}_\gamma\circ\mathcal{D}_p on its targets. Prefixes are built by composing these operations in source order. The configurations are identical through H(q0)H(q_0) and T(q2)T(q_2) as isolated gates; the controlled change is the noise rate attached to each CXCX.

The diagnostic interface. Each prefix starts afresh from ρ0=∣000⟩⟨000∣\rho_0 = \lvert000\rangle\langle000\rvert. Let Odiag\mathcal{O}_{\mathrm{diag}} contain every non-identity three-qubit Pauli string of weight at most two, and use the same diagnostic interface X={ρ0}×Odiag\mathcal{X} = \{\rho_0\}\times\mathcal{O}_{\mathrm{diag}} at every prefix. There are (31)3=9\binom{3}{1}3 = 9 weight-one strings and (32)32=27\binom{3}{2}3^2 = 27 weight-two strings, hence ∣X∣=36\lvert\mathcal{X}\rvert= 36. Examples include XIIXII, ZZIZZI, and IYZIYZ; XXXXXX is not in this diagnostic suite because its weight is three. Keeping the suite fixed makes the four distances comparable. It is broader in number of checks than the finished program’s three-check test interface, {ZZI,IZZ,XXX}\{ZZI, IZZ, XXX\}, used elsewhere in the notebook, but it does not contain that interface.

For O∈OdiagO\in\mathcal{O}_{\mathrm{diag}}, the exact fingerprint entry is the deviation from the ideal prefix,

Fb,j(O)=tr⁡[OΛb,j(ρ0)]−tr⁡[OUjρ0Uj†].F_{b,j}(O)=\operatorname{tr}\left[O\Lambda_{b,j}(\rho_0)\right]-\operatorname{tr}\left[OU_j\rho_0U_j^\dagger\right].

The comparison is the uniform distance

dj=∥FA,j−FD,j∥∞=max⁡O∈Odiag∣tr⁡[OΛA,j(ρ0)]−tr⁡[OΛD,j(ρ0)]∣.(7)d_j=\left\|F_{A,j}-F_{D,j}\right\|_\infty=\max_{O\in\mathcal{O}_{\mathrm{diag}}}\left|\operatorname{tr}\left[O\Lambda_{A,j}(\rho_0)\right]-\operatorname{tr}\left[O\Lambda_{D,j}(\rho_0)\right]\right|. \tag*{(7)}

The common ideal term cancels in the second expression. Thus djd_j is an exact maximum discrepancy for the selected observations, not a probability that gate jj has failed and not a distance between full channels.

Reading the prefix trace. The notebook evaluates eq. (7) on all four truncated programs:

PrefixLast gatedjd_j
P1P_1H(q0)H(q_0)0.0000
P2P_2CX(q0,q1)CX(q_0,q_1)0.0729
P3P_3T(q2)T(q_2)0.0729
P4P_4CX(q1,q2)CX(q_1,q_2)0.1007

Table 5.

Here τ\tau is a developer-specified acceptable change in an expectation value. It is not the estimator error ε\varepsilon of definition 12. The first crossing is P2P_2: the two configurations agree on the diagnostic suite after HH, and differ beyond τ\tau after the first CXCX. The controlled model explains this particular result: DD increases only the error rate used after two-qubit gates. The unchanged rounded maximum at P3P_3 does not establish that TT has no effect on every coordinate. Likewise, the rise at P4P_4 does not by itself attribute a separate fault to the second CXCX.

The notebook’s final-output test instead reads ZZIZZI, IZZIZZ, and XXXXXX, and reports distance 0.1231 on P4P_4. This need not equal the diagnostic value 0.1007: XXXXXX is visible to the test but absent from the weight-at-most-two diagnostic suite. The difference illustrates both the usefulness and the limits of an interface. Neither number is a distribution-free measure of overall program equivalence.

What “first” means operationally. The notebook truncates the parsed gate sequence and composes the corresponding ideal and noisy matrices for each PjP_j. It does not interrupt one execution at successive gates, and it does not exercise an optimising compiler. On a device, each prefix would need to be prepared and run as a separate circuit; an optimising compiler might then fuse or reorder gates differently from the full program. A deployed analysis would need to specify how source checkpoints align with the realised operations before treating P2P_2 as a location in compiled code. In any setting, an earlier difference invisible to X1X_1 could first become visible in X2X_2. “First divergence” therefore means the first observed threshold crossing, not a general causal fault-localisation result. A linear scan finds that crossing in this example; bisection would require a monotonicity property that these distances do not generally have.

The immediate developer action is to inspect the first CXCX implementation and the state it receives, then evaluate a candidate change. For example, CXCX is ideally equivalent to HH on the target, followed by CZCZ, followed by another HH on the target. Whether that replacement improves the noisy realisation must be measured; the example does not establish that it does.

If the profiles are measured instead. The trace above is analytic. For finite-shot fingerprints F^b,j\widehat{F}_{b,j}, let εs\varepsilon_s bound the uniform error of each profile at failure probability at most δ/8\delta/8. There are two configurations at four checkpoints, so a union bound gives, simultaneously for every jj, with probability at least 1−δ1-\delta,

∣d^j−dj∣≤2εs,d^j=∥F^A,j−F^D,j∥∞.\left|\widehat{d}_j-d_j\right| \le2\varepsilon_s,\qquad\widehat{d}_j=\left\|\widehat{F}_{A,j}-\widehat{F}_{D,j}\right\|_\infty.

A confidence-aware claim that P2P_2 is the first crossing of τ\tau would require d^1+2εs≤τ\widehat{d}_1+2\varepsilon_s\le\tau and d^2−2εs>τ\widehat{d}_2-2\varepsilon_s>\tau; otherwise the result is undecided at that confidence. The notebook supplies no such finite-shot experiment, so its four values should not be read as certified detections. With TT measurement rounds for each profile, a direct four-prefix comparison would require eight graphic acquisitions (and thus 8T8T circuit executions under that allocation); caching the baseline would leave four new acquisitions for DD. Compilation, preparation, readout, and any calibration overhead are additional costs. The channel-level evaluation in the paper does not measure this complete debugging workflow.

See worked_example_Part_4_noise_aware_diff_testing.ipynb in the anonymised artefact for details and instructions on running this part. This is the only example with a fixed program.

Quantum Computing Background

For a detailed background, see [39]. A (pure) quantum state is represented by a ket ∣ψ⟩\lvert\psi\rangle in a complex Hilbert space. For a single qubit, the fundamental unit of quantum information, in the computational basis {∣0⟩,∣1⟩}\{\lvert0\rangle, \lvert1\rangle\}, the general state is a superposition of the basis states:

∣ψ⟩=α∣0⟩+β∣1⟩,(8)\lvert\psi\rangle= \alpha\lvert0\rangle+ \beta\lvert1\rangle, \tag*{(8)}

where α\alpha and β\beta are complex numbers called amplitude coefficients, encoding both the likelihood of observing each state and the phase of the quantum system (e.g. ∣+⟩=(∣0⟩+∣1⟩)/2\lvert+\rangle= (\lvert0\rangle+\lvert1\rangle)/\sqrt{2} and ∣+i⟩=(∣0⟩+i∣1⟩)/2\lvert+i\rangle= (\lvert0\rangle+i\lvert1\rangle)/\sqrt{2}). The product state of an nn qubit system can be described by ∣ψ⟩=∣ψ1⟩⊗∣ψ2⟩⊗⋯⊗∣ψn⟩\lvert\psi\rangle= \lvert\psi_1\rangle\otimes\lvert\psi_2\rangle\otimes\cdots\otimes\lvert\psi_n\rangle, where ⊗\otimes denotes the tensor product and each ψi\psi_i (1≤i≤n1 \leq i \leq n) is a single qubit state (eq. (8)). The associated Hilbert space is 2n2^n-dimensional, which grows exponentially with nn, and contains the quantum states and quantum-channel representations.

Entanglement occurs when two or more qubits are correlated thus, the state of one qubit cannot be described independently of the others. An entangled system is described by a single joint quantum state that is non-separable. It can neither be factored into a simple tensor product (with ⊗\otimes) of individual qubit states, nor as a probabilistic mixture of such product states. This is essential for capturing the non-classical correlations between the qubits. E.g. the Bell states [39], a set of four maximally entangled two-qubit states,

∣Φ±⟩=12(∣00⟩±∣11⟩),∣Ψ±⟩=12(∣01⟩±∣10⟩),(9)\lvert\Phi^{\pm}\rangle= \frac{1}{\sqrt{2}}(\lvert00\rangle\pm\lvert11\rangle), \qquad\lvert\Psi^{\pm}\rangle= \frac{1}{\sqrt{2}}(\lvert01\rangle\pm\lvert10\rangle), \tag*{(9)}

have been used as part of the reference set in constructing our instantiation of a fingerprint abstraction (§ 4). The most general quantum state of an nn-qubit system is described by a density matrix ρ∈C2n×2n\rho\in\mathbb{C}^{2^n \times2^n}, representing either a pure state with ρ=∣ψ⟩⟨ψ∣\rho= \lvert\psi\rangle\langle\psi\rvert, or a mixed state with ρ=∑ipi∣ψi⟩⟨ψi∣\rho= \sum_i p_i\lvert\psi_i\rangle\langle\psi_i\rvert, scaling exponentially with nn.

Quantum operators

Quantum operators. Quantum operators, or gates, e.g. NOT or rotation gates, are linear transformations acting on a qubit or several qubits, and are represented by unitary matrices. By definition, they are reversible operations such that each matrix has an inverse that undoes its action. A matrix UU is unitary if: UU†=U†U=IUU^\dagger= U^\dagger U = I, where U†U^\dagger is the Hermitian conjugate (or adjoint) of UU, and II is the identity matrix. The Hermitian conjugate of a matrix, A={aij}A = \{a_{ij}\}, is obtained by taking the transpose and complex conjugate of each entry: A†={aji∗}A^\dagger= \{a_{ji}^*\}. A matrix AA is Hermitian if it satisfies: A=A†A = A^\dagger, meaning it is equal to the transpose of its own complex conjugate and hence is symmetric. A measurable outcome, or an observable OO, is represented by a Hermitian matrix whose eigenvalues are the possible outcomes of the measurement. The expected result of measuring OO on a system ∣ψ⟩\lvert\psi\rangle is ⟨ψ∣O∣ψ⟩\langle\psi\lvert O\lvert\psi\rangle. Our instantiation of a fingerprint abstraction (§ 4) uses two-qubit Pauli matrices2 and other quantum operators as part of the reference set.

Execution of Quantum Programs in Practice

"Shots" in Quantum Experiments. In quantum computing, a single circuit execution yields only one measurement outcome. Estimating a probability distribution, therefore, requires many repeated circuit executions, or shots, with the standard error scaling as 1/N1/\sqrt{N} for NN independent shots. Further, an entire experiment of many shots may itself be repeated multiple times (repeats) to increase total sample size, reduce statistical error and enable checking for variability across runs. We utilise both concepts in our work. Shots are directly

Rx(θ)=[cos⁡(θ/2)−isin⁡(θ/2)−isin⁡(θ/2)cos⁡(θ/2)]Ry(θ)=[cos⁡(θ/2)−sin⁡(θ/2)sin⁡(θ/2)cos⁡(θ/2)]Rz(θ)=[e−iθ200eiθ2]R_x(\theta) = \begin{bmatrix} \cos(\theta/2) & -i\sin(\theta/2) \\ -i\sin(\theta/2) & \cos(\theta/2) \end{bmatrix} \qquad R_y(\theta) = \begin{bmatrix} \cos(\theta/2) & -\sin(\theta/2) \\ \sin(\theta/2) & \cos(\theta/2) \end{bmatrix} \qquad R_z(\theta) = \begin{bmatrix} e^{-i\frac{\theta}{2}} & 0 \\ 0 & e^{i\frac{\theta}{2}} \end{bmatrix}

associated with our instantiation of a fingerprint abstraction and methodology, while repeats are part of the evaluation methodology.

We model noise using quantum channels, which are Completely Positive, Trace-Preserving (CPTP) maps acting on density matrices. A quantum channel can be viewed as the mathematical description of the physical process through which a quantum system is transferred from a sender to a receiver. Interactions between the quantum system and its surrounding environment that alter the transmitted state are modelled in a noisy channel. The channel is considered noiseless when the quantum state remains undisturbed during transmission. A channel Λ\Lambda acting on kk qubits can be expressed in the following form, known as the Kraus form:

Λ(ρ)=∑ℓKℓρKℓ†with∑ℓKℓ†Kℓ=I.(10)\Lambda(\rho) = \sum_{\ell} K_{\ell}\rho K_{\ell}^{\dagger} \quad\text{with} \quad\sum_{\ell} K_{\ell}^{\dagger}K_{\ell} = I. \tag*{(10)}

This representation guarantees that the evolution of density matrices remains physically valid, even when extended to larger composite systems. We use the Kraus form in §5.1 and §5.2.

Among the most commonly used noise channels are the depolarising, amplitude damping, and phase damping channels. Depolarising noise models random errors that can drive the quantum state towards the maximally mixed state by contracting the Bloch vector. Amplitude damping captures energy dissipation phenomena, such as relaxation from the excited state ∣1⟩|1\rangle to the ground state ∣0⟩|0\rangle, while phase damping models the loss of quantum coherence without altering measurement probabilities in the computational basis. These channels provide mathematical abstractions of physical noise processes and are essential for developing, testing, and evaluating quantum programs under realistic noisy conditions. We utilise these channels in §5.1, §5.2 and §6.

A.2.3 Classical Shadows in a Nutshell. Quantum computations are affected by noise from imperfect control, decoherence, and measurement errors [39]. Noise is studied on quantum hardware, where device-specific effects can be time-dependent, correlated, and non-Markovian, or in simulation, where errors are modelled via abstract quantum channels (e.g. depolarising or amplitude-damping [18]) but may fail to reproduce accurately the statistical behaviour observed on devices. Error correction is a set of methods used to address the loss of quantum information due to noise and decoherence, enabling errors to be detected and corrected such that no information about the encoded logical state is revealed.

Error mitigation reduces noise impact without the full overhead of fault-tolerant quantum error-correction, typically via classical post-processing or circuit-level transformations [14, 45]. Classical shadows [19] are a common complemented randomised-measurement technique, within the broader family of shadow tomography [1, 2] that estimate many observable expectation values without reconstructing the full quantum state.

Classical shadows are a specific efficient instantiation generated by applying randomly chosen unitaries, UtU_t, to an unknown quantum state, ρ\rho, measured in the computational basis, and then post-processing the outcomes into snapshot operators, ρ^t\hat{\rho}_t, such that E[ρ^t]=ρ\mathbb{E}[\hat{\rho}_t] = \rho. The resulting multiset, ρ^t\hat{\rho}_t, allows unbiased simultaneous estimation of expectation values, say, Tr⁡(Oρ)\operatorname{Tr}(O\rho) for each observable OO in state ρ\rho for observables OO as ⟨O^⟩=1T∑t=1TTr⁡(Oρ^t)\langle\hat{O}\rangle= \frac{1}{T}\sum_{t=1}^{T}\operatorname{Tr}(O\hat{\rho}_t).

Randomising measurement bases ensures that each measurement outcome contains information about multiple observables. Importantly, if observables have a bounded shadow norm, the number of measurements scales logarithmically rather than linearly with the number of observables. This approach has been utilised in physical applications, e.g. characterising laboratory-prepared states. The construction of our instantiation of fingerprint abstraction, CHANSHADOW, as detailed in §4, is inspired by the classical-shadow framework of Huang et al. [19]. However, we do not materialise full snapshots. ChanShadow, instead, maps measurement outcomes directly to deviation signatures tailored to QSE. Specifically, we restrict the measurement ensemble to a fixed, finite set of observables relevant for quantum-software workloads: per reference state ρi\rho_i and observable OjO_j, we collect an empirical estimator ⟨Oj⟩i\langle O_j\rangle_i and standard error σij\sigma_{ij}.

Probability Preliminaries

This section recalls the notions used in definitions 9 and 12, proposition 2, and theorem 3 and in the evaluation of RQ1.

Measurable sets and distributions. A σ\sigma-algebra on a set YY is a family of subsets of YY that contains YY and is closed under complement and countable union; its members are the events. On a subset of a finite-dimensional normed vector space we use the Borel σ\sigma-algebra, generated by the open sets. A probability distribution on YY is a function PP from events to [0,1][0,1] with P(Y)=1P(Y)=1 that is additive over countable unions of disjoint events. It need not have finite support: a distribution over channels may spread over a continuum. The point mass [y][y] assigns 1 to every event that contains yy and 0 to the others.

Expectation. If YY is a subset of a finite-dimensional real vector space and PP has a finite first moment, its expectation is E[P]=∫Yy dP(y)\mathbb{E}[P]=\int_Y y\,dP(y), computed coordinate by coordinate; for a point mass, E[[y]]=y\mathbb{E}[[y]]=y, and for P=∑iwi[yi]P=\sum_i w_i[y_i], E[P]=∑iwiyi\mathbb{E}[P]=\sum_i w_i y_i. If YY is closed and convex, E[P]\mathbb{E}[P] lies in YY, because it lies in the closed convex hull of the support of PP. The channels on nn qubits form a compact convex set, so every distribution over channels has an expectation, and that expectation is again a channel; this is the expected concretisation γ‾P\overline{\gamma}_P of definition 9.

Random fingerprints, laws and quantiles. A measured fingerprint is a random variable F^\widehat{F} with values in RX\mathbb{R}^{X}; its law is the distribution P(B)=Pr⁡[F^∈B]P(B)=\Pr[\widehat{F}\in B], which is αT(Λ)\alpha_T(\Lambda) in definition 12. For a real random variable DD, such as the error DΛ=∥α(Λ)−F^∥∞D_\Lambda=\lVert\alpha(\Lambda)-\widehat{F}\rVert_\infty, the function t↦Pr⁡[D≤t]t\mapsto\Pr[D\le t] is nondecreasing and right-continuous, and the (1−δ)(1-\delta)-quantile of DD is q1−δ=inf⁡{t:Pr⁡[D≤t]≥1−δ}q_{1-\delta}=\inf\{t:\Pr[D\le t]\ge1-\delta\}. By right-continuity, Pr⁡[D≤t]≥1−δ\Pr[D\le t]\ge1-\delta holds exactly when t≥q1−δt\ge q_{1-\delta}, which is proposition 2(2).

Repeated sessions and empirical coverage. Independent repetitions of a measurement session give independent random fingerprints with a common law. Over SS sessions, the number of sessions with D≤εD\le\varepsilon is binomially distributed with parameter c=Pr⁡[D≤ε]c=\Pr[D\le\varepsilon]; its relative frequency estimates the coverage cc, and the Clopper–Pearson bound is an exact one-sided lower confidence bound for cc. The empirical (1−δ)(1-\delta)-quantile of SS sessions is the ⌈(1−δ)S⌉\lceil(1-\delta)S\rceil-th smallest observed error.

Concentration. The union bound, Pr⁡[⋃iAi]≤∑iPr⁡[Ai]\Pr[\bigcup_i A_i]\le\sum_i\Pr[A_i], turns guarantees for single entries into a guarantee for the whole fingerprint. Hoeffding’s inequality states that the mean Y‾\overline{Y} of TT independent random variables with values in [a,b][a,b] satisfies Pr⁡[∣Y‾−EY∣≥ε]≤2exp⁡(−2Tε2/(b−a)2)\Pr[|\overline{Y}-\mathbb{E}Y|\ge\varepsilon]\le2\exp(-2T\varepsilon^2/(b-a)^2). Chebyshev’s inequality states that Pr⁡[∣Y−EY∣≥ε]≤Var⁡(Y)/ε2\Pr[|Y-\mathbb{E}Y|\ge\varepsilon]\le\operatorname{Var}(Y)/\varepsilon^2. The median-of-means estimator combines the two: each batch mean is ε\varepsilon-accurate with probability at least 33/3433/34 once a batch has 34T/ε234T/\varepsilon^2 rounds, and a Chernoff bound on the number of inaccurate batches shows that K=⌈2ln⁡(2M/δ)⌉K=\lceil2\ln(2M/\delta)\rceil batches make all MM estimates ε\varepsilon-accurate with probability at least 1−δ1-\delta [19].

Optional Channel Reconstruction

A fingerprint constrains the underlying channel only through the ∣X∣|X| linear functionals

Tr⁡(OjΛ(ρi))=Tr⁡[(ρiT⊗Oj)JΛ],\operatorname{Tr}(O_j\Lambda(\rho_i))=\operatorname{Tr}\left[(\rho_i^{\mathsf{T}}\otimes O_j)J_\Lambda\right],

where JΛJ_\Lambda is the Choi matrix in the input-first convention. When a concrete channel representative is required, we define the partial concretisation γshadow\gamma_{\mathrm{shadow}} by the physically constrained least-squares problem

γshadow(F^)=arg⁡min⁡J⪰0, Tr⁡out(J)=I∑(ρi,Oj)∈X(Tr⁡[(ρi⊗Oj)J]−(F^ij+μijideal))2(11)\gamma_{\mathrm{shadow}}(\widehat{F})=\underset{\substack{J\succeq0,\ \operatorname{Tr}_{\mathrm{out}}(J)=I}}{\arg\min}\sum_{(\rho_i,O_j)\in X}\left(\operatorname{Tr}\left[(\rho_i\otimes O_j)J\right]-\left(\widehat{F}_{ij}+\mu_{ij}^{\mathrm{ideal}}\right)\right)^2 \tag*{(11)}

which is a semidefinite program. The constraints J⪰0J\succeq0 and Tr⁡out(J)=I\operatorname{Tr}_{\mathrm{out}}(J)=I enforce complete positivity and trace preservation, respectively. When XX is informationally complete for the channel family of interest, the optimisation recovers Λ\Lambda exactly from the noiseless fingerprint. Otherwise, it returns a least-squares CPTP map consistent with the observed deviations. Unlike the parametric reconstruction used in the proof of concept, this formulation is non-parametric and applies to arbitrary CPTP channels.

Corollary 4 (Precision of γshadow\gamma_{\mathrm{shadow}}). For every F^\widehat{F} and every Λ^∈γshadow(F^)\widehat{\Lambda}\in\gamma_{\mathrm{shadow}}(\widehat{F}),

∥αX(Λ^)−αX(Λ)∥2≤∥F^−αX(Λ)∥2.\left\|\alpha_X(\widehat{\Lambda})-\alpha_X(\Lambda)\right\|_2\leq\left\|\widehat{F}-\alpha_X(\Lambda)\right\|_2.

Hence, on the event of theorem 3,

∥αX(Λ^)−αX(Λ)∥∞≤∣X∣ ε.\left\|\alpha_X(\widehat{\Lambda})-\alpha_X(\Lambda)\right\|_\infty\leq\sqrt{|X|}\,\varepsilon.

Proof. The objective in eq. (11) is ∥αX(J)−F^∥22\left\|\alpha_X(J)-\widehat{F}\right\|_2^2. Since αX(C)\alpha_X(\mathcal{C}) is convex and compact, αX(Λ^)\alpha_X(\widehat{\Lambda}) is the Euclidean projection of F^\widehat{F} onto αX(C)\alpha_X(\mathcal{C}). Projection onto a closed convex set is non-expansive towards every point in the set, including αX(Λ)\alpha_X(\Lambda). □

Thus, γshadow\gamma_{\mathrm{shadow}} selects a canonical CPTP representative among channels consistent with the measured fingerprint. This reconstruction is optional: fingerprint comparison itself operates directly on the ∣X∣|X| entries and does not require a Choi matrix. The SDP acts on a 4n×4n4^n\times4^n matrix and therefore has exponential size in nn.

Supplementary Validation of Theoretical Bounds

The main evaluation reports each result with its corresponding research question. The following figure (Figure 5) gathers additional checks of the analytic bounds and estimator behaviour in one place.

Six supplementary experimental checks of the theoretical bounds

Figure 5. Supplementary experimental checks of the theoretical bounds. Shaded regions are excluded by the corresponding bounds.

Soundness and variance. Exact channel pairs at n≤8n\leq8 lie on or below the Lipschitz bound L=1L=1, attained by amplitude- and phase-damping pairs; depolarising pairs attain exactly 2/32/3. The soundness check includes three hardware-informed IBM-Boston single-qubit noise profiles (depolarising, amplitude damping, and phase damping applied to one qubit) and two homogeneous nn-qubit product-noise profiles (depolarising and phase damping applied to every qubit). The measured single-round variance equals the shadow norm 3w−⟨O⟩23^w-\langle O\rangle^2 to within a maximum deviation of 2% over 20 cases: the states ∣+⟩|+\rangle, ∣0⟩|0\rangle, and ∣+i⟩|+i\rangle under depolarising noise (p=0.1p=0.1) and amplitude damping (γ=0.2\gamma=0.2), measured with X, Y, and Z, and the Bell state ∣Φ+⟩|\Phi^+\rangle under two-qubit depolarising noise (p=0.1p=0.1), measured with XX and ZZ.

Sample complexity and estimator convergence. Rounds required to reach ε\varepsilon with confidence 0.95 are measured against ∣X∣|X| up to n=8n=8. Shot budgets are searched on a multiplicative grid with factor 1.25, and scaling exponents are estimated by least-squares regression over all measured points under homogeneous depolarising noise (p=0.10p=0.10). The measured points lie far inside the linear-baseline region and near the logarithmic reference. Separately, six independent seeds track the predicted T−1/2T^{-1/2} convergence line with fitted slope −0.500±0.006-0.500\pm0.006.

Detectability and drift boundaries. The detectability threshold follows the ∣F∣−2|F|^{-2} variance bound; extrapolating the measured hardware-rate results to a single layer gives approximately 7×1087\times10^8 rounds for the IBM-Boston profile. The warm-start benefit depends on the fingerprint displacement: when ∥ΔF∥∞\lVert\Delta\mathbf{F} \rVert_{\infty} is small relative to the target accuracy ε\varepsilon, previous snapshots remain informative and reduce the fresh-measurement requirement. As drift grows, the bias from stale snapshots eventually dominates and the update no longer helps. The detailed hardware-rate and drift-limit experiments are reported in §A.7.4.

Scaling the Evaluation

We extend the empirical evaluation beyond the n≤2n \le2 limit imposed by exact diamond-norm SDPs in § 5.

Figure 6 contrasts the exponential growth of the full channel representation with the polynomial fingerprint-size references, and compares the predicted per-state sample-cost trend with measured shadow-sample counts.

Representation and measurement scaling

Figure 6. Representation and measurement scaling. Theoretical growth references for the full channel dimension (16n16^n), fingerprint size (O(n)O(n) and O(n2)O(n^2)), and per-state shadow-sample cost (O(log⁡n)O(\log n)), with measured shadow-sample counts for n=1n = 1–77.

Next, we describe the methodological extensions that enable scalable evaluation, and then report the corresponding evaluation results.

Scaled Ground Truths and the Product Sampler

Exact diamond norms via SDP are limited to n≤2n \le2. We extend the exact evaluation to larger channels with two ground truths, each validated against the SDP by the machine-checked test suite before any experiment may use it: (i) for channels identical on all but one site, multiplicativity of the completely bounded trace norm gives

∥Γ⊗(Λ1−Λ2)∥⋄=∥Λ1−Λ2∥⋄\lVert\Gamma\otimes(\Lambda_1-\Lambda_2) \rVert_{\diamond}=\lVert\Lambda_1-\Lambda_2 \rVert_{\diamond}

reducing the nn-qubit distance to a single-qubit SDP at any nn; and (ii) for Pauli channels, the diamond distance equals the ℓ1\ell_1 distance of the Pauli probability vectors, exact for depolarising and dephasing products up to n=6n=6 here. On the estimation side, a product-factorised implementation of the literal sampler draws each qubit’s measurement outcome from its own rotated marginal—exactly the distribution of algorithm 1 on product instances, verified against the full sampler including YY bases—at O(nT)O(nT) cost, enabling the genuine estimator at n=8n=8.

The scaled runs use product reference states and weight-≤2\le2 observables; entangled probes are retained in the n≤2n \le2 suites.

Scaling the Evaluation: Exact Ground Truths at n≤8n \le8

Diamond-norm SDPs limit exact evaluation to n≤2n \le2; we lift this with two exact ground truths, each machine-validated against the SDP before use (§A.6.1), and a product-factorised literal sampler, and re-measure the research questions at scale (Figure 7).

Scaling the evaluation with exact ground truths

Figure 7. Scaling the evaluation with exact ground truths. (a) Soundness at n≤8n \le8: the bound L=1L = 1 is attained at every size by single-site damping pairs; global Pauli families fall below 2/3 as nn grows. (b) Literal-sampler rounds to ε=0.15\varepsilon= 0.15 versus ∣X∣|X| up to n=8n = 8 (38× range), pooled β=0.28\beta= 0.28.

Soundness (RQ1) at $n \le 8. Over 14 exact channel pairs per size—single-site amplitude-damping, phase-damping, and depolarising perturbations of an IBM-tier product channel (ground truth by cb-norm multiplicativity) and global depolarising/dephasing Pauli products (ground truth by the Pauli ℓ1\ell_1 formula)—the Lipschitz bound is attained at every size: L=1.000L = 1.000 at n=2,4,6n = 2, 4, 6, realised by the single-site amplitude- and phase-damping pairs, with depolarising fixed at exactly $2/3$. The correlation degrades gracefully (ρ=0.92→0.83\rho= 0.92 \to0.83), and the degradation has a clean cause: global Pauli families lose tightness with nn (worst ratio 0.290.29 at n=6n = 6) because their diamond worst case requires entangled inputs across many qubits, which product probes do not supply. Soundness at scale is therefore tight exactly where the noise is local—the regime the interface is designed for—and conservative for globally correlated noise.

Conciseness (RQ2) as per-qubit identifiability. At n=4n = 4 and 66, regressing each qubit’s amplitude-damping rate from the exact fingerprint achieves R2=1.000R^2 = 1.000 for every qubit, while regressions restricted to entries not involving that qubit have R2<0R^2 < 0: the fingerprint’s information is not merely retained but localised to the correct qubit, which is what fault attribution requires.

Efficiency (RQ3) to n=8n = 8. With the literal product sampler, the rounds to uniform error ε=0.15\varepsilon= 0.15 at confidence 0.950.95 grow from 3,153 to 8,290 while the interface grows 38× (from ∣X∣=8|X| = 8 to 304): a pooled exponent β=0.28\beta= 0.28 across sizes and seeds, and β≈0.08\beta\approx0.08–0.250.25 within each size—far below the linear baseline over a range 5.7× wider than the n≤2n \le2 measurement, materially strengthening definition [12] evidence.

Adaptiveness (RQ4) via structured concretisation. The general SDP concretisation is intractable beyond n=2n = 2 (4n4^n Choi growth), so at n=4n = 4 we evaluate a structured product concretisation: per-qubit rates fitted from the estimated fingerprint, with per-qubit reconstruction errors computed by exact single-qubit diamond norms and the total reported as the telescoping upper bound ∑q∥Λ^q−Λq∥⋄\sum_q\|\hat{\Lambda}_q-\Lambda_q\|_\diamond. The bound falls from 0.72 to 0.17 as the budget grows 400 →\to 6,400 rounds—a bound, not an equality, and labelled as such.

Realistic Noise Framework and Stress Protocol: Probing the Limits

The main evaluation uses canonical Kraus noise channels. We add a configurable per-qubit noise framework and four stress tests that probe where the concrete domain fails. Hence, this section extends the evaluation towards hardware-inspired settings to characterise the conditions under which the abstraction remains applicable.

Framework and Calibration

Channels are assembled from per-qubit configurations—lists of (depolarising, amplitude-damping, phase-damping) primitives at arbitrary rates—optionally composed with correlated two-qubit terms (a CZ-attributed two-qubit depolarising channel and coherent ZZZZ crosstalk e−iθZZ/2e^{-i\theta ZZ/2}) and repeated to depth kk. The ibm_boston profile (Heron r3, 156 qubits) uses the public platform calibration table (read 2026-06-10): two-qubit error median 1.19×10−31.19 \times10^{-3} (layered 2.28×10−32.28 \times10^{-3}) and readout error median 4.15×10−34.15 \times10^{-3}; per-qubit T1,T2T_1,T_2 and single-qubit gate error are Heron-class representative medians, replaceable from the platform’s downloadable calibration data. Gate-time/coherence ratios convert to per-gate amplitude-damping and dephasing rates, the residual gate infidelity to a depolarising rate, and the published per-pair spread fixes best/median/worst qubit tiers for heterogeneous configurations. The calibrated readout error is injected into the literal estimator as a per-qubit assignment flip.

Stress Tests

(L1) Detectability floor: at hardware rates, how many rounds are needed to resolve the largest fingerprint entry of a depth-kk layer to a factor-two signal-to-noise, and what bias floor does readout error impose? (L2) Non-Pauli errors: is a coherent over-rotation (outside every Pauli model) detected and recoverable by the general concretisation, and is the probe suite first-order sensitive to coherent ZZZZ crosstalk? (L3) Blindness: the probe map is a finite set of linear functionals on the 16n16^n-dimensional Choi space; we compute the dimension of its null space for increasingly rich interfaces and construct an explicit channel pair with identical fingerprints, reporting its exact diamond distance as a measured lower bound on the blindness radius. (L4) Drift validity region: we sweep the drift magnitude and locate the crossover at which pooling stale snapshots stops paying.

Heterogeneous per-Qubit Noise

To stress the protocol on realistic, spatially varying noise, we compose distinct per-qubit channels and probe entangled states. The critical case leaves one qubit noiseless and applies strong amplitude damping (γ=0.30\gamma= 0.30) to the other, then probes the Bell state ∣Φ+⟩|\Phi^{+}\rangle; a correct fingerprint must attribute the fault to the damaged qubit (a large single-qubit deviation there, none on the clean qubit) while still exposing its propagation through the correlator. We additionally test nominally asymmetric rates representative of a calibrated device.

Limits of the Concrete Domain

The following four experiments identify the practical limitations of the abstraction (L1-L4). Each measures one aspect of the operating regime where the abstraction ceases to be reliable or informative.

(L1) Detectability has a hard sample floor. Resolving the largest fingerprint entry of a depth-kk IBM-Boston layer requires T∝∣F∣−2.06T \propto|F|^{-2.06} rounds at confidence 0.95 over the measured decade (theory −2-2): 5.4×1045.4 \times10^{4} rounds at depth 100 (max⁡∣F∣=4.8×10−2\max|F| = 4.8 \times10^{-2}) and 9.0×1059.0 \times10^{5} at depth 25, but an extrapolated ∼7×108\sim7 \times10^{8} for a single layer (max⁡∣F∣=4.9×10−4\max|F| = 4.9 \times10^{-4}). Per-gate fingerprints at hardware rates are therefore impractical; the operating regime is the depth-accumulated channel, where deviations compound linearly with depth and the cost falls quadratically. The calibrated readout error (4.15×10−34.15 \times10^{-3}) additionally imposes a bias floor of order 10−210^{-2} on the uncorrected estimator: entries below the floor are invisible without readout mitigation, which is the practical resolution limit of the live protocol.

(L2) Non-Pauli errors: detected and recoverable, with one blind spot. A coherent over-rotation RX(0.1)R_X(0.1)—outside every Pauli noise model—produces the full first-order signature (max⁡∣F∣=sin⁡θ\max|F| = \sin\theta), and the general SDP concretisation reconstructs the coherent channel, with diamond error falling 0.144→0.0350.144 \to0.035 as the budget grows (the plateau is the SDP regularisation floor). Coherent ZZZZ crosstalk, however, exposes a structural blind spot: every observable in the paper suite commutes with ZZZZ to first order on the probe states, so the suite’s response is O(θ2)O(\theta^{2}) (max⁡∣ΔF∣=5.0×10−3\max|\Delta F| = 5.0 \times10^{-3} at θ=0.1\theta= 0.1), while a two-observable extension (YZYZ, ZYZY on ∣+0⟩|+0\rangle, ∣0+⟩|0+\rangle) restores the first-order signal (ΔF=sin⁡θ=0.0998\Delta F = \sin\theta= 0.0998). Interface design is thus part of the soundness contract: crosstalk-sensitive suites must include mixed-axis correlators.

(L3) Blindness is real, measurable, and repairable. The probe map of the paper’s two-qubit suite spans only 80 of the 256 Choi dimensions, leaving a 176-dimensional blind subspace; we construct an explicit CPTP pair with ∥ΔF∥∞<10−14\|\Delta F\|_{\infty} < 10^{-14} yet exact diamond distance 0.0396—a measured lower bound on the blindness radius. This is information absent from the interface, not a failure of the estimation guarantee of Definition 12. Enriching the interface shrinks the blind space monotonically: all 15 two-qubit Pauli’s leave 120 dimensions; 16 informationally complete product states with all 15 Paulis eliminate it entirely (blind dimension 0), at which point γ\gamma is exact in principle. Conciseness and observational completeness trade off along this ladder, and the fingerprint exposes the dial.

(L4) Incremental updates have a validity region. At confidence 0.95, warm-starting pays a factor 2.0× at fingerprint drift 0.025 per step and 1.4× at drift ϵ=0.10\epsilon= 0.10, crosses over near drift 0.16, and hurts beyond it (ratio 0.3× at drift 0.7): stale snapshots carry bias equal to the drift, which pooling dilutes only while it is below the statistical gain. These results empirically characterise the operating region of the incremental update procedure. They do not change Definition 14, which concerns estimator convergence under a fixed channel, nor do they establish a general guarantee that reusing stale measurements will improve accuracy. Rather, they show that the benefit of incremental updating depends on the magnitude of the fingerprint displacement and the resulting trade-off between sampling variance and bias.

Custom profile. The high-noise per-qubit profile (depolarising 5×10−35 \times10^{-3}, amplitude damping 2×10−32 \times10^{-3}, phase damping 5×10−35 \times10^{-3}) runs through the full pipeline: exact max⁡∣F∣=9.0×10−3\max|F| = 9.0 \times10^{-3} concentrated on coherence entries (dephasing-dominated, as expected), and the literal estimate at T=2×105T = 2 \times10^{5} followed by the general reconstruction recovers the channel to diamond error 5.0×10−35.0 \times10^{-3}—the framework is usable end-to-end at realistic rates given the L1 budget.

References

  1. [1]Scott Aaronson. 2018. Shadow tomography of quantum states. In Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (Los Angeles, CA, USA) (STOC 2018). ACM, New York, NY, USA, 325–338. doi:10.1145/3188745.3188802arxiv.org/abs/1711.01053
  2. [2]Scott Aaronson and Guy N. Rothblum. 2019. Gentle measurement of quantum states and differential privacy. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Phoenix, AZ, USA) (STOC 2019). ACM, New York, NY, USA, 322–333. doi:10.1145/3313276.3316378DOI
  3. [3]Robert Alicki, Michał Horodecki, Paweł Horodecki, and Ryszard Horodecki. 2002. Dynamical description of quantum computing: Generic nonlocality of quantum noise. Phys. Rev. A 65 (May 2002), 062101. Issue 6. doi:10.1103/PhysRevA.65.062101DOI
  4. [4]Giuliano Benenti and Giuliano Strini. 2010. Computing the distance between quantum channels: usefulness of the Jamiolkowski representation. Journal of Physics B: Atomic, Molecular and Optical Physics 43, 21 (oct 2010), 215508. doi:10.1088/0953-4075/43/21/215508DOI
  5. [5]Avner Bensoussan, Elena Chachkova, Karine Even-Mendoza, Sophie Fortz, Vasileios Klimis, and Mohammadreza Mousavi. 2026. Toward Live Noise Fingerprinting for Discrepancy Analysis in Quantum Software Engineering. In 19th IEEE International Conference on Software Testing, Verification and Validation (ICST). IEEE, Daejeon, Republic of Korea, 749–754. doi:10.1109/ICST69053.2026.00096DOI
  6. [6]Kish Bharti, Alba Cervera-Lierta, Thi Ha Kyaw, Tobias Haug, Summer Alperin-Lea, Abhinav Anand, Matthias Degroote, Hermanni Heimonen, Jakob S. Kottmann, Tim Menke, Wai-Keong Mok, Sukin Sim, Leong-Chuan Kwek, and Alán Aspuru-Guzik. 2022. Noisy intermediate-scale quantum (NISQ) algorithms. Rev. Mod. Phys. 94 (Feb 2022), 015004. Issue 1. doi:10.1103/RevModPhys.94.015004
  7. [7]Robin Blume-Kohout, John King Gamble, Erik Nielsen, Kenneth Rudinger, Jonathan Mizrahi, Kevin Fortier, and Peter Maunz. 2017. Demonstration of qubit operations below a rigorous fault tolerance threshold with gate set tomography. Nature Communications 8, 1 (15 Feb 2017), 14485. doi:10.1038/ncomms14485
  8. [8]Christophe Chareton, Sébastien Bardin, Dongho Lee, Benoît Valiron, Renaud Vilmart, and Zhao Wei Xu. 2022. Formal Methods for Quantum Programs: A Survey. arXiv:2109.06493 [cs.PL] https://arxiv.org/abs/2109.06493
  9. [9]Isaac L Chuang and Michael A Nielsen. 1997. Prescription for experimental determination of the dynamics of a quantum black box. Journal of Modern Optics 44, 11-12 (1997), 2455–2467. doi:10.1080/09500349708231894DOI
  10. [10]Bob Coecke and Keye Martyn. 2011. A Partial Order on Classical and Quantum States. Lecture Notes in Physics, Vol. 813. Springer Berlin Heidelberg, Berlin, Heidelberg, 593–683. doi:10.1007/978-3-642-12821-9_10DOI
  11. [11]Patrick Cousot. 2021. Principles of Abstract Interpretation. MIT Press, Cambridge, MA, USA. https://mitpress.mit.edu/9780262044905/principles-of-abstract-interpretation/
  12. [12]Patrick Cousot and Radhia Cousot. 1977. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In Proceedings of the 4th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (Los Angeles, California) (POPL ’77). Association for Computing Machinery, New York, NY, USA, 238–252. doi:10.1145/512950.512973DOI
  13. [13]Patrick Cousot and Radhia Cousot. 2012. Probabilistic Abstract Interpretation. In Programming Languages and Systems. Vol. 7211. Springer Berlin Heidelberg, Berlin, Heidelberg, 169–193. Series Title: Lecture Notes in Computer Science. doi:10.1007/978-3-642-28869-2_9DOI
  14. [14]Suguru Endo, Simon C. Benjamin, and Ying Li. 2018. Practical Quantum Error Mitigation for Near-Future Applications. Phys. Rev. X 8 (Jul 2018), 031027. Issue 3. doi:10.1103/PhysRevX.8.031027DOI
  15. [15]Yuan Feng and Sanjiang Li. 2023. Abstract interpretation, Hoare logic, and incorrectness logic for quantum programs. Information and Computation 294 (2023), 105077. doi:10.1016/j.ic.2023.105077DOI
  16. [16]Sophie Fortz, Énaut Mendiluze Usandizaga, Shaukat Ali, Paolo Arcaini, and Mohammad Reza Mousavi. 2026. Robust Mutation Analysis of Quantum Programs Under Noise. arXiv preprint arXiv:2605.13279. arXiv:2605.13279 [cs.SE] https://arxiv.org/abs/2605.13279
  17. [17]Amit Jamadagni Gangapuram, Andreas M. Läuchli, and Cornelius Hempel. 2024. Benchmarking quantum computer simulation software packages: State vector simulators. SciPost Phys. Core 7 (2024), 075. doi:10.21468/SciPostPhysCore.7.4.075DOI
  18. [18]Google Quantum AI. 2025. Representing Noise. https://quantumai.google/cirq/noise/representing_noise.
  19. [19]Hsin-Yuan Huang, Richard Kueng, and John Preskill. 2020. Predicting Many Properties of a Quantum System from Very Few Measurements. Nature Physics 16, 10 (Sept. 2020), 1050–1057. doi:10.1038/s41567-020-0932-7DOI
  20. [20]Qifan Huang, Li Zhou, Wang Fang, Mengyu Zhao, and Mingsheng Ying. 2025. Efficient formal verification of quantum error correcting programs. Proceedings of the ACM on Programming Languages 9, PLDI, Article 190 (June 2025), 26 pages. doi:10.1145/3729293DOI
  21. [21]Shih-Han Hung, Kesha Hietala, Shaopeng Zhu, Mingsheng Ying, Michael Hicks, and Xiaodi Wu. 2019. Quantitative robustness analysis of quantum programs. Proc. ACM Program. Lang. 3, POPL, Article 31 (Jan. 2019), 29 pages. doi:10.1145/3290344DOI
  22. [22]IBM Quantum. Accessed: 2026-07-03. Building noise models. https://quantum.cloud.ibm.com/docs/guides/build-noise-models.
  23. [23]Chan Gu Kang, Joonghoon Lee, and Hakjoo Oh. 2024. Statistical Testing of Quantum Programs via Fixed-Point Amplitude Amplification. Proc. ACM Program. Lang. 8, OOPSLA2, Article 276 (Oct. 2024), 25 pages. doi:10.1145/3689716DOI
  24. [24]Vasileios Klimis, Avner Bensoussan, Elena Chachkarova, Karine Even-Mendoza, Sophie Fortz, and Connor Lenihan. 2025. Shaking Up Quantum Simulators with Fuzzing and Rigour. Proc. ACM Program. Lang. 9, OOPSLA, Article 322 (13 Oct. 2025), 30 pages. doi:10.1145/3763100DOI
  25. [25]Alexander K. Kraus, Michael Beverland, Dmitry I. Pikulin, and Torsten Karzig. 2018. Modeling noise and error correction for Majorana-based quantum computing. Quantum 2 (Sept. 2018), 88. doi:10.22331/q-2018-09-03-88
  26. [26]Alexander Kraskov, Harald Stögbauer, and Peter Grassberger. 2004. Estimating mutual information. Physical Review E 69, 6 (2004), 066138. doi:10.1103/PhysRevE.69.066138DOI
  27. [27]Handy Kurniawan, Laura Rodríguez-Soriano, Daniele Cuomo, Carmen G. Almudever, and Francisco García Herrero. 2024. On the Use of Calibration Data in Error-Aware Compilation Techniques for NISQ Devices. In 2024 IEEE International Conference on Quantum Computing and Engineering (QCE), Vol. 01. IEEE, Los Alamitos, CA, USA, 338–348. doi:10.1109/QCE60285.2024.00048DOI
  28. [28]Ryan Levy, Di Luo, and Bryan K. Clark. 2024. Classical Shadows for Quantum Process Tomography on Near-Term Quantum Computers. Physical Review Research 6 (2024), 013029. doi:10.1103/PhysRevResearch.6.013029DOI
  29. [29]Marco Lewis, Sadegh Soudjani, and Paolo Zuliani. 2023. Formal Verification of Quantum Programs: Theory, Tools, and Challenges. ACM Transactions on Quantum Computing 5, 1, Article 1 (Dec. 2023), 35 pages. doi:10.1145/3624483DOI
  30. [30]Easwar Magesan, Jay M Gambetta, and Joseph Emerson. 2011. Scalable and Robust Randomized Benchmarking of Quantum Processes. Physical Review Letters 106, 18 (2011), 180504. https://doi.org/10.1103/PhysRevLett.106.180504
  31. [31]Stefano Martina, Lorenzo Buffoni, Stefano Cherubini, and Filippo Caruso. 2022. Learning the noise fingerprint of quantum devices. Quantum Machine Intelligence 4, 1 (2022), 8. doi:10.1007/s42484-022-00066-0DOI
  32. [32]Stefan Raimund Maschek, Jürgen Schwitalla, Maja Franz, and Wolfgang Mauerer. 2025. Make Some Noise! Measuring Noise Model Quality in Real-World Quantum Software. In Proceedings of the IEEE International Conference on Quantum Software (QSW). IEEE, Los Alamitos, CA, USA, 11 pages. doi:10.1109/QSW67625.2025.00010DOI
  33. [33]Giulia Meuli, Mathias Soeken, Martin Roetteler, and Thomas Häner. 2020. Enabling accuracy-aware Quantum compilers using symbolic resource estimation. Proc. ACM Program. Lang. 4, OOPSLA, Article 130 (Nov. 2020), 26 pages. doi:10.1145/3428198DOI
  34. [34]David Monniaux. 2001. Backwards Abstract Interpretation of Probabilistic Programs. In Programming Languages and Systems. Vol. 2028. Springer Berlin Heidelberg, Berlin, Heidelberg, 367–382. Series Title: Lecture Notes in Computer Science. doi:10.1007/3-540-45309-1_24DOI
  35. [35]Asmar Muqeeet, Tao Yue, Shaukat Ali, and Paolo Arcaini. 2024. Mitigating Noise in Quantum Software Testing Using Machine Learning. IEEE Transactions on Software Engineering 50, 11 (2024), 2947–2961. doi:10.1109/TSE.2024.3462974DOI
  36. [36]Prakash Murali, Jonathan M. Baker, Ali Javadi-Abhari, Frederic T. Chong, and Margaret Martonosi. 2019. Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers. In Proceedings of the Twenty-Fourth International Conference on Architectural Support for Programming Languages and Operating Systems (Providence, RI, USA) (ASPLOS ’19). ACM, New York, NY, USA, 1015–1029. doi:10.1145/3297858.3304075DOI
  37. [37]Juan Manuel Murillo, Jose Garcia-Alonso, Enrique Moguel, Johann Karsten Franyk, Shaukat Ali, Tao Yue, Paolo Arcaini, Ricardo Pérez-Castillo, Ignacio García-Rodríguez de Guzmán, Mario Piattini, Antonio Ruiz-Cortés, Antonio Brogi, Jianjun Zhao, Andriy Miranskyy, and Manuel Wimmer. 2025. Quantum Software Engineering: Roadmap and Challenges Ahead. ACM Trans. Softw. Eng. Methodol. 34, 5, Article 154 (May 2025), 48 pages. doi:10.1145/3712002
  38. [38]Stefanie Muroya, Krishnendu Chatterjee, and Thomas A. Henzinger. 2026. Noise-aware Verification and Synthesis of Quantum Programs. arXiv:2608.05807 [cs.PL]. https://arxiv.org/abs/2608.05807
  39. [39]Michael A. Nielsen and Isaac L. Chuang. 2010. Quantum Computation and Quantum Information (10th Anniversary edition). Cambridge University Press, UK. doi:10.1017/CBO9780511976667
  40. [40]Zhonghao Pan, Yang Feng, Zhiyuan Li, Yunxin Liu, and Yuanchun Li. 2023. Understanding the Impact of Quantum Noise on Quantum Programs. In 2023 IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER) (Taipa, Macao). IEEE, Los Alamitos, CA, USA, 426–437. doi:10.1109/SANER56733.2023.00047DOI
  41. [41]Simon Perdrix. 2008. Quantum Entanglement Analysis Based on Abstract Interpretation. In Static Analysis. Springer Berlin Heidelberg, Berlin, Heidelberg, 270–282. doi:10.1007/978-3-540-69166-2_18DOI
  42. [42]Gabriel Pontolillo, Asmar Muqeet, Shaukat Ali, and Mohammad Reza Mousavi. 2025. From Ideal to Noisy: Adapting Property-Based Testing for Real-World Noisy Quantum Computers. In 2025 IEEE International Conference on Quantum Computing and Engineering (QCE). IEEE, Albuquerque, NM, USA, 405–416. doi:10.1109/QCE65121.2025.00053DOI
  43. [43]Gabriel Joseph Pontolillo and Mohammad Reza Mousavi. 2024. Delta Debugging for Property-Based Regression Testing of Quantum Programs. In Proceedings of the 5th ACM/IEEE International Workshop on Quantum Software Engineering (Q-SE). ACM, New York, NY, USA, 1–8. doi:10.1145/3643667.3648219DOI
  44. [44]Nils Quetschlich, Lukas Burgholzer, and Robert Wille. 2023. MQT Bench: Benchmarking Software and Design Automation Tools for Quantum Computing. Quantum 7 (2023), 1062. MQT Bench is available at https://www.cda.cit.tum.de/mqtbench/. doi:10.22331/q-2023-07-20-1062DOI
  45. [45]Kristan Temme, Sergey Bravyi, and Jay M. Gambetta. 2017. Error Mitigation for Short-Depth Quantum Circuits. Phys. Rev. Lett. 119 (Nov 2017), 180509. Issue 18. doi:10.1103/PhysRevLett.119.180509DOI
  46. [46]Xinyi Wang, Shaukat Ali, and Davide Taibi. 2025. The Landscape of Quantum Software Testing Tools. IEEE Software 42, 5 (2025), 136–140. doi:10.1109/MS.2025.3578154DOI
  47. [47]John Watrous. 2013. Simpler semidefinite programs for completely bounded norms. Chicago Journal of Theoretical Computer Science 2013, 8 (2013), 1–19. doi:10.4086/cjtcS.2013.008DOI
  48. [48]John Watrous. 2018. The theory of quantum information. Cambridge university press, UK. doi:10.1017/9781316848142DOI
  49. [49]Jiaming Ye, Xiongfei Wu, Shangzhou Xia, Fuyuan Zhang, and Jianjun Zhao. 2025. Is Measurement Enough? Rethinking Output Validation in Quantum Program Testing. In 2025 40th IEEE/ACM International Conference on Automated Software Engineering (ASE). IEEE, Seoul, Korea, Republic of, 3824–3828. doi:10.1109/ASE63991.2025.00324DOI
  50. [50]Nengkun Yu and Jens Palsberg. 2021. Quantum abstract interpretation. In Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (Virtual, Canada) (PLDI 2021). Association for Computing Machinery, New York, NY, USA, 542–558. doi:10.1145/3453483.3454061
  51. [51]Jake Zappin, Trevor Stalnaker, Oscar Chaparro, and Denys Poshyvanyk. 2025. When Quantum Meets Classical: Characterizing Hybrid Quantum-Classical Issues Discussed in Developer Forums. In 2025 IEEE/ACM 47th International Conference on Software Engineering (ICSE). IEEE Press, Ottawa, Ontario, Canada, 2931–2943. doi:10.1109/ICSE55347.2025.00137DOI
  52. [52]Jake Zappin, Trevor Stalnaker, Oscar Chaparro, and Denys Poshyvanyk. 2026. Challenges and Practices in Quantum Software Testing and Debugging: Insights from Practitioners. ACM Trans. Softw. Eng. Methodol. (Aug. 2026), 50 pages. Just Accepted. doi:10.1145/3838727DOI

Paper details

vlnc:W_889rmswa
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Claude, ChatGPT

View statement
Looking for related papers…
Contents