betaFeedback

WorksComputer Science

Red-Blue Hamiltonian Tomography via the Operator Lightcone Wavemap

Abstract

We introduce a model-free method for Hamiltonian tomography based on the operator spreading wavefront. Given two tensor network simulations of the same quantum lattice (one with the nominal Hamiltonian and one with one or more perturbed bonds), the signed cross-entropy of the non-identity Pauli weight field L(v,t)=−ln⁡(npert/nbase)\mathcal{L}(v,t) = -\ln(n_{\rm pert}/n_{\rm base}) identifies each perturbed bond by its causal signature: a red-blue sign flip at the two endpoints, visible from the first wavefront crossing. Combining measurements from pp strategically placed observation centers via an ensemble log-likelihood sum, a single broken bond is identified with an 82-fold margin over the next candidate on a 7×77\times7 lattice. Extending to realistic coupling degradation (δJ=−0.20δJ = -0.20) and up to 8 simultaneous faults, the integrated log-ratio Λ(v)=ln⁡(B(v)/N(v))Λ(v) = \ln(\mathcal{B}(v)/\mathcal{N}(v)) achieves a per-bond detection rate above 90% in a single seismic pass using only 6 simulations. An iterative re-scan strategy progressively resolves multi-bond cases as the signal clears with each recalibration pass. The method requires no model assumptions and no knowledge of the perturbation type or magnitude; the detection is deliberately blind.

Introduction

Identifying miscalibrated or anomalous couplings in a quantum processor is a central challenge in quantum hardware characterization. Standard approaches require explicit Hamiltonian learning: fitting a parameterized coupling model to measurement data. This scales poorly with system size and depends on model assumptions about the noise and interaction structure.

We propose a different approach based on a clear separation of roles. The simulator knows the nominal Hamiltonian and produces two Pauli weight fields: nbase(v,t)n_{\mathrm{base}}(v,t) from the nominal evolution, and npert(v,t)n_{\mathrm{pert}}(v,t) from an evolution where one bond has been silently modified. The detection algorithm receives only these two arrays of numbers and must identify the modified bond from their ratio alone, with no knowledge of the Hamiltonian, the perturbation type, or its magnitude. The detection is deliberately blind.

A perturbed bond creates a causal signature in the wavefront: a sign flip in the cross-entropy field L(v)=−ln⁡(npert/nbase)L(v)=-\ln(n_{\mathrm{pert}}/n_{\mathrm{base}}) between its two endpoints that propagates no further. The broken bond is exactly where the wavefront sign changes, identifiable from the observables alone.

The method is inspired by seismic tomography: place sensors (observation centers) at strategic positions, emit a wave (initialize a local operator), and read the arrival pattern. The perturbed bond is the anomaly in the medium.

The red-blue color scheme is a deliberate reference to the red-blue pebble game of Hong and Kung [2], which characterizes I/O complexity as a bottleneck in computational graphs. Here the roles are analogous: red sites (upstream, wave blocked) and blue sites (downstream, wave starved) identify the bond that limits operator propagation, exactly as red and blue pebbles identify the I/O bottleneck in a computation.

Setup

We simulate the kicked isotropic Heisenberg model on a 7×77 \times7 rectangular lattice (49 sites, 84 bonds) using a GPU-accelerated belief propagation tensor network simulator with Trotter step ε=0.10\varepsilon= 0.10, bond dimension χ=50\chi= 50, and truncation cutoff δ=10−3\delta= 10^{-3}. The non-identity Pauli weight at site vv and cycle tt is:

n(v,t)=∑P:Pv≠IcP(t)2(1)n(v,t) = \sum_{P:P_v\ne I} c_P(t)^2 \tag*{(1)}

where Oc(t)=∑PcP(t)PO_c(t) = \sum_P c_P(t)P is the evolved operator initialized at center cc. By normalization ∑PcP2=1\sum_P c_P^2 = 1, n(v,t)∈[0,1]n(v,t) \in[0,1] is a probability.

To simulate miscalibrated bonds, we weaken their couplings by δJ\delta J, with each bond potentially taking a different value. In the experiments below we use δJ=−0.20\delta J = -0.20 (J=0.80J = 0.80, a 20% degradation) as a representative choice; the detection method does not depend on knowing δJ\delta J in advance and works for any coupling deviation. The Pauli transfer matrix entries scale as cos⁡(Jε)\cos(J\varepsilon), attenuating operator propagation without blocking it entirely. For the multi-bond experiments, kk bonds are selected uniformly at random and perturbed simultaneously.

We place p=6p = 6 observation centers using a greedy geodesic bond cover: the minimum set of sites such that every bond is within dmax⁡=2d_{\max} = 2 hops of at least one center. For the 7×77 \times7 lattice this gives centers at sites {6,10,25,30,32,34}\{6, 10, 25, 30, 32, 34\}, covering all 84 bonds.

Signal Vocabulary and Measurement Definitions

All definitions are expressed in terms of two observables per site per cycle: nbase(v,t)n_{\mathrm{base}}(v,t) and npert(v,t)n_{\mathrm{pert}}(v,t), the non-identity Pauli weights under the nominal and perturbed Hamiltonian respectively. The BFS frontier crossing time t0(v)=min⁡{t:nbase(v,t)>εth}t_0(v) = \min\{t : n_{\mathrm{base}}(v,t) > \varepsilon_{\mathrm{th}}\} defines a site-specific reference time; it marks the physical arrival of the wavefront at vv, set by the Lieb-Robinson lightcone, not by the numerical cutoff.

At each site vv in the 3-cycle window [t0(v)±1][t_0(v) \pm1] we observe one of three frontier patterns. A site is White [W] when nbase(v,t0)≤εthn_{\mathrm{base}}(v,t_0) \le\varepsilon_{\mathrm{th}}: the baseline wave has not yet arrived and no information is available. A site is Blue [B] when npert(v,t0)>nbase(v,t0)>εthn_{\mathrm{pert}}(v,t_0) > n_{\mathrm{base}}(v,t_0) > \varepsilon_{\mathrm{th}}: the perturbed wave accumulates at vv because drainage is blocked by a broken bond downstream; the site is a wall face. A site is Red [R] when npert(v,t0)<nbase(v,t0)n_{\mathrm{pert}}(v,t_0) < n_{\mathrm{base}}(v,t_0) with nbase(v,t0)>εthn_{\mathrm{base}}(v,t_0) > \varepsilon_{\mathrm{th}}: the perturbed wave is attenuated because a broken bond on the path from center blocked transmission; the site is in the shadow.

