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

arXiv:2610.33607

Krylov geometry and optimal recovery under uncertain coherent noise

Abhishek Chowdhury

quant-phhep-thmath-phphysics.opticsSubmitted Oct 24, 2026• Announced Oct 27, 2026• 0 citations
arXivHTMLPDF

Abstract

Recovery from a coherent rotation with an unobserved angle depends on both the encoding and what calibration reveals about the noise. We determine their combined limit for a known finite-dimensional generator and one final recovery. Two polynomial projections organize the answer. A physical Krylov chain separates correctable error amplitudes from their first state-dependent distortion; projection onto lower-angle powers identifies the part that a coherent decoder can cancel. Under explicit rank and moment conditions, their combination gives the exact leading optimal entanglement infidelity at weak noise and a recovery attaining it for any finite logical dimension. The optimal worst-input error lies between one and $d$ times that infidelity at leading order, for logical dimension $d$. When the angle distribution is unknown, we optimize one decoder for every distribution compatible with the calibration. When spectral and calibration frequencies are integer multiples of a common frequency, moment positivity turns this into an exact finite optimization. Small measured means can still allow rare finite rotations. If the sole calibration datum is $β_r=\mathbb E[\sin^{2r}(θ/2)]$, with $θ$ the wrapped rotation phase at that common frequency, the optimal worst-prior infidelity is $O(β_r)$ exactly when generator powers through degree $r-1$ are correctable. When the first uncorrectable power has degree $m<r$, the optimal loss scales as $β_r^{m/r}$, with a sharp coefficient fixed by a universal moment problem. In a loss-free four-photon memory, population measurements at two calibration durations retain the fully informed quartic error coefficient for a fixed symmetric narrow-noise family with positive variance and finite fourth moment; a single duration permits loss quadratic in the noise width.

AI Summary

The paper studies a fixed finite-dimensional quantum encoding exposed to $e^{-i\sigma xH}$, with known $H$ but unobserved random angle, followed by one deterministic recovery. It asks how encoding geometry and incomplete calibration jointly limit recovery fidelity. For a nondegenerate prefix correcting $I,H,\ldots,H^L$, it derives the exact leading optimal entanglement infidelity, $1-F_{e,\mathrm{opt}}=g_L^2h_m\mathcal V\sigma^{2m}/(m!)^2+o(\sigma^{2m})$, where $m=L+1$. Physical block-Krylov orthogonalization determines propagation $g_L$ and logical boundary distortion $\mathcal V$; projection of $x^m$ onto lower angle powers determines residual variance $h_m$. A coherently adjusted, polar-aligned recovery attains the coefficient, with a converse covering all CPTP recoveries. After a known logical rotation is removed, optimal half-diamond error lies between one and $d$ times optimal entanglement infidelity at leading order. Petz recovery doubles the occupied-shell contribution but retains the optimal leakage contribution. For uncertain priors, a minimax polynomial selects one common decoder. Commensurate spectral and calibration frequencies permit exact finite moment optimization. With sole datum $\beta_r=\mathbb E[\sin^{2r}(\theta/2)]$, worst-prior infidelity is $O(\beta_r)$ exactly when powers through $r-1$ are correctable; a first defective power $m<r$ instead gives $\beta_r^{m/r}$ scaling under additional boundary hypotheses. In a loss-free four-photon example, two calibration durations retain the informed quartic coefficient, whereas one permits quadratic loss. The local theorem requires rank and moment conditions; uniform guarantees require tail control. The model excludes independently fluctuating or noncommuting generators and control during storage. Optical recovery implementability and photon loss remain unresolved.

Little sign of AI-generated textAI use disclosedStrong assumptions
The author acknowledges the use of the free versions of ChatGPT (GPT-5 series) and Claude (Claude 5 series) for assistance with organizing the literature, secondary numerical cross-checking, and LaTeX formatting.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
72 pages including appendices, 5 figures

Related papers

