Observable-Conditioned Backaction in Dynamic Circuits: A Higher-Order Context-Conditioned Kernel for Local Dynamics

• URL: http://arxiv.org/abs/2603.18381v1
• Date: Thu, 19 Mar 2026 00:59:11 GMT
• Title: Observable-Conditioned Backaction in Dynamic Circuits: A Higher-Order Context-Conditioned Kernel for Local Dynamics
• Abstract summary: Mid-circuit measurements are essential primitives for dynamic circuits and quantum error correction.<n> Device-level benchmarking often compresses this disturbance into low-order proxy metrics.<n>We argue that these proxies can be operationally incomplete for multiscale dynamic circuits.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Mid-circuit measurements are essential primitives for dynamic circuits and quantum error correction, yet characterizing their induced disturbance on spectator qubits remains a central practical problem. Device-level benchmarking often compresses this disturbance into low-order proxy metrics such as $T_1$, $T_2$, readout assignment error, and pairwise crosstalk. We argue that these proxies can be operationally incomplete for multiscale dynamic circuits. We introduce a higher-order context-conditioned kernel, $Γ_{\mathrm{eff}}[Y,O] = Γ_{\mathrm{loc}}[O] + Γ_{\mathrm{proxy}}[O] + Γ_{\mathrm{rel}}[Y,O]$, where $Y$ is a global context label and $O$ a local observable. The term $Γ_{\mathrm{rel}}[Y,O]$ is a phenomenological compression ansatz isolating residual context dependence unexplained by standard proxies. To avoid impossibility issues of quantum partial-information decompositions on non-commuting algebras, the Möbius weights entering this ansatz are evaluated operationally on classical measurement outcomes. We present evidence in three steps. First, earlier GHZ-versus-clock hardware results motivate an observable-class split. Second, we present dynamical evidence using the A6 synthetic hardware harness. A6 injects a pure higher-order context dependence via a programmed conditional interaction. Because the $(C_0,C_1,C_2)$ parity context is invisible to singles and pairs by construction, standard low-order diagnostics are fundamentally blind to the source of the probe's disturbance. Third, we demonstrate coherent controllability through the A6.2 quantum-eraser experiment. Programmable MARK interactions suppress unconditional fringes while eraser-basis conditioning restores them, consistent with complementarity bounds. These results validate a context-conditioned description of backaction over proxy-only null models.

Related papers

• Power law graph attention: exact generalization of scaled dot-product attention, empirical collapse at inference [0.5076419064097734]
  Large Language Model from Power Law Decoder Representations (PLDR-LLM) and its attention, Power Law Graph Attention (PLGA)<n>PLGA replaces the fixed bilinear form of scaled dotproduct attention (SDPA) with a learned, input-generated bilinear operator $G_LM$.<n>PLGA contains SDPA exactly at $G_LM=I$; $A_LM$ and $A_P$ are strictly entrywise positive, with Perron-Frobenius structure on $A_LM$.
  arXiv  Detail & Related papers  (2026-08-10T22:45:22Z)
• Intrinsic Structure: Spectral Identifiability for Mechanistic Interpretability [51.56484100374058]
  We prove the first identifiability theorem for a mechanistic-interpretability primitive.<n>The spectrum is an identifiable, model-intrinsic fingerprint with a stated error bar, not a legible decomposition.
  arXiv  Detail & Related papers  (2026-08-10T19:42:01Z)
• Robust Average-Reward Markov Decision Processes: Minimax-Optimal Learning via Plug-in Reductions [51.50375419691955]
  Distributionally robust Markov decision processes provide a principled framework for sequential decision making under model uncertainty.<n>We study how many samples are necessary and sufficient to learn an $varepsilon$-optimal robust policy under the average-reward criterion.
  arXiv  Detail & Related papers  (2026-08-06T19:49:48Z)
• Effective Dimension Governs Generalization in Quantum Kernel Vision Models [31.082191748525137]
  We show that entanglement structure and quantum noise are two knobs that move $d_rm eff$.<n>Amplitude damping contracts $d_rm eff$ and lifts test accuracy by up to $+13%$ along an inverted-U sweet spot.
  arXiv  Detail & Related papers  (2026-06-18T12:55:59Z)
