Official website: distinctiontheory.orgPublic portal for the start guide, papers, claim status, failure registry, prior-art boundary, and citation resources. Canonical GitHub repository:https://github.com/yiningwu-research/Distinction-Theory FDS-Q2 develops the quantum-computation paper in the Finite Distinction Systems (FDS) / Distinction Theory sequence. It studies fault-tolerant quantum computation as a problem of finite distinction maintenance: logical quantum distinctions must be actively preserved against noise, leakage, decoherence, latency, reset burden, cooling limits, and finite correction infrastructure. This paper is not a no-go theorem for quantum computation. It does not claim that quantum computation is impossible, does not refute the quantum threshold theorem, and does not identify every syndrome measurement with Landauer erasure. Instead, it asks what physical maintenance ledger must be paid in order to instantiate fault-tolerant assumptions at useful scale. The central claim is: Logical error suppression requires finite distinction-maintenance infrastructure. A logical qubit is treated as a protected quantum quotient or code-algebra distinction, QL = q(ρphys), not as a simultaneously readable classical bit. Quantum error correction therefore converts distinction loss into maintenance work: redundancy, syndrome acquisition, decoding, feedback, reset, cooling, routing, reservoir engineering, and control. The main audit object is a vector ledger rather than a scalar cost: Rcorr(τ)(εL; N, C) = ( Bsyn, Bdec, Breset, Llatency, Pmaint ), together with a maintenance-capacity vector Cmaint(τ) = ( Cread, Cdec, Creset, Cfeed, Ccool, Cctrl, Clatency ). The feasibility condition is componentwise: Rcorr(τ) ⪯ Cmaint(τ), meaning that syndrome, decoding, reset, latency, power, cooling, and effective-error components must each fit their corresponding time window, physical location, and engineering capacity. Landauer’s principle enters only as a lower bound on logically irreversible reset, overwrite, or garbage disposal under its standard assumptions: Perase ≥ kBT ln 2 · berase/cycle / τcyc. The paper explicitly distinguishes syndrome acquisition from erasure. It does not assume that every extracted syndrome bit is erased at the same temperature stage where it is measured. Syndrome information may be exported, buffered, decoded elsewhere, processed reversibly for a time, or dissipated through an engineered reservoir. The Q2 requirement is that the entropy-export path, reset burden, latency, cooling load, and failure probability be specified rather than hidden. The paper introduces two audit principles: No-free logical distinction maintenance: if passive protection does not fully suppress noise, then maintaining a logical distinction below error tolerance requires redundancy, syndrome information, feedback, reset or export, engineered dissipation, latency increase, resource growth, task relaxation, or failure. Ledger relocation: maintenance cost can be moved across cold stages, room-temperature electronics, optical channels, autonomous reservoirs, topological gaps, or passive-protection mechanisms, but it cannot be made unaccounted. For surface-code-like architectures, Q2 uses the normal forms Nphys ∼ αnLd2, and pL(d,p) ∼ A(p/pth)(d+1)/2, to illustrate the central tradeoff: logical error decreases as code distance grows, but physical carriers, syndrome load, decoding burden, routing, reset, and maintenance infrastructure also grow. For cryogenic solid-state processors, Q2 defines a cold-stage reset ledger, Presetcold ≳ [ kBTcold ln 2 / τcyc ] χresetβnLd2, and a scaling-wall diagnostic nLmax ∼ [ Pcoolavailτcyc ] / [ ηχresetβ kBTcold ln 2 d2 ]. This diagnostic is not a platform-independent maximum logical-qubit count. It is a way to locate which cooling, reset, control, or latency ledger is being exhausted. The paper also analyzes ledger-relocation latency tax. Moving decoding or syndrome processing to warmer electronics may reduce cold-stage heat, but can increase feedback-loop time, τloop = τmeas + τexport + τdecode + τfeed, which increases idle error and can require larger code distance: τloop ↑ ⇒ peff ↑ ⇒ dreq ↑ ⇒ Nphys, Bsyn, Pmaint ↑. The architecture discussion covers superconducting processors, spin qubits, trapped ions, neutral atoms, photonics, topological protection, bosonic and cat-code approaches, qLDPC codes, LDPC-cat codes, and autonomous or dissipative QEC. These are treated as ledger-shaping or ledger-relocation strategies rather than as ledger-elimination strategies. Q2 further proposes a minimum reporting template for quantum-computing architecture audits: ( nL, d, Nphys, peff, pL*, τcyc, Bsyn, Breset, Pcold, Proom, Ptotal ), together with decoder location, reset location, cooling stage, latency bottleneck, and entropy-export path. This release includes deterministic normal-form demonstrations: surface-code logical-error/load scaling, cold-stage reset-floor sensitivity bands, latency-density feedback, architecture maintenance regimes, and an FDS-Q2 relation map. These figures are conceptual normal forms, not empirical fits, not refrigerator models, and not quantum dynamical simulations. The release includes the paper PDF, LaTeX source, reproducibility code, generated figures, CSV tables, and model-summary outputs.
Official website: distinctiontheory.orgPublic portal for the start guide, papers, claim status, failure registry, prior-art boundary, and citation resources. Canonical GitHub repository:https://github.com/yiningwu-research/Distinction-Theory FDS-Q2 develops the quantum-computation paper in the Finite Distinction Systems (FDS) / Distinction Theory sequence. It studies fault-tolerant quantum computation as a problem of finite distinction maintenance: logical quantum distinctions must be actively preserved against noise, leakage, decoherence, latency, reset burden, cooling limits, and finite correction infrastructure. This paper is not a no-go theorem for quantum computation. It does not claim that quantum computation is impossible, does not refute the quantum threshold theorem, and does not identify every syndrome measurement with Landauer erasure. Instead, it asks what physical maintenance ledger must be paid in order to instantiate fault-tolerant assumptions at useful scale. The central claim is: Logical error suppression requires finite distinction-maintenance infrastructure. A logical qubit is treated as a protected quantum quotient or code-algebra distinction, QL = q(ρphys), not as a simultaneously readable classical bit. Quantum error correction therefore converts distinction loss into maintenance work: redundancy, syndrome acquisition, decoding, feedback, reset, cooling, routing, reservoir engineering, and control. The main audit object is a vector ledger rather than a scalar cost: Rcorr(τ)(εL; N, C) = ( Bsyn, Bdec, Breset, Llatency, Pmaint ), together with a maintenance-capacity vector Cmaint(τ) = ( Cread, Cdec, Creset, Cfeed, Ccool, Cctrl, Clatency ). The feasibility condition is componentwise: Rcorr(τ) ⪯ Cmaint(τ), meaning that syndrome, decoding, reset, latency, power, cooling, and effective-error components must each fit their corresponding time window, physical location, and engineering capacity. Landauer’s principle enters only as a lower bound on logically irreversible reset, overwrite, or garbage disposal under its standard assumptions: Perase ≥ kBT ln 2 · berase/cycle / τcyc. The paper explicitly distinguishes syndrome acquisition from erasure. It does not assume that every extracted syndrome bit is erased at the same temperature stage where it is measured. Syndrome information may be exported, buffered, decoded elsewhere, processed reversibly for a time, or dissipated through an engineered reservoir. The Q2 requirement is that the entropy-export path, reset burden, latency, cooling load, and failure probability be specified rather than hidden. The paper introduces two audit principles: No-free logical distinction maintenance: if passive protection does not fully suppress noise, then maintaining a logical distinction below error tolerance requires redundancy, syndrome information, feedback, reset or export, engineered dissipation, latency increase, resource growth, task relaxation, or failure. Ledger relocation: maintenance cost can be moved across cold stages, room-temperature electronics, optical channels, autonomous reservoirs, topological gaps, or passive-protection mechanisms, but it cannot be made unaccounted. For surface-code-like architectures, Q2 uses the normal forms Nphys ∼ αnLd2, and pL(d,p) ∼ A(p/pth)(d+1)/2, to illustrate the central tradeoff: logical error decreases as code distance grows, but physical carriers, syndrome load, decoding burden, routing, reset, and maintenance infrastructure also grow. For cryogenic solid-state processors, Q2 defines a cold-stage reset ledger, Presetcold ≳ [ kBTcold ln 2 / τcyc ] χresetβnLd2, and a scaling-wall diagnostic nLmax ∼ [ Pcoolavailτcyc ] / [ ηχresetβ kBTcold ln 2 d2 ]. This diagnostic is not a platform-independent maximum logical-qubit count. It is a way to locate which cooling, reset, control, or latency ledger is being exhausted. The paper also analyzes ledger-relocation latency tax. Moving decoding or syndrome processing to warmer electronics may reduce cold-stage heat, but can increase feedback-loop time, τloop = τmeas + τexport + τdecode + τfeed, which increases idle error and can require larger code distance: τloop ↑ ⇒ peff ↑ ⇒ dreq ↑ ⇒ Nphys, Bsyn, Pmaint ↑. The architecture discussion covers superconducting processors, spin qubits, trapped ions, neutral atoms, photonics, topological protection, bosonic and cat-code approaches, qLDPC codes, LDPC-cat codes, and autonomous or dissipative QEC. These are treated as ledger-shaping or ledger-relocation strategies rather than as ledger-elimination strategies. Q2 further proposes a minimum reporting template for quantum-computing architecture audits: ( nL, d, Nphys, peff, pL*, τcyc, Bsyn, Breset, Pcold, Proom, Ptotal ), together with decoder location, reset location, cooling stage, latency bottleneck, and entropy-export path. This release includes deterministic normal-form demonstrations: surface-code logical-error/load scaling, cold-stage reset-floor sensitivity bands, latency-density feedback, architecture maintenance regimes, and an FDS-Q2 relation map. These figures are conceptual normal forms, not empirical fits, not refrigerator models, and not quantum dynamical simulations. The release includes the paper PDF, LaTeX source, reproducibility code, generated figures, CSV tables, and model-summary outputs.
Official website: distinctiontheory.orgPublic portal for the start guide, papers, claim status, failure registry, prior-art boundary, and citation resources. Canonical GitHub repository:https://github.com/yiningwu-research/Distinction-Theory FDS-Q1 develops the quantum-record-boundary paper in the Q-series of Finite Distinction Systems (FDS) / Distinction Theory. It studies Wigner’s Friend scenarios as finite record-boundary promotion problems. The central claim is that a friend-relative operational record cannot be promoted into Wigner’s accessible fact algebra unless a physical record channel supplies sufficient cross-boundary mutual information. Q1 does not solve the measurement problem, derive the Born rule, replace decoherence theory, modify unitary quantum mechanics, or claim that consciousness causes collapse. It is not a collapse theory. It is a finite-record boundary theory: observers are treated as finite distinction-registers, and measurements are treated as stable record formation under finite capacity. The central quantitative object is the boundary-mismatch entropy MF|W = H2(ZF | ZW), where ZF is the friend’s accessible record class and ZW is Wigner’s accessible record class. A friend-relative record is Wigner-promotable to tolerance ε only when H2(ZF | ZW) ≤ ε, equivalently, I2(ZF; ZW) ≥ H2(ZF) - ε. Q1 carefully separates Wigner’s ignorance from physical coherence. Wigner’s ideal global coherent assignment requires isolation and reversible-control assumptions. Wigner’s operational state is instead obtained by tracing out inaccessible degrees of freedom. The friend’s internal record is represented as a stable record class relative to the friend’s accessible algebra, not as a claim of fundamental collapse. The paper introduces a concrete finite-record interface. An observer implements an operational measurement family MO = {EOz}, which outputs a finite classical record ZO. A POVM outcome counts as an FDS record only when it is stabilized in the observer’s register over a retention window [t, t + τ] with error probability at most δ. Thus Q1 treats record extraction as classical-register stabilization under finite accessibility, not as a fundamental projection or collapse trigger. Information-theoretic quantities are measured in bits: H2, I2, and C. When a physical entropy is associated with a record distribution, the conversion is S = kB ln 2 · H2. Q1 uses this convention because FDS tracks finite distinguishability in binary record units. Von Neumann entropy is used when the relevant object is a quantum reduced state rather than a classical record variable. The paper formulates several core results: a boundary-promotion criterion, a Wigner-friend boundary-separation proposition, a finite-access lower bound on friend-record reconstruction using data processing and Fano-style inequalities, and an objective-convergence condition through environmental redundancy. In the binary case, the reconstruction error satisfies a lower-bound relation involving the inverse of the binary entropy function on the monotone branch 0 ≤ Pe ≤ 1/2. Q1 also defines an objective availability threshold using environmental fragments. For fragments E1, ..., EN, the minimal fragment number is mε = min { m : I2(ZF; E1:m) ≥ H2(ZF) - ε }. A record becomes objectively available to a class of finite observers only when redundancy, observer capacity, and record stability are all sufficient. This connects Q1 to decoherence and quantum Darwinism while preserving the distinction between decoherence, internal record formation, and external record availability. The paper’s response to Frauchiger-Renner-style arguments is not a refutation of the theorem. Instead, Q1 provides a boundary-audit rule: a statement recorded in the friend’s accessible algebra cannot be inserted into Wigner’s accessible algebra unless boundary promotion succeeds. In slogan form: AF-fact does not imply AW-fact unless the physical promotion channel supplies sufficient mutual information. Q1 introduces a promotion strength ηF→W = I2(ZF; ZW) / H2(ZF), which organizes boundary-alignment regimes: no promotion, partial leakage, Wigner-promotable record, and full boundary alignment. Partial leakage licenses inference, not promotion. For quantum technology, Q1 distinguishes coherence preservation from record availability. It introduces the diagnostic record availability horizon τRAH = inf { t : I2(Zinternal; Zexternal(t)) ≥ H2(Zinternal) - ε }. This is a diagnostic time for external record availability, not a new fundamental timescale. It is intended to complement device metrics such as T1, T2, gate fidelity, readout fidelity, internal record stability, cross-boundary mutual information, record-erasure history, and reset or garbage-collection cost. The release includes deterministic normal-form demonstrations. They illustrate the record-boundary causal map, boundary-promotion condition, decoherence versus record availability, a three-bit toy model, the promotion lattice, and the relation map connecting FDS Core, T1, O1, Q1, P3/P4/P7, and Q2. These figures are conceptual normal forms, not quantum dynamical simulations and not empirical fits. This release includes the paper PDF, LaTeX source, reproducibility code, generated figures, CSV outputs, and model summary outputs.
Paper also available at PhilArchive: https://philarchive.org/rec/WUOAAB Official website: distinctiontheory.orgPublic portal for the start guide, papers, claim status, failure registry, prior-art boundary, and citation resources. Canonical GitHub repository:https://github.com/yiningwu-research/Distinction-Theory FDS-O1 develops an operational finite-capacity model of physical observation and measurement. The paper replaces the idealized notion of an observer as a point of access to facts with a finite physical record-bearing system: a finite distinction-register. In this framework, an observer is a system that can register, preserve, update, order, and communicate distinctions only through finite records, finite channels, finite update rates, finite buffers, and finite thermodynamic budgets. The paper formulates measurement as stable record formation under finite capacity. A measurement event is not merely an interaction; it is the stabilization of an accessible record whose distinction class can be retained and used by a finite observer within a specified time window. The model defines measurement capacity through dynamically coupled bottlenecks, including sensor resolution, readout channel, internal memory, record stability, buffering, externalized access, compression, and irreversible update throughput. The central diagnostic condition compares task-relevant rate-distortion demand with accessible measurement capacity. When demand exceeds capacity, full-fidelity measurement is operationally impossible unless the system changes the boundary, increases time, buffers, externalizes records, compresses, erases, relaxes the task, or fails. The predicted budget-crossing signatures include bottleneck switching, latency jumps, buffer overflow, false merging, state merging, externalization bursts, reset cascades, and irreversible housekeeping costs. This version extends the initial O1 model by adding dynamic bottleneck coupling, transient versus sustained budget crossing, reversible-versus-irreversible heat accounting, a two-dimensional sensor-array simulation, an operational interface with decoherence, and a comparison with active inference and robotics. The accompanying replication package includes deterministic synthetic simulations, figures, CSV outputs, LaTeX source, and Python code. The simulations are illustrative model demonstrations, not fits to physical detector data, quantum experiments, biological observers, or human-subject data. Scope and boundary. This paper does not claim that consciousness is required for observation. It does not solve the quantum measurement problem, derive the Born rule, replace decoherence theory, modify unitary quantum mechanics, derive the Bekenstein bound, derive holography, or derive the Einstein equations. Its contribution is narrower: it converts finite-observer distinguishability budgets into a concrete measurement-capacity diagnostic framework with explicit budget-crossing signatures. This record is part of the Distinction Theory / Active Finite Distinction Systems research programme. Related archival materials, including the formal core, general archive, and claim registry, are maintained in the public project repository.
This paper addresses a missing architectural layer in fault-tolerant quantum computing. The central question is not whether quantum processors require cooling, better qubits, error-correcting codes, real-time decoders, protected oscillator modes, engineered reservoirs, or feedback, but whether these mechanisms can be organized into a single measurable condition for active logical-state maintenance. The paper proposes Quantum-State Homeostasis as a source–sink framework for stabilizing protected logical quantum information under continuous dissipation. In this framework, a fault-tolerant quantum processor is not modeled as a perfectly isolated object, nor as a collection of independent engineering patches. Instead, it is modeled as an engineered open-system information architecture whose logical state survives only when restoration capacity, basis sharpness, dominant protected-mode occupation, and entropy-export coupling close together. The central contribution is the homeostasis score Qhomeo. This score combines four necessary factors: restoration capacity above coherence-window load, sharply selected logical basis, dominant protected logical-mode occupation, and engineered source–sink coupling. The resulting condition, Qhomeo = Θ((RQτQ/IQ) − 1) · WQ · p0,Q · κQ, defines logical stability as a conjunctive architecture rather than a single hardware parameter. Cryogenic cooling may extend the coherence window τQ; quantum error correction and decoding may increase restoration capacity RQ; cat qubits, bosonic codes, surface codes, and protected oscillator manifolds may support WQ and p0,Q; reservoir engineering, leakage reset, syndrome extraction, ancilla reset, and feedback may close κQ. However, none of these mechanisms is sufficient alone. A colder processor can still fail if its logical basis is diffuse. A fast decoder can still fail if feedback is not effectively coupled. A protected code manifold can still fail if entropy cannot leave the protected subsystem. The paper therefore reframes fault tolerance as active homeostatic maintenance of a protected logical mode. The structural theorem of the paper is conditional: if a quantum-stabilization architecture admits operational definitions of restoration capacity, coherence window, protected information load, basis sharpness, dominant protected-mode occupation, and source–sink coupling, then it admits a Qhomeo representation. Under the reduced-order assumptions stated in the manuscript, the protected logical mode follows an attractor-like stability condition αΦ > Γ. The paper interprets this not as a new fundamental law of quantum mechanics, but as a reduced-order architectural description of logical survival. Quantum error correction is therefore understood as controlled information transfer: error entropy is not annihilated, but routed into syndrome records, reset costs, reservoir excitations, heat, leakage-removal pathways, or correction-frame updates while the protected logical state is preserved. The empirical layer is framed as an architectural consistency program rather than proof of completed fault tolerance. The framework is anchored against published results across cat-qubit, GKP, and neutral-atom platforms, showing that heterogeneous stabilization mechanisms can be interpreted through the same reduced-order source–sink structure. The paper further commits to time-bounded prospective predictions for next-generation dissipative cat experiments, GKP fixed-point relationships, neutral-atom code-distance scaling, and an engineering sweet-spot range for αΦ/Γ. Failure of individual predictions revises the corresponding sub-claim; failure of multiple predictions triggers broader re-evaluation of the framework. The manuscript also defines claim boundaries: Qhomeo does not replace Hamiltonian models, Lindblad equations, threshold proofs, or platform-specific noise models; it organizes them architecturally. It does not claim that a fault-tolerant quantum computer has already been built, that quantum processors are biological or conscious, or that cooling is unnecessary. Its value lies in proposing a falsifiable, platform-neutral, source–sink architecture for testing whether logical quantum information can be actively maintained as a protected, sharply selected, entropy-exporting dominant mode. Keywords: quantum error correction, fault tolerance, logical qubits, quantum-state homeostasis, Qhomeo, source-sink architecture, reservoir engineering, autonomous QEC, bosonic codes, cat qubits, GKP codes, neutral atoms, logical information condensate, protected logical mode, entropy exhaust, reduced-order model, architectural stability score, quantum information stabilization, prospective falsification.
Official website: distinctiontheory.orgPublic portal for the start guide, papers, claim status, failure registry, prior-art boundary, and citation resources. Canonical GitHub repository:https://github.com/yiningwu-research/Distinction-Theory FDS-X4 develops the Pauli-exclusion paper in the X-series physical bridge sequence of Finite Distinction Systems (FDS) / Distinction Theory. It interprets the Pauli exclusion principle as finite address protection for fermionic matter: a collision-free occupancy rule for fermionic mode addresses. The central algebra is (a†i)2 = 0, ni = a†iai ∈ {0,1}. This nilpotent occupancy rule does not label identical fermions as classical individuals. In X4, a “token” means an address-protected fermionic mode-occupancy event, not a classically individuated particle label. The Pauli rule prevents a second identical fermionic occupancy event from being written into an already occupied quantum address. X4 does not replace the spin-statistics theorem. The standard QFT theorem remains the hard connection between half-integer spin and Fermi-Dirac statistics under assumptions such as Lorentz invariance, microcausality / locality, and positive energy. X4 instead asks what operation the resulting fermionic algebra performs in a finite distinction system. Its answer is: Pauli exclusion protects finite fermionic addresses, forces structural diversity, and prevents identity-address collisions in matter. The paper reframes an earlier information-density intuition. It does not claim that bosonic multiple occupation creates infinite independent distinguishability. Bosons are treated positively as integration, broadcast, synchronization, and field-mediated coupling channels. Fermions provide address-protected differentiation; bosons provide coherent field-mode amplification and shared interaction structure. X4 introduces an address-diversity bound. For N occupancy events and an occupancy cutoff p, the number of distinct addresses required satisfies Dp(N) ≥ ⌈N/p⌉. In the Pauli case p = 1, sufficient available addresses imply D1(N) = N. Thus Pauli exclusion maximizes forced address diversity among finite cutoff rules. The paper treats p = 1 as an operational minimality bridge: FDS explains the economy of the single-occupancy rule, not the spin-statistics origin of fermionic antisymmetry. The paper connects finite address protection to atomic shell structure, chemical diversity, stability of bulk matter, degeneracy pressure, white-dwarf and neutron-star support, and finite-information bounds. It distinguishes local fermionic address protection from global high-density gravitational / holographic cutoffs. X4 also relates the Pauli principle to neighboring FDS papers: X3 on the functional decomposition of the four interactions, P6 on speed–precision–resource bounds, P7 on invariant protection, and P4 on anti-recurrence and non-overwriting finite-memory structure. It includes a Physical AI design implication: robust agents need Pauli-like address protection to avoid identity collision, memory aliasing, object-permanence failure, and catastrophic overwrite. Deterministic algebraic and normal-form demonstrations are included. They illustrate fermionic versus bosonic occupancy, address-diversity scaling, ambiguity cost under generalized occupancy, shell-filling contrast, degeneracy-pressure scaling, stability scaling, and the X4 dependency chain. These figures are conceptual / normal-form visualizations, not empirical fits or physical simulations of real atoms or compact stars. This release includes the paper PDF, LaTeX source, reproducibility code, generated figures, and CSV / JSON outputs.
Boundary-Access Holonomy and the Quantum Reversible Quotient: A Finite-Distinction Framework for the Zero-Record-Holonomy Sector introduces FDS-Q0, an upstream quantum-foundations paper in the Finite Distinction Systems (FDS) program. The central question is why reversible quantum mechanics has a symmetric distinguishability structure at all. Standard finite-dimensional quantum mechanics is usually formulated after this symmetry has already been assumed: states live in complex projective Hilbert space, reversible dynamics is unitary, and distinguishability is symmetric inside the closed-system formalism. Q0 asks what finite boundary-access conditions make such a reversible symmetric sector available. The proposal is that standard Hilbert-space quantum mechanics is located as the zero-holonomy reversible quotient of a more primitive asymmetric finite-boundary access dynamics. A physical distinction is first directed, boundary-relative, capacity-limited, and record-sensitive: a system may export, preserve, erase, or recover a distinction differently across different boundaries. The central object is the boundary-access holonomy H∂, an operational obstruction to closing a directed access loop through system, apparatus, environment, record, and recovery channels. Q0 defines finite boundary-access systems, operational directed access, access asymmetry, boundary-access holonomy, and three holonomy sectors: coherent holonomy, record holonomy, and leakage holonomy. It gives a restricted access-category theorem showing that zero record holonomy makes the reversible quotient well-defined; in the restricted quantum-access category, the recovered-state kernel is symmetric. The paper explicitly does not claim to derive the full Hilbert reconstruction, the Born rule, objective collapse, hidden variables, quantum field theory, or all of quantum mechanics. The paper also supplies two minimal operational normal forms. First, a Mach-Zehnder stable-record model separates ordinary coherence overlap from stable accessible record holonomy, predicting that recoverable visibility can split at fixed overlap when stable record accessibility differs. Second, a QEC directed-leakage model treats leakage from the computational subspace as directed leakage into uncorrectable boundary sectors, predicting that logical failure can split at matched physical error when uncorrectable leakage differs. The compressed thesis is: H∂ = 0 ⇒ reversible Hilbert sector,H∂ ≠ 0 ⇒ record, decoherence, measurement, and maintenance sectors. Q0 supplies an upstream quantum-access layer for the FDS quantum sequence. Its immediate scientific task is to make boundary-access holonomy a calculable and testable quantity. Official website: distinctiontheory.orgPublic portal for the start guide, papers, claim status, failure registry, prior-art boundary, and citation resources. Canonical GitHub repository:https://github.com/yiningwu-research/Distinction-Theory
This paper extends the control-latency governance framework developed for classical and physical autonomous systems into fault-tolerant quantum computing, and finds there not a strained analogy but a domain where the framework’s central inequality has already been discovered independently by practitioners. In fault-tolerant quantum computation, a quantum state protected by error correction survives only while the classical decoding loop — which reads syndrome measurements, infers the error, and applies or tracks a correction — keeps pace with the rate at which physical errors accumulate. When decode latency exceeds the interval in which errors remain correctable, the uncorrected-syndrome backlog grows without bound and the logical computation collapses into noise. This is the Control-Latency Solvency Bound, S = H / T_c, in a new substrate: H is set by decoherence and the correctability window, T_c by the classical decode-and-feedback loop. The paper makes three contributions. First, it identifies the quantum error-correction “backlog problem” — already modeled in the QEC literature as a backlog growing in proportion to the gap between the error-arrival rate and the decode rate — as a physical instance of the solvency bound, giving a governance and capital-allocation reading of what the field currently treats as a systems-engineering constraint. Second, applying the Finitude Principle, it isolates three finite resources whose exhaustion defines the limits of quantum advantage: coherence time, classical decoding bandwidth, and — at the level of the wider economy rather than the machine — the cryptographic trust reserve that a cryptographically relevant quantum computer would deplete. Third, it develops the capital-allocation consequence: investment in additional physical qubits produces no usable logical capability unless matched by classical decoding capacity, so quantum infrastructure spend is bounded by a classical-control complement that is routinely under-modeled. The paper introduces no new formal apparatus; it applies an existing one, and its modest claim is that the governability of quantum computers, the finitude of their enabling resources, and the economics of their deployment are one problem, already visible in the engineering data, and worth naming as such.