This paper introduces Dark-State Invariants, a deterministic framework for identifying temporally stable regions in belief propagation dynamics. By detecting invariant-stable nodes—where both sign and magnitude remain unchanged across iterations—the method quantifies computational redundancy within iterative decoding systems. Evaluated across deterministic stress scenarios, the framework reveals that convergent systems rapidly accumulate invariant regions, while oscillatory and chaotic systems do not. This work reframes convergence as the emergence of invariance and establishes a foundation for invariant-driven computation elimination and selective update strategies in QLDPC decoding.
This paper introduces Dark-State Invariants, a deterministic framework for identifying temporally stable regions in belief propagation dynamics. By detecting invariant-stable nodes—where both sign and magnitude remain unchanged across iterations—the method quantifies computational redundancy within iterative decoding systems. Evaluated across deterministic stress scenarios, the framework reveals that convergent systems rapidly accumulate invariant regions, while oscillatory and chaotic systems do not. This work reframes convergence as the emergence of invariance and establishes a foundation for invariant-driven computation elimination and selective update strategies in QLDPC decoding.
In this paper, we propose a multistage decoding framework that leverages internal information produced by an underlying message-passing decoder. The proposed method targets the failure dynamics caused by both classical trapping sets and degenerate errors supported on symmetric stabilizers, which are among the primary limitations of iterative decoding for QLDPC codes. To identify unreliable variable nodes, we introduce a heuristic metric that combines several dynamical features of the decoder, including variable-node log likelihood reliabilities, hard-decision oscillations, the number of adjacent unsatisfied checks, and the soft information contributed by unsatisfied checks. Based on this ranking metric, the decoder performs guided rewinds by selectively forcing the initial log likelihood ratio values of the most suspicious variable nodes and restarting the message-passing decoder under the corresponding forced configuration. To manage the combinatorial growth of candidate configurations, the search is formulated within a beam- search framework with controlled beam width. In addition, we introduce a pruning metric based on the combination of the residual syndrome weight and a posteriori reliability of the decoder output, thereby retaining only the most promising search paths. Logical error rate results demonstrate that the proposed decoder significantly outperforms the normalized min- sum decoder and achieves competitive performance with belief propagation enhanced by order-10 ordered statistics decoding.
This work introduces QEC, a deterministic, replay-safe reasoning system for quantum error correction and invariant-driven computation. Unlike conventional adaptive systems that rely on stochastic exploration, QEC operates as a deterministic reasoning layer over system evolution, producing proof-carrying state transitions that are fully reproducible and verifiable. The system replaces probabilistic optimization with a structured pipeline of invariant detection, deterministic control, memory accumulation, governance, validation, repair reasoning, and invariant-preserving compression. Each stage produces canonical, hash-stable artifacts, ensuring that identical inputs yield byte-identical outputs across environments. QEC reframes failure as a structural phenomenon ("dark states") and introduces deterministic repair through symmetry breaking, validated via counterfactual replay. The system further demonstrates that reasoning itself can be compressed into minimal canonical forms without loss of replay fidelity. Empirical runs over QLDPC Tanner graph simulations demonstrate zero hash divergence across independent executions and compact proof artifacts (~2–5 KB), supporting the feasibility of deterministic reasoning with proof in complex systems. This work establishes a new paradigm: execution → reasoning → proof
Quantum error correction (QEC) is critical for scalable and reliable quantum computing, but existing solutions, such as surface codes, incur significant qubit overhead. Quantum low-density parity check (qLDPC) codes have recently emerged as a promising alternative, requiring fewer qubits. However, the lack of efficient decoders remains a major barrier to their practical implementation. In this work, we introduce SymBreak, a novel decoder for qLDPC codes that adaptively modifies the decoding graph to improve the performance of state-of-the-art belief propagation (BP) decoders. Our key contribution is identifying quantum degeneracy as a root cause of the convergence issues often encountered in BP decoding of quantum LDPC codes. We propose a solution that mitigates this issue at the decoding graph level, achieving both fast and accurate decoding. Our results demonstrate that SymBreak outperforms BP and BP+OSD-a more complex variant of BP-with a 16.17× reduction in logical error rate compared to BP and 3.23× compared to BP+OSD across various qLDPC code families. With only an 18.97% time overhead compared to BP, SymBreak provides significantly faster decoding times than BP+OSD, representing a major advancement in efficient and accurate decoding for qLDPC-based QEC architectures.
This work introduces a deterministic framework for identifying, validating, and falsifying structural invariants in decoder transformation pipelines. Departing from traditional performance-centric analyses of belief propagation, the study treats decoder execution as a composition of deterministic operators and focuses on invariant properties that persist under repeated application. We formally establish several classes of invariants, including ternary closure, operator idempotence, and dark-skip cascade behavior, and validate them directly against implementation through deterministic testing. In parallel, we construct explicit counterexamples to demonstrate the failure of commonly assumed properties such as universal absorbing states and global idempotence under damping. A key contribution is the introduction of invariant-guided reasoning as a mechanism for eliminating redundant computation rather than optimizing it. By reframing decoder pipelines as dynamical systems with provable algebraic structure, this work provides a foundation for deterministic runtime reduction, modular pipeline design, and future extensions into qudit-based decoding and sonification-driven analysis. This work builds on prior results in dark-state invariant detection and forms part of an ongoing research program in invariant-driven computation and quantum-inspired information dynamics.
This document presents a formally validated optimization within the QSOL-IMC Quantum Error Correction (QEC) framework (v68.5.0). The optimization exploits a data-level invariant in belief propagation (BP) dynamics diagnostics: sign vectors and their derived CRC32 signatures are pure, deterministic functions indexed solely by trace position. This invariant enables elimination of redundant computation across multiple diagnostic metrics through trace-level precomputation and reuse. The invariant is proven via slice-level equivalence, byte-level identity, and purity arguments, and validated with deterministic instrumentation. The full test suite remains unchanged and passes completely. The optimization reduces redundant sign computations by 75.3% within BP dynamics analysis while preserving bitwise identity, convergence behavior, and reproducibility guarantees. Scope. This document covers invariant validation and diagnostic-layer optimization only. No algorithmic changes to decoding behavior are introduced.
While quantum systems are know to possess inherent computational advantages over classical computers, constructing algorithms that harness such advantage remains an open challenge. Non-stabiliserness (i.e., traversal of states outside the Clifford orbit), is a necessary condition, as de-quantisation is otherwise possible. Nevertheless, an excess of non-stabiliserness is also known to not be advantageous. In this paper, we present an approach to understanding the efficient use of non-stabiliser states by tracking their behaviour across various algorithms. Our techniques reveal different efficiencies in the use of non-stabiliserness, leading us to hypothesise that greater classical optimisation degrees of freedom can introduce unnecessary non-stabiliser consumption, which becomes costly with error correction.