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.
Energy of computing papers 37 papers
Energy of computing. Joules per answer and the energy limits of computation Tagged papers: 37.
Lifetime as a Placement Signal: A Reconciled Analytical Study of Endurance Budgets for KV Cache Tiering across HBM and High-Bandwidth Flash in Agentic LLM Serving
Agentic large language model (LLM) serving accumulates key-value (KV) cache across many orchestrated requests, and high-bandwidth flash (HBF) offers an order of magnitude more capacity than high-bandwidth memory (HBM) at HBM-class read bandwidth, but its finite write endurance constrains how much…
Thermodynamic Divergence of Active Quantum Error Correction Overhead: A Kapitza-Limited Feasibility Threshold for Gate-Based Architectures
Active quantum error correction (QEC) is conventionally analyzed as an algorithmic resource problem: how many physical qubits and gate cycles are needed per logical qubit. We propose a complementary thermodynamic feasibility criterion. In a gate-based architecture, every QEC cycle is driven by…
Actual Demand of a Computational Substrate: A Reconciled Demand-Side and Allocation Framework for Physical Computing Platforms
Debates about novel computational substrates—reservoir systems, post-qubit quantum architectures, thermodynamically bounded devices—are usually conducted from the supply side: what can a given physical system compute? This paper asks the complementary question posed by the QNFO programme: what is…
In-Network Hamiltonian Engineering for 6G: Service Model, Quantitative Budgets, and Re-Entry Analysis
The QNFO program (In-Network Hamiltonian Engineering for 6G, https://papers.qnfo.org/papers/in-network-hamiltonian-engineering-for-6g/) proposes placing semi-classical Hamiltonian control logic inside the network fabric of sixth-generation (6G) telecommunications infrastructure, so that network…
Ultrametric p-Adic Arithmetic as Energy-Proportional Precision Computing: An Energy Model for Digit-Terminable Multiply-Accumulate
Fixed-width Archimedean floating-point arithmetic pays a constant energy cost per multiply-accumulate (MAC) regardless of the precision actually required by the computation. We conjecture and formalize an alternative: p-adic (ultrametric) number representations, whose digits are hierarchically…
The Resource Burden of Active Quantum Error Correction: A Scaling Analysis of Qubit, Bandwidth, and Energy Overheads
Active quantum error correction (QEC) protects quantum information only by continuously consuming physical resources: qubits, measurement bandwidth, classical processing, and energy. While the theoretical foundations of QEC are mature, the resource burden of running a code—rather than constructing…
Thermodynamic Budgeting for Hybrid Quantum-Classical Computing: A Three-Layer Energy Model with Explicit Arithmetic and a 15-Month Validation Roadmap
Hybrid quantum-classical (HQC) computing is the dominant near-term paradigm, yet its energy accounting is rarely made explicit: the classical control, readout, cryogenic, and orchestration hardware surrounding the quantum processing unit (QPU) can dominate the total power budget, eroding any…
Adiabatic Superconducting Spiking Architectures: A Reconciled Energy Budget for Quantum-Inspired Neuromorphic Computing
Neuromorphic computing promises order-of-magnitude energy savings over von Neumann processors, yet CMOS spiking hardware remains bounded by capacitive switching losses and transistor leakage. We present a reconciled analysis of a hybrid architecture that replaces the CMOS neuron with a…
Thermodynamic Trade-off Frontiers for Neuromorphic Processors: A Quantum-Inspired Non-Equilibrium Model of the Energy–Speed Boundary
Neuromorphic processors promise order-of-magnitude gains in energy efficiency, but no predictive framework currently connects device-level dissipation to system-level computational throughput. We develop a non-equilibrium thermodynamic model in which a neuromorphic processor is treated as a driven,…
The Margolus-Levitin Bound and Energy-Time Limits for Quantum Computation at the Landauer Scale
The Margolus-Levitin (ML) bound establishes a fundamental limit on the speed of quantum evolution, stating that a system with mean energy $\langle H \rangle$ above its ground state requires a minimum time $\tau \ge \pi\hbar/(2\langle H\rangle)$ to evolve between orthogonal states. This preprint…
Quantum Computation Latency-Energy Tradeoff and the JPCUB Metric
Fault-tolerant quantum computation trades latency against energy through the code distance: a larger distance d costs more syndrome rounds and more physical gates per logical operation, lengthening every operation and raising its energy. This paper computes that tradeoff for the rotated surface code…
Revising the Joules-per-Compute (JPCUB) Benchmark: Normalizing Energy Efficiency by Logical-Qubit Operations
Energy benchmarks for quantum processors are usually quoted per physical gate or per physical qubit, figures that hide the dominant cost of a fault-tolerant machine: the error-correction overhead that multiplies physical work by a distance-dependent factor before any logical operation is delivered.…
Landauer-Limit Energy Floor and JPCUB Normalization for Cryogenic Quantum Control Electronics
Cryogenic quantum control electronics dissipate energy many orders of magnitude above the thermodynamic minimum implied by Landauer's principle, and the gap matters for the joules-per-compute economics of fault-tolerant machines. This paper computes the Landauer floor for a rotated surface-code…
Decoherence Times and Quantum Speed Limits in Spin-Chain Systems: A Many-Body Testbed for Energy-Time Uncertainty
Spin chains are the canonical many-body testbed for quantum memories and quantum wires, and the question of what bounds their useful computation time is usually answered in one of two vocabularies that are rarely placed on the same scale: the decoherence time T2 set by the environment, and the…
A Lower Bound on Energy Cost per Logical-Qubit Operation in Surface-Code Quantum Error Correction
Surface-code quantum error correction translates one logical qubit into a two-dimensional array of physical qubits, and the energy cost of that translation is rarely quantified at the level of a logical operation. This paper specifies a minimal, convention-explicit energy model for a rotated…
Error Correction Is a Landauer Machine: The Thermodynamic Floor of Quantum Error-Correction Overhead
Every cycle of active (measurement-based) quantum error correction is an erasure process priced by Landauer's principle at no less than kT ln 2 per erased bit; correction overhead therefore converges to a positive thermodynamic floor, (n-k)/k * kT ln 2 per logical qubit per round for an n,k…
The Qudit Advantage: System-Level Joules-per-Solution Comparison of a Qudit Architecture Against 17 Conventional Qubit Quantum Computing Platforms
The JPCUB Competitive Landscape v2.0 benchmarked 17 qubit-based quantum computing platforms across a single system-level energy-efficiency metric: joules per solution (J/sol). All 17 platforms use two-level quantum systems (qubits). This paper extends the JPCUB framework to qudit architectures —…
The QWAV Decade: Enterprise p-Adic Computing 2025-2035
Computing efficiency — measured by Joules Per Computational Unit (JPCUB †) — will be the dominant competitive axis in enterprise computing by 2035. This document forecasts the JPCUB ecosystem's evolution across three eras. Era 1: Benchmark (2025-2028) — JPCUB is validated against public hardware…
Computing After Silicon: A History-Constrained Forecast of Computing Machine Evolution, 2026-2050
A history-constrained forecast of computing machine evolution 2026-2050. Seven post-silicon candidates assessed; heterogeneous convergence (AI accelerators, quantum co-processors, processing-in-memory) is the central thesis; twelve dated falsifiable predictions registered for 2030-2040.
The BQNN Classical Baseline: Constructive Falsification of Near-Term Quantum Advantage at a Fifteen-Million-to-One Energy Disadvantage
Classical BinaryConnect ensemble achieves 92.73% accuracy vs BQNN quantum inference (~82-85%) at 0.0365 J vs 550,000 J (ratio 1.5x10^7). CAL-BQNN-05 confirmed one year early.
Quantum Coherence in Photosystem II: Environment-Assisted Transport and the Role of Vibronic Coupling in Biological Light-Harvesting
Review of quantum coherence in PSII light-harvesting, ENAQT, vibronic coupling.
The Physics of Computation: Fundamental Limits and the Honest Boundaries of Post-Classical Computing
Phase III of the Qubit Delusion series. Examines fundamental physical limits on computation: Landauer bound, Margolus-Levitin theorem, Bremermann limit, Bekenstein bound. Shows that quantum error-correction overhead (1e2-1e3 physical operations per logical operation) multiplies thermodynamic cost…
MASS-FREQUENCY
Rowan Brad Quni, QNFO ORCID: 0009-0002-4317-5604 DOI: https://papers.qnfo.org/papers/mass-frequency/ | Related Works: - Quantum Resonance Computing (QRC): The Path Forward for Quantum Computing ([DOI:…
Ultrametric Quantum Gravity and Computation
This report presents a unified theoretical framework that bridges two seemingly disparate frontiers: ultrametric quantum computation and ultrametric quantum gravity. Both paradigms replace the conventional Archimedean continuum with a discrete, hierarchical, tree‑like geometry described by p‑adic…
Quantum Abacus
The scalability of active, gate-based quantum computers is fundamentally challenged by the “Thermodynamic Wall,” where the heat from control electronics becomes prohibitive. This study computationally investigates the “Quantum Abacus,” a passive quantum computing architecture that circumvents this…
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…
Thermodynamic Veto
The realization of commercially viable, fault-tolerant quantum computing is precluded not by engineering immaturity but by a fundamental percolation phase transition driven by correlated noise and thermodynamic constraints, which render the required system scales physically uncorrectable. The status…
Adaptive Thick Skin
Standard approaches to robustness in open systems rely on static topological protection, maintaining a constant energy bias to enforce non-reciprocity. However, this strategy incurs a prohibitive thermodynamic cost, or “quiet tax,” during benign environmental conditions. Here, the “Adaptive Thick…
Escaping the Millikelvin Death Spiral
Standard quantum architectures rely on dilution refrigeration to suppress thermal noise, tethering the industry to a non-scalable 20 mK thermal floor. The cooling power at millikelvin temperatures scales poorly, creating a “mainframe constraint” that limits widespread deployment. Here, a 4-Kelvin…
Lifecycle of a Fault-Tolerant Quantum Computer
The operational lifetime of a fault-tolerant quantum computer is fundamentally a race between the inevitable, continuous degradation of its physical hardware and the escalating resource cost of the classical computation required for the error correction to compensate. This dynamic process defines a…
Thermodynamic and Informational Bottlenecks of Scalable Fault-Tolerant Quantum Computation
The promise of fault-tolerant quantum computation rests on its ability to solve certain intractable problems exponentially faster than classical computers. However, this theoretical promise is challenged by a cascade of interconnected physical bottlenecks, where the act of scaling quantum resources…
Thermodynamic and Quantum Constraints on Scalable Quantum Computing
The central tension in scalable quantum computing lies between the exponential growth of quantum information density and the polynomial limits of cryogenic heat extraction. This thermodynamic bottleneck motivates an architectural inversion, where high-power control and readout electronics are…
Thermodynamic Imperative
Standard quantum computing paradigms assume that minimizing temperature is the primary pathway to coherence, driving massive investment in millikelvin dilution refrigeration. However, a fundamental thermodynamic paradox remains unsolved: cooling capacity scales superlinearly with temperature…
THERMODYNAMIC STABILITY OF A FILAMENTARY VACUUM
The theoretical program of analogue gravity has established a robust kinematic correspondence between the propagation of excitations in condensed matter systems and the behavior of quantum fields in curved spacetime. This framework, developed over decades of research, posits that the geometric…
Programming the Vacuum
The exponential growth of Hilbert space dimensions presents a fundamental barrier to the classical simulation of quantum systems, necessitating a paradigm shift from algorithmic simulation to physical instantiation. This study validates the “Inverted Church-Turing-Deutsch” (CTD) framework, which…
Unifying Photosynthetic Energy Transduction and Ambient Superconductivity
Standard quantum mechanical interpretations rely on wave-particle duality to explain energy transduction, yet this duality often obscures the distinct functional roles of force carriers and matter particles in driven non-equilibrium systems. This manuscript proposes a radical “Signal-Worker”…
Emergent Computation
The classical Turing-von Neumann architecture, which has defined the digital epoch, is confronting insurmountable energetic and structural limits, most notably the von Neumann bottleneck. This necessitates a paradigm shift toward physical computation, a framework where information processing is…
New papers by email
One short weekly digest: titles and links. No tracking; unsubscribe any time.