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 -bit registers with (modulus 16), each key instance induces an ideal relation , producing a visually distinct ridge in the joint distribution. Executed on ibm_torino in a single Sampler V2 job (8 keys, 1024 shots/key, total shots), the ridge persists under hardware noise with ridge-hit probability (uniform baseline ), corresponding to a ridge contrast of (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öbius-based information decomposition of over detector-bit subsets via a Möbius inversion pipeline and evaluate targeted positive synergy at order . We observe with significance under label-shuffle permutation tests (accuracy , ). 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.

生成讲解博客的中文版本

生成AI智能校验的中文版本