For a bond (u,v)(u,v) with uu on the center-side and vv on the shadow-side, these patterns combine into three observable signatures. When both endpoints are white [W, W, W] the bond has not yet been reached or is healthy. When the wall face is detected but the shadow is not yet visible [W, B, W], one more cycle is needed. The broken bond signature [W, B, R] is the primary target: uu appears blue at cycle t0t_0 and vv appears red at cycle t0+1t_0 + 1, identifying the bond between them as anomalous. This pattern rests on a single assumption: both waves reach uu at the same frontier time t0t_0, so any amplitude difference at vv is attributable to the bond, not to a timing offset. The temporal order (blue before red by one cycle) is then universal, following from the BFS causal structure: uu is reached before vv, so the wall accumulates before the shadow appears.

The signed cross-entropy evaluated in the frontier window is:

L(v0,[t0±1])=−ln⁡npert(v0,t0)nbase(v0,t0)(2)\mathcal{L}(v_0,[t_0\pm1])=-\ln\frac{n_{\mathrm{pert}}(v_0,t_0)}{n_{\mathrm{base}}(v_0,t_0)} \tag*{(2)}

This is a cross-correlation fixed in space: both waves evaluated at the same site v0v_0 at the same frontier moment t0t_0, with the window [t0±1][t_0\pm1] providing context (white before, red after). Positive L\mathcal{L} identifies red (shadow), negative identifies blue (wall face). The broken bond is the edge between consecutive blue and red sites in the BFS ordering.

A complementary observable measures the wave through a bond rather than at a site. Consider the bond (v0,u0)(v_0,u_0) in the BFS path from the center. The baseline reaches v0v_0 at frontier time t0t_0 and u0u_0 at t1=t0+1t_1=t_0+1. The baseline transfer ratio is:

Tbase(v0→u0)=nbase(u0,t1)nbase(v0,t0)(3)T_{\mathrm{base}}(v_0\to u_0)=\frac{n_{\mathrm{base}}(u_0,t_1)}{n_{\mathrm{base}}(v_0,t_0)} \tag*{(3)}

This measures how much of the wave at v0v_0 propagates through the bond to u0u_0 in one BFS step, directly encoding the gate’s coupling strength JJ. For the perturbed run (with potentially delayed frontier times t0p,t1pt_0^p,t_1^p):

Tpert(v0→u0)=npert(u0,t1p)npert(v0,t0p)(4)T_{\mathrm{pert}}(v_0\to u_0)=\frac{n_{\mathrm{pert}}(u_0,t_1^p)}{n_{\mathrm{pert}}(v_0,t_0^p)} \tag*{(4)}

The ratio Tbase/Tpert>1T_{\mathrm{base}}/T_{\mathrm{pert}}>1 signals a broken bond: less weight crosses the bond in the perturbed run.

Two important caveats apply. First, there is a path distortion. The perturbed wave arriving at v0v_0 has already traversed all upstream bonds. If any of those are also broken, npert(v0,t0p)n_{\mathrm{pert}}(v_0,t_0^p) is already weakened, not by bond (v0,u0)(v_0,u_0) but by upstream damage. The ratio Tbase/TpertT_{\mathrm{base}}/T_{\mathrm{pert}} then conflates the upstream distortion with the target bond signal. The ratio is not a pure measurement of bond (v0,u0)(v_0,u_0). Second, there is a measurable Sensitivity. problem. The perturbed weight npert(v0,t0p)n_{\mathrm{pert}}(v_0,t_0^p) may be close to εth\varepsilon_{\mathrm{th}}, the threshold, making the ratio numerically unreliable. The local cross-correlation L(v0,[t0±1])\mathcal{L}(v_0,[t_0\pm1]) avoids both caveats by using the baseline as the reference; it measures the relative change at the frontier moment, not the absolute transfer.

The Cross-Entropy Wavemap Observable

The previous section introduced the signal vocabulary for a wave with a single origin: one center fires, the wavefront spreads, and the red-blue sign flip at the bond endpoints is the detection signal. Here we extend to the case where pp centers fire independently, each producing its own wavemap. The key quantities are defined per-center, then combined into an ensemble.

For each center kk and site vv, we evaluate the signed cross-entropy in a 3-cycle window [t0±1][t_0\pm1] centered on the BFS frontier crossing t0(v)=min⁡{t:nbasek(v,t)>εth}t_0(v)=\min\{t:n_{\mathrm{base}}^k(v,t)>\varepsilon_{\mathrm{th}}\}:

Lk(v,[t0±1])=−ln⁡npertk(v,t0(v))nbasek(v,t0(v))(5)\mathcal{L}_k(v,[t_0\pm1])=-\ln\frac{n_{\mathrm{pert}}^k(v,t_0(v))}{n_{\mathrm{base}}^k(v,t_0(v))} \tag*{(5)}

This is a cross-correlation fixed in space: both waves are evaluated at the same site vv and the same frontier moment t0(v)t_0(v), defined by the baseline. The window [t0−1,t0,t0+1][t_0-1,t_0,t_0+1] captures three states — before arrival (WHITE), wall-face signal (BLUE or WHITE), and shadow signal (RED) — and t0(v)t_0(v) is the moment of maximum signal and minimum χ\chi-saturation noise.

Consider a bond (u,v)(u,v) with uu closer to center kk. At time t0t_0, the baseline wave has just crossed the bond and nbase(u,t0)≈npert(u,t0)n_{\mathrm{base}}(u,t_0)\approx n_{\mathrm{pert}}(u,t_0); both waves have reached uu with equal amplitude. One cycle later at t1=t0+1t_1=t_0+1, the weaker bond slows drainage from uu: weight accumulates, npert(u)>nbase(u)n_{\mathrm{pert}}(u)>n_{\mathrm{base}}(u), so L(u)<0\mathcal{L}(u)<0 (blue, wall face). Simultaneously, in the baseline weight flows through bond (u,v)(u,v) and arrives at vv, while in the perturbed run less weight crosses: npert(v,t1)<nbase(v,t1)n_{\mathrm{pert}}(v,t_1)<n_{\mathrm{base}}(v,t_1), so L(v)>0\mathcal{L}(v)>0 (red, shadow). The temporal order is universal: blue at the wall face first, red at the shadow one cycle later. The broken bond sits between the blue and red sites, identified by the sign change (Figure 1). The contrast ∣L(u)−L(v)∣\lvert\mathcal{L}(u)-\mathcal{L}(v)\rvert is maximum at t1t_1, providing the detection signal.

Signed cross-entropy $\mathcal{L}(v,t)$ for a single broken bond, showing three seismic scans across cycles 1–3

Figure 1. Signed cross-entropy L(v,t)\mathcal{L}(v,t) for a single broken bond (bond 9, sites 11↔12, δJ=−0.20\delta J=-0.20), rect 7×77 \times7, χ=50\chi=50, 3 cycles. Rows show the three seismic scans: corners+center, quadrants, mid-edges. Columns show cycles 1–3. Cycle 1: no signal in any scan. Cycle 2: yellow (BLUE) accumulation visible at the wall-face site. Cycle 3: red (RED) shadow appears at the downstream site; sign flip across the bond identifies it in all three scans independently. Gold circles: bond endpoints. Stars: scan centers.