What Must a Quantum-Memory Decoder Know About Temporally Correlated Noise?

Danesh Morales-Hashemi, Graeme Smith, Ningping Cao

What must a quantum error-correction decoder know about temporally correlated noise, and what does it cost to learn? We study this question for fixed stabilizer memory experiments with known system-environment interactions. We formulate calibration in terms of the fidelity differences that select a Pauli recovery and relate missing information to the resulting fidelity loss. Our main example uses weak coherent $X$ rotations in a class of CSS codes including Shor, Steane, and odd-distance rotated surface codes. All physical qubits share a sign either fixed throughout a run or independently redrawn each interval. The two models have identical syndrome statistics and the same spatiotemporal Pauli process (SPP), obtained by Pauli-twirling every noise interval. Yet at suitable storage times, they require different logical corrections. In the weak-noise limit, each model is almost perfectly correctable when known. Without model information, even the best final recovery has a worst-case fidelity loss approaching $1/2$ relative to the noise-aware optimum, despite access to the full syndrome record. For this pair of models, at fixed code and fixed positive target loss below $1/2$, we prove matching calibration bounds. With logical preparation and final readout, complete QEC cycles require a number of noise intervals scaling as the inverse rotation angle raised to the code's $X$ distance. Allowing two uninterrupted intervals before one extraction reduces the optimal cost to inverse-square scaling. Physical Pauli twirling of every noise interval changes both recovery performance and its information requirements. Discarding the record of applied random Pauli operations makes the SPP sufficient for optimal recovery. Keeping this record can improve the attainable fidelity, but reaching that optimum may require additional noise information.

quant-pharXiv:2610.03545•Oct 5, 2026•0 citations

Fidelity Determines the Minimum Error of Quantum Recovery

Dario Picozzi

Even a recovery that maximizes worst-input entanglement fidelity can retain avoidable errors in subsequent measurements. Entanglement fidelity is the probability of passing a test of whether the state and its entanglement were preserved; infidelity is the probability of failing it. Operational error is the largest possible change in any measurement probability, quantified by the normalized diamond distance. For every finite-dimensional noise channel and fixed encoding, we prove that operational error and worst-input entanglement infidelity have the same minimum over all recovery operations. The proof constructs one final unitary (a reversible quantum operation) that makes any recovery's operational error no greater than its original worst-input entanglement infidelity. With a retained noise record, we determine the optimal error and characterize all optimal decoders subject to a Kraus-rank limit for each outcome. For a fixed decoded channel, a semidefinite program finds the optimal final unitary in the low-error regime. We characterize all optimal final corrections and show that, at a fixed error floor $0<ε<1$, the operational optimizers' sensitivity to residual unitary errors of size $s$ is at worst of order $s^{4/3}$, while the canonical polar correction has quadratic sensitivity.

arXiv:2611.07344•Nov 5, 2026•0 citations

Optimal Decoding of 2D Compass Codes Under Coherent Noise

Bálint Pató, Qiang Miao, Kenneth R. Brown

Coherent noise on the physical qubits can lead to coherent error on the logical qubits in a quantum error-corrected system, even if the best recovery operator is found. An optimal decoder under coherent noise finds the minimal angle of the logical, coherent rotation for a given physical rotation angle under the uniform, coherent noise model. We show that one can optimally decode$2\mathrm{D}$compass codes without an explicit optimal decoder in polynomial complexity by simply flipping the sampled logical angle using a Majorana simulator and a sub-optimal decoder. Estimating the threshold requires tools different from MWPM decoding. As the infidelity curves don't intersect, we use finite-size scaling to evaluate optimal decoding performance by estimating the logical infidelity at the infinite distance limit. We motivate our finite size scaling ansatz based on repetition code-like compass codes for which we can exactly calculate the logical channel up to a distance of up to 1021. Under optimal decoding, our finite-size scaling methods predict a threshold of$(0.274\pm 0.010)\pi$for the surface code and a threshold of$(0.252\pm 0.001)\pi$for the m=2 Z-stacked Shor code. We compare our results to previous predictions and find a slight deviation in the case of the Z-stacked Shor code and a slight decrease in the case of the surface code.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•0 citations

