Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Boltzmann Brain

Hutan Ashrafian

Published Nov 1, 2026• 0 citations
Publisher

Abstract

A quantum Boltzmann brain would arise if a fluctuation assembled an observer whose information processing used quantum switches, in which the order of physical operations is coherently controlled. A comparison with conventional substrates must account for both the assigned computation and the probability that the assembled apparatus can sustain it. I develop this comparison for a network distinguishing unknown commuting from anticommuting operations. With one invocation of each operation, an exact certificate bounds single-task fixed-order success by 11/12 for a specified finite ensemble. With an answer committed before each fresh task, the bound extends to networks retaining arbitrary quantum memory and identifies reliability requirements that the switch can satisfy but the matched fixed-order architecture cannot. For a shared fluctuating phase, a finite execution schedule also gives a lower bound on completed-batch success, including the probability that the reliable episode persists; an explicit example exceeds the causal upper bound. The network’s reliability region links residual order information, tolerated errors and phase correlations to both occupation and duration. With a fixed error budget, a fixed number r of phase coordinates and inverse-size visibility loss below the feasibility threshold, occupation scales as N^{-r/2}, while Brownian noise imposes an exponential penalty for sustaining a fixed duration as the number of outputs N grows. For one common phase with finite frequency-correlation time, fixed survival quantiles instead scale as N^{-1/2}. Incorporating these operational probabilities into a common thermal formation model yields a crossover criterion for the assembly saving required to offset the loss of reliable operation. The resulting theory makes a coherent-order contribution to fluctuation-observer comparisons calculable, conditional on the complete apparatus, its noise law and the functional requirements assigned to an observer.

AI Summary

The paper asks how coherent control of operation order could affect comparisons between fluctuation-assembled observers, once both apparatus formation and reliable computation are included. It models a “quantum Boltzmann brain” using quantum switches to distinguish unknown commuting from anticommuting operations, rather than specifying a general model of cognition. For a specified finite ensemble and one invocation of each operation, an exact certificate bounds fixed-order single-task success by $11/12$. Requiring an answer before each fresh task extends the bound to networks with arbitrary retained quantum memory. This yields reliability requirements achievable by the switch but not by the matched fixed-order architecture. For a shared fluctuating phase, a finite execution schedule supplies a lower bound on completed-batch success that includes the probability that the reliable episode persists; an explicit example exceeds the causal upper bound. The noise analysis relates residual order information, error tolerance and phase correlations to the frequency and duration of reliable operation. With fixed error budget, $r$ phase coordinates and inverse-size visibility loss below a feasibility threshold, occupation scales as $N^{-r/2}$ for $N$ outputs. Brownian phase noise produces an exponential penalty for maintaining a fixed duration as $N$ grows; for one common phase with finite frequency-correlation time, fixed survival quantiles instead scale as $N^{-1/2}$. A common thermal formation model gives a crossover criterion for assembly savings to compensate for unreliable operation. These conclusions are conditional on the complete apparatus, noise law and assigned observer requirements. Only the abstract was available for this summary.

No sign of AI-generated textUnclear noveltyStrong assumptions

Written by gpt-6.1-sol from the abstract only. Automated: it can be wrong.

DOI
10.5281/zenodo.23862736

Related papers

The Subordinator Renormalization Problem: When Markovian Error Models Misidentify Quantum Memory

Marcos Eduardo Elias Eliashberg Elias

A quantum processor is controlled through a sequence of operations distributed across time. Its reliability therefore depends on more than the decay observed when the device is left undisturbed. Environmental correlations, stochastic timing, intervention history, acceptance rules, and the observable being computed can all change which errors matter and which protection strategy is justified. The Subordinator Renormalization Problem examines this dependence through an integrated treatment of stochastic clocks, fractional dynamics, multi-time quantum processes, task-specific protection, and finite-sample certification. Its central question is precise: how can temporal resolution be changed and environmental memory compressed while preserving the predictions required by a specified quantum task, including the effects of permitted interventions and their full physical cost? Scientific motivation Coherence time, average gate fidelity, qubit count, and scalar measures of non-Markovianity characterize different aspects of a quantum device. They do not individually determine whether a particular computation can deliver a reliable answer within a given resource budget. A reduced model may reproduce uncontrolled relaxation while omitting correlations that become consequential under pulses, measurements, resets, or subsequent gates. This manuscript investigates the information that must survive a reduction of the noise description. It develops task-sufficient memory as an operational requirement: two process descriptions may be treated as equivalent only when they preserve the declared output expectations, acceptance probabilities, and costs for every allowed future continuation. Stochastic clocks and fractional quantum dynamics The mathematical framework connects Lévy subordinators, Bernstein functions, inverse stable clocks, renewal processes, Caputo fractional derivatives, and Mittag–Leffler relaxation with completely positive quantum dynamics. A central distinction concerns direct and inverse time changes. Direct Bochner subordination of a quantum dynamical semigroup can preserve the semigroup composition law while modifying its generator. An inverse stable clock generally produces a fractional evolution family without that composition law. Fractional powers of generators and fractional derivatives in physical time consequently represent different constructions and cannot be interpreted interchangeably. The manuscript also separates a change of time units from a physical change of the clock law. It derives an exact scaling identity within a fixed stable family and specifies the dimensions of the corresponding relaxation parameter. This identifies what scale covariance establishes and what would require additional evidence of physical control over the environment. The clock-reset problem For inverse stable relaxation, uninterrupted evolution and evolution with an independently renewed hidden clock generally yield different predictions. The paper derives a short-time expansion quantifying the difference between the coherence multiplier after uninterrupted evolution for twice a given duration and the product obtained from two independently renewed intervals. This result makes an otherwise hidden modeling assumption experimentally meaningful. A reset assumption changes the predicted observable response. Whether a real operation renews the relevant environmental variables must therefore be part of the physical model. The analysis includes closed-form calculations for the half-order Mittag–Leffler relaxation, checks of scale covariance, and verification of the deterministic-clock limit. Identical decoherence curves and different control responses An explicit Gaussian dephasing construction provides a separate identification counterexample. A continuum of noise processes produces exactly the same uncontrolled quantum channel at every time, while displaying different responses to spin echo. The entire family has zero Breuer–Laine–Piilo backflow in its uncontrolled reduced dynamics. Nevertheless, its temporal correlations determine whether an echo helps or harms once pulse imperfections are included. The construction shows why uncontrolled channel information alone can be insufficient for an intervention-dependent decision. The relevant distinction is operational: noise processes that look identical during idle evolution can require different control choices. The Gaussian construction and the inverse stable clock analysis are distinct models. Together, they expose complementary requirements on a predictive description, without identifying either construction as a universal microscopic model of a quantum device. Task-sufficient representations and mathematical guarantees The paper formulates exact equivalence of multi-time processes relative to a specified family of interventions, terminal observables, acceptance rules, and resource costs. For a finite linear family, it characterizes the corresponding task quotient and establishes its minimal dimension within linear encoders admitting exact recovery of the contract predictions. Approximate reductions are treated through explicit stability bounds. These bounds show how errors in unnormalized output moments, acceptance probabilities, and attempt costs propagate into conditional expectations and cost per accepted outcome. Low acceptance can amplify a small modeling error and erase an apparent resource advantage. A robust-selection result identifies the feasibility margins required when choosing a policy from approximate predictions. The framework thereby connects process reduction to a concrete accuracy requirement. Finite-sample certification and resource accounting The manuscript derives simultaneous finite-sample certificates for conditional task bias and expected cost per accepted outcome. The guarantees remain valid after data-dependent selection within a fixed finite candidate family, under the stated assumptions of independent reset attempts, bounded observations and costs, and an independently trusted ideal reference. The accounting includes rejected attempts and distinguishes systematic task bias from statistical sampling uncertainty. It also charges characterization, compilation, classical computation, and revalidation to the total resource objective. This distinction matters because a nominal reduction in the cost of one execution can require an unaffordable calibration campaign. A useful controller must improve the complete calculation at matched task accuracy and confidence. Reproducible numerical investigation A classical numerical study evaluates ten pulse policies across three correlation regimes and two contracted observables. The calculations include analytic population predictions, Gaussian trajectory sampling, density-matrix consistency checks, and repeated finite-shot calibration experiments. The results exhibit task-dependent protection choices: a sequence beneficial for one observable can introduce unnecessary error for another. They also distinguish the absence of a certified policy from a general claim that no feasible control exists. Conventional calibrated Hahn echo and the corresponding two-pulse sequence match the best control performance in this benchmark. The study establishes identification and certification results within its declared models; scalable compression, hardware advantage, and reductions in fault-tolerance overhead remain open research objectives. Meaning of the subordinator renormalization problem The title names an operational research problem: construct a change of temporal resolution together with a compressed memory representation and a consistent update rule that preserve all contracted predictions under the permitted controls. The challenge includes causality, complete positivity where applicable, normalization, conditional updates, approximation error, and total resource cost. A small collection of fitted moments is insufficient unless these properties can be maintained through subsequent interventions. The manuscript uses renormalization in the sense of scale change and retention of operationally relevant information. It formulates the conditions a useful reduction must satisfy rather than claiming a completed Wilsonian flow or a new universality class. Relevance and readership The work is intended for researchers in quantum computing, open quantum systems, quantum control, noise characterization, quantum error correction, stochastic processes, fractional calculus, and mathematical model reduction. Its broader engineering relevance is the connection between a model’s predictive sufficiency and the reliable computational output obtained for the resources consumed. The proposed research direction is to identify physical families in which the memory relevant to a useful task can be represented, learned, and updated more efficiently than a full process description. Manuscript contents Version 2.0 comprises 23 pages, four figures, four propositions, one corollary, a finite-sample certification theorem, mathematical appendices, a glossary of 47 terms, and 49 bibliographic references. The bibliography covers stochastic clocks and fractional analysis, quantum dynamical semigroups, environmental memory, process tensors, noise spectroscopy, control, fault tolerance, and statistical certification. About the author Dr. Marcos Eduardo Elias is a Brazilian engineer, mathematician, computer scientist, and entrepreneur based in São Paulo. He is Chairman of Instituto Ramanujan and works with Holosystems on quantum algorithms, stochastic modeling, and the connection between mathematical research and physical computation. His interests include open quantum systems, adaptive quantum–classical optimization, cryptography, and decision-making under uncertainty. Acknowledgments The author gratefully acknowledges Holosystems Quantum Computing Systems for the institutional and intellectual setting in which the