Each center kk is initialized and evolved independently: a separate baseline and perturbed simulation pair per center. The signed cross-entropy Lk(v)\mathcal{L}_k(v) is computed for each center individually, then summed into an ensemble log-likelihood:

Lens(v)=∑k=1pLk(v)(6)\mathcal{L}_{\mathrm{ens}}(v) = \sum_{k=1}^{p} \mathcal{L}_k(v) \tag*{(6)}

Centers on the same side of the broken bond reinforce each other; centers on opposite sides contribute opposite signs that partially cancel. Silent centers (wave never reaches site vv) contribute zero and do not corrupt the sum.

A more robust alternative to the pointwise L(v,t0)\mathcal{L}(v,t_0) accumulates the signal over all TT cycles:

B(v)=∑t=1Tnbase(v,t),N(v)=∑t=1Tnpert(v,t),Λ(v)=ln⁡B(v)N(v)(7)\mathcal{B}(v) = \sum_{t=1}^{T} n_{\mathrm{base}}(v,t), \qquad\mathcal{N}(v) = \sum_{t=1}^{T} n_{\mathrm{pert}}(v,t), \qquad\Lambda(v) = \ln\frac{\mathcal{B}(v)}{\mathcal{N}(v)} \tag*{(7)}

Positive Λ\Lambda identifies red (shadow), negative identifies blue (wall face). The integral captures both the delay and the sustained amplitude difference: a broken bond delays the perturbed wave and reduces its steady-state weight, making Λ(v)\Lambda(v) more robust than L(v,t0)\mathcal{L}(v,t_0) when the pointwise signal is weak. In the multi-bond experiments, Λ(v)\Lambda(v) is the primary detection signal.

The Log-Transfer Vector Field

The cross-entropy L(v,t)=ln⁡(nbase/npert)\mathcal{L}(v,t) = \ln(n_{\mathrm{base}}/n_{\mathrm{pert}}) is a scalar field on sites. We now show that its natural spatio-temporal gradient is a vector field defined on bonds, and that this gradient field directly reveals the broken bond as a physical singularity.

Since n(v,t)n(v,t) is a scalar field on the graph, its discrete spatial gradient at site vv in the direction of neighbor uu is (∇n)v→u(t)=n(u,t)−n(v,t)(\nabla n)_{v\to u}(t) = n(u,t) - n(v,t). Since n(v,t)n(v,t) is a probability, weight flows multiplicatively through bonds: n(u,t+1)=n(v,t)⋅Tv→un(u,t+1) = n(v,t) \cdot T_{v\to u}, so the natural gradient is in log-space. The spatio-temporal gradient of L\mathcal{L} at directed bond (v→u)(v \to u) from cycle tt to t+1t+1 is:

(∇stL)v→u(t)=L(u,t+1)−L(v,t)=ln⁡nbase(u,t+1)nbase(v,t)−ln⁡npert(u,t+1)npert(v,t)=ln⁡TbaseTpert≡δln⁡Tv→u(t)(8)(\nabla_{\mathrm{st}} \mathcal{L})_{v\to u}(t) = \mathcal{L}(u,t+1) - \mathcal{L}(v,t) = \ln\frac{n_{\mathrm{base}}(u,t+1)}{n_{\mathrm{base}}(v,t)} - \ln\frac{n_{\mathrm{pert}}(u,t+1)}{n_{\mathrm{pert}}(v,t)} = \ln\frac{T^{\mathrm{base}}}{T^{\mathrm{pert}}} \equiv\delta\ln T_{v\to u}(t) \tag*{(8)}

At each site vv, collecting this quantity over all neighbors u1,u2,…u_1,u_2,\ldots (up to 4 for a rectangular lattice) gives a vector field:

(∇stL)v(t)=[(∇stL)v→u1(t),  (∇stL)v→u2(t),  …](9)(\nabla_{\mathrm{st}} \mathcal{L})_v(t) = \left[(\nabla_{\mathrm{st}} \mathcal{L})_{v\to u_1}(t),\;(\nabla_{\mathrm{st}} \mathcal{L})_{v\to u_2}(t),\;\ldots\right] \tag*{(9)}

one component per bond direction. Each component is a log-likelihood ratio: positive when the baseline transfers more than the perturbed run along that bond, negative when the perturbed transfers more.

A broken bond (u,v)(u,v) is a singularity in this gradient field. At the first wavefront crossing (cycle tt), the baseline flows through the bond freely while the perturbed run is impeded: δln⁡Tu→v(t)>0\delta\ln T_{u\to v}(t) > 0 (red, baseline transfers more through the broken bond). One cycle later, weight has accumulated at the wall-face site uu in the perturbed run; npert(u)n_{\mathrm{pert}}(u) grows, making the reverse ratio n(v,t+1)/npert(u,t)n(v,t+1)/n_{\mathrm{pert}}(u,t) larger: δln⁡Tv→u(t)<0\delta\ln T_{v\to u}(t) < 0 (blue, perturbed transfers more in reverse because the shadow site vv is depleted). The two directed components of the same bond have opposite signs: the gradient field has a discontinuity exactly at the broken bond.

By subsequent cycles the perturbation diffracts: the wall-face accumulation radiates excess weight along alternative paths, enriching bonds that would normally receive less, while the shadow deepens. The gradient field develops a characteristic diffraction pattern centered on the broken bond, with two diagonal fringes whose orientation encodes the bond direction directly (Figure 2).

Spatio-temporal gradient field for a broken bond across three time steps

Figure 2. (∇stL)v→u(t)(\nabla_{\mathrm{st}} \mathcal{L})_{v\to u}(t), broken bond 9 (sites 11↔\leftrightarrow12), χ=50\chi= 50. Red: baseline transfers more. Blue: perturbed transfers more.

The gradient field ∇stL\nabla_{\mathrm{st}} \mathcal{L} has several properties that distinguish it from the scalar L(v,t)\mathcal{L}(v,t). It is defined on bonds rather than sites, so the broken bond appears directly as a gradient discontinuity rather than through its effect on neighboring sites. It carries directional information: the sign asymmetry between forward and reverse components identifies which side is the wall face and which is the shadow, and the diffraction pattern orientation encodes the bond direction. The normalization by n(v,t)n(v,t) suppresses the dominant-site bias that affects site-based metrics. Systematic artifacts from the simulation (Trotter color ordering, BP approximation, or any other effect present in both runs) cancel in the ratio Tbase/TpertT_{\mathrm{base}}/T_{\mathrm{pert}}, whether nbasen_{\mathrm{base}} and npertn_{\mathrm{pert}} come from two simulations or from a simulation and hardware shots.

Seismic Multi-Center Scanning