Optimal purity estimation under correlated phase drift and photon loss

Zixuan He

Purity does not change under a phase rotation, but estimating it from successive optical pulses can still require relative-phase information. This article determines the best possible precision when an unknown single-mode source is independently prepared, undergoes photon loss, and is then rotated by a hidden correlated phase trajectory. A uniform precision law. The normal source state satisfies \(\operatorname{Tr}(\rho N)\le E\) and \(\operatorname{Tr}(\rho N^s)\le M\), with fixed \(E,M>0\) and \(s\ge1\). The phase starts uniformly on the circle, independently of the entire sequence of independent increments, whose known Fourier spectrum is \(\exp(-\gamma|q|^\beta)\), with \(\gamma>0\) and \(0<\beta\le2\). The target is the purity \(P_\eta=\operatorname{Tr}[\mathcal L_\eta(\rho)^2]\) after pure loss, not the purity of the phase-averaged marginal. For \(m\) source preparations, set \(p=1-\eta\), \(L_m=[\log(m+\mathrm e)]^{1/\beta}\) and \(q_m=\lceil[\log m/(2\gamma)]^{1/\beta}\rceil\). The minimax expected absolute error obeys \[ R_m(P_\eta)\asymp F_m(p),\qquad F_m(p)=L_m^{-s}\eta^{q_m}+L_m^{-2s}(1+pL_m)^{-2s}. \] The comparison constants are uniform for \(\eta\in[1/2,1]\), including transmissivities approaching one as the budget grows. An ideal adjacent-pair interference measurement, independent of the transmissivity, attains the order. The converse allows arbitrary joint measurements on the complete correlated quantum history. The same law holds for the second Rényi entropy \(-\log P_\eta\). What loss changes. Vacuum–high-photon coherence and coherence between broad high-photon packets give two different hard pairs of legal sources. Without loss the rate is \((\log m)^{-s/\beta}\); at fixed nonzero loss it is \((\log m)^{-4s/\beta}\). Each loss level has its own output target. The faster rate therefore does not mean improved recovery of the original input purity. Both constructions retain their actual moment budgets, the same source within each experiment and complete photon tails. Mean cost, stopping and unbiased readings. Allowing arbitrary quantum memory, feedback and an observable stopping time leaves the order unchanged when only the worst-case mean number of requested raw source slots is bounded by \(B\): \[ R_B^{\mathrm{stop}}(P_\eta)\asymp F_{\lfloor B\rfloor}(1-\eta). \] Every requested slot is charged, including discarded slots and failed outcomes. An exactly unbiased purity estimator attains the same absolute-error order with finite mean cost and almost-sure termination, using rare, unbounded signed readings. Under the specified independent common-phase reset and auxiliary-reset permissions for repeated blocks, exact unbiasedness and uniformly finite mean cost rule out uniformly finite variance. This is a uniform obstruction over sources, not a claim of infinite variance at every source; exact unbiasedness is not asserted for the Rényi entropy. The analysis builds on swap/parity measurements, drift diagnostics, quadratic-functional deconvolution and randomized telescoping. Its contribution is the matching quantum-history law, its uniform loss dependence and its return to the actual mean preparation budget. The integrated 14-page PDF contains two figure groups, complete proofs and references. The figures illustrate asymptotic rate functions, not experimental data or calibrated sample requirements; detector, phase-control, storage and elapsed-time costs are separate from the source-slot optimum.

•Nov 9, 2026•0 citations

Quantum change point metrology

Xu Chen, Xue Ma