•Nov 10, 2026•0 citations

Task-Sufficient Memory under Stochastic Clocks: Coarse-graining operators, fixed points, and finite-policy certification

Marcos Eduardo — Elias

What information about environmental memory must a quantum controller retain to guarantee a specified computational output? This preprint formulates that question in terms of task-sufficient process representations, intervention-valid predictions, stochastic clock laws, and explicit resource accounting. The central requirement is to preserve the outcomes and costs of the permitted decisions, with a stated accuracy contract and a finite-sample certificate. The paper connects two complementary lines of analysis. An operational construction studies Gaussian dephasing and controlled qubit tasks. A separate stochastic-clock analysis studies direct and inverse time changes, fractional relaxation, and the information that temporal coarse graining must transport. These constructions address related modelling questions but are not identified as a single microscopic noise model. The main elements are: Identical uncontrolled channels, different controlled responses. A continuum of Gaussian phase processes has the same uncontrolled coherence at every time and zero Breuer-Laine-Piilo backflow, yet different spin-echo responses. The construction shows why an uncontrolled channel family alone can fail to determine an intervention-dependent control decision. Task-sufficient equivalence and resource contracts. The manuscript defines a contract functional collecting accepted-output moments, acceptance probabilities, and physical costs over a declared policy family. Its finite linear task quotient identifies distinctions relevant to those predictions. Approximate sufficiency is accompanied by stability bounds that expose the sensitivity of conditional guarantees to low acceptance probabilities and small feasibility margins. Simultaneous finite-policy certification. Conservative confidence bounds certify conditional task bias and expected cost per accepted outcome after selection among a fixed, finite set of candidate policies. The assumptions include independent reset attempts, bounded observations and costs, and a trusted ideal reference. Failure to certify a candidate is explicitly distinguished from proof that no feasible physical policy exists. An explicit coarse-graining framework for stochastic clocks. The proposed decorated phase space records the process, permitted policy family, observable set, and clock law. The clock component transports stable laws under their natural scaling and relates domains of attraction to regular variation of waiting-time tails. Within the stated two-parameter clock-and-coupling family, the relaxation-rate direction scales with eigenvalue c^alpha. These clock results are placed in the established probabilistic renormalization literature; they do not establish hyperbolicity or convergence for the full decorated operator. A reset-sensitive fractional-relaxation calculation. Direct subordination of a quantum dynamical semigroup is distinguished from inverse-stable time change. For the latter, the paper compares uninterrupted evolution with independent renewal of the hidden clock and relevant environment. At half order and dimensionless rate one, the exact erfcx representation gives the short-time defect Delta(h) ~ 0.660989212585294 sqrt(h). The difference concerns the declared reset protocols, rather than a general assertion that every physical gate resets its environment. The reported classical benchmark uses ten candidate policies with explicit pulse depolarisation and separate X- and Z-expectation contracts. At the quasistatic endpoint, midpoint echo increases average identity-gate fidelity from 0.789293 to 0.990050. The fidelity crossover near r = 0.0467883 is distinct from the stricter X-task feasibility threshold r >= 0.9688074. For the selected Z-task input, dephasing is harmless and unnecessary echo pulses reduce the expectation. Conventional calibrated echo matches the best tested control performance; calibration, sampling, rejected attempts, and amortisation remain part of the resource account. Two questions are isolated as conjectures: boundedness of the task-quotient dimension along the coarse-graining orbit, and rigidity of the task quotient as a complete contract invariant. The manuscript specifies falsifiable numerical and experimental tests, including rescaled relaxation-profile collapse and finite tests of quotient-rank growth. It establishes no hardware advantage, scalable task-compression theorem, logical error-rate improvement, or error-correction overhead reduction. This illustrated version 2.0 contains 30 pages, four scientific figures, derivation and reproduction appendices, a methodological comparison with renormalization in one-dimensional dynamics, a glossary, and 58 references. The manuscript is dated 12 November 2026 and supersedes version 1.0 of 10 November 2026. The four figures show the uncontrolled/control-response contrast, task-dependent protection, finite-policy certification alongside dimensionless fractional relaxation, and the exact scalar clock-reset defect.

•Nov 13, 2026•0 citations

Causal Residual Probability Expression and Gauge-Compatible Memory Geometry

Charles Bruce Cook