Rather than running each center independently, we initialize all pp centers simultaneously in a single seismic scan: the initial operator is O(0)=∑kZckO(0)=\sum_k Z_{c_k}, firing all centers at once. At each site vv, the first-arrival signal is dominated by the nearest center, automatically selecting the strongest directional component. The sign flip at the broken bond endpoints emerges without any explicit path tracing or per-center bookkeeping, and the cost drops from 2p2p simulations to just 2 (one baseline, one perturbed).

To achieve broad coverage with no geometric blind spots, we use three complementary center placements on the 7×77\times7 lattice: corners and center {1,7,25,43,49}\{1,7,25,43,49\}, quadrant centers {11,13,37,39}\{11,13,37,39\}, and mid-edge sites {4,22,28,46}\{4,22,28,46\}. Each placement covers a different region of the grid; together the three scans ensure every bond is within dmax⁡=2d_{\max}=2 hops of at least one center in at least one scan. At vhop≈0.45v_{\mathrm{hop}}\approx0.45 hops/cycle, 2 hops requires 5 simulation cycles. The total cost is 6 simulations (3 baselines + 3 perturbed), run in parallel on 3 GPUs.

Bond scores are computed using the integrated log-ratio Λ(v)\Lambda(v) across all three scans. For each bond bb connecting sites vav_a and vbv_b, the score is the maximum contrast ∣Λ(va)−Λ(vb)∣|\Lambda(v_a)-\Lambda(v_b)| over all scans. The top-kk bonds by score are declared broken, where kk is the number of expected faults. On 20 single-bond trials (δJ=−0.20\delta J=-0.20, two independent datasets), this procedure achieves 20/20 correct identifications. On 10 two-bond trials it achieves 9/10, with the single failure corresponding to two bonds sharing an endpoint whose wavefronts cancel (the BLUE-BLUE-RED interference pattern discussed in § 5).

Bond Detection

For each bond bb connecting sites vav_a and vbv_b we define a bond score:

S(b)=Lens(va)×Lens(vb)(10)S(b)=\mathcal{L}_{\mathrm{ens}}(v_a)\times\mathcal{L}_{\mathrm{ens}}(v_b) \tag*{(10)}

A negative product indicates a sign flip across the bond, the causal signature of the broken bond. Rank bonds by most negative S(b)S(b).

Table 1 shows the individual and ensemble results for bond 12 (sites 15 ↔\leftrightarrow 16, identity PTM perturbation, 7×77\times7 lattice, χ=50\chi=50, 5 cycles).

CenterSideL(15)\mathcal{L}(15)L(16)\mathcal{L}(16)Result
10upstream+0.87−0.02✓ CORRECT
30upstream+0.37−0.04✓ CORRECT
25downstream+0.03−0.04× WRONG
32downstream+0.00−0.03× WRONG
6too far00silent
34too far00silent
Ensemble—+1.23−0.13✓ CORRECT

Table 1. Signed cross-entropy at bond 12 endpoints (sites 15,16). Ensemble score: S(12)=−0.164S(12)=-0.164, next bond =−0.002=-0.002 (82× margin).

The ensemble identifies bond 12 with an 82-fold margin over the next candidate, despite only 2 of 6 individual centers giving the correct answer. The wrong individual answers: centers 25 and 32 both correctly identify site 16 as a bond endpoint; their error is only in declaring the wrong adjacent bond. The ensemble product cancels these partial errors.

The gradient field of § 5 provides a complementary bond score. For each directed bond (v→u)(v \to u), summing ∣δln⁡Tv→u(t)∣|\delta\ln T_{v\to u}(t)| above a threshold over all scans and cycles gives:

σ(b)=∑scans∑t(∣δln⁡Tv→u(t)∣+∣δln⁡Tu→v(t)∣)⋅1[∣δln⁡T∣>τ](11)\sigma(b) = \sum_{\mathrm{scans}} \sum_{t} \left( |\delta\ln T_{v\to u}(t)| + |\delta\ln T_{u\to v}(t)| \right) \cdot\mathbf{1}[|\delta\ln T| > \tau] \tag*{(11)}

with threshold τ=0.01\tau= 0.01. The broken bond is the one with the largest asymmetry between forward and reverse directions. Table 2 compares the two methods across bond counts.

kk bondsS(b)S(b) from L\mathcal{L}σ(b)\sigma(b) from ∇stL\nabla_{\mathrm{st}}\mathcal{L}
120/2020/20
29/109/10
43/5 ALL1/5 ALL
8mixedavg 6/8

Table 2. Detection rate (ALL bonds correct) for the two bond scores. Both achieve 20/20 single-bond and 9/10 two-bond. They fail on different trials at higher bond counts, making them complementary.

Both methods support an iterative calibration strategy: declare the top-kk broken bonds, recalibrate the hardware, then re-run the scan. In each pass the already-fixed bonds no longer contaminate the signal, so the remaining faults surface more clearly. The process stops when npert(v,t)≈nbase(v,t)n_{\mathrm{pert}}(v,t) \approx n_{\mathrm{base}}(v,t) everywhere: a physical criterion that requires no additional measurement overhead.

Tensor Network Simulation as Quantum Circuit Execution

The Trotter simulation underlying our method is not merely an approximation of a quantum circuit; it is the quantum circuit, represented in the Pauli operator basis rather than the amplitude basis. The identification is exact:

  • Each lattice site = one qubit

  • Each bond gate exp⁡(−iθ(XX+YY+ZZ))\exp(-i\theta(XX + YY + ZZ)) = one two-qubit gate

  • Each color class (non-overlapping bonds applied in parallel) = one gate layer

  • Each belief propagation synchronization after a full Trotter cycle = one barrier (per-color-class BP, as in the Julia L-MPF implementation [3], provides finer sub-cycle resolution matching the quantum circuit barrier structure)

  • Each PAULI NL output = a mid-circuit Pauli weight measurement

Both the graph coloring (determining which bonds share qubits) and the quantum circuit parallelism constraint (which gates can be applied simultaneously) derive from the lattice topology. The color class ordering is the gate layer ordering.

This identification reveals two distinct timescales. Physical time tt counts integer Trotter cycles, t=n⋅εt = n \cdot\varepsilon; the observables C(t)C(t) and n(v,t)n(v,t) at cycle granularity are physical, independent of color class ordering to O(ε2)O(\varepsilon^2) and convergent to true quantum dynamics. Circuit time tcolort_{\mathrm{color}} has sub-cycle, per-color-class granularity, a property of the circuit implementation rather than the Hamiltonian. Two Trotter implementations of the same Hamiltonian with different color orderings agree on C(t)C(t) to first order in ε\varepsilon but differ by O(ε2)O(\varepsilon^2) Trotter errors; their n(v,tcolor)n(v,t_{\mathrm{color}}) tomography fingerprints differ already at the first sub-cycle. The BP synchronization granularity determines which timescale is accessible: per-cycle BP (as used here) loses sub-step information; per-color BP (Julia L-MPF [3]) respects the causal barrier structure of the quantum circuit.