We quantify the extra Bayes risk of locating a quantum change point and estimating its amplitude with one measurement. The joint and marginal optimizations use the full record and the same joint prior, with both parameters unknown. For product records on a known pure state curve, position has clipped absolute loss in resolution units, and amplitude offset has squared loss in fixed calibrated units. Ideal steps exhibit certified conflict at finite signal strength, including in phase records of sixteen qubits, and recover both informative marginal optima at strong signal. For finite offset prior width, a retained quantum boundary region serves position, and the remaining suffix serves amplitude. Physical recovery holds when strength grows more slowly than the square root of record length. Known smooth rises also admit leading recovery in the coherent experiment as strength grows and width shrinks. For the quintic profile, we establish two residual cost scaling laws. The residual cost is $Θ(s^{-2})$ as $s\to\infty$. Taking the strong signal limit at fixed $w$ yields a limiting cost of $Θ(w^3)$ as $w\to0$. In the resolved local model, quadratic position loss admits a common optimum within the covariant class. These results link onset geometry and decision loss to Bayesian measurement compatibility in quantum change point estimation.

quant-pharXiv:2610.38345•Oct 29, 2026•0 citations

Robust State Equation: Calibrated Hankel Recovery and Finite-Precision Classicalization

Максим Чурилов

Exact physical memory is an unstable target: a process of Hankel rank one can be arbitrarily close to processes requiring larger classical and quantum carriers. We make this obstruction quantitative and then identify the extra structure under which a physical finite-sample upper theorem is possible. First, on a stationary binary Markov family whose mixing gap is uniformly at least one half, every estimator of exact linear rank, minimum classical memory, or minimum quantum Hilbert dimension has worst-case error at least 3/8 at local separation \(\Theta([N(L-1)]^{-1/2})\) from the rank-one model. The smallest nonzero singular value of an explicit Hankel core is proportional to the same parameter. Thus a spectral or dynamical margin is necessary even under rapid mixing. Second, finite Hankel data determine a minimum linear realization only up to similarity, whereas nonnegativity and complete positivity are not invariant under a generic similarity. We give an exact two-state counterexample and then formulate the missing assumption as a calibrated physical core. For an invertible core \(H\), all shifts are recovered in one basis by \(\tilde{A}_a = \tilde{H}^{-1}\tilde{H}_a\). An explicit perturbation theorem, followed by Choi positive-part projection and one common trace-preserving correction, returns a genuine quantum instrument. A direct-query finite-sample corollary controls its error uniformly over adaptive policies and exposes every dependence on core conditioning, physical calibration, horizon, and confidence. The resulting linear-in-horizon coefficient is first-order sharp: a one-state classical process attains the exact discrepancy \(1-(1-\Delta/2)^L\) at one-step diamond radius \(\Delta\). Third, we prove a compact-state classicalization theorem. Any finite-dimensional physical memory described by a compact base-norm state space has, at horizon \(L\) and operational error \(\eta>0\), a classical realization whose number of states is the seeded covering number at radius \(2\eta/L\), uniformly over adaptive policies. For a \(d\)-dimensional quantum instrument this gives, for \(d\geq 2\), \[ \left(1+\frac{2(1-d^{-1})L}{\eta}\right)^{d^2-1} \] states, with no extra transient state; one state suffices for \(d=1\). The ambient exponent \(d^2-1\) is optimal for universal trace-norm discretization, while a compact branch-invariant reachable set replaces it by its own metric entropy. Consequently, an unbounded exact quantum/classical memory separation cannot remain unbounded at fixed \(d\), \(L\), \(\eta\). Robust quantum advantage must instead be quantified as a joint precision–horizon tradeoff. Deterministic verification code audits the mixing lower bound, the similarity-gauge counterexample, common-shift recovery, physical repair, and finite-net simulation.