Causal Residual Probability Expression and Gauge-Compatible Memory Geometry develops a self-contained framework for distinguishing available probability structure from its capacity to sustain physical expression through a specified channel. Its central contribution is to separate two requirements that are often treated together: the amount of active structure available and the persistence of relationships across separated times, positions, configurations, or scales. The paper constructs a normalized expression-capacity diagnostic from these requirements while keeping it distinct from probability itself, event occurrence, energy, force, amplitude, and detector response. Beginning with classical probability and covariance, the manuscript identifies two independent failure boundaries: the absence of active extent and the absence of relational persistence. It establishes, under stated regularity assumptions, how a residual that respects both boundaries must incorporate both requirements. Within an explicitly restricted minimal-structure class, this leads to a uniquely determined normalized diagnostic. The paper carefully separates this formal result from the physical expression postulate that gives the diagnostic its interpretation. That interpretation remains conditional on the completeness of the chosen channel and is subject to independent testing; it is not presented as a consequence of covariance analysis alone. A substantial methodological contribution is the specification of how the framework can be measured without introducing target-dependent definitions. The manuscript sets out covariance normalization, treatment of changing active dimensions, compatible comparisons between separated observations, and estimation from repeated matched realizations. It distinguishes properties of an ensemble from properties that can legitimately be assigned to individual configurations. It also requires retention of the underlying correlation record, recognizing that a single expression-capacity score cannot recover phase, orientation, internal structure, or a unique dynamical history. Preregistration, independent calibration, uncertainty reporting, and withheld evaluation are integral parts of the proposed protocol. The paper extends this construction to persistence across scales. It describes how matched microscopic histories can be followed through successive coarse-graining steps using a common feature space and declared identity-transport rules. This makes an important distinction between survival at each adjacent scale and survival across an entire scale sequence. Worked counterexamples demonstrate that repeated local success can coexist with cumulative failure. The resulting scale framework is explicitly application-dependent: its physical implementation requires a specified feature map, renormalization procedure, and retained active sector. To connect expression diagnostics with dynamics, the manuscript incorporates established exact projection methods into a gauge-compatible reduced-response architecture. It explains how degrees of freedom excluded from a chosen description return through retarded memory, while separating exact projection identities from subsequent approximations and physical interpretations. Gauge-invariant observables and appropriately transported comparisons are used to prevent changes of gauge frame from being mistaken for physical loss of persistence. The paper also distinguishes persistent correlation from genuine dynamical memory and distinguishes temporal ordering from relativistic locality. Within this architecture, the manuscript develops conditional applications to weak and strong interaction channels. For weak channels, it identifies the response conditions required for screened spatial behavior and separates screening range from detector thresholds and independently measured mediator masses. For strong channels, it specifies the additional requirements for stable transverse localization, surviving longitudinal support, finite tube energy, and a contribution to stored energy that grows with source separation. It treats Wilson-loop observables, string breaking, and enlargement of the relevant channel description as essential consistency checks. These constructions retain established electroweak and quantum chromodynamic content rather than claiming to derive particle properties or gauge structure from the diagnostic alone. The spectral analysis distinguishes the classical diagnostic from proposed expression operators and their action on physical states. It explains why positive expression capacity for every individual state does not, by itself, establish a common positive lower bound across all physical excitations. The manuscript formulates a conditional spectral-gap theorem and identifies the independent closure and energy-comparison requirements needed to apply it. It further separates intrinsic mass gaps from finite-volume effects, lattice cutoffs, thermal screening, material screening, and finite causal-history effects. Overall, the paper provides a structured theoretical and operational research programme linking probability-domain diagnostics, cross-scale persistence, gauge-compatible memory, and conditional field and spectral consequences. Its achievements include explicit definitions, formal results within declared assumptions, measurement protocols, worked counterexamples, control and falsification matrices, and clearly stated proof obligations. It does not claim a completed fundamental theory, an empirical confirmation of the framework, a derivation of observed gauge groups or numerical couplings, or a solution to the Yang–Mills mass-gap problem. Its intended contribution is a testable architecture that makes those remaining tasks precise and prevents conditional results from being presented as completed physical explanations.

•Nov 12, 2026•0 citations

On the Emergence of Quantum Boltzmann Fluctuation Dynamics near a Bose–Einstein Condensate

Thomas Chen, Michael Hott

arXiv:2106.03825•Journal of Statistical Physics•Apr 4, 2023•7 citations

Distinct stability laws for Wigner entropy and non-Gaussian structure

Zixuan He