A perturbed bond (coupling J≠1J \ne1) is a miscalibrated gate: the two-qubit rotation angle θ=J⋅ε\theta= J \cdot\varepsilon differs from the nominal value. The Pauli transfer matrix for exp⁡(−iθ(XX+YY+ZZ))\exp(-i\theta(XX+YY+ZZ)) has diagonal entries cos⁡(θ)\cos(\theta), which for any J≠1J \ne1 gives cos⁡(Jε)≠cos⁡(ε)\cos(J\varepsilon) \ne\cos(\varepsilon). Since ∣cos⁡(θ)∣≤1\lvert\cos(\theta)\rvert\le1 for all θ\theta (unitary gate), any coupling deviation attenuates the wave relative to baseline, guaranteeing npert(v∗)<nbase(v∗)n_{\mathrm{pert}}(v^*) < n_{\mathrm{base}}(v^*) at the shadow endpoint v∗v^*, so L(v∗)>0\mathcal{L}(v^*) > 0 (red) regardless of the sign of δJ=J−1\delta J = J - 1. The detection method is robust: the red site is always the shadow endpoint, never inverted. The gradient field ∇stL\nabla_{\mathrm{st}}\mathcal{L} of § 5 reveals the complementary effect: while the bond attenuates the wave on the shadow side, it simultaneously causes accumulation on the wall-face side and, by subsequent cycles, amplification along rerouted paths that would otherwise receive less weight.

Belief propagation is exact on trees: messages from disjoint subtrees are independent and the fixed point is unique. The seismic initialization fires multiple centers simultaneously, creating wavefronts that meet and interfere inside the graph. This interference violates the tree assumption structurally: circular message dependencies prevent convergence regardless of iteration count. It is a property of the multi-center initialization, not of the solver.

The detection observable L(v,t)=ln⁡(nbase/npert)\mathcal{L}(v,t) = \ln(n_{\mathrm{base}}/n_{\mathrm{pert}}) is a ratio of two runs that share the same centers, the same graph, and the same BP schedule. Whatever interference pattern the multi-center initialization creates is therefore structurally identical in both runs. It is not an approximation error to be corrected; it is a shared background that cancels exactly in the ratio. Only the bond-specific perturbation survives. This was verified empirically: running with up to 30,000 damped BP iterations (which achieve convergence for small center sets) gives PAULI_NL values identical to standard 100-iteration BP. The residual BP non-convergence leaves n(v,t)n(v,t) unchanged.

A complete theoretical characterization of multi-center BP on loopy graphs remains open and will ultimately be resolved by hardware experiments where n^(v,t)\hat{n}(v,t) is measured directly, with no BP involved.

This frames our tomography as quantum ATPG (Automatic Test Pattern Generation) [4], the classical circuit testing methodology generalized to quantum gates. In classical ATPG: fault activation (excite the stuck-at gate), path sensitization (find an observable path from fault to output), backward implication (infer the faulty gate). The quantum analog is: perturbation (change JJ), wavefront propagation (operator spreading from center to shadow site), and cross-entropy inversion (red site + center position →\to bond identity).

Causal Structure, Hardware Path, and Detection Algorithm

The observable n(v,t)n(v,t) is accessible on real quantum hardware via local Pauli measurements after ZNE gate-folding circuits [1]. The cross-entropy L(v)\mathcal{L}(v) requires only the ratio of two measurements, with no absolute calibration. The center placement is determined by the graph topology alone, independent of the Hamiltonian.

Our method exploits the Lieb-Robinson bound: information cannot propagate faster than vhopv_{\mathrm{hop}} hops/cycle. A broken bond creates a causal anomaly; the wavefront on one side cannot inform the other. The first-arrival time tfirst(v)t_{\mathrm{first}}(v) is observed directly, without knowing vhopv_{\mathrm{hop}} in advance.

The seismic 3-scan cost is fixed at 6 simulations regardless of how many bonds are broken. On the 7×77 \times7 lattice (χ=50\chi= 50, 5 cycles, AMD MI100 32 GB GPU), each scan pair runs in 272 s using 11% VRAM with 2 GPUs in parallel.

When two adjacent broken bonds share an endpoint, say bonds (i,j)(i,j) and (j,k)(j,k) with shared site jj, the cross-entropy field shows a three-site pattern: site ii appears red (shadow of bond (i,j)(i,j)), site kk appears blue (wall face of bond (j,k)(j,k)), and the shared site jj appears white. At jj, the red contribution from one broken bond and the blue contribution from the other cancel, producing an interference node. The white fringe is not a detection failure; it is an interference pattern arising from opposite-side contributions canceling at the shared node. The current algorithm detects such pairs via a triplet scorer Swall=L(vi)×L(vk)S_{\mathrm{wall}} = \mathcal{L}(v_i) \times\mathcal{L}(v_k), skipping the white shared endpoint and reading the outer sites directly.

The seismic and aperture methods are naturally complementary and suggest a two-phase adaptive protocol. In Phase 1 (seismic), all pp centers fire simultaneously: one quantum experiment, minimum cost, producing a map of RED sites that identifies the region of interest. In Phase 2 (aperture), the RED sites from Phase 1 guide the selection of targeted observation centers geometrically positioned to discriminate between candidate bonds adjacent to those sites. Only k≪pk \ll p centers need to be run, each independently.

This mirrors standard practice in other imaging domains: a wide-field scout scan (seismic) followed by targeted high-resolution acquisition (aperture). On quantum hardware, Phase 1 maps directly to a single quantum experiment; Phase 2 selects the minimum number of additional experiments to confirm the bond identity.

The seismic phase requires only one circuit (all centers in a single initialization) and one set of hardware shots for the perturbed device. The baseline nbase(v,t)n_{\mathrm{base}}(v,t) is provided by simulation and reused across all candidate perturbations at no additional hardware cost. The aperture phase then tests the hypothesis with directional projections; perturbation signals that survive across independent projections with geometry-consistent timing are physical, while chi-truncation artifacts and shot noise are uncorrelated across runs and average out.

The following describes wavefront triangulation across scans. When multiple independent scans are available, the temporal order in which each scan detects the broken bond carries geometric information beyond the sign flip alone. This enables a triangulation strategy analogous to GPS: each scan provides a time-of-arrival constraint that localizes the bond.

Formally, scan ss with nearest center csc_s detects the broken bond at cycle ts∗t_s^*, the first cycle where ∣Lk(v)∣>εth|\mathcal{L}_k(v)| > \varepsilon_{\mathrm{th}} for some bond endpoint vv. This constrains the bond to lie within ds=ts∗×vhopd_s = t_s^* \times v_{\mathrm{hop}} hops of csc_s: a ball D(cs,ds)\mathcal{D}(c_s,d_s) on the graph. Across MM scans, the bond lies in the intersection:

