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

Exact-Root Certification of Finite-Error Ordering in Quantum Control

Y.Y.N. Li

Published Jun 16, 2026• 0 citations
Publisher

Abstract

Are matched integrated controls---total duration, pulse area, and weighted-average detuning---sufficient to determine a finite-time quantum output? We test this on an eight-atom Rydberg chain over a 117-schedule grid (104 with nonzero detuning gap), comparing each two-segment forward schedule with its exact schedule-order reversal under exact statevector evolution, with duration, pulse area, and weighted-average detuning matched exactly. Changing only the order produces distinguishable states and output distributions, exceeding the measured numerical floor by more than five orders of magnitude. The path-area proxy suggested by the leading commutator, C_BCH = g f(1-f), does not govern the grid (R^2 = 0.946, RMSE = 0.0249, spurious intercept = -0.0198), whereas a first-order support proxy C_lin = g min(f, 1-f) fits substantially better (R^2 = 0.991, RMSE = 0.0102) without being asserted as a universal scaling law. Six equal-duration permutations of a three-detuning multiset provide a decisive counterexample: schedules sharing the single second-order coefficient A_2 exactly still differ in baseline-referenced TVD by up to a factor 2.6. These results show that average-control descriptions discard resolvable path information in finite-time neutral-atom dynamics---an empirical boundary statement, not a claim of a new fundamental time law or a failure of the Magnus expansion.

DOI
10.5281/zenodo.20713301

Related papers

The Controls Reveal the Choice: Exact Echo Reversals under Matched Noise Statistics

Vincent Marquez

We give two explicit constructions in which matched noise statistics lead to opposite choices between free evolution and a single finite-duration echo on a dephasing qubit. First, two bounded, strictly stationary, zero-mean laws share their entire one-time amplitude distribution and the covariance R(τ)=(2π²/17)(1-|τ|)₊, hence the same ordinary power spectrum. Nevertheless, a centered rectangular π pulse of width 1/100 improves coherence magnitude, purity and target-state fidelity for one law and worsens all three for the other. Each failure-probability gap exceeds 61/1400. All third joint moments vanish, and the first distinguishing temporal cumulant is fourth order. Second, for every prescribed odd n≥3, a parity-conditioned binomial construction matches every multi-time joint moment through total order n and preserves the complete one-time law, while retaining opposite finite-echo target-fidelity gaps of at least 1/16. The noise bound is nπ/2 and the pulse amplitude is 8π²n, with fixed total duration and pulse area. Both results follow from explicit phase integrals, a stationary random-offset construction and a uniform finite-pulse perturbation estimate. They give quantitative control-selection obstructions for noise laws sharing the stated statistical summaries. Three-page note, 7 September 2026, release 2026-09-07-r6. Companion proof-status notes were not uploaded with this draft.

•Sep 7, 2026•0 citations

Certifying When Temporal Order Can Be Ignored in Continuous-Time Quantum Walks

Madjid Eshaghi Gordji, Mohamadali Berahman

Abstract Continuous-time quantum walks on dynamic graphs are generated by an ordered sequence of Hamiltonians. Replacing that sequence by one average Hamiltonian can simplify analysis and control, but it may change the transported quantum state. We study this replacement in the single-excitation sector for sequential, undirected edge couplings. Nonzero edge Hamiltonians commute precisely when their edges coincide or are vertex-disjoint, giving a pulse-independent exact reduction for schedules supported on a matching. For general schedules, we derive a nonperturbative spectral-norm bound between the ordered unitary and the exponential of the integrated Hamiltonian. In the edge model, the bound becomes a weighted count of temporal wedges—pairs of distinct event edges meeting at one vertex—and is computable in expected linear time. The same certificate controls state-transfer amplitudes and probabilities, process fidelity, average gate fidelity, and sensitivity to event reordering. A weak-pulse expansion shows that its quadratic scaling is generally sharp. An exact three-vertex calculation and reproducible numerical tests illustrate when the certificate is informative and when cancellation makes it conservative. The result is a directly checkable sufficient condition for replacing a dynamic quantum walk by its weighted aggregate.

•Oct 28, 2026•0 citations

Quantum Clocks in Complementarity-First Geometry: Redshift, Equivalence, and the Universal Matter-Coupling Boundary

Qingchun Zhang