Loss can restore the vacuum entropy bound without erasing non-Gaussian structure. This paper determines when an entropy statement justifies a coherent-state approximation, when non-Gaussian structure survives optical loss, and what mode and source-request budgets are needed to use that structure. The results give quantum-optics researchers separate criteria for entropy recovery, state approximation, Gaussian concentration and conversion to a specified output. Version 1.5 — revised 10 October 2026. The 96-page PDF contains the main article, Methods, Supplementary Information and references. This revision connects the exact loss boundary to a mode-uniform near-equality certificate, finite-data validation, a conversion-cost lower bound for the same thermally repaired source, and an exact equal-entropy comparison of sources with different conversion-cost exponents. The central figures are updated accordingly. 1. Near-vacuum states can have an unbounded entropy deficit Write $\nu_m$ for the $m$-mode vacuum and define $\Delta_{\alpha,m}(\rho)=H_\alpha(W_{\nu_m})-H_\alpha(W_\rho)$, using natural logarithms; $H_1$ is Shannon entropy. Positive deficit means entropy below vacuum. We construct physical Wigner-positive states satisfying, simultaneously, $$E_m=\operatorname{Tr}(N_m\rho_m)\to0,\qquad \tfrac12\|\rho_m-\nu_m\|_1\to0,\qquad d_{\mathcal F_m}(\rho_m)\to0,\qquad \Delta_{1,m}(\rho_m)\to+\infty.$$ Here $\mathcal F_m$ is the trace-norm-closed convex hull of Gaussian states and $d_{\mathcal F_m}$ uses half the trace norm. Thus proximity to the entire Gaussian model does not control Wigner entropy uniformly in mode number. Independent weak modes amplify a one-mode entropy effect while their total excitation vanishes. For the same sequence, half loss instead gives $-E_m\le\Delta_{1,m}(\mathcal L_{1/2}^{\otimes m}\rho_m)\le0$, so the entropy difference from vacuum tends to zero. 2. The exact pure-loss recovery boundary For Wigner-positive inputs, intensity transmissivity $\eta$ and any fixed positive total input-energy budget $E$, the sharp threshold is $$\eta_c(\alpha)=\begin{cases}1/2,&0<\alpha\le1,\\ \alpha/2,&1<\alpha<2.\end{cases}$$ With $\mathcal P_{m,E}=\{\rho:W_\rho\ge0,\ \operatorname{Tr}(N_m\rho)\le E\}$, $$\sup_{m\ge1}\sup_{\rho\in\mathcal P_{m,E}}\Delta_{\alpha,m}(\mathcal L_\eta^{\otimes m}\rho)=\begin{cases}0,&\eta\le\eta_c(\alpha),\\+\infty,&\eta>\eta_c(\alpha).\end{cases}$$ The recovery statement includes the boundary itself and is independent of mode number. Half loss also restores vacuum majorization for arbitrary density operators. For $\alpha\ge2$, established Wigner-norm bounds give the vacuum entropy bound at every transmissivity for Wigner-positive outputs. These statements distinguish a universal guarantee from the earlier sign crossing that a particular source may exhibit. 3. Near equality gives a certificate for the entire input For an arbitrary input $\rho$, define the half-loss output Shannon excess $$s(\rho)=h(W_{\mathcal L_{1/2}^{\otimes m}\rho})-m(1+\ln\pi)\ge0.$$ The half-loss identity identifies this quantity with the input's total Wehrl entropy excess. Applying mode-uniform Wehrl stability yields $$\inf_a\|\rho-|a\rangle\langle a|\|_1^2\le\frac{64}{\ln2}\,s(\rho).$$ The bound controls the full input state, with no energy or photon-support restriction. One coherent reference then controls every subsequent quantum channel and every unconditional measurement event. In particular, an event-probability error at most $\epsilon$ is guaranteed by $s\le(\ln2)\epsilon^2/16$. Conversely, a surviving output Gaussian-hull gap enforces $$s(\rho)\ge\frac{\ln2}{16}\,d_{\mathcal F_m}(\mathcal L_{1/2}^{\otimes m}\rho)^2.$$ Recovery of the inequality and proximity to equality therefore support different physical inferences: the former permits residual non-Gaussian structure, while the latter certifies a coherent-state approximation. 4. Surviving structure has mode and conversion costs A thermally repaired vacuum–three-photon source with per-mode occupation $c/m$ has total input energy tending to $3c$. Along the recovery boundary, its attenuated state obeys $$\liminf_{m\to\infty}d_{\mathcal F_m}(\widetilde\rho_{m,\eta_c})\ge c\eta_c^3\exp\{-c[1-(1-\eta_c)^3]\}>0.$$ At half transmission this lower bound is $g(c)=(c/8)e^{-7c/8}$. Starting from one complete block, Gaussian processing requires $\Theta(m)$ output modes to retain any fixed positive gap below this bound at success probability at least a fixed $p_0>0$. Gaussian ancillary states, adaptive Gaussian measurements, feedback, discarding and postselection are included. A distinct task requests fresh independent blocks of this same half-loss source to produce the one-mode target $\tau_*=(18|0\rangle\langle0|+6|1\rangle\langle1|+|2\rangle\langle2|)/25$ within half trace distance $10^{-6}$. Let $C_m$ be the infimum of expected complete-block requests divided by success probability, including all failed requests. For fixed $0<c\le1$, every achieving Gaussian protocol obeys the asymptotic lower bound $$\log C_m\ge\frac1{128}(m/c)^{1/3}-\log m-O(1).$$ This is a source-request lower bound; the optimal achievable cost for this source remains undetermined. The proof evaluates a curvature-controlled input certificate for the actual thermally repaired state and applies the Gaussian conversion theorem of the companion paper cited below. 5. Exactly equal entropy does not fix conversion cost For two separate two-mode quartic source families, their mixture probabilities can be adjusted so that their half-loss Shannon entropies are exactly equal. Under a common target, tolerance and failure-inclusive accounting, the inherited matching conversion laws become $$h(W_{\omega_A})=h(W_{\omega_B})=2(1+\ln\pi)+s,\qquad \log C_A(s)=\Theta(s^{-1/3}),\qquad \log C_B(s)=\Theta(s^{-1/2}).$$ The target tolerance is held fixed in these asymptotics. The delivered energies after entropy matching satisfy $E_A,E_B\sim s/2$. At exactly equal energy, the two excesses instead share $s_i(E)=2E-(35/8)E^2+O(E^3)$ and differ by $s_A(E)-s_B(E)=15E^3+O(E^4)$. Entropy alone therefore cannot select the cheaper source for a fixed output task. 6. Finite data and finite mode budgets Under a declared displaced-input photon-tail bound $\operatorname{Tr}[N\mathbf1_{N>K}\sigma_a]\le\tau_K$, trusted half loss and all-mode on/off detection with efficiency at least $\xi_{\min}$, the click probability $q$ gives $$s(\sigma)\le A_Kq+\tau_K,\qquad A_K=\frac{K}{1-(1-\xi_{\min}/2)^K}.$$ A one-sided binomial bound turns this into an entropy confidence certificate. An explicit undisplaced four-photon-cutoff example uses $K=4$, $\tau_K=0$, $\xi=0.8$ and $N=3{,}517{,}336$ independent validation blocks, accepting at most 41 clicks, to certify unconditional event error at most $0.05$ with false-acceptance probability at most $0.001$ and missed acceptance at most $0.001$ on the stated low-click alternative class. All vacuum results count; training, calibration and source heralding are separate costs. When coherent-state approximation alone is the task, the same click measurement supplies a stronger direct fidelity test. The paper also gives all-input finite-budget exclusions above the loss-recovery line. For example, at $E=1$, $\alpha=1.9$, $\eta=0.9505$ and $m=10^5$, the certified bound $\Delta_\alpha<0.06942$ rules out a target deficit of $0.1$ nat. A separate finite single-mode preparation model predicts positive Shannon deficit near $\eta=0.97$, negative deficit near $\eta=0.85$, and a Gaussian-hull witness above $4.4\times10^{-3}$ at half transmission, with explicit preparation, measurement-error and raw-trial budgets in the PDF. 7. Dimensional scales, a strict entropy floor and ORCS Near order two, put $\alpha=2-\delta$ and $L=\ln(1/\delta)$. For the maximum deficit $D_{m,E}$ at fixed total energy, $$D_{m,E}(2-\delta)=\Theta_{m,E}(\delta/L)\quad\text{for fixed }m,\qquad T_h(\delta,E)=\Theta_{E,h}(L/\delta),$$ where $T_h$ is the first mode number allowing a fixed positive deficit $h$. Beyond a sufficiently large fixed multiple of $L/\delta$, $D_{m,E}(2-\delta)=\Theta_E(m\delta)$. The manuscript separates proved sufficient fronts from necessary exit bounds; the sharp first-crossing coefficient remains open. At every fixed mode number, an energy-unrestricted strict Shannon floor also holds: $h(W_\rho)\ge m\ln(2\pi)+\varepsilon_m$ with $\varepsilon_m>0$ for all Wigner-positive states. The ordering-resolved coherence spectrum (ORCS) supplies an exact single-mode loss coordinate. With $\mathcal C_{r,k}$ denoting the ordering-weighted norm of photon-number-difference block $k$, $$\mathcal C_{r,k}(\mathcal L_\eta\rho)=\mathcal C_{T_\eta(r),k}(\rho),\qquad T_\eta(r)=1-\frac{1-r}{\eta}.$$ For vacuum–$n$-photon coherence and $1<\alpha<2$, $$\mathcal C_{1-\alpha/2}(\mathcal L_\eta|n\rangle\langle0|)=\left(\frac{2\eta}{\alpha}\right)^n.$$ This formula exposes the high-order coherence mechanism at the loss threshold; the universal recovery result is proved through the full nonlinear Wigner-norm inequality. Related papers and history The counterexample paper Wigner entropy below vacuum: physical counterexamples and stability limits expands arXiv:2609.13312v1, submitted on 10 September 2026. This stability paper develops the dimensional, loss-dependent and operational consequences. Its state-approximation and conversion interfaces use the companion results From phase-space entropy to coherent-state error: mode-uniform Rényi–Wehrl stability and Phase records control the conversion cost of non-Gaussian light. The mode-retention comparison connects to Limits to Gaussian concentration of non-Gaussian light.

•Sep 23, 2026•0 citations

The problem of Boltzmann brains and how Bohmian mechanics helps solve it

Roderich Tumulka

Most versions of classical physics imply that if the 4-volume of the entire space-time is infinite or at least extremely large, then random fluctuations in the matter will by coincidence create copies of us in remote places, so called “Boltzmann brains.” That is a problem because it leads to the wrong prediction that we should be Boltzmann brains. The question arises, how can any theory avoid making this wrong prediction? In quantum physics, it turns out that the discussion requires a formulation of quantum theory that is more precise than the orthodox interpretation. Using Bohmian mechanics for this purpose, we point out a possible solution to the problem based on the phenomenon of “freezing” of configurations.