b∗∈⋂s=1MD(cs,ts∗×vhop)(12)b^* \in\bigcap_{s=1}^{M} \mathcal{D}(c_s, t_s^* \times v_{\mathrm{hop}}) \tag*{(12)}

where D(c,r)\mathcal{D}(c,r) is the set of bonds within crossing distance rr of center cc.

The sign of the earliest detection (which endpoint is RED vs BLUE) further constrains the direction: the center csc_s is on the BLUE (wall-face) side of the broken bond. Subsequent scans confirm or deny: a scan detecting the opposite sign at the same endpoints confirms (center is on the other side of the same bond); a scan detecting different endpoints shifts the candidate set. Each confirmation tightens the intersection; each denial eliminates candidates.

In practice on the 7×77 \times7 lattice with 3 scans (corners+center, quadrants, mid-edges): scan 2 detects bond 9 (11↔12) at cycle 1 (center 13, 1 hop away), scan 3 confirms with opposite sign at cycle 2 (center 4, 2 hops away), scan 1 provides weak confirmation at cycle 2 from the far corners. The intersection of the three balls gives a small candidate set containing the true bond.

BFS-guided fault detection algorithm

The detection method reduces to a graph-theoretic algorithm that operates entirely on the observable n(v,t)n(v,t), without reference to the Hamiltonian, coupling values, or simulation parameters. Let G=(V,E)G=(V,E) be the coupling graph, {cs}\{c_s\} the observation centers, and εth\varepsilon_{\mathrm{th}} the detection threshold.

  1. For each center csc_s and each site v∈Vv \in V, record the baseline arrival time tbase∗(v)=min⁡{t:nbase(v,t)>εth}t_{\mathrm{base}}^*(v)=\min\{t:n_{\mathrm{base}}(v,t)>\varepsilon_{\mathrm{th}}\} and perturbed arrival time tpert∗(v)=min⁡{t:npert(v,t)>εth}t_{\mathrm{pert}}^*(v)=\min\{t:n_{\mathrm{pert}}(v,t)>\varepsilon_{\mathrm{th}}\}. These are the actual BFS frontier crossings, not predicted hop distances; tpert∗(v)t_{\mathrm{pert}}^*(v) may exceed tbase∗(v)t_{\mathrm{base}}^*(v) if a broken bond delays the perturbed wave.

  1. Both the simulation and the quantum circuit assume an execution order among independent bonds, determined by Trotter color class. We materialize this order for causal determination: assign each site vv the pair (h(v),c(ev))(h(v),c(e_v)) where h(v)h(v) is its BFS hop depth and c(ev)∈{0,1,2,3}c(e_v)\in\{0,1,2,3\} is the color class of the bond used to reach it. The total order (h,c)(h,c) gives exact sub-cycle causality: (hu,cu)<(hv,cv)(h_u,c_u)<(h_v,c_v) means site uu is strictly upstream of vv.

  1. For a bond (u,v)(u,v) with uu upstream of vv, compute the bond transfer coefficient:

T=n(v,tbase∗(v))n(u,tbase∗(u))(13)T=\frac{n(v,t_{\mathrm{base}}^*(v))}{n(u,t_{\mathrm{base}}^*(u))} \tag*{(13)}

When nbase(u)≫εthn_{\mathrm{base}}(u)\gg\varepsilon_{\mathrm{th}}, both waves share the same source amplitude at the BFS frontier and L(v)≈ln⁡(Tbase/Tpert)\mathcal{L}(v)\approx\ln(T_{\mathrm{base}}/T_{\mathrm{pert}}): the signed cross-entropy directly measures the relative change in bond transfer. A broken bond reduces Tpert<TbaseT_{\mathrm{pert}}<T_{\mathrm{base}}, giving L(v)>0\mathcal{L}(v)>0 (red shadow) and L(u)<0\mathcal{L}(u)<0 (blue wall face).

  1. For each site vv with ∣L(v)∣>εth|\mathcal{L}(v)|>\varepsilon_{\mathrm{th}}, examine neighbors uu with (hu,cu)<(hv,cv)(h_u,c_u)<(h_v,c_v). Declare bond (u,v)(u,v) as a candidate if L(u)\mathcal{L}(u) and L(v)\mathcal{L}(v) have opposite signs. Score each candidate by ∣L(u)−L(v)∣⋅δ/t∗|\mathcal{L}(u)-\mathcal{L}(v)|\cdot\delta/t^* where δ=2\delta=2 if tpert∗(v)>tbase∗(v)t_{\mathrm{pert}}^*(v)>t_{\mathrm{base}}^*(v), else 1, and t∗=min⁡(tbase∗(u),tbase∗(v))t^*=\min(t_{\mathrm{base}}^*(u),t_{\mathrm{base}}^*(v)).

  1. Repeat steps 1–4 for each scan independently. Rank all candidate bonds by total score across scans and declare the top-kk as broken.

From our experiments we have identified three recurrent interference signatures, which we name here as a working vocabulary based on observed cases. Each is a consequence of the BFS frontier geometry and the Trotter color class ordering, with no quantum-specific reasoning required. We expect further patterns to emerge as the geometry of faults and center placements varies; the vocabulary below reflects our current observations, not an exhaustive classification. RED-BLUE is the clean single-bond signature: center on one side, sign flip across the bond. BLUE-WHITE-BLUE arises when a bond is sandwiched between two equidistant centers: the shared site is white (interference node) and the outer sites are blue on both sides, making both adjacent bonds identifiable. BLUE-BLUE-RED occurs when two orthogonal broken bonds share an endpoint: the shared site accumulates from two directions, the outer RED identifies one bond, and the adjacent BLUE s identify the second.

Measurability and Detection Thresholds

The detection method requires n(v,t)n(v,t) to be measurable both from the simulation fidelity standpoint and from the hardware shot budget. Two independent conditions must hold simultaneously.

Recall that n(v,t)∈[0,1]n(v,t) \in[0,1] is a probability: the fraction of Pauli basis operators that have non-identity support at site vv after tt Trotter cycles (§ 3). On real hardware the circuit is executed NN times. A barrier after each Trotter cycle allows a mid-circuit local Pauli weight measurement at site vv; each shot returns either the identity at vv or a non-identity Pauli (XX, YY, or ZZ). The three non-identity outcomes are not distinguished: only the binary question “identity or not” is asked, and the non-identity count kk accumulates as a success count. This binary nature of each shot makes the Binomial model natural: k∼Binomial⁡(N,n(v,t))k \sim\operatorname{Binomial}(N,n(v,t)), where the physical probability n(v,t)n(v,t) is the Bernoulli success probability for each of the NN independent shots. The empirical estimate n^(v,t)=k/N\hat{n}(v,t) = k/N is then an unbiased estimator of the true n(v,t)n(v,t).

