Open research library
Papers you can read, cite and question
609 papers from the QNFO program, filed on nine shelves by the reader each one is written for: energy per answer, error correction, physics, numbers and p-adics, logic and formalism, AI and knowledge, autonomous systems, assessments, and cross-cutting essays. Every page renders its mathematics and can be questioned in place. How a living paper works.
Looking for an answer rather than a paper? Ask the whole corpus: answers cite the papers they come from.
Stabilizer formalism papers 34 papers
Stabilizer formalism. Stabilizer, decoder and code constructions Tagged papers: 34.
Manifold Modulation for Latent Space Steganography: A Capacity Bound and Distillation Demodulation Model for Teacher-Student Transmission Channels
Large language models are increasingly deployed in teacher-student pipelines in which a student model is fine-tuned on text produced by a teacher, so any statistical signature the teacher imprints on its outputs is transferred to the student whether or not anyone intends it. No existing treatment…
A Deterministic Interface Model for Quantum Statistics: Born Rule, Interference, and Measurement-Dependence Budgets for Loophole-Free Bell Correlations
Device-independent quantum key distribution and certified random-number generation derive their security guarantees from the magnitude of Bell violations, and those guarantees are only as strong as the assumption of measurement independence between setting choices and hidden variables. No published…
Scaling of the Hadamard Deformation Space in Concatenated 4,1,2 Iceberg Codes: Exact Counts, Skew Amplification, and Search Reduction
Concatenated quantum error-correcting codes raise the effective distance of a joint code without requiring the discovery of new codes with desirable parameters, and the $[[4,1,2]]$ Iceberg code is the smallest error-detecting building block and therefore the one with the lowest resource overhead.…
What Must a Quantum-Memory Decoder Know About Temporally Correlated Noise? A Reconciled Exposition and Cost Accounting
Temporal correlations in quantum-memory noise create a calibration problem that is invisible to syndrome statistics alone. We reconstruct, in expository form, the central results of a study of fixed stabilizer memory experiments with known system-environment interactions [1],[2]. The study's main…
Ensemble Drafting: A Draft-Then-Verify Framework Unifying Population-Level Ensemble Control and Speculative Inference
Many computational and control systems share a hidden structure: a cheap, imperfect proposal mechanism produces candidate outputs, and an expensive, authoritative mechanism verifies them in a single pass. We call the abstraction of this structure ensemble drafting. It unifies two bodies of work that…
Deductive Verification of Discrete-Time Quantum-Walk Simulators: Contracts, Cost Bounds, and Periodicity Targets
Discrete-time quantum walks are a universal model of quantum computation, a platform for topological phases, and a standard testbed for quantum algorithms, yet the simulators used to study them are rarely checked with the rigor applied to classical library code. We frame quantum-walk simulator…
Operational Circularity of Qubit Ontology: Excitations Defined by Their Own Readout
Is the qubit a pre-existing object that control pulses and readout merely probe, or a two-level subsystem constituted by the very operations that define it? We formalize this question as a self-referential calibration problem: an ontology map $\Phi$ assigns Hilbert-space identifications to…
Fidelity Budgets for Discrete Regularizations of Gauge Theories: Exact Single-Link Computations, Scaling Laws, and the Limits of Heuristic Bounds
Discrete regularizations of gauge theories — finite-dimensional link Hilbert spaces in quantum link models, truncated electric bases on quantum registers, and tensor networks on Bruhat–Tits trees — all face the same structural question: when does the discrete object faithfully encode its continuum…
Entanglement Wedge Reconstruction Beyond the Large \(N\) Limit via the Twirled Petz Map
Entanglement wedge reconstruction (EWR) furnishes the most precise holographic statement of bulk locality: the bulk region bounded by the quantum extremal surface is recoverable from a chosen boundary subregion. At leading order in the large‑\(N\) expansion this statement is underpinned by modular…
Measurement-and-Feedforward Quantum Circuits as Code Design: Detectability, Branch Counting, and the Location of Nonstabilizerness
Shallow quantum circuits augmented by mid-circuit measurements and classical feedforward can deterministically prepare long-range entangled states and implement global unitaries that no comparable-depth unitary circuit can reach. Recent work established a general correspondence between all such…
Braid Group Representations, Modular Data, and the Classification of Majorana Zero Mode Fusion Rules in Two-Dimensional Topological Superconductors
Majorana zero modes (MZMs) bound to vortices of a two-dimensional topological superconductor (2D TSC) realize non-Abelian anyons whose exchange is described by a projective representation of the braid group $B_N$. The associated anyon theory is encoded in a modular tensor category (MTC) with fusion…
Exact Maximum-Likelihood Quantum Decoding beyond Treewidth: A Structural Analysis of Rank-Decomposition Dynamic Programming
Maximum-likelihood (ML) decoding is the optimal decoding rule for quantum error correction under stochastic Pauli noise, but exact evaluation of logical-class probabilities has required tensor-network contraction whose cost grows exponentially in the treewidth of the syndrome graph, blocking…
Adaptivity Closes the Stabilizer Learning Gap: An Analytical Account of Optimal Single-Copy Stabilizer State Learning
Stabilizer states underpin quantum error correction, device benchmarking, and the classical simulation of quantum circuits, yet their learnability shows a sample-complexity gap: an $n$-qubit stabilizer state can be identified from $\Theta(n)$ copies using joint two-copy Bell measurements, while…
Error Attribution as a Resource-Allocation Principle for Quantum Error Correction: Sensitivity-Guided Noise Reduction and Its Analytic Limits
Logical error rate is the standard benchmark for quantum error correction (QEC), but it is an aggregate quantity: it says nothing about which circuit components actually drive logical failure. Recent work introduced an error attribution scheme that computes per-component sensitivities…
Why Vertices, Not Points? Vertex-Anchored Braiding, Stabilizer Arithmetic, and Displacement Gaps on Bruhat–Tits Buildings
Bruhat–Tits buildings are the canonical combinatorial-geometric objects attached to reductive groups over non-Archimedean local fields, and the recent QNFO constructions of p-adic braid groups [12], p-adic anyon models [13], and a p-adic Temperley–Lieb parameter [14] anchor their discrete braiding…
Configuration-Space Topology and the Distinction Calculus: The Exchange Scalar, Its ±1 Shadow, and a Pre-Registered Derivation Program
Configuration-space topology (CST) derives exchange statistics from the topology of the space in which identical particles move: the fundamental group pi_1(C_N(M)) is the symmetric group S_N in d >= 3 spatial dimensions (exactly two exchange phases: boson +1, fermion -1) and the braid group B_N in d…
Extending v_p^max Code Classification: Testing the Mahler Spectral Conjecture on Additional Stabilizer Code Families
ACRP-06: Tests UF paper C7.3 on 8 additional codes. Golay CSS confirmed v_p^max=28; all other stabilizer codes cluster at random baseline (1-6). C7.3 bound to Golay-type self-dual codes.
Adelic Quantum Error Correction: A Synthesis Across All Primes v1.0.0
The $p$-adic quantum error correction program has developed three independent but connected strands: a mathematical theory of $p$-adic stabilizer codes (Phase A), an experimental protocol to test for ultrametric error structure (Phase B), and a hardware co-design proposal for tree-structured qubit…
Adelic Quantum Error Correction: Code Constructions Beyond the Stabilizer Formalism
Adelic generalization of Heydeman holographic QEC. v0.1.1 adds professionally rendered PDF.
Syntactic Token Calculus
Formalize the observer as a self-enclosing boundary that applies a finite-resolution truncation to the infinite syntactic web. Model thermodynamics, the arrow of time, and quantum decoherence as epistemic artifacts of lossy boundary projection, expressed entirely without numerical probabilities,…
Syntactic Token Calculus Research Plan
The persistent reliance on continuous, substance-based ontologies in theoretical physics has precipitated a crisis of non-renormalizable infinities, demanding a radical shift toward discrete relational foundations. By shifting to an epistemic foundation built entirely on a finite substrate of…
Gauge-Invariant Field Theory of Signal-Worker Interactions
The transition of Quantum Architectonics from a materials-centric discipline to a fundamental ontology of information-matter interaction necessitates a rigorous field-theoretic description. This study bridges that gap by promoting the Signal-Worker ontology to a continuous Gauge-Invariant Quantum…
Simulated Stability and the Superdeterministic Quantum Machine
URL: https://papers.qnfo.org/papers/simulated-stability-and-the-superdeterministic-quantum-machine/ Date: 2026-03-05 Superdeterminism is a deterministic interpretation of quantum mechanics. It posits that all events are fundamentally predetermined. This includes the choices made by conscious…
Alpha Pi Project
The Alpha Pi project begins with a practical engineering challenge: quantum states are exquisitely fragile, decohering rapidly due to environmental noise. This fragility stems not merely from technical limitations but from a deeper mathematical vulnerability: the continuous real‑number field that…
CRYOGENICALLY STABILIZED SYNTHETIC LATTICE
We present the design and physical operating principles of a rack-mountable photonic hardware platform designed to instantiate a synthetic vacuum capable of passive quantum error rejection. Unlike conventional quantum processors that rely on algorithmic error correction, this architecture utilizes…
Stability Compiler
The modeling of fundamental entities as zero-dimensional points creates singularities across physics and network engineering. Current regularization methods like renormalization are procedural patches that fail to explain the origin of finite scales. This paper introduces the topological extension…
Topological Extension Hypothesis
Scientific modeling often relies on zero-dimensional point approximations, leading to mathematical singularities and empirical anomalies when resolution increases. Existing solutions like renormalization are procedural patches that fail to address the underlying ontological error across disparate…
Recursive Constraint Nucleation in Epistemic Cut Architecture
Biological systems are characterized by a fundamental dualism: rate-independent symbolic descriptions (genotypes) exert causal control over rate-dependent physical dynamics (phenotypes). It is established that the universal laws of physics do not inherently favor the spontaneous emergence of these…
Stabilization of Gottesman-Kitaev-Preskill States
Harmonic oscillators enable hardware-efficient quantum error correction through the redundancy of infinite-dimensional Hilbert spaces. Conventional stabilization relies on measurement-based feedback, which is limited by detection latency and recoil heating in trapped ion systems. We propose an…
Computational Toy Model of Non-Local Information Storage in a Quantum Cellular Automaton
Can local, unitary dynamics generate the kind of non-local information storage that holographic quantum error correction requires? This paper revisits that question with a fully reproducible, exact state-vector simulation of a twelve-qubit quantum cellular automaton (QCA) evolving under the…
Hybrid Gate Decomposition and Vector-Norm Analysis for Quantum PDE Solvers
The simulation of high-Reynolds number fluid turbulence remains a grand challenge in computational physics, where the “Curse of Dimensionality” imposes an \(O(N^4)\) complexity scaling on classical solvers (Zylberman, 2025). Quantum algorithms offer a theoretical logarithmic pathway, but their…
Phase Transitions of Logic
The realization of fault-tolerant universal quantum computation is currently hindered by a fundamental dichotomy between substrate controllability and intrinsic robustness. This paper introduces the “Universal Hamiltonian Computational Substrate” (UHCS) framework to quantitatively compare two…
Higgs Particle Never Existed
The 2012 announcement of the discovery of a new boson at the Large Hadron Collider (LHC) was interpreted as the detection of the Higgs particle, a foundational component of the Standard Model. This document presents a formal proof, derived from the first principles of quantum field theory,…
Standard-Deviation Normalization Proof
Let \((\Omega, \mathcal{F}, P)\)be a probability space, and let \(X\)be a real-valued random variable defined on this space, representing a physical observable. Assume \(X\)has a well-defined mean \(\mu = \mathbb{E}[X]\)and finite, positive variance \(\sigma^2 = \mathbb{E}[(X - \mu)^2] > 0\). Let…
New papers by email
One short weekly digest: titles and links. No tracking; unsubscribe any time.