This paper asks what must be added to the one normalized relational interval and selected finite-dimensional carriers inherited from the first two Complementarity-First Time papers before those carriers function as quantum clocks, support endpoint comparisons, and share a universal matter coupling. The analysis first separates four parameter types: raw relation magnitude ρ, normalized relational interval ℓ, supplied local proper interval τ, and a shared comparison parameter s. In the declared order-unit placement class, the raw interval and raw generator compensators cancel exactly, leaving phase evolution per ℓ. For any one chosen parameter, a selected state-readout statistic is minimally phase-readable exactly when its grouped Bohr-frequency expansion has nonzero weight in at least one nonzero mode. A declared endpoint observable factors into signal transport and local clock calibration after the signal law, path, observers, and transitions are supplied. Complete labeled gap transfer is affine on each connected spectral graph. On a supplied common semiclassical path, a complete mass-energy operator is sufficient for common internal spectral scaling at the retained weak-field order; it does not derive universal trajectories or a unique matter action. An explicitly typed worldline-reparameterization-covariant, complement-even scalar model gives species-dependent clock rates, proving that the inherited one-time geometry and complement parity do not force universality. A two-level commuting perturbation has an internal affine blind spot, whereas an addressed three-level sector supports an anchor-free spectral-shape contrast. The prospective multiclock architecture therefore has rank three, with independent vector z = (Δ_ST, Δ_01, N_3)^T. It remains at STOP-SOURCE. No second physical time dimension, universal matter action, unique signal action, executed experiment, numerical redshift prediction, absolute second, numerical ℏ, objective chance law, total-carrier completeness, or thermodynamic arrow is claimed.

•Aug 26, 2026•0 citations

Reversible Finite-Frame Dynamics for Rational Quantum Grids

Josef Bruzzese

Reversible Finite-Frame Dynamics for Rational Quantum Grids: Preparation Laws and Matching-Dependent Statistical Predictions This paper develops a finite, reversible model of quantum control motivated by Tim Palmer’s rational quantum mechanics (RaQM). Rational restrictions on quantum states do not by themselves determine how nominal quantum gates should act when their exact outputs lie outside the admissible state set. The paper addresses this problem by constructing finite catalogues of quantum frames on which commands act as permutations, together with explicit preparation laws that assign statistical predictions to complete control sequences. The analysis distinguishes a conditional rational grid from its occupation-compatible subset, identifies their common projective monomial gate group, and proves an obstruction to uniformly accurate fixed-grid repair by local gates. Equal-measure partitions and perfect matchings are then used to construct reversible approximations of local and entangling controls on enlarged finite ray sets. A compensated preparation law yields a common random-unitary channel for each control word, while a finite consistency criterion determines whether a proposed preparation law works for all words. For fixed circuit depth, the resulting statistics converge uniformly to the nominal quantum predictions as the catalogue is refined. At sufficiently large depths, finite recurrence forces disagreement for a repeated entangling circuit. An explicit rematching of the CNOT control removes a seven-block discrepancy without increasing the catalogue size or the stated error bounds, showing that those coarse conditions alone do not determine the earliest observable deviation. The construction is therefore a mathematically explicit candidate completion of finite-state quantum kinematics, while leaving the physical selection of a particular matching, preparation law and reduction dynamics as additional assumptions. Exact Python and Wolfram Language checks accompany the finite examples.

•May 2, 2026•1 citation

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

Quantum Boltzmann Brain

Hutan Ashrafian

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.