•Nov 3, 2026•0 citations
Recovery from a coherent rotation with an unobserved angle depends on both the encoding and what calibration reveals about the noise. We determine their combined limit for a known finite-dimensional generator and one final recovery. Two polynomial projections organize the answer. A physical Krylov chain separates correctable error amplitudes from their first state-dependent distortion; projection onto lower-angle powers identifies the part that a coherent decoder can cancel. Under explicit rank and moment conditions, their combination gives the exact leading optimal entanglement infidelity at weak noise and a recovery attaining it for any finite logical dimension. The optimal worst-input error lies between one and ddd times that infidelity at leading order, for logical dimension ddd. When the angle distribution is unknown, we optimize one decoder for every distribution compatible with the calibration. When spectral and calibration frequencies are integer multiples of a common frequency, moment positivity turns this into an exact finite optimization. Small measured means can still allow rare finite rotations. If the sole calibration datum is βr=E[sin⁡2r(θ/2)]β_r=\mathbb E[\sin^{2r}(θ/2)]βr​=E[sin2r(θ/2)], with θθθ the wrapped rotation phase at that common frequency, the optimal worst-prior infidelity is O(βr)O(β_r)O(βr​) exactly when generator powers through degree r−1r-1r−1 are correctable. When the first uncorrectable power has degree m<rm<rm<r, the optimal loss scales as βrm/rβ_r^{m/r}βrm/r​, with a sharp coefficient fixed by a universal moment problem. In a loss-free four-photon memory, population measurements at two calibration durations retain the fully informed quartic error coefficient for a fixed symmetric narrow-noise family with positive variance and finite fourth moment; a single duration permits loss quadratic in the noise width.
The paper studies a fixed finite-dimensional quantum encoding exposed to e−iσxHe^{-i\sigma xH}e−iσxH, with known HHH but unobserved random angle, followed by one deterministic recovery. It asks how encoding geometry and incomplete calibration jointly limit recovery fidelity.
For a nondegenerate prefix correcting I,H,…,HLI,H,\ldots,H^LI,H,…,HL, it derives the exact leading optimal entanglement infidelity, 1−Fe,opt=gL2hmVσ2m/(m!)2+o(σ2m)1-F_{e,\mathrm{opt}}=g_L^2h_m\mathcal V\sigma^{2m}/(m!)^2+o(\sigma^{2m})1−Fe,opt​=gL2​hm​Vσ2m/(m!)2+o(σ2m), where m=L+1m=L+1m=L+1. Physical block-Krylov orthogonalization determines propagation gLg_LgL​ and logical boundary distortion V\mathcal VV; projection of xmx^mxm onto lower angle powers determines residual variance hmh_mhm​. A coherently adjusted, polar-aligned recovery attains the coefficient, with a converse covering all CPTP recoveries. After a known logical rotation is removed, optimal half-diamond error lies between one and ddd times optimal entanglement infidelity at leading order. Petz recovery doubles the occupied-shell contribution but retains the optimal leakage contribution.
For uncertain priors, a minimax polynomial selects one common decoder. Commensurate spectral and calibration frequencies permit exact finite moment optimization. With sole datum βr=E[sin⁡2r(θ/2)]\beta_r=\mathbb E[\sin^{2r}(\theta/2)]βr​=E[sin2r(θ/2)], worst-prior infidelity is O(βr)O(\beta_r)O(βr​) exactly when powers through r−1r-1r−1 are correctable; a first defective power m<rm<rm<r instead gives βrm/r\beta_r^{m/r}βrm/r​ scaling under additional boundary hypotheses. In a loss-free four-photon example, two calibration durations retain the informed quartic coefficient, whereas one permits quadratic loss.
The local theorem requires rank and moment conditions; uniform guarantees require tail control. The model excludes independently fluctuating or noncommuting generators and control during storage. Optical recovery implementability and photon loss remain unresolved.
What must a quantum error-correction decoder know about temporally correlated noise, and what does it cost to learn? We study this question for fixed stabilizer memory experiments with known system-environment interactions. We formulate calibration in terms of the fidelity differences that select a Pauli recovery and relate missing information to the resulting fidelity loss. Our main example uses weak coherent XXX rotations in a class of CSS codes including Shor, Steane, and odd-distance rotated surface codes. All physical qubits share a sign either fixed throughout a run or independently redrawn each interval. The two models have identical syndrome statistics and the same spatiotemporal Pauli process (SPP), obtained by Pauli-twirling every noise interval. Yet at suitable storage times, they require different logical corrections. In the weak-noise limit, each model is almost perfectly correctable when known. Without model information, even the best final recovery has a worst-case fidelity loss approaching 1/21/21/2 relative to the noise-aware optimum, despite access to the full syndrome record. For this pair of models, at fixed code and fixed positive target loss below 1/21/21/2, we prove matching calibration bounds. With logical preparation and final readout, complete QEC cycles require a number of noise intervals scaling as the inverse rotation angle raised to the code's XXX distance. Allowing two uninterrupted intervals before one extraction reduces the optimal cost to inverse-square scaling. Physical Pauli twirling of every noise interval changes both recovery performance and its information requirements. Discarding the record of applied random Pauli operations makes the SPP sufficient for optimal recovery. Keeping this record can improve the attainable fidelity, but reaching that optimum may require additional noise information.
Even a recovery that maximizes worst-input entanglement fidelity can retain avoidable errors in subsequent measurements. Entanglement fidelity is the probability of passing a test of whether the state and its entanglement were preserved; infidelity is the probability of failing it. Operational error is the largest possible change in any measurement probability, quantified by the normalized diamond distance. For every finite-dimensional noise channel and fixed encoding, we prove that operational error and worst-input entanglement infidelity have the same minimum over all recovery operations. The proof constructs one final unitary (a reversible quantum operation) that makes any recovery's operational error no greater than its original worst-input entanglement infidelity. With a retained noise record, we determine the optimal error and characterize all optimal decoders subject to a Kraus-rank limit for each outcome. For a fixed decoded channel, a semidefinite program finds the optimal final unitary in the low-error regime. We characterize all optimal final corrections and show that, at a fixed error floor 0<ε<10<ε<10<ε<1, the operational optimizers' sensitivity to residual unitary errors of size sss is at worst of order s4/3s^{4/3}s4/3, while the canonical polar correction has quadratic sensitivity.
Coherent noise on the physical qubits can lead to coherent error on the logical qubits in a quantum error-corrected system, even if the best recovery operator is found. An optimal decoder under coherent noise finds the minimal angle of the logical, coherent rotation for a given physical rotation angle under the uniform, coherent noise model. We show that one can optimally decode2D2\mathrm{D}2Dcompass codes without an explicit optimal decoder in polynomial complexity by simply flipping the sampled logical angle using a Majorana simulator and a sub-optimal decoder. Estimating the threshold requires tools different from MWPM decoding. As the infidelity curves don't intersect, we use finite-size scaling to evaluate optimal decoding performance by estimating the logical infidelity at the infinite distance limit. We motivate our finite size scaling ansatz based on repetition code-like compass codes for which we can exactly calculate the logical channel up to a distance of up to 1021. Under optimal decoding, our finite-size scaling methods predict a threshold of(0.274±0.010)π(0.274\pm 0.010)\pi(0.274±0.010)πfor the surface code and a threshold of(0.252±0.001)π(0.252\pm 0.001)\pi(0.252±0.001)πfor the m=2 Z-stacked Shor code. We compare our results to previous predictions and find a slight deviation in the case of the Z-stacked Shor code and a slight decrease in the case of the surface code.
Purity does not change under a phase rotation, but estimating it from successive optical pulses can still require relative-phase information. This article determines the best possible precision when an unknown single-mode source is independently prepared, undergoes photon loss, and is then rotated by a hidden correlated phase trajectory. A uniform precision law. The normal source state satisfies Tr⁡(ρN)≤E\operatorname{Tr}(\rho N)\le ETr(ρN)≤E and Tr⁡(ρNs)≤M\operatorname{Tr}(\rho N^s)\le MTr(ρNs)≤M, with fixed E,M>0E,M>0E,M>0 and s≥1s\ge1s≥1. The phase starts uniformly on the circle, independently of the entire sequence of independent increments, whose known Fourier spectrum is exp⁡(−γ∣q∣β)\exp(-\gamma|q|^\beta)exp(−γ∣q∣β), with γ>0\gamma>0γ>0 and 0<β≤20<\beta\le20<β≤2. The target is the purity Pη=Tr⁡[Lη(ρ)2]P_\eta=\operatorname{Tr}[\mathcal L_\eta(\rho)^2]Pη​=Tr[Lη​(ρ)2] after pure loss, not the purity of the phase-averaged marginal. For mmm source preparations, set p=1−ηp=1-\etap=1−η, Lm=[log⁡(m+e)]1/βL_m=[\log(m+\mathrm e)]^{1/\beta}Lm​=[log(m+e)]1/β and qm=⌈[log⁡m/(2γ)]1/β⌉q_m=\lceil[\log m/(2\gamma)]^{1/\beta}\rceilqm​=⌈[logm/(2γ)]1/β⌉. The minimax expected absolute error obeys Rm(Pη)≍Fm(p),Fm(p)=Lm−sηqm+Lm−2s(1+pLm)−2s. R_m(P_\eta)\asymp F_m(p),\qquad F_m(p)=L_m^{-s}\eta^{q_m}+L_m^{-2s}(1+pL_m)^{-2s}. Rm​(Pη​)≍Fm​(p),Fm​(p)=Lm−s​ηqm​+Lm−2s​(1+pLm​)−2s. The comparison constants are uniform for η∈[1/2,1]\eta\in[1/2,1]η∈[1/2,1], including transmissivities approaching one as the budget grows. An ideal adjacent-pair interference measurement, independent of the transmissivity, attains the order. The converse allows arbitrary joint measurements on the complete correlated quantum history. The same law holds for the second Rényi entropy −log⁡Pη-\log P_\eta−logPη​. What loss changes. Vacuum–high-photon coherence and coherence between broad high-photon packets give two different hard pairs of legal sources. Without loss the rate is (log⁡m)−s/β(\log m)^{-s/\beta}(logm)−s/β; at fixed nonzero loss it is (log⁡m)−4s/β(\log m)^{-4s/\beta}(logm)−4s/β. Each loss level has its own output target. The faster rate therefore does not mean improved recovery of the original input purity. Both constructions retain their actual moment budgets, the same source within each experiment and complete photon tails. Mean cost, stopping and unbiased readings. Allowing arbitrary quantum memory, feedback and an observable stopping time leaves the order unchanged when only the worst-case mean number of requested raw source slots is bounded by BBB: RBstop(Pη)≍F⌊B⌋(1−η). R_B^{\mathrm{stop}}(P_\eta)\asymp F_{\lfloor B\rfloor}(1-\eta). RBstop​(Pη​)≍F⌊B⌋​(1−η). Every requested slot is charged, including discarded slots and failed outcomes. An exactly unbiased purity estimator attains the same absolute-error order with finite mean cost and almost-sure termination, using rare, unbounded signed readings. Under the specified independent common-phase reset and auxiliary-reset permissions for repeated blocks, exact unbiasedness and uniformly finite mean cost rule out uniformly finite variance. This is a uniform obstruction over sources, not a claim of infinite variance at every source; exact unbiasedness is not asserted for the Rényi entropy. The analysis builds on swap/parity measurements, drift diagnostics, quadratic-functional deconvolution and randomized telescoping. Its contribution is the matching quantum-history law, its uniform loss dependence and its return to the actual mean preparation budget. The integrated 14-page PDF contains two figure groups, complete proofs and references. The figures illustrate asymptotic rate functions, not experimental data or calibrated sample requirements; detector, phase-control, storage and elapsed-time costs are separate from the source-slot optimum.
We quantify the extra Bayes risk of locating a quantum change point and estimating its amplitude with one measurement. The joint and marginal optimizations use the full record and the same joint prior, with both parameters unknown. For product records on a known pure state curve, position has clipped absolute loss in resolution units, and amplitude offset has squared loss in fixed calibrated units. Ideal steps exhibit certified conflict at finite signal strength, including in phase records of sixteen qubits, and recover both informative marginal optima at strong signal. For finite offset prior width, a retained quantum boundary region serves position, and the remaining suffix serves amplitude. Physical recovery holds when strength grows more slowly than the square root of record length. Known smooth rises also admit leading recovery in the coherent experiment as strength grows and width shrinks. For the quintic profile, we establish two residual cost scaling laws. The residual cost is Θ(s−2)Θ(s^{-2})Θ(s−2) as s→∞s\to\inftys→∞. Taking the strong signal limit at fixed www yields a limiting cost of Θ(w3)Θ(w^3)Θ(w3) as w→0w\to0w→0. In the resolved local model, quadratic position loss admits a common optimum within the covariant class. These results link onset geometry and decision loss to Bayesian measurement compatibility in quantum change point estimation.
Exact physical memory is an unstable target: a process of Hankel rank one can be arbitrarily close to processes requiring larger classical and quantum carriers. We make this obstruction quantitative and then identify the extra structure under which a physical finite-sample upper theorem is possible. First, on a stationary binary Markov family whose mixing gap is uniformly at least one half, every estimator of exact linear rank, minimum classical memory, or minimum quantum Hilbert dimension has worst-case error at least 3/8 at local separation Θ([N(L−1)]−1/2)\Theta([N(L-1)]^{-1/2})Θ([N(L−1)]−1/2) from the rank-one model. The smallest nonzero singular value of an explicit Hankel core is proportional to the same parameter. Thus a spectral or dynamical margin is necessary even under rapid mixing. Second, finite Hankel data determine a minimum linear realization only up to similarity, whereas nonnegativity and complete positivity are not invariant under a generic similarity. We give an exact two-state counterexample and then formulate the missing assumption as a calibrated physical core. For an invertible core HHH, all shifts are recovered in one basis by A~a=H~−1H~a\tilde{A}_a = \tilde{H}^{-1}\tilde{H}_aA~a​=H~−1H~a​. An explicit perturbation theorem, followed by Choi positive-part projection and one common trace-preserving correction, returns a genuine quantum instrument. A direct-query finite-sample corollary controls its error uniformly over adaptive policies and exposes every dependence on core conditioning, physical calibration, horizon, and confidence. The resulting linear-in-horizon coefficient is first-order sharp: a one-state classical process attains the exact discrepancy 1−(1−Δ/2)L1-(1-\Delta/2)^L1−(1−Δ/2)L at one-step diamond radius Δ\DeltaΔ. Third, we prove a compact-state classicalization theorem. Any finite-dimensional physical memory described by a compact base-norm state space has, at horizon LLL and operational error η>0\eta>0η>0, a classical realization whose number of states is the seeded covering number at radius 2η/L2\eta/L2η/L, uniformly over adaptive policies. For a ddd-dimensional quantum instrument this gives, for d≥2d\geq 2d≥2, (1+2(1−d−1)Lη)d2−1 \left(1+\frac{2(1-d^{-1})L}{\eta}\right)^{d^2-1} (1+η2(1−d−1)L​)d2−1 states, with no extra transient state; one state suffices for d=1d=1d=1. The ambient exponent d2−1d^2-1d2−1 is optimal for universal trace-norm discretization, while a compact branch-invariant reachable set replaces it by its own metric entropy. Consequently, an unbounded exact quantum/classical memory separation cannot remain unbounded at fixed ddd, LLL, η\etaη. Robust quantum advantage must instead be quantified as a joint precision–horizon tradeoff. Deterministic verification code audits the mixing lower bound, the similarity-gauge counterexample, common-shift recovery, physical repair, and finite-net simulation.