A two-level system is reset to error eps by N quenches of its energy gap, each followed by full equilibration with a bath at temperature T. For every dissipation budget, the number of steps required is log*(1/eps) up to an additive constant, and log*(1/eps)+1 steps keep the dissipation below 0.7 kT at every eps. At fixed N the minimal dissipation diverges as 1/2 times the N-fold iterated logarithm of 1/eps, with an explicit constant. For all N and eps it is at least L^2/(2N), where the thermodynamic length L = arcsin(1 - 2 eps) stays below pi/2, and this is sharp as N grows at fixed eps, so the limits do not commute. At eps = 1e-6 the minimal dissipation is 6.2 kT for one step, 1.3 kT for two and 0.68 kT for three. The three laws of thermodynamics for this protocol are written in the visibility V = 1 - 2p, with gamma(V) = (1 - V^2)^(-1/2) and rapidity eta = artanh V. The entropy produced in a step is exactly ln(gamma_2/gamma_1) - V_1 (eta_2 - eta_1). It reduces to (1/2) gamma^2(V) (Delta V)^2 for a small step and to ln gamma(V) for a one-step reset, so no floor of the form (1/2) I(V) per event holds; that floor, stated in earlier preprints of the author, is withdrawn here. The exact step formula and the bound L^2/(2N) are machine-checked in Lean 4 (github.com/bharathsrivats/fisher-lorentz-formalization, tag v2.1.0). Related prior work is credited in the paper, and no claim of priority is made.
A two-level system is reset to error eps by N quenches of its energy gap, each followed by full equilibration with a bath at temperature T. For every dissipation budget, the number of steps required is log*(1/eps) up to an additive constant, and log*(1/eps)+1 steps keep the dissipation below 0.7 kT at every eps. At fixed N the minimal dissipation diverges as 1/2 times the N-fold iterated logarithm of 1/eps, with an explicit constant. For all N and eps it is at least L^2/(2N), where the thermodynamic length L = arcsin(1 - 2 eps) stays below pi/2, and this is sharp as N grows at fixed eps, so the limits do not commute. At eps = 1e-6 the minimal dissipation is 6.2 kT for one step, 1.3 kT for two and 0.68 kT for three. The three laws of thermodynamics for this protocol are written in the visibility V = 1 - 2p, with gamma(V) = (1 - V^2)^(-1/2) and rapidity eta = artanh V. The entropy produced in a step is exactly ln(gamma_2/gamma_1) - V_1 (eta_2 - eta_1). It reduces to (1/2) gamma^2(V) (Delta V)^2 for a small step and to ln gamma(V) for a one-step reset, so no floor of the form (1/2) I(V) per event holds; that floor, stated in earlier preprints of the author, is withdrawn here. The exact step formula and the bound L^2/(2N) are machine-checked in Lean 4 (github.com/bharathsrivats/fisher-lorentz-formalization, tag v2.1.0). Related prior work is credited in the paper, and no claim of priority is made.
Quantum information reset is an intrinsically irreversible process constrained by the second law of thermodynamics. In contemporary superconducting processors, dissipation during qubit reset is frequently dominated not only by quantum limits but by a classical energy floor on the order of 10^{-21} J. In contrast, the entropic bound T \Delta S at dilution refrigerator temperatures (\sim 15 mK) corresponds to a lower energy scale of approximately 10^{-23} J, establishing entropy production as the organizing physical principle that limits both the efficiency and the speed of reset operations. We introduce an entropy-limited efficiency estimator, \eta_S = 1 - (T \Delta S / W_{\rm diss}), which quantifies the thermodynamic distance from the entropic (Landauer) limit. By construction, \eta_S = 0 corresponds to the saturation of the entropy production limit, while \eta_S \to 1 indicates dissipation dominated by non-entropic (classical) contributions. Maximizing \eta_S is equivalent to a constrained variational problem in which dissipated work is minimized subject to the second law of thermodynamics. For typical superconducting qubits (\omega_q/2\pi \sim 5 GHz, T_1 \sim 50–100 \mus, T \sim 15 mK), the entropic bound T \Delta S \sim 10^{-23} J lies two orders of magnitude below the experimentally observed classical dissipation floor W_{\rm floor} \sim 10^{-21} J. Figures 1 and 2 were generated using the provided scripts_generate_figures.py script, using parameters: \omega_q/2\pi = 5 GHz, T_1 = 80 \mus, and T = 15 mK.
This document collects fourteen theorems extending the Fisher information identity I(V) = γ²(V) = 1/(1−V²), where V is the visibility of a binary quantum measurement and γ is the Lorentz factor. The identity was established in the author's anchor preprint (Zenodo DOI: 10.5281/zenodo.19363449). Part A — Internal Structure (T1–T5): Uniqueness of the Jeffreys prior as a Diff⁺- invariant half-density on the binary Fisher-Rao manifold (T1). Closed-form Thomas-Wigner rotation angle for sequential binary qubit measurements (T2). SLD saturation theorem with explicit mixed-state tilt formula tan β = b(1−r²)/a (T3). Uniqueness of the Gudermannian as the arclength bridge between Bures and Beltrami-Klein metrics (T4). Closed-form isotropic retention ratio R(r) interpolating from 1/3 to 1/2 (T5). Part B — Observer Limits (T6–T7): Lawvere fixed-point obstruction proving no finite observer can reconstruct the full γ² field (T6). Energy-precision uncertainty bound E·Var(θ̂) ≥ kT ln 2 / γ²(V) with distinguished Planckian operating point at V_P = √(1−ln 2) (T7). Part C — Symmetry and Classification (T8–T11): Möbius form-invariance of the conformal equivalence (T8). Classification of unsharp binary qubit effects by visibility (T9). Modular flow as imaginary-time SL(2,ℂ) boost with spinor rapidity ζ = 2itη (T10). SLOCC covariance of single-qubit visibility via Einstein addition (T11). Part D — Quantum Gravity (T12–T13): Scaling correspondence between holographic subregion-CV complexity and Fisher information under boost, with dimension-specific constants κ_d (T12; identity form κ_d = 1 stated as conjecture). γ² Page curve for black hole evaporation (T13; proof sketch). Part E — Partial Result (T14): Partial result deriving 3+1D spacetime signature from SL(2,ℂ) qubit measurement symmetry via exceptional isomorphisms, with explicit gap acknowledged. Complete proofs are provided for T1 through T11. T12 and T13 are proof sketches. T14 is a partial result with an explicit gap acknowledged. Each theorem is intended for subsequent individual journal submission; four companion papers (Bayesian-geometric, Lorentz kinematics, observer thermodynamics, symmetry-holography) are in preparation. This record establishes priority on the theorems as a collection. Related records:Anchor preprint: DOI 10.5281/zenodo.19363449Cross-domain applications: DOI 10.5281/zenodo.19545786
Fourteen theorems on the algebraic structure of binary quantum measurement, built on the identity I(V) = γ²(V) = 1/(1 − V²), where I is the classical Fisher information of a binary measurement with visibility V = 2p − 1 and γ is the Lorentz factor of special relativity. Part A (T1–T5): internal structure. Uniqueness of the Jeffreys prior π_J(V) = γ(V)/π under Diff₊ invariance (T1). Closed-form Thomas–Wigner rotation for sequential binary measurements (T2). SLD saturation of the quantum Cramér–Rao bound (T3). Uniqueness of the Gudermannian bridge between hyperbolic and spherical Fisher–Rao geometries (T4). Closed-form mixed-state retention R(r) interpolating from 1/3 to 1/2 (T5). Part B (T6–T7): observer–manifold theorems. Futility theorem via Lawvere's fixed-point theorem: no embedded observer can surjectively reconstruct the γ² field (T6). Energy-precision uncertainty E·Var(θ̂) ≥ kT ln 2 / γ²(V), saturating Landauer at V = 0 (T7). Part C (T8, held): dimensional selection of 3+1D spacetime from exceptional isomorphisms, with explicit gap acknowledged. Part D (T9–T12): symmetry and classification. Form-invariance of the conformal equivalence under Möbius action (T9). Two-outcome binary qubit effect classification via 4γ²(V) (T10). Modular flow as SL(2,ℂ) boost at imaginary rapidity (T11). SLOCC covariance γ²(V') = γ²(V)·γ²(ξ)·(1+Vξ)² (T12). Part E (T13–T14): quantum gravity connections. Holographic subregion complexity equals Fisher information under boost (T13, proof sketch). γ² Page curve for black hole evaporation (T14, proof sketch). Complete proofs for T1–T7 and T9–T12. T8 presented with scope limitations. T13 and T14 presented as proof sketches. Mathematical companion to: B.G. Srivats, "Fisher Information Is the Squared Lorentz Factor," Zenodo DOI 10.5281/zenodo.19363449 (2026) B.G. Srivats, "From Measurement to Reality," Zenodo DOI 10.5281/zenodo.19486140 (2026) Builds on independently established work by Burns–Greenfield–Dressel (QSMF 13:10, 2026) and Fullwood–Vedral–Guzmán-González (arXiv:2604.07471, 2026). Each theorem is intended for subsequent individual journal publication; this record establishes priority on all fourteen as a collection.
The paper has two components. Parts I–IV develop a conditional operational theory of reservoir-assisted cooling and exact reset at the level of channels; Part V is a self-contained Hamiltonian-level case study of exact reset embeddings in a D1–D5 CFT reservoir. The two notions of “exact reset” are different and are kept distinct throughout. We separate three logically distinct questions in reservoir-assisted cooling: what the reservoir entropy implies thermodynamically, which low-temperature ancillas are accessible, and what extra dynamical resource exact ground-state preparation needs. Convex microcanonical entropy is neither sufficient nor necessary for a microscopic cooling operation; it is a thermodynamic route to an ancilla supply, under a stated local-Gibbsian hypothesis. For a resonant qubit target we prove that every energy-conserving collision with a qubit ancilla acts as p' = p + s(q − p), 0 ≤ s ≤ 1, so cooling to error ε is possible exactly when ancillas with excited population at most ε can be supplied. We then remove the two-level restriction: for an arbitrary energy-incoherent sink, within the stated collision model, the least reachable excited population is a sector-wise majorization (sorting) problem with an explicit closed-form solution. Its consequences are: (a) a cooling criterion: a sink can cool a target of population p if and only if some pair of its levels one target gap apart has population ratio below p/(1−p); (b) a Gibbs sink at any finite temperature leaves the exact floor min{p, (1−p)e^{−β E_sys}} > 0, and this floor is stable under arbitrary sequences of fresh sinks at the same temperature (the sequence extension is proved by a concavity lemma); (c) the floor is a single-temperature statement: a hot and a cold thermal sink used together cool every p ∈ (0,1), and iterating fresh pairs drives p → 0 with no work store, measurement or record, while sequential single-sink collisions already reach n̄_c / (1 + n̄_c + n̄_h); (d) sharpness of the energy support, or one classical record of entropy h_2(p), is what buys exactness in finitely many steps. Exact reset has two independent resource obstructions in the stated model. The optimal residual excitation of any energy-conserving reset is the sink weight on directions that lack spectral room (the room floor), with a criterion for measurement-free exact reset; against limited control, any circuit of m gates with rank(G − I) ≤ ρ leaves the target excited with probability at least the sink-spectrum tail beyond ρm, so, within this gate model, the number of gates needed for exactness is at least the corresponding tail rank divided by ρ, with the operational integer requirement expressed by the ceiling where a finite target error is specified. Within the shell-ancilla model, an explicit dimension requirement dim ≥ 1/ε follows, with the corresponding bound attained by the stated construction. The room floor and the rank–error bound are energy-conserving, sector-wise and gate-rank refinements of the Ticozzi–Viola purification bound, and are presented as such. We also give a conditional zero-designated-work SWAP construction with N = O(log log(1/ε)) collisions for a quadratic-entropy family, a dimension-counting reset criterion with an exact ladder-sink cost–error curve, an error budget for measurement–feedback completion, and a finite birth–death noise model with a positive spectral gap. Black holes, Na⁺_147 nanoclusters, structured-vacuum engines and Casimir experiments are treated as delimited case studies, not demonstrations. The contribution is a conditional operational characterisation with falsifiable requirements; it is not a claim that the third law has been circumvented. Finite instances of the principal formulas were checked by exact arithmetic and numerical sampling (random energy-conserving unitaries against the closed forms, and exact evaluation of tabulated values; Section 27); these checks are consistency tests, not substitutes for the proofs. Part V. The case study proves two conditional obstructions to exact spectral reset embeddings in a D1–D5 CFT reservoir. The first is a sector-specific capacity bound: under explicit component-string, single-strand, graded-orbifold and constant-character hypotheses, the maximal-left-charge Ramond-ground-state sector has dimension 4N, so a larger source cannot embed into it. The second is a finite-dimensional perturbative criterion: for an exactly degenerate source block transported by a regular family, the second-order effective Hamiltonian must act as a scalar on the transported block, equivalently the block must lie in a single second-order eigenspace, which gives an eigenspace-multiplicity bound for a prescribed target sector. At level four, under an explicit Hermiticity and perturbative-matching hypothesis, fifteen long-multiplet primaries with distinct second-order lifts give a fixed-label non-scalar target block. All obstructions are conditional and local, no universal no-go theorem for the full D1–D5 Hilbert space is claimed, and no microscopic reset dynamics are constructed.
Faist, Berta and Brandão showed that n uses of a time-covariant quantum channel cost, to leading order, n times its thermodynamic capacity, when the device may collect all inputs before it releases any output. Many devices cannot wait: they must release each output before the next input arrives. This paper shows that, for devices built from energy-conserving dynamics and heat baths, this can cost extra work, but only for quantum channels, and determines exactly how much. Real-time work law. For a time-covariant channel the real-time work per use is a maximum over inputs of an entropy change plus an energy change, with one extra term: the least correlation an implementation must leave between each output and what stays in the device. Below this rate, with thermal hardware and deterministic work, the worst-case error of every real-time device tends to one. Only quantum channels pay. Classical channels, including full reset, pay no surcharge. Partial reset of a qubit pays one at every temperature, and the Werner–Holevo qutrit channel pays kT ln 3 per use, against essentially nothing in batch. What is free, and undecidability. In real time a channel costs nothing exactly when it is a limit of thermal operations, and no algorithm decides which channels these are, even in a fixed dimension. Clocks. If the battery holds no phase reference of its own, a clock that must come back exactly cannot run a channel that is not time-covariant; one that may come back slightly changed, with its actual mean energy and entropy refunded, runs every channel at the same rate, and for a gate the heat baths must reach energies that grow faster than the number of uses. All rates here are optimal asymptotic work rates at vanishing error over the complete interaction, with hardware allowed to grow; where a controller comes back only approximately, its actual mean energy and entropy are also refunded up to sublinear changes. This record archives the manuscript, its TeX source and its machine checks (Python, and Lean with Mathlib). The manuscript is the authority for exact statements and hypotheses; the verification notes list what is checked by machine and what is proved only in the text. How the work was done, including the use of AI models, is described in the manuscript. This paper is one of four on the thermodynamics of time order: The work cost of answering in real time (https://github.com/Apsiape/answering-in-real-time); The price of keeping time (https://github.com/Apsiape/price-of-keeping-time); The price of time order (https://github.com/Apsiape/price-of-time-order). Scoped licenses: the manuscript, PDF and TeX source are licensed under Creative Commons Attribution 4.0 International (CC-BY-4.0). The software and machine-readable verification artifacts are additionally available under the MIT License. See RIGHTS.md in the archive. The aggregate Other (Open) category represents this mixed-license package.
Quantum error correction is priced in combinatorial currency — rate, distance, threshold — while the physical cost of performing correction goes uncounted. Every cycle of active (measurement-based) error correction erases information: syndrome extraction, majority voting, and ancilla re-initialization each reset redundancy, and Landauer's principle prices each erasure at no less than kT·ln2 per bit. This paper derives the resulting thermodynamic floor for correction overhead — (n−k)/k · kT·ln2 per logical qubit per round for an [[n,k]] code — verifies its scaling across code families (linear for repetition, quadratic for surface, constant for constant-rate), and applies the JPCUB joules-per-correct-answer metric to rank correction architectures. A two-level nested (tree-structured) code is compared with flat Hamming codes of equal rate on a clustered NAND-like channel: hierarchical decoding cuts the per-round erasure count by a factor of 1.6 to 3, while the naive construction pays a residual-error penalty — a partial null that leaves the floor claim intact and defines the protocol for an industrial flash-memory test. Biological systems that run robust quantum processes without correction (photosynthetic energy transfer, radical-pair magnetoreception) show the floor is an architecture choice: structure prepays in capital energy what correction pays in operating erasures. Autonomous and dissipative correction is identified as the boundary of the claim. A closing section documents the 2026 quantum-algorithms-and-QEC curriculum snapshot: the energy bill the paper prices is absent from the field's own teaching materials as of 2026-08-26.