The estimator has variance Var⁡(n^)=n(1−n)/N\operatorname{Var}(\hat{n}) = n(1-n)/N, a direct consequence of the Binomial distribution. At the frontier, n(v,t)≪1n(v,t) \ll1: the total Pauli weight is conserved (∑vn(v,t)=1\sum_v n(v,t) = 1) and spreads over a growing shell of sites, so each individual n(v,t)n(v,t) decreases with distance from the center. In this small-nn regime 1−n≈11-n \approx1 and the variance simplifies to n/Nn/N, giving a shot noise floor σ(n)≈n/N\sigma(n) \approx\sqrt{n/N}. Note also that only sites where n(v,t)>ϵthn(v,t) > \epsilon_{\mathrm{th}} contribute to the detection (§ 3), so the relevant regime is ϵth≤n(v,t)≪1\epsilon_{\mathrm{th}} \le n(v,t) \ll1. The baseline nbase(v,t)n_{\mathrm{base}}(v,t) is provided by simulation and is exact; only the perturbed run is measured on hardware. The condition is that n^pert\hat{n}_{\mathrm{pert}} is a reliable estimate of the true npert(v,t)n_{\mathrm{pert}}(v,t), so that the comparison with the theoretical nbase(v,t)n_{\mathrm{base}}(v,t) is meaningful. Reliability requires the standard deviation of the estimator σ(n^)=n/N\sigma(\hat{n}) = \sqrt{n/N} to be much smaller than the quantity being estimated: σ(n^)≪n\sigma(\hat{n}) \ll n. As NN grows, σ(n^)\sigma(\hat{n}) shrinks and the estimate converges to the true value. The minimum observable nn is set by the detection threshold ϵth\epsilon_{\mathrm{th}}. For n^\hat{n} to be a reliable estimate at n=ϵthn = \epsilon_{\mathrm{th}} we require σ(n^)≤ϵth\sigma(\hat{n}) \le\epsilon_{\mathrm{th}}, i.e., ϵth/N≤ϵth\sqrt{\epsilon_{\mathrm{th}}/N} \le\epsilon_{\mathrm{th}}, which gives:

N≥1ϵth(14)N \ge\frac{1}{\epsilon_{\mathrm{th}}} \tag*{(14)}

For ϵth=10−3\epsilon_{\mathrm{th}} = 10^{-3}, at least 10310^3 shots are required. Table 3 shows the statistical floor as a function of shot budget.

NN shotsσ(n^)\sigma(\hat{n}) at n=ϵthn = \epsilon_{\mathrm{th}}Status
10210^23×10−33 \times10^{-3}noise exceeds threshold
10310^31×10−31 \times10^{-3}noise matches threshold (minimum)
10410^43×10−43 \times10^{-4}reliable estimate
10610^63×10−53 \times10^{-5}well into reliable regime

Table 3. Estimator noise σ(n^)=ϵth/N\sigma(\hat{n}) = \sqrt{\epsilon_{\mathrm{th}/N}} at the detection threshold ϵth=10−3\epsilon_{\mathrm{th}} = 10^{-3}. Reliable detection requires N≥1/ϵth=103N \ge1/\epsilon_{\mathrm{th}} = 10^3.

The tensor network simulation introduces two distinct noise sources that set a floor on trustworthy n(v,t)n(v,t) values. First, truncation: bond singular values below the cutoff δcut\delta_{\mathrm{cut}} are set to zero, so any n(v,t)n(v,t) arising from truncated components is numerical noise, not physical operator spreading. Second, belief propagation is not strictly causal: messages propagate globally in each sweep, producing tiny non-zero n(v,t)∼10−4n(v,t) \sim10^{-4} at sites outside the Lieb–Robinson lightcone. In a real quantum circuit these sites would never be activated (only gates within the lightcone fire), so this leakage is a simulation artifact with no hardware counterpart. Both effects are below δcut=10−3\delta_{\mathrm{cut}} = 10^{-3}, which we therefore adopt as the simulation floor.

Other simulators with tighter cutoffs could in principle trust smaller n(v,t)n(v,t) values and use a lower ϵth\epsilon_{\mathrm{th}}. However, a smaller threshold demands proportionally more shots at the frontier: to estimate n≈δcutn \approx\delta_{\mathrm{cut}} reliably one needs N≥1/δcutN \ge1/\delta_{\mathrm{cut}} shots. A simulation floor of 10−610^{-6} would require 10610^{6} shots merely to reach reliable estimates at the threshold, a cost that must be weighed against the physical benefit of the finer resolution.

The two conditions converge at the same threshold ϵth=δcut=10−3\epsilon_{\mathrm{th}} = \delta_{\mathrm{cut}} = 10^{-3}: the simulation floor sets the minimum trustworthy signal, and from Table 3 reliable hardware estimates at that level require N≥1/ϵth=103N \ge1/\epsilon_{\mathrm{th}} = 10^{3} shots. Both conditions are satisfied simultaneously by:

ϵth≥δcut,N≥1ϵth(15)\epsilon_{\mathrm{th}} \ge\delta_{\mathrm{cut}}, \qquad N \ge\frac{1}{\epsilon_{\mathrm{th}}} \tag*{(15)}

A tighter simulation cutoff δcut<10−3\delta_{\mathrm{cut}} < 10^{-3} enables a smaller ϵth\epsilon_{\mathrm{th}} and finer resolution, but demands proportionally more shots at the frontier to maintain reliable estimates.

From § 8, the bond gate PTM has diagonal entries cos⁡(Jϵ)\cos(J\epsilon). A coupling deviation δJ\delta J shifts the rotation angle and attenuates the diagonal entry by −sin⁡(Jϵ)⋅ϵ δJ-\sin(J\epsilon) \cdot\epsilon\,\delta J to first order. At J=1J = 1 this means the perturbed weight at site vv is simply the baseline attenuated:

npert(v,t)≈nbase(v,t)[1−ϵsin⁡(ϵ)∣δJ∣](16)n_{\mathrm{pert}}(v,t) \approx n_{\mathrm{base}}(v,t)\left[1-\epsilon\sin(\epsilon)|\delta J|\right] \tag*{(16)}

so the signal δn=nbase−npert≈nbase(v,t)⋅ϵ⋅sin⁡(ϵ)⋅∣δJ∣\delta n = n_{\mathrm{base}} - n_{\mathrm{pert}} \approx n_{\mathrm{base}}(v,t) \cdot\epsilon\cdot\sin(\epsilon) \cdot|\delta J| is proportional to the baseline weight and scales linearly with the coupling deviation. The attenuation factor ϵsin⁡(ϵ)∣δJ∣\epsilon\sin(\epsilon)|\delta J| depends only on the Trotter step and the perturbation magnitude, not on the site.