The Ninth Marcel Grossmann Meeting•Jun 22, 2022•0 citations
A quantum Boltzmann brain would arise if a fluctuation assembled an observer whose information processing used quantum switches, in which the order of physical operations is coherently controlled. A comparison with conventional substrates must account for both the assigned computation and the probability that the assembled apparatus can sustain it. I develop this comparison for a network distinguishing unknown commuting from anticommuting operations. With one invocation of each operation, an exact certificate bounds single-task fixed-order success by 11/12 for a specified finite ensemble. With an answer committed before each fresh task, the bound extends to networks retaining arbitrary quantum memory and identifies reliability requirements that the switch can satisfy but the matched fixed-order architecture cannot. For a shared fluctuating phase, a finite execution schedule also gives a lower bound on completed-batch success, including the probability that the reliable episode persists; an explicit example exceeds the causal upper bound. The network’s reliability region links residual order information, tolerated errors and phase correlations to both occupation and duration. With a fixed error budget, a fixed number r of phase coordinates and inverse-size visibility loss below the feasibility threshold, occupation scales as N^{-r/2}, while Brownian noise imposes an exponential penalty for sustaining a fixed duration as the number of outputs N grows. For one common phase with finite frequency-correlation time, fixed survival quantiles instead scale as N^{-1/2}. Incorporating these operational probabilities into a common thermal formation model yields a crossover criterion for the assembly saving required to offset the loss of reliable operation. The resulting theory makes a coherent-order contribution to fluctuation-observer comparisons calculable, conditional on the complete apparatus, its noise law and the functional requirements assigned to an observer.
The paper asks how coherent control of operation order could affect comparisons between fluctuation-assembled observers, once both apparatus formation and reliable computation are included. It models a “quantum Boltzmann brain” using quantum switches to distinguish unknown commuting from anticommuting operations, rather than specifying a general model of cognition.
For a specified finite ensemble and one invocation of each operation, an exact certificate bounds fixed-order single-task success by 11/1211/1211/12. Requiring an answer before each fresh task extends the bound to networks with arbitrary retained quantum memory. This yields reliability requirements achievable by the switch but not by the matched fixed-order architecture. For a shared fluctuating phase, a finite execution schedule supplies a lower bound on completed-batch success that includes the probability that the reliable episode persists; an explicit example exceeds the causal upper bound.
The noise analysis relates residual order information, error tolerance and phase correlations to the frequency and duration of reliable operation. With fixed error budget, rrr phase coordinates and inverse-size visibility loss below a feasibility threshold, occupation scales as N−r/2N^{-r/2}N−r/2 for NNN outputs. Brownian phase noise produces an exponential penalty for maintaining a fixed duration as NNN grows; for one common phase with finite frequency-correlation time, fixed survival quantiles instead scale as N−1/2N^{-1/2}N−1/2.
A common thermal formation model gives a crossover criterion for assembly savings to compensate for unreliable operation. These conclusions are conditional on the complete apparatus, noise law and assigned observer requirements. Only the abstract was available for this summary.
A quantum processor is controlled through a sequence of operations distributed across time. Its reliability therefore depends on more than the decay observed when the device is left undisturbed. Environmental correlations, stochastic timing, intervention history, acceptance rules, and the observable being computed can all change which errors matter and which protection strategy is justified. The Subordinator Renormalization Problem examines this dependence through an integrated treatment of stochastic clocks, fractional dynamics, multi-time quantum processes, task-specific protection, and finite-sample certification. Its central question is precise: how can temporal resolution be changed and environmental memory compressed while preserving the predictions required by a specified quantum task, including the effects of permitted interventions and their full physical cost? Scientific motivation Coherence time, average gate fidelity, qubit count, and scalar measures of non-Markovianity characterize different aspects of a quantum device. They do not individually determine whether a particular computation can deliver a reliable answer within a given resource budget. A reduced model may reproduce uncontrolled relaxation while omitting correlations that become consequential under pulses, measurements, resets, or subsequent gates. This manuscript investigates the information that must survive a reduction of the noise description. It develops task-sufficient memory as an operational requirement: two process descriptions may be treated as equivalent only when they preserve the declared output expectations, acceptance probabilities, and costs for every allowed future continuation. Stochastic clocks and fractional quantum dynamics The mathematical framework connects Lévy subordinators, Bernstein functions, inverse stable clocks, renewal processes, Caputo fractional derivatives, and Mittag–Leffler relaxation with completely positive quantum dynamics. A central distinction concerns direct and inverse time changes. Direct Bochner subordination of a quantum dynamical semigroup can preserve the semigroup composition law while modifying its generator. An inverse stable clock generally produces a fractional evolution family without that composition law. Fractional powers of generators and fractional derivatives in physical time consequently represent different constructions and cannot be interpreted interchangeably. The manuscript also separates a change of time units from a physical change of the clock law. It derives an exact scaling identity within a fixed stable family and specifies the dimensions of the corresponding relaxation parameter. This identifies what scale covariance establishes and what would require additional evidence of physical control over the environment. The clock-reset problem For inverse stable relaxation, uninterrupted evolution and evolution with an independently renewed hidden clock generally yield different predictions. The paper derives a short-time expansion quantifying the difference between the coherence multiplier after uninterrupted evolution for twice a given duration and the product obtained from two independently renewed intervals. This result makes an otherwise hidden modeling assumption experimentally meaningful. A reset assumption changes the predicted observable response. Whether a real operation renews the relevant environmental variables must therefore be part of the physical model. The analysis includes closed-form calculations for the half-order Mittag–Leffler relaxation, checks of scale covariance, and verification of the deterministic-clock limit. Identical decoherence curves and different control responses An explicit Gaussian dephasing construction provides a separate identification counterexample. A continuum of noise processes produces exactly the same uncontrolled quantum channel at every time, while displaying different responses to spin echo. The entire family has zero Breuer–Laine–Piilo backflow in its uncontrolled reduced dynamics. Nevertheless, its temporal correlations determine whether an echo helps or harms once pulse imperfections are included. The construction shows why uncontrolled channel information alone can be insufficient for an intervention-dependent decision. The relevant distinction is operational: noise processes that look identical during idle evolution can require different control choices. The Gaussian construction and the inverse stable clock analysis are distinct models. Together, they expose complementary requirements on a predictive description, without identifying either construction as a universal microscopic model of a quantum device. Task-sufficient representations and mathematical guarantees The paper formulates exact equivalence of multi-time processes relative to a specified family of interventions, terminal observables, acceptance rules, and resource costs. For a finite linear family, it characterizes the corresponding task quotient and establishes its minimal dimension within linear encoders admitting exact recovery of the contract predictions. Approximate reductions are treated through explicit stability bounds. These bounds show how errors in unnormalized output moments, acceptance probabilities, and attempt costs propagate into conditional expectations and cost per accepted outcome. Low acceptance can amplify a small modeling error and erase an apparent resource advantage. A robust-selection result identifies the feasibility margins required when choosing a policy from approximate predictions. The framework thereby connects process reduction to a concrete accuracy requirement. Finite-sample certification and resource accounting The manuscript derives simultaneous finite-sample certificates for conditional task bias and expected cost per accepted outcome. The guarantees remain valid after data-dependent selection within a fixed finite candidate family, under the stated assumptions of independent reset attempts, bounded observations and costs, and an independently trusted ideal reference. The accounting includes rejected attempts and distinguishes systematic task bias from statistical sampling uncertainty. It also charges characterization, compilation, classical computation, and revalidation to the total resource objective. This distinction matters because a nominal reduction in the cost of one execution can require an unaffordable calibration campaign. A useful controller must improve the complete calculation at matched task accuracy and confidence. Reproducible numerical investigation A classical numerical study evaluates ten pulse policies across three correlation regimes and two contracted observables. The calculations include analytic population predictions, Gaussian trajectory sampling, density-matrix consistency checks, and repeated finite-shot calibration experiments. The results exhibit task-dependent protection choices: a sequence beneficial for one observable can introduce unnecessary error for another. They also distinguish the absence of a certified policy from a general claim that no feasible control exists. Conventional calibrated Hahn echo and the corresponding two-pulse sequence match the best control performance in this benchmark. The study establishes identification and certification results within its declared models; scalable compression, hardware advantage, and reductions in fault-tolerance overhead remain open research objectives. Meaning of the subordinator renormalization problem The title names an operational research problem: construct a change of temporal resolution together with a compressed memory representation and a consistent update rule that preserve all contracted predictions under the permitted controls. The challenge includes causality, complete positivity where applicable, normalization, conditional updates, approximation error, and total resource cost. A small collection of fitted moments is insufficient unless these properties can be maintained through subsequent interventions. The manuscript uses renormalization in the sense of scale change and retention of operationally relevant information. It formulates the conditions a useful reduction must satisfy rather than claiming a completed Wilsonian flow or a new universality class. Relevance and readership The work is intended for researchers in quantum computing, open quantum systems, quantum control, noise characterization, quantum error correction, stochastic processes, fractional calculus, and mathematical model reduction. Its broader engineering relevance is the connection between a model’s predictive sufficiency and the reliable computational output obtained for the resources consumed. The proposed research direction is to identify physical families in which the memory relevant to a useful task can be represented, learned, and updated more efficiently than a full process description. Manuscript contents Version 2.0 comprises 23 pages, four figures, four propositions, one corollary, a finite-sample certification theorem, mathematical appendices, a glossary of 47 terms, and 49 bibliographic references. The bibliography covers stochastic clocks and fractional analysis, quantum dynamical semigroups, environmental memory, process tensors, noise spectroscopy, control, fault tolerance, and statistical certification. About the author Dr. Marcos Eduardo Elias is a Brazilian engineer, mathematician, computer scientist, and entrepreneur based in São Paulo. He is Chairman of Instituto Ramanujan and works with Holosystems on quantum algorithms, stochastic modeling, and the connection between mathematical research and physical computation. His interests include open quantum systems, adaptive quantum–classical optimization, cryptography, and decision-making under uncertainty. Acknowledgments The author gratefully acknowledges Holosystems Quantum Computing Systems for the institutional and intellectual setting in which the
What information about environmental memory must a quantum controller retain to guarantee a specified computational output? This preprint formulates that question in terms of task-sufficient process representations, intervention-valid predictions, stochastic clock laws, and explicit resource accounting. The central requirement is to preserve the outcomes and costs of the permitted decisions, with a stated accuracy contract and a finite-sample certificate. The paper connects two complementary lines of analysis. An operational construction studies Gaussian dephasing and controlled qubit tasks. A separate stochastic-clock analysis studies direct and inverse time changes, fractional relaxation, and the information that temporal coarse graining must transport. These constructions address related modelling questions but are not identified as a single microscopic noise model. The main elements are: Identical uncontrolled channels, different controlled responses. A continuum of Gaussian phase processes has the same uncontrolled coherence at every time and zero Breuer-Laine-Piilo backflow, yet different spin-echo responses. The construction shows why an uncontrolled channel family alone can fail to determine an intervention-dependent control decision. Task-sufficient equivalence and resource contracts. The manuscript defines a contract functional collecting accepted-output moments, acceptance probabilities, and physical costs over a declared policy family. Its finite linear task quotient identifies distinctions relevant to those predictions. Approximate sufficiency is accompanied by stability bounds that expose the sensitivity of conditional guarantees to low acceptance probabilities and small feasibility margins. Simultaneous finite-policy certification. Conservative confidence bounds certify conditional task bias and expected cost per accepted outcome after selection among a fixed, finite set of candidate policies. The assumptions include independent reset attempts, bounded observations and costs, and a trusted ideal reference. Failure to certify a candidate is explicitly distinguished from proof that no feasible physical policy exists. An explicit coarse-graining framework for stochastic clocks. The proposed decorated phase space records the process, permitted policy family, observable set, and clock law. The clock component transports stable laws under their natural scaling and relates domains of attraction to regular variation of waiting-time tails. Within the stated two-parameter clock-and-coupling family, the relaxation-rate direction scales with eigenvalue c^alpha. These clock results are placed in the established probabilistic renormalization literature; they do not establish hyperbolicity or convergence for the full decorated operator. A reset-sensitive fractional-relaxation calculation. Direct subordination of a quantum dynamical semigroup is distinguished from inverse-stable time change. For the latter, the paper compares uninterrupted evolution with independent renewal of the hidden clock and relevant environment. At half order and dimensionless rate one, the exact erfcx representation gives the short-time defect Delta(h) ~ 0.660989212585294 sqrt(h). The difference concerns the declared reset protocols, rather than a general assertion that every physical gate resets its environment. The reported classical benchmark uses ten candidate policies with explicit pulse depolarisation and separate X- and Z-expectation contracts. At the quasistatic endpoint, midpoint echo increases average identity-gate fidelity from 0.789293 to 0.990050. The fidelity crossover near r = 0.0467883 is distinct from the stricter X-task feasibility threshold r >= 0.9688074. For the selected Z-task input, dephasing is harmless and unnecessary echo pulses reduce the expectation. Conventional calibrated echo matches the best tested control performance; calibration, sampling, rejected attempts, and amortisation remain part of the resource account. Two questions are isolated as conjectures: boundedness of the task-quotient dimension along the coarse-graining orbit, and rigidity of the task quotient as a complete contract invariant. The manuscript specifies falsifiable numerical and experimental tests, including rescaled relaxation-profile collapse and finite tests of quotient-rank growth. It establishes no hardware advantage, scalable task-compression theorem, logical error-rate improvement, or error-correction overhead reduction. This illustrated version 2.0 contains 30 pages, four scientific figures, derivation and reproduction appendices, a methodological comparison with renormalization in one-dimensional dynamics, a glossary, and 58 references. The manuscript is dated 12 November 2026 and supersedes version 1.0 of 10 November 2026. The four figures show the uncontrolled/control-response contrast, task-dependent protection, finite-policy certification alongside dimensionless fractional relaxation, and the exact scalar clock-reset defect.
Causal Residual Probability Expression and Gauge-Compatible Memory Geometry develops a self-contained framework for distinguishing available probability structure from its capacity to sustain physical expression through a specified channel. Its central contribution is to separate two requirements that are often treated together: the amount of active structure available and the persistence of relationships across separated times, positions, configurations, or scales. The paper constructs a normalized expression-capacity diagnostic from these requirements while keeping it distinct from probability itself, event occurrence, energy, force, amplitude, and detector response. Beginning with classical probability and covariance, the manuscript identifies two independent failure boundaries: the absence of active extent and the absence of relational persistence. It establishes, under stated regularity assumptions, how a residual that respects both boundaries must incorporate both requirements. Within an explicitly restricted minimal-structure class, this leads to a uniquely determined normalized diagnostic. The paper carefully separates this formal result from the physical expression postulate that gives the diagnostic its interpretation. That interpretation remains conditional on the completeness of the chosen channel and is subject to independent testing; it is not presented as a consequence of covariance analysis alone. A substantial methodological contribution is the specification of how the framework can be measured without introducing target-dependent definitions. The manuscript sets out covariance normalization, treatment of changing active dimensions, compatible comparisons between separated observations, and estimation from repeated matched realizations. It distinguishes properties of an ensemble from properties that can legitimately be assigned to individual configurations. It also requires retention of the underlying correlation record, recognizing that a single expression-capacity score cannot recover phase, orientation, internal structure, or a unique dynamical history. Preregistration, independent calibration, uncertainty reporting, and withheld evaluation are integral parts of the proposed protocol. The paper extends this construction to persistence across scales. It describes how matched microscopic histories can be followed through successive coarse-graining steps using a common feature space and declared identity-transport rules. This makes an important distinction between survival at each adjacent scale and survival across an entire scale sequence. Worked counterexamples demonstrate that repeated local success can coexist with cumulative failure. The resulting scale framework is explicitly application-dependent: its physical implementation requires a specified feature map, renormalization procedure, and retained active sector. To connect expression diagnostics with dynamics, the manuscript incorporates established exact projection methods into a gauge-compatible reduced-response architecture. It explains how degrees of freedom excluded from a chosen description return through retarded memory, while separating exact projection identities from subsequent approximations and physical interpretations. Gauge-invariant observables and appropriately transported comparisons are used to prevent changes of gauge frame from being mistaken for physical loss of persistence. The paper also distinguishes persistent correlation from genuine dynamical memory and distinguishes temporal ordering from relativistic locality. Within this architecture, the manuscript develops conditional applications to weak and strong interaction channels. For weak channels, it identifies the response conditions required for screened spatial behavior and separates screening range from detector thresholds and independently measured mediator masses. For strong channels, it specifies the additional requirements for stable transverse localization, surviving longitudinal support, finite tube energy, and a contribution to stored energy that grows with source separation. It treats Wilson-loop observables, string breaking, and enlargement of the relevant channel description as essential consistency checks. These constructions retain established electroweak and quantum chromodynamic content rather than claiming to derive particle properties or gauge structure from the diagnostic alone. The spectral analysis distinguishes the classical diagnostic from proposed expression operators and their action on physical states. It explains why positive expression capacity for every individual state does not, by itself, establish a common positive lower bound across all physical excitations. The manuscript formulates a conditional spectral-gap theorem and identifies the independent closure and energy-comparison requirements needed to apply it. It further separates intrinsic mass gaps from finite-volume effects, lattice cutoffs, thermal screening, material screening, and finite causal-history effects. Overall, the paper provides a structured theoretical and operational research programme linking probability-domain diagnostics, cross-scale persistence, gauge-compatible memory, and conditional field and spectral consequences. Its achievements include explicit definitions, formal results within declared assumptions, measurement protocols, worked counterexamples, control and falsification matrices, and clearly stated proof obligations. It does not claim a completed fundamental theory, an empirical confirmation of the framework, a derivation of observed gauge groups or numerical couplings, or a solution to the Yang–Mills mass-gap problem. Its intended contribution is a testable architecture that makes those remaining tasks precise and prevents conditional results from being presented as completed physical explanations.
Loss can restore the vacuum entropy bound without erasing non-Gaussian structure. This paper determines when an entropy statement justifies a coherent-state approximation, when non-Gaussian structure survives optical loss, and what mode and source-request budgets are needed to use that structure. The results give quantum-optics researchers separate criteria for entropy recovery, state approximation, Gaussian concentration and conversion to a specified output. Version 1.5 — revised 10 October 2026. The 96-page PDF contains the main article, Methods, Supplementary Information and references. This revision connects the exact loss boundary to a mode-uniform near-equality certificate, finite-data validation, a conversion-cost lower bound for the same thermally repaired source, and an exact equal-entropy comparison of sources with different conversion-cost exponents. The central figures are updated accordingly. 1. Near-vacuum states can have an unbounded entropy deficit Write νm\nu_mνm​ for the mmm-mode vacuum and define Δα,m(ρ)=Hα(Wνm)−Hα(Wρ)\Delta_{\alpha,m}(\rho)=H_\alpha(W_{\nu_m})-H_\alpha(W_\rho)Δα,m​(ρ)=Hα​(Wνm​​)−Hα​(Wρ​), using natural logarithms; H1H_1H1​ is Shannon entropy. Positive deficit means entropy below vacuum. We construct physical Wigner-positive states satisfying, simultaneously, Em=Tr⁡(Nmρm)→0,12∥ρm−νm∥1→0,dFm(ρm)→0,Δ1,m(ρm)→+∞.E_m=\operatorname{Tr}(N_m\rho_m)\to0,\qquad \tfrac12\|\rho_m-\nu_m\|_1\to0,\qquad d_{\mathcal F_m}(\rho_m)\to0,\qquad \Delta_{1,m}(\rho_m)\to+\infty.Em​=Tr(Nm​ρm​)→0,21​∥ρm​−νm​∥1​→0,dFm​​(ρm​)→0,Δ1,m​(ρm​)→+∞. Here Fm\mathcal F_mFm​ is the trace-norm-closed convex hull of Gaussian states and dFmd_{\mathcal F_m}dFm​​ uses half the trace norm. Thus proximity to the entire Gaussian model does not control Wigner entropy uniformly in mode number. Independent weak modes amplify a one-mode entropy effect while their total excitation vanishes. For the same sequence, half loss instead gives −Em≤Δ1,m(L1/2⊗mρm)≤0-E_m\le\Delta_{1,m}(\mathcal L_{1/2}^{\otimes m}\rho_m)\le0−Em​≤Δ1,m​(L1/2⊗m​ρm​)≤0, so the entropy difference from vacuum tends to zero. 2. The exact pure-loss recovery boundary For Wigner-positive inputs, intensity transmissivity η\etaη and any fixed positive total input-energy budget EEE, the sharp threshold is ηc(α)={1/2,0<α≤1,α/2,1<α<2.\eta_c(\alpha)=\begin{cases}1/2,&0<\alpha\le1,\\ \alpha/2,&1<\alpha<2.\end{cases}ηc​(α)={1/2,α/2,​0<α≤1,1<α<2.​ With Pm,E={ρ:Wρ≥0, Tr⁡(Nmρ)≤E}\mathcal P_{m,E}=\{\rho:W_\rho\ge0,\ \operatorname{Tr}(N_m\rho)\le E\}Pm,E​={ρ:Wρ​≥0, Tr(Nm​ρ)≤E}, sup⁡m≥1sup⁡ρ∈Pm,EΔα,m(Lη⊗mρ)={0,η≤ηc(α),+∞,η>ηc(α).\sup_{m\ge1}\sup_{\rho\in\mathcal P_{m,E}}\Delta_{\alpha,m}(\mathcal L_\eta^{\otimes m}\rho)=\begin{cases}0,&\eta\le\eta_c(\alpha),\\+\infty,&\eta>\eta_c(\alpha).\end{cases}supm≥1​supρ∈Pm,E​​Δα,m​(Lη⊗m​ρ)={0,+∞,​η≤ηc​(α),η>ηc​(α).​ The recovery statement includes the boundary itself and is independent of mode number. Half loss also restores vacuum majorization for arbitrary density operators. For α≥2\alpha\ge2α≥2, established Wigner-norm bounds give the vacuum entropy bound at every transmissivity for Wigner-positive outputs. These statements distinguish a universal guarantee from the earlier sign crossing that a particular source may exhibit. 3. Near equality gives a certificate for the entire input For an arbitrary input ρ\rhoρ, define the half-loss output Shannon excess s(ρ)=h(WL1/2⊗mρ)−m(1+ln⁡π)≥0.s(\rho)=h(W_{\mathcal L_{1/2}^{\otimes m}\rho})-m(1+\ln\pi)\ge0.s(ρ)=h(WL1/2⊗m​ρ​)−m(1+lnπ)≥0. The half-loss identity identifies this quantity with the input's total Wehrl entropy excess. Applying mode-uniform Wehrl stability yields inf⁡a∥ρ−∣a⟩⟨a∣∥12≤64ln⁡2 s(ρ).\inf_a\|\rho-|a\rangle\langle a|\|_1^2\le\frac{64}{\ln2}\,s(\rho).infa​∥ρ−∣a⟩⟨a∣∥12​≤ln264​s(ρ). The bound controls the full input state, with no energy or photon-support restriction. One coherent reference then controls every subsequent quantum channel and every unconditional measurement event. In particular, an event-probability error at most ϵ\epsilonϵ is guaranteed by s≤(ln⁡2)ϵ2/16s\le(\ln2)\epsilon^2/16s≤(ln2)ϵ2/16. Conversely, a surviving output Gaussian-hull gap enforces s(ρ)≥ln⁡216 dFm(L1/2⊗mρ)2.s(\rho)\ge\frac{\ln2}{16}\,d_{\mathcal F_m}(\mathcal L_{1/2}^{\otimes m}\rho)^2.s(ρ)≥16ln2​dFm​​(L1/2⊗m​ρ)2. Recovery of the inequality and proximity to equality therefore support different physical inferences: the former permits residual non-Gaussian structure, while the latter certifies a coherent-state approximation. 4. Surviving structure has mode and conversion costs A thermally repaired vacuum–three-photon source with per-mode occupation c/mc/mc/m has total input energy tending to 3c3c3c. Along the recovery boundary, its attenuated state obeys lim inf⁡m→∞dFm(ρ~m,ηc)≥cηc3exp⁡{−c[1−(1−ηc)3]}>0.\liminf_{m\to\infty}d_{\mathcal F_m}(\widetilde\rho_{m,\eta_c})\ge c\eta_c^3\exp\{-c[1-(1-\eta_c)^3]\}>0.liminfm→∞​dFm​​(ρ​m,ηc​​)≥cηc3​exp{−c[1−(1−ηc​)3]}>0. At half transmission this lower bound is g(c)=(c/8)e−7c/8g(c)=(c/8)e^{-7c/8}g(c)=(c/8)e−7c/8. Starting from one complete block, Gaussian processing requires Θ(m)\Theta(m)Θ(m) output modes to retain any fixed positive gap below this bound at success probability at least a fixed p0>0p_0>0p0​>0. Gaussian ancillary states, adaptive Gaussian measurements, feedback, discarding and postselection are included. A distinct task requests fresh independent blocks of this same half-loss source to produce the one-mode target τ∗=(18∣0⟩⟨0∣+6∣1⟩⟨1∣+∣2⟩⟨2∣)/25\tau_*=(18|0\rangle\langle0|+6|1\rangle\langle1|+|2\rangle\langle2|)/25τ∗​=(18∣0⟩⟨0∣+6∣1⟩⟨1∣+∣2⟩⟨2∣)/25 within half trace distance 10−610^{-6}10−6. Let CmC_mCm​ be the infimum of expected complete-block requests divided by success probability, including all failed requests. For fixed 0<c≤10<c\le10<c≤1, every achieving Gaussian protocol obeys the asymptotic lower bound log⁡Cm≥1128(m/c)1/3−log⁡m−O(1).\log C_m\ge\frac1{128}(m/c)^{1/3}-\log m-O(1).logCm​≥1281​(m/c)1/3−logm−O(1). This is a source-request lower bound; the optimal achievable cost for this source remains undetermined. The proof evaluates a curvature-controlled input certificate for the actual thermally repaired state and applies the Gaussian conversion theorem of the companion paper cited below. 5. Exactly equal entropy does not fix conversion cost For two separate two-mode quartic source families, their mixture probabilities can be adjusted so that their half-loss Shannon entropies are exactly equal. Under a common target, tolerance and failure-inclusive accounting, the inherited matching conversion laws become h(WωA)=h(WωB)=2(1+ln⁡π)+s,log⁡CA(s)=Θ(s−1/3),log⁡CB(s)=Θ(s−1/2).h(W_{\omega_A})=h(W_{\omega_B})=2(1+\ln\pi)+s,\qquad \log C_A(s)=\Theta(s^{-1/3}),\qquad \log C_B(s)=\Theta(s^{-1/2}).h(WωA​​)=h(WωB​​)=2(1+lnπ)+s,logCA​(s)=Θ(s−1/3),logCB​(s)=Θ(s−1/2). The target tolerance is held fixed in these asymptotics. The delivered energies after entropy matching satisfy EA,EB∼s/2E_A,E_B\sim s/2EA​,EB​∼s/2. At exactly equal energy, the two excesses instead share si(E)=2E−(35/8)E2+O(E3)s_i(E)=2E-(35/8)E^2+O(E^3)si​(E)=2E−(35/8)E2+O(E3) and differ by sA(E)−sB(E)=15E3+O(E4)s_A(E)-s_B(E)=15E^3+O(E^4)sA​(E)−sB​(E)=15E3+O(E4). Entropy alone therefore cannot select the cheaper source for a fixed output task. 6. Finite data and finite mode budgets Under a declared displaced-input photon-tail bound Tr⁡[N1N>Kσa]≤τK\operatorname{Tr}[N\mathbf1_{N>K}\sigma_a]\le\tau_KTr[N1N>K​σa​]≤τK​, trusted half loss and all-mode on/off detection with efficiency at least ξmin⁡\xi_{\min}ξmin​, the click probability qqq gives s(σ)≤AKq+τK,AK=K1−(1−ξmin⁡/2)K.s(\sigma)\le A_Kq+\tau_K,\qquad A_K=\frac{K}{1-(1-\xi_{\min}/2)^K}.s(σ)≤AK​q+τK​,AK​=1−(1−ξmin​/2)KK​. A one-sided binomial bound turns this into an entropy confidence certificate. An explicit undisplaced four-photon-cutoff example uses K=4K=4K=4, τK=0\tau_K=0τK​=0, ξ=0.8\xi=0.8ξ=0.8 and N=3,517,336N=3{,}517{,}336N=3,517,336 independent validation blocks, accepting at most 41 clicks, to certify unconditional event error at most 0.050.050.05 with false-acceptance probability at most 0.0010.0010.001 and missed acceptance at most 0.0010.0010.001 on the stated low-click alternative class. All vacuum results count; training, calibration and source heralding are separate costs. When coherent-state approximation alone is the task, the same click measurement supplies a stronger direct fidelity test. The paper also gives all-input finite-budget exclusions above the loss-recovery line. For example, at E=1E=1E=1, α=1.9\alpha=1.9α=1.9, η=0.9505\eta=0.9505η=0.9505 and m=105m=10^5m=105, the certified bound Δα<0.06942\Delta_\alpha<0.06942Δα​<0.06942 rules out a target deficit of 0.10.10.1 nat. A separate finite single-mode preparation model predicts positive Shannon deficit near η=0.97\eta=0.97η=0.97, negative deficit near η=0.85\eta=0.85η=0.85, and a Gaussian-hull witness above 4.4×10−34.4\times10^{-3}4.4×10−3 at half transmission, with explicit preparation, measurement-error and raw-trial budgets in the PDF. 7. Dimensional scales, a strict entropy floor and ORCS Near order two, put α=2−δ\alpha=2-\deltaα=2−δ and L=ln⁡(1/δ)L=\ln(1/\delta)L=ln(1/δ). For the maximum deficit Dm,ED_{m,E}Dm,E​ at fixed total energy, Dm,E(2−δ)=Θm,E(δ/L)for fixed m,Th(δ,E)=ΘE,h(L/δ),D_{m,E}(2-\delta)=\Theta_{m,E}(\delta/L)\quad\text{for fixed }m,\qquad T_h(\delta,E)=\Theta_{E,h}(L/\delta),Dm,E​(2−δ)=Θm,E​(δ/L)for fixed m,Th​(δ,E)=ΘE,h​(L/δ), where ThT_hTh​ is the first mode number allowing a fixed positive deficit hhh. Beyond a sufficiently large fixed multiple of L/δL/\deltaL/δ, Dm,E(2−δ)=ΘE(mδ)D_{m,E}(2-\delta)=\Theta_E(m\delta)Dm,E​(2−δ)=ΘE​(mδ). The manuscript separates proved sufficient fronts from necessary exit bounds; the sharp first-crossing coefficient remains open. At every fixed mode number, an energy-unrestricted strict Shannon floor also holds: h(Wρ)≥mln⁡(2π)+εmh(W_\rho)\ge m\ln(2\pi)+\varepsilon_mh(Wρ​)≥mln(2π)+εm​ with εm>0\varepsilon_m>0εm​>0 for all Wigner-positive states. The ordering-resolved coherence spectrum (ORCS) supplies an exact single-mode loss coordinate. With Cr,k\mathcal C_{r,k}Cr,k​ denoting the ordering-weighted norm of photon-number-difference block kkk, Cr,k(Lηρ)=CTη(r),k(ρ),Tη(r)=1−1−rη.\mathcal C_{r,k}(\mathcal L_\eta\rho)=\mathcal C_{T_\eta(r),k}(\rho),\qquad T_\eta(r)=1-\frac{1-r}{\eta}.Cr,k​(Lη​ρ)=CTη​(r),k​(ρ),Tη​(r)=1−η1−r​. For vacuum–nnn-photon coherence and 1<α<21<\alpha<21<α<2, C1−α/2(Lη∣n⟩⟨0∣)=(2ηα)n.\mathcal C_{1-\alpha/2}(\mathcal L_\eta|n\rangle\langle0|)=\left(\frac{2\eta}{\alpha}\right)^n.C1−α/2​(Lη​∣n⟩⟨0∣)=(α2η​)n. This formula exposes the high-order coherence mechanism at the loss threshold; the universal recovery result is proved through the full nonlinear Wigner-norm inequality. Related papers and history The counterexample paper Wigner entropy below vacuum: physical counterexamples and stability limits expands arXiv:2609.13312v1, submitted on 10 September 2026. This stability paper develops the dimensional, loss-dependent and operational consequences. Its state-approximation and conversion interfaces use the companion results From phase-space entropy to coherent-state error: mode-uniform Rényi–Wehrl stability and Phase records control the conversion cost of non-Gaussian light. The mode-retention comparison connects to Limits to Gaussian concentration of non-Gaussian light.
Most versions of classical physics imply that if the 4-volume of the entire space-time is infinite or at least extremely large, then random fluctuations in the matter will by coincidence create copies of us in remote places, so called “Boltzmann brains.” That is a problem because it leads to the wrong prediction that we should be Boltzmann brains. The question arises, how can any theory avoid making this wrong prediction? In quantum physics, it turns out that the discussion requires a formulation of quantum theory that is more precise than the orthodox interpretation. Using Bohmian mechanics for this purpose, we point out a possible solution to the problem based on the phenomenon of “freezing” of configurations.