•Nov 1, 2026•0 citations
Are matched integrated controls---total duration, pulse area, and weighted-average detuning---sufficient to determine a finite-time quantum output? We test this on an eight-atom Rydberg chain over a 117-schedule grid (104 with nonzero detuning gap), comparing each two-segment forward schedule with its exact schedule-order reversal under exact statevector evolution, with duration, pulse area, and weighted-average detuning matched exactly. Changing only the order produces distinguishable states and output distributions, exceeding the measured numerical floor by more than five orders of magnitude. The path-area proxy suggested by the leading commutator, C_BCH = g f(1-f), does not govern the grid (R^2 = 0.946, RMSE = 0.0249, spurious intercept = -0.0198), whereas a first-order support proxy C_lin = g min(f, 1-f) fits substantially better (R^2 = 0.991, RMSE = 0.0102) without being asserted as a universal scaling law. Six equal-duration permutations of a three-detuning multiset provide a decisive counterexample: schedules sharing the single second-order coefficient A_2 exactly still differ in baseline-referenced TVD by up to a factor 2.6. These results show that average-control descriptions discard resolvable path information in finite-time neutral-atom dynamics---an empirical boundary statement, not a claim of a new fundamental time law or a failure of the Magnus expansion.
We give two explicit constructions in which matched noise statistics lead to opposite choices between free evolution and a single finite-duration echo on a dephasing qubit. First, two bounded, strictly stationary, zero-mean laws share their entire one-time amplitude distribution and the covariance R(τ)=(2π²/17)(1-|τ|)₊, hence the same ordinary power spectrum. Nevertheless, a centered rectangular π pulse of width 1/100 improves coherence magnitude, purity and target-state fidelity for one law and worsens all three for the other. Each failure-probability gap exceeds 61/1400. All third joint moments vanish, and the first distinguishing temporal cumulant is fourth order. Second, for every prescribed odd n≥3, a parity-conditioned binomial construction matches every multi-time joint moment through total order n and preserves the complete one-time law, while retaining opposite finite-echo target-fidelity gaps of at least 1/16. The noise bound is nπ/2 and the pulse amplitude is 8π²n, with fixed total duration and pulse area. Both results follow from explicit phase integrals, a stationary random-offset construction and a uniform finite-pulse perturbation estimate. They give quantitative control-selection obstructions for noise laws sharing the stated statistical summaries. Three-page note, 7 September 2026, release 2026-09-07-r6. Companion proof-status notes were not uploaded with this draft.
Abstract Continuous-time quantum walks on dynamic graphs are generated by an ordered sequence of Hamiltonians. Replacing that sequence by one average Hamiltonian can simplify analysis and control, but it may change the transported quantum state. We study this replacement in the single-excitation sector for sequential, undirected edge couplings. Nonzero edge Hamiltonians commute precisely when their edges coincide or are vertex-disjoint, giving a pulse-independent exact reduction for schedules supported on a matching. For general schedules, we derive a nonperturbative spectral-norm bound between the ordered unitary and the exponential of the integrated Hamiltonian. In the edge model, the bound becomes a weighted count of temporal wedges—pairs of distinct event edges meeting at one vertex—and is computable in expected linear time. The same certificate controls state-transfer amplitudes and probabilities, process fidelity, average gate fidelity, and sensitivity to event reordering. A weak-pulse expansion shows that its quadratic scaling is generally sharp. An exact three-vertex calculation and reproducible numerical tests illustrate when the certificate is informative and when cancellation makes it conservative. The result is a directly checkable sufficient condition for replacing a dynamic quantum walk by its weighted aggregate.
This paper asks what must be added to the one normalized relational interval and selected finite-dimensional carriers inherited from the first two Complementarity-First Time papers before those carriers function as quantum clocks, support endpoint comparisons, and share a universal matter coupling. The analysis first separates four parameter types: raw relation magnitude ρ, normalized relational interval ℓ, supplied local proper interval τ, and a shared comparison parameter s. In the declared order-unit placement class, the raw interval and raw generator compensators cancel exactly, leaving phase evolution per ℓ. For any one chosen parameter, a selected state-readout statistic is minimally phase-readable exactly when its grouped Bohr-frequency expansion has nonzero weight in at least one nonzero mode. A declared endpoint observable factors into signal transport and local clock calibration after the signal law, path, observers, and transitions are supplied. Complete labeled gap transfer is affine on each connected spectral graph. On a supplied common semiclassical path, a complete mass-energy operator is sufficient for common internal spectral scaling at the retained weak-field order; it does not derive universal trajectories or a unique matter action. An explicitly typed worldline-reparameterization-covariant, complement-even scalar model gives species-dependent clock rates, proving that the inherited one-time geometry and complement parity do not force universality. A two-level commuting perturbation has an internal affine blind spot, whereas an addressed three-level sector supports an anchor-free spectral-shape contrast. The prospective multiclock architecture therefore has rank three, with independent vector z = (Δ_ST, Δ_01, N_3)^T. It remains at STOP-SOURCE. No second physical time dimension, universal matter action, unique signal action, executed experiment, numerical redshift prediction, absolute second, numerical ℏ, objective chance law, total-carrier completeness, or thermodynamic arrow is claimed.
Reversible Finite-Frame Dynamics for Rational Quantum Grids: Preparation Laws and Matching-Dependent Statistical Predictions This paper develops a finite, reversible model of quantum control motivated by Tim Palmer’s rational quantum mechanics (RaQM). Rational restrictions on quantum states do not by themselves determine how nominal quantum gates should act when their exact outputs lie outside the admissible state set. The paper addresses this problem by constructing finite catalogues of quantum frames on which commands act as permutations, together with explicit preparation laws that assign statistical predictions to complete control sequences. The analysis distinguishes a conditional rational grid from its occupation-compatible subset, identifies their common projective monomial gate group, and proves an obstruction to uniformly accurate fixed-grid repair by local gates. Equal-measure partitions and perfect matchings are then used to construct reversible approximations of local and entangling controls on enlarged finite ray sets. A compensated preparation law yields a common random-unitary channel for each control word, while a finite consistency criterion determines whether a proposed preparation law works for all words. For fixed circuit depth, the resulting statistics converge uniformly to the nominal quantum predictions as the catalogue is refined. At sufficiently large depths, finite recurrence forces disagreement for a repeated entangling circuit. An explicit rematching of the CNOT control removes a seven-block discrepancy without increasing the catalogue size or the stated error bounds, showing that those coarse conditions alone do not determine the earliest observable deviation. The construction is therefore a mathematically explicit candidate completion of finite-state quantum kinematics, while leaving the physical selection of a particular matching, preparation law and reduction dynamics as additional assumptions. Exact Python and Wolfram Language checks accompany the finite examples.
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.
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.