Note that this is a stronger requirement than simply estimating n^pert\hat{n}_{\mathrm{pert}} reliably: we need the signal δn\delta n to be measurably larger than the estimator noise σ(n^)≈nbase/N\sigma(\hat{n}) \approx\sqrt{n_{\mathrm{base}}/N}. Setting δn≥σ(n^)\delta n \ge\sigma(\hat{n}) gives the minimum detectable coupling deviation. We emphasize that the present work performs detection: identifying the location and existence of a broken bond from wavemap patterns, not estimation of δJ\delta J from the numerical values of n(v,t)n(v,t). Quantitative estimation of the coupling deviation from the measured n^pert\hat{n}_{\mathrm{pert}} is a harder and separate problem, left for future work.

∣δJ∣min⁡≈ϵthϵ⋅sin⁡(ϵ)⋅N⋅nbase(v,t)(17)|\delta J|_{\min} \approx\frac{\epsilon_{\mathrm{th}}}{\epsilon\cdot\sin(\epsilon) \cdot\sqrt{N \cdot n_{\mathrm{base}}(v,t)}} \tag*{(17)}

For ϵ=0.10\epsilon= 0.10 and nbase≈10−2n_{\mathrm{base}} \approx10^{-2} (genuine wavefront at first arrival), the detection threshold scales as ∣δJ∣min⁡∝1/N|\delta J|_{\min} \propto1/\sqrt{N}: at N=106N = 10^{6} shots ∣δJ∣min⁡≈1.0|\delta J|_{\min} \approx1.0, at N=107N = 10^{7} it drops to 0.320.32. To detect the experimental coupling degradation ∣δJ∣=0.20|\delta J| = 0.20 used throughout this work requires N≈2.5×107N \approx2.5 \times10^{7} shots. This is independent of the minimum shot budget for reliable estimation (N≥103N \ge10^{3}): the two conditions address different questions: can we measure n(v,t)n(v,t) at all, versus can we resolve the specific coupling deviation of interest.

Conclusion

A broken bond leaves a causal signature in the operator wavefront: a red-blue sign flip in L(v,t)\mathcal{L}(v,t) at its two endpoints, identifiable from the first wavefront crossing and robust across all center placements. Its spatio-temporal gradient ∇stL\nabla_{\mathrm{s}t}\mathcal{L} reveals the same bond as a physical singularity: a gradient discontinuity with a characteristic diffraction pattern whose orientation encodes the bond direction. Three seismic scans, each firing a different set of centers simultaneously, cover all 84 bonds of the 7×77 \times7 lattice in 6 simulations. Both detection methods achieve 20/20 single-bond and 9/10 two-bond identification, with failures on complementary trials. The per-bond detection rate remains above 90% for up to 8 simultaneous faults in a single pass. An iterative protocol (declare, recalibrate, re-scan) progressively resolves multi-bond cases, with npert(v,t)≈nbase(v,t)n_{\mathrm{pert}}(v,t) \approx n_{\mathrm{base}}(v,t) as the natural stopping criterion.

The measurability analysis shows that N≥103N \ge10^{3} shots suffice for reliable estimation of n(v,t)n(v,t) at the detection threshold; resolving the specific coupling deviation ∣δJ∣=0.20|\delta J| = 0.20 requires N∼2.5×107N \sim2.5 \times10^{7} shots, a stronger condition that governs hardware deployment.

The method is a direct sequitur to the Lindblad MPF framework. Both use the same observable n(v,t)n(v,t), the same circuits, and the same hardware protocol; MPF infers noise from a known Hamiltonian, while this work infers coupling geometry from a known noise baseline. Two inferences from one measurement, in opposite directions.

Aperture Synthesis with Voronoi Center Placement

An alternative to the seismic approach runs each center independently, in direct analogy with aperture synthesis in radio interferometry. Each center kk at a different graph position plays the role of one antenna at a different baseline; Lk(v)\mathcal{L}_k(v) encodes which side of the broken bond site vv is on (sign) and the signal strength (magnitude).

Centers are placed with the constraint that no two share the same row or column in the lattice. This guarantees every bond has a strictly unique nearest center (no Voronoi ties): the perpendicular bisector between any two centers never passes through a bond, so one center always dominates the signal at every bond. For p=7p = 7 on the 7×77 \times7 lattice (one center per row, one per column, a permutation placement), exhaustive search over permutations minimizing max⁡bTb\max_b T_b gives centers {3,13,15,25,35,37,47}\{3, 13, 15, 25, 35, 37, 47\} with zero ties across all 84 bonds, maximum Tb=5T_b = 5 cycles, and balanced Voronoi regions of 10–16 bonds each.

Ensemble summation Lens(v)=∑kLk(v)\mathcal{L}_{\mathrm{ens}}(v) = \sum_k \mathcal{L}_k(v) fails for bonds sandwiched between centers on opposite sides, where RED and BLUE contributions partially cancel. A winner-takes-all rule avoids this: for each center kk compute the signed contrast across every bond,

Ck(b)=∣Lksigned(va)−Lksigned(vb)∣(18)C_k(b) = \left|\mathcal{L}^{\mathrm{signed}}_k(v_a) - \mathcal{L}^{\mathrm{signed}}_k(v_b)\right| \tag*{(18)}

and declare the globally winning center-bond pair (k∗,b∗)=arg⁡max⁡k,bCk(b)(k^*, b^*) = \arg\max_{k,b} C_k(b). The winning center is necessarily on the BLUE side of the broken bond; each center is a fully independent observer and the one with the strongest signal wins. On 10 trials (δJ=−0.20\delta J = -0.20), the adaptive seismic-then-aperture protocol achieves 10/10 correct identifications: 7 bonds identified by seismic alone (2 simulations), 3 by aperture (14 simulations), at an average cost of 2+0.3×14≈62 + 0.3 \times14 \approx6 simulations per bond.

The seismic 3-scan approach in § 6 supersedes this method for the multi-bond case: it achieves the same single-bond accuracy at lower cost, and extends naturally to multiple simultaneous faults without requiring the no-shared-row-or-column placement constraint.

References

  1. [1]Tudor Giurgica-Tiron, Yousef Hindy, Ryan LaRose, Andrea Mari, and William J. Zeng. Digital zero noise extrapolation for quantum error mitigation. 2020 IEEE International Conference on Quantum Computing and Engineering (QCE), pages 306–316, 2020.
  2. [2]Jia-Wei Hong and H. T. Kung. I/O complexity: The red-blue pebble game. In Proceedings of the Thirteenth Annual ACM Symposium on Theory of Computing (STOC ’81), pages 326–333, 1981.DOI
  3. [3]Andrew Robertson et al. Lindblad multiproduct formulas, 2026. Manuscript.arxiv.org/abs/2609.05024
  4. [4]J. P. Roth. Diagnosis of automata failures: A calculus and a method. IBM Journal of Research and Development, 10(4):278–291, 1966.DOI

Paper details

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

views · 10

downloads · 0

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

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents