Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2604.15051

Hardware Validation of DAGI via a Modular "Ridge" Signature and High-Order Synergistic Information

Petr Sramek
View original source ↗Read source document ↗Export metadata ↓

Abstract

We report a hardware validation of the DAGI (Directed Acyclic Graph Information) framework on IBM Quantum hardware using a small, controlled experiment whose ideal output distribution is constrained to a low-dimensional modular manifold (a "ridge"). For two $n$-bit registers $(u,v)$ with $n=4$ (modulus 16), each key instance $k$ induces an ideal relation $v \equiv k \cdot u \pmod{16}$, producing a visually distinct ridge in the joint $(u, v)$ distribution. Executed on ibm\_torino in a single Sampler V2 job (8 keys, 1024 shots/key, $N=8192$ total shots), the ridge persists under hardware noise with ridge-hit probability $p_{hit} = 0.1830$ (uniform baseline $1/16$), corresponding to a ridge contrast of $2.93\times$ (95\% bootstrap CI [2.80, 3.06]). Key recovery exceeds chance: per-shot accuracy 0.1689 (chance 0.125, 95\% Wilson CI [0.1610, 0.1772]), and per-group dictionary recovery 0.375 (chance 0.125). To test the central DAGI hypothesis -- that recoverable key information is predominantly high-order/synergistic rather than visible in low-order marginals -- we compute a M\"obius-based information decomposition of $I(K;D_S)$ over detector-bit subsets $S$ via a M\"obius inversion pipeline and evaluate targeted positive synergy $CPS_K$ at order $k_{max}=3$. We observe $CPS_K(k=3) = 0.08788$ with significance under label-shuffle permutation tests (accuracy $p=0.001996$, $CPS_K$ $p=0.004975$). Uniformity diagnostics show near-uniform single-bit marginals while correlation concentrates in specific low-order pairs, and a bootstrap reliability sweep confirms order-3 targeted synergy remains statistically reliable at the full 1024-shot target budget. These results support the claim that DAGI detects and quantifies nontrivial, hardware-resilient, higher-order information structure associated with a known global algebraic constraint.

Explore related subjects

quant-ph

Keep this discovery

BibTeXRIS

Petr Sramek. 2026-04-16. Hardware Validation of DAGI via a Modular "Ridge" Signature and High-Order Synergistic Information. https://arxiv.org/abs/2604.15051

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph↗
arXiv2026

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph↗
arXiv2026

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph↗