• Self-Attention as a Covariance Readout: A Unified View of In-Context Learning and Repetition [8.250374560598495]
  Large language models (LLMs) exhibit two behaviours: in-context learning (ICL) and repetitive generation.<n>In both, the model behaves as though it had summarised the context into a population-level statistic and discarded token-level detail.<n>We ask whether this summarisation and forgetting' can be derived from the attention mechanism itself, and answer in the affirmative.
  arXiv  Detail & Related papers  (2026-05-11T12:33:15Z)
• Tight Convergence Rates for Online Distributed Linear Estimation with Adversarial Measurements [66.94250413799232]
  We study mean estimation of a random vector $X$ in a distributed parameter-server-worker setup.<n>Key challenges are adversarial measurements and asynchrony.<n>Results provide a unified finite-time characterization of robustness, identifiability, and statistical efficiency in distributed linear estimation with adversarial workers.
  arXiv  Detail & Related papers  (2026-04-07T11:45:55Z)
• Avoiding Premature Collapse: Adaptive Annealing for Entropy-Regularized Structural Inference [1.7523718031184992]
  We identify a fundamental mechanism for this failure: textbfPremature Mode Collapse.<n>We propose textbfEfficient Piecewise Hybrid Adaptive Stability Control (EPH-ASC), an adaptive scheduling algorithm that monitors the stability of the inference process.
  arXiv  Detail & Related papers  (2026-01-30T14:47:18Z)
• INC: An Indirect Neural Corrector for Auto-Regressive Hybrid PDE Solvers [61.84396402100827]
  We propose the Indirect Neural Corrector ($mathrmINC$), which integrates learned corrections into the governing equations.<n>$mathrmINC$ reduces the error amplification on the order of $t-1 + L$, where $t$ is the timestep and $L$ the Lipschitz constant.<n>We test $mathrmINC$ in extensive benchmarks, covering numerous differentiable solvers, neural backbones, and test cases ranging from a 1D chaotic system to 3D turbulence.
  arXiv  Detail & Related papers  (2025-11-16T20:14:28Z)
• Quantum-Theoretical Re-interpretation of Pricing Theory [0.0]
  Motivated by Heisenberg's observable-only stance, we replace latent "information" with observable transitions between price states.<n>On a discrete price lattice with a Hilbert-space representation, shift operators and the spectral calculus of the price define observable frequency operators and a translation-invariant convolution generator.<n>Noncommutativity emerges from the observable shift algebra rather than being postulated.
  arXiv  Detail & Related papers  (2025-10-07T02:36:12Z)
• Reinforcement Learning with Verifiable yet Noisy Rewards under Imperfect Verifiers [90.50039419576807]
  Reinforcement Learning with Verifiable Rewards (RLVR) trains policies against automated verifiers to avoid costly human labeling.<n>To reduce vulnerability to verifier hacking, many RLVR systems collapse rewards to binary $0,1$ during training.<n>This choice carries a cost: it introduces textitfalse negatives (rejecting correct answers, FNs) and textitfalse positives (accepting incorrect ones, FPs)
  arXiv  Detail & Related papers  (2025-10-01T13:56:44Z)
• Explicit Quantum Circuits for Simulating Linear Differential Equations via Dilation [0.0]
  We present a concrete pipeline that connects the dilation formalism with explicit quantum circuit constructions.<n>On the analytical side, we introduce a discretization of the continuous dilation operator that is tailored for quantum implementation.<n>We prove that the resulting scheme achieves a global error bound of order $O(M-3/2)$, up to exponentially small boundary effects.
  arXiv  Detail & Related papers  (2025-09-20T18:54:49Z)
• Near-Optimal Clustering in Mixture of Markov Chains [74.3828414695655]
  We study the problem of clustering $T$ trajectories of length $H$, each generated by one of $K$ unknown ergodic Markov chains over a finite state space of size $S$.<n>We derive an instance-dependent, high-probability lower bound on the clustering error rate, governed by the weighted KL divergence between the transition kernels of the chains.<n>We then present a novel two-stage clustering algorithm.
  arXiv  Detail & Related papers  (2025-06-02T05:10:40Z)
• Learning with Norm Constrained, Over-parameterized, Two-layer Neural Networks [54.177130905659155]
  Recent studies show that a reproducing kernel Hilbert space (RKHS) is not a suitable space to model functions by neural networks. In this paper, we study a suitable function space for over- parameterized two-layer neural networks with bounded norms.
  arXiv  Detail & Related papers  (2024-04-29T15:04:07Z)
• Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
  We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings. In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$. We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
  arXiv  Detail & Related papers  (2020-02-25T19:18:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.