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-State Recovery Under Uncertain Histories: Temporal Ordering, Information Sufficiency, and Fidelity Bounds

Denise Venerable, Grok SpaceXAI, Gemini Google, ChatGPT OpenAI

Published Nov 13, 2026• 0 citations
Publisher

Abstract

This theoretical preprint investigates quantum-state recovery under uncertain historical records, distinguishing temporal ordering, information sufficiency, record erasure, and undetected corruption within finite-dimensional quantum-information models. Using a logical-qubit framework, the study establishes necessary and sufficient conditions for exact recovery by a single history-independent quantum channel, showing that admissible unitary errors must differ only by a global phase. It examines commuting and noncommuting transformations, demonstrating when distinct operational histories share a common inverse and when temporal ordering changes recovery fidelity. The analysis derives worst-case fidelity bounds for phase-gate catalogs, including a minimax recovery theorem based on the shortest enclosing phase arc and the geometry of the full phase catalog. It compares flagged erasure, blind trust in corrupted labels, and reliability-aware recovery strategies. At a matched record-error rate of 0.10, flagged erasure with midpoint recovery achieves higher expected worst-input fidelity and a stronger worst-case guarantee than blind trust under the specified models. The manuscript also examines calibration probes, measurement back-action, and the distinction between historical reconstruction and quantum-state restoration. Analytical results are supported by computational investigations, with experimental records retained separately. The findings are theoretical and computational. They do not constitute experimental validation of a physical quantum device or magnesium-silicate implementation. The work situates its results within established quantum error correction, quantum-information theory, and quantum-process research.

DOI
10.5281/zenodo.24207559

Related papers

History-Conditioned Quantum Error Correction under Temporally Correlated Noise: Finite-Horizon Performance and Reproducible Simulations of a Three-Qubit Phase-Error Code

TrinityLabo

This preliminary research preprint presents a reproducible numerical study of history-conditioned quantum error correction under temporally correlated noise. We consider a three-qubit phase-error code subject to a synthetic Pauli noise model with a persistent hidden noise regime. A noisy classical monitor and the accumulated syndrome/measurement history are used to estimate that regime through standard Bayesian hidden-Markov filtering, and recovery operations are selected by a causal maximum-a-posteriori rule. The central question is whether accessible temporal information can extend the finite interval over which encoded quantum information remains reliable. In 100,000 matched synthetic trajectories, survival through 20 correction rounds increases from 0.74406 for a snapshot MAP decoder to 0.91455 for the history-conditioned decoder. Under a 90% no-logical-fault survival criterion, the empirical computational-memory window increases from 6 to 25 rounds, with a simultaneous 95% lower confidence band supporting 23 rounds for the history-conditioned policy. Control experiments show that the advantage disappears when temporal predictability is removed: when the hidden regime becomes independent from round to round, the history-conditioned and snapshot policies coincide. Additional monitor and model ablations demonstrate that the benefit depends on correction-relevant temporal correlations, informative side information, and adequate calibration. The work also formulates finite-horizon survival criteria and sufficient error-budget bounds without assuming independent logical faults, while explicitly separating classical filter stability from preservation of quantum information. This study does not claim a new Bayesian filtering method, superiority over existing temporal quantum-error-correction decoders, a scalable fault-tolerance threshold, or demonstrated room-temperature quantum-computing hardware. Rather, it provides a concrete operational specialization of the broader TrinityLabo history-first framework and a small, reproducible benchmark showing how temporal inference can condition quantum recovery under specified noise assumptions. Ambient-temperature operation remains a future experimental application requiring calibrated device-level noise models, fault-prone syndrome extraction, hardware latency analysis, and comparison against established temporal decoders.

•Sep 26, 2026•0 citations

Quantum state reconstruction from incomplete preparation records

Hikaru Wakaura

Abstract Preparing additional quantum states while retaining a source requires information beyond an arbitrary unknown input. We formulate reconstruction from incom- plete classical preparation records as an identity channel on the source and two output preparations. For a short interval of QPE phase states, we derive the exact record-only minimax fidelity and an attaining endpoint superposition, closing the gap between center replay and an endpoint upper bound. An explicit one-ancilla circuit realizes the optimum with a known success probability, while deterministic synthesis provides a finite-circuit alternative. Shor and randomized-simulation examples expose different obstructions from discrete ambiguity and missing ran- dom choices. In one randomized-simulation setting, optimal conditional fidelity averaged over records was 0.925, although robust fidelity above five sixths was impossible for eight of ten records. Session calibration and resource-controlled comparisons distinguish average performance from worst-case guarantees. Hard- ware diagnostics test operational phase models, source waiting and preparation costs. They do not certify intrinsic gate angles, reconstruction fidelity or physical source preservation. The analysis identifies information and operational conditions without changing universal cloning bounds.

•Oct 28, 2026•0 citations

Relational Information, Classical Records, and Preparation-Aware Quantum Recovery

Qingchun Zhang

This preprint studies operational equivalence and recovery in a twenty-dimensional residual system with a fixed four-sector representation of dimensions 8, 8, 2 and 2. It distinguishes what a declared observation algebra can detect, what a channel preserves, and what a retained classical record makes recoverable. Record-resolved criteria separate useful reversible-error records from unrelated labels and measured-sector records, even when the discarded channel is the same. For a specified coarse-record model, the work identifies exactly recoverable observable algebras and proves an optimal entanglement-fidelity expression on a fixed four-state orbit code. Preparation-aware recovery is then classified over all one-use isometric subspaces in the stated family. An explicit ten-dimensional marker code attains exact recovery under a specified stochastic record where the whole-sector support restriction permits only eight dimensions. Its encoding, nonbaseline marker measurement, and conditional inverse operations remain supplied resources. Scoped Lean evidence verifies the explicit arbitrary-complex-matrix recovery construction and related finite identities; it does not formalize the general complete-positivity/reference framework or optimal-dimension theorem. The recorded-error model is not derived from the companion exchange-timing model, and no protection of its long pulse sequence is claimed.

•Sep 10, 2026•0 citations

Environment-Record Leakage for Finite Quantum Error Histories: Balanced Global Minimax, Complete Minimizer Geometry, and Distributional Stability

Byoungwoo Lee

Overview This preprint develops a finite-history framework for quantifying how coherently stored environment records reveal logical quantum information. Instead of considering only which error occurred, the analysis treats the full complementary environment channel associated with a labeled family of finite quantum-error histories. For two selected history labels, the leakage is expressed exactly through the numerical-range diameter of the compressed relative operator. This yields global finite-history compression bounds, a zero-leakage characterization equivalent to Knill–Laflamme scalarity, and lower and upper bounds for recovery by a single common channel. Main results For a balanced independent two-step dephasing model on one logical qubit encoded into two physical qubits, the paper solves the worst-case optimization over the full rank-two code Grassmannian: $$\inf_{V\in\mathrm{Gr}(2,4)} \sup_{\phi,\psi} \mathcal L_{\mathrm{hist}}(V) = \frac12.$$ The transverse leakage is determined exactly by $$L_{\mathrm{tr}}(\eta,t) = \max\left\{ \frac12,\, 2\eta,\, \sqrt{\frac14-\eta^2}\sqrt{1+t} \right\}.$$ All global minimizers are classified. Besides the parity-isoclinic orthogonal-axis family, the minimizer set contains a genuine non-isoclinic region characterized by $$0 < \eta \le \frac14, \qquad e_z = o_z = 0, \qquad \vert{}\mathbf e \cdot \mathbf o\vert{} \le \frac{4\eta^2}{1-4\eta^2}.$$ A universal quartic inequality needed for the all-code theorem is reduced analytically to an exact polynomial-positivity problem and closed using rational Bernstein-basis verification. Distributional stability On a fixed labeled history-operator family, the complementary channel, worst-parameter leakage, and all-code minimax value are Lipschitz-stable under changes of the history probability distribution. With $$d_{\mathrm A}(p,q) = \left[ \sum_h \left(\sqrt{p_h}-\sqrt{q_h}\right)^2 \right]^{1/2},$$ the minimax value satisfies $$\vert{}\Lambda(p)-\Lambda(q)\vert{} \le 2d_{\mathrm A}(p,q).$$ Consequently, key quantitative implications of the balanced complete solution—including the minimax value, principal near-minimizer coordinate constraints, and a universal operational recovery lower bound—remain stable under nearby biased or correlated perturbations.

•Jul 25, 2026•1 citation

Information-Calibrated Quantum Diffusion: Aligning Forward Noise with Reverse Recoverability

Qipeng Qian, Yuntao Qian

Quantum diffusion models typically parameterize forward corruption by raw channel strength, even though this parameter does not directly quantify how much ensemble information is erased or how difficult the corresponding reverse problem is. We introduce the classical--quantum information decrement $Δ_t=I(X{:}Q_{t-1})-I(X{:}Q_t)$ as an intrinsic diffusion coordinate that links forward noise allocation to reverse recoverability. Along depolarization, equalizing $Δ_t$ yields the unique minimax discretization of the forward information loss, while universal recoverability gives the same quantity an operational interpretation as a physically attainable local recovery budget. We further show that such local calibration is not sufficient for stochastic generation: models can satisfy the same recovery criterion while producing substantially different state distributions. This motivates a stochastic learner that combines information-calibrated recovery constraints with distribution matching. We establish finite-sample calibration and compositional trace-Wasserstein control for the resulting learner. Controlled quantum experiments validate the predicted information--recovery alignment, show that the recovery constraints improve local inversion, and confirm the complementary role of distribution matching in endpoint generation. The resulting framework also achieves stronger endpoint trace-Wasserstein performance than an official QuDDPM implementation with fewer trainable parameters. Overall, our work provides a unified information-theoretic principle for designing forward schedules, calibrating reverse steps, and separating physical recovery from generative coverage in quantum diffusion.

quant-pharXiv:2608.14083•Aug 17, 2026•0 citations

Information recoverability of noisy quantum states

Xuanqiang Zhao, Benchi Zhao, Zihan Xia +1 more

Extracting classical information from quantum systems is an essential step of many quantum algorithms. However, this information could be corrupted as the systems are prone to quantum noises, and its distortion under quantum dynamics has not been adequately investigated. In this work, we introduce a systematic framework to study how well we can retrieve information from noisy quantum states. Given a noisy quantum channel, we fully characterize the range of recoverable classical information. This condition allows a natural measure quantifying the information recoverability of a channel. Moreover, we resolve the minimum information retrieving cost, which, along with the corresponding optimal protocol, is efficiently computable by semidefinite programming. As applications, we establish the limits on the information retrieving cost for practical quantum noises and employ the corresponding protocols to mitigate errors in ground state energy estimation. Our work gives the first full characterization of information recoverability of noisy quantum states from the recoverable range to the recovering cost, revealing the ultimate limit of probabilistic error cancellation.

arXiv:2203.04862•Quantum•Apr 13, 2023•12 citations
This theoretical preprint investigates quantum-state recovery under uncertain historical records, distinguishing temporal ordering, information sufficiency, record erasure, and undetected corruption within finite-dimensional quantum-information models. Using a logical-qubit framework, the study establishes necessary and sufficient conditions for exact recovery by a single history-independent quantum channel, showing that admissible unitary errors must differ only by a global phase. It examines commuting and noncommuting transformations, demonstrating when distinct operational histories share a common inverse and when temporal ordering changes recovery fidelity. The analysis derives worst-case fidelity bounds for phase-gate catalogs, including a minimax recovery theorem based on the shortest enclosing phase arc and the geometry of the full phase catalog. It compares flagged erasure, blind trust in corrupted labels, and reliability-aware recovery strategies. At a matched record-error rate of 0.10, flagged erasure with midpoint recovery achieves higher expected worst-input fidelity and a stronger worst-case guarantee than blind trust under the specified models. The manuscript also examines calibration probes, measurement back-action, and the distinction between historical reconstruction and quantum-state restoration. Analytical results are supported by computational investigations, with experimental records retained separately. The findings are theoretical and computational. They do not constitute experimental validation of a physical quantum device or magnesium-silicate implementation. The work situates its results within established quantum error correction, quantum-information theory, and quantum-process research.
This preliminary research preprint presents a reproducible numerical study of history-conditioned quantum error correction under temporally correlated noise. We consider a three-qubit phase-error code subject to a synthetic Pauli noise model with a persistent hidden noise regime. A noisy classical monitor and the accumulated syndrome/measurement history are used to estimate that regime through standard Bayesian hidden-Markov filtering, and recovery operations are selected by a causal maximum-a-posteriori rule. The central question is whether accessible temporal information can extend the finite interval over which encoded quantum information remains reliable. In 100,000 matched synthetic trajectories, survival through 20 correction rounds increases from 0.74406 for a snapshot MAP decoder to 0.91455 for the history-conditioned decoder. Under a 90% no-logical-fault survival criterion, the empirical computational-memory window increases from 6 to 25 rounds, with a simultaneous 95% lower confidence band supporting 23 rounds for the history-conditioned policy. Control experiments show that the advantage disappears when temporal predictability is removed: when the hidden regime becomes independent from round to round, the history-conditioned and snapshot policies coincide. Additional monitor and model ablations demonstrate that the benefit depends on correction-relevant temporal correlations, informative side information, and adequate calibration. The work also formulates finite-horizon survival criteria and sufficient error-budget bounds without assuming independent logical faults, while explicitly separating classical filter stability from preservation of quantum information. This study does not claim a new Bayesian filtering method, superiority over existing temporal quantum-error-correction decoders, a scalable fault-tolerance threshold, or demonstrated room-temperature quantum-computing hardware. Rather, it provides a concrete operational specialization of the broader TrinityLabo history-first framework and a small, reproducible benchmark showing how temporal inference can condition quantum recovery under specified noise assumptions. Ambient-temperature operation remains a future experimental application requiring calibrated device-level noise models, fault-prone syndrome extraction, hardware latency analysis, and comparison against established temporal decoders.
Abstract Preparing additional quantum states while retaining a source requires information beyond an arbitrary unknown input. We formulate reconstruction from incom- plete classical preparation records as an identity channel on the source and two output preparations. For a short interval of QPE phase states, we derive the exact record-only minimax fidelity and an attaining endpoint superposition, closing the gap between center replay and an endpoint upper bound. An explicit one-ancilla circuit realizes the optimum with a known success probability, while deterministic synthesis provides a finite-circuit alternative. Shor and randomized-simulation examples expose different obstructions from discrete ambiguity and missing ran- dom choices. In one randomized-simulation setting, optimal conditional fidelity averaged over records was 0.925, although robust fidelity above five sixths was impossible for eight of ten records. Session calibration and resource-controlled comparisons distinguish average performance from worst-case guarantees. Hard- ware diagnostics test operational phase models, source waiting and preparation costs. They do not certify intrinsic gate angles, reconstruction fidelity or physical source preservation. The analysis identifies information and operational conditions without changing universal cloning bounds.
This preprint studies operational equivalence and recovery in a twenty-dimensional residual system with a fixed four-sector representation of dimensions 8, 8, 2 and 2. It distinguishes what a declared observation algebra can detect, what a channel preserves, and what a retained classical record makes recoverable. Record-resolved criteria separate useful reversible-error records from unrelated labels and measured-sector records, even when the discarded channel is the same. For a specified coarse-record model, the work identifies exactly recoverable observable algebras and proves an optimal entanglement-fidelity expression on a fixed four-state orbit code. Preparation-aware recovery is then classified over all one-use isometric subspaces in the stated family. An explicit ten-dimensional marker code attains exact recovery under a specified stochastic record where the whole-sector support restriction permits only eight dimensions. Its encoding, nonbaseline marker measurement, and conditional inverse operations remain supplied resources. Scoped Lean evidence verifies the explicit arbitrary-complex-matrix recovery construction and related finite identities; it does not formalize the general complete-positivity/reference framework or optimal-dimension theorem. The recorded-error model is not derived from the companion exchange-timing model, and no protection of its long pulse sequence is claimed.
Overview This preprint develops a finite-history framework for quantifying how coherently stored environment records reveal logical quantum information. Instead of considering only which error occurred, the analysis treats the full complementary environment channel associated with a labeled family of finite quantum-error histories. For two selected history labels, the leakage is expressed exactly through the numerical-range diameter of the compressed relative operator. This yields global finite-history compression bounds, a zero-leakage characterization equivalent to Knill–Laflamme scalarity, and lower and upper bounds for recovery by a single common channel. Main results For a balanced independent two-step dephasing model on one logical qubit encoded into two physical qubits, the paper solves the worst-case optimization over the full rank-two code Grassmannian: inf⁡V∈Gr(2,4)sup⁡ϕ,ψLhist(V)=12.\inf_{V\in\mathrm{Gr}(2,4)} \sup_{\phi,\psi} \mathcal L_{\mathrm{hist}}(V) = \frac12.infV∈Gr(2,4)​supϕ,ψ​Lhist​(V)=21​. The transverse leakage is determined exactly by Ltr(η,t)=max⁡{12, 2η, 14−η21+t}.L_{\mathrm{tr}}(\eta,t) = \max\left\{ \frac12,\, 2\eta,\, \sqrt{\frac14-\eta^2}\sqrt{1+t} \right\}.Ltr​(η,t)=max{21​,2η,41​−η2​1+t​}. All global minimizers are classified. Besides the parity-isoclinic orthogonal-axis family, the minimizer set contains a genuine non-isoclinic region characterized by 0<η≤14,ez=oz=0,∣e⋅o∣≤4η21−4η2.0 < \eta \le \frac14, \qquad e_z = o_z = 0, \qquad \vert{}\mathbf e \cdot \mathbf o\vert{} \le \frac{4\eta^2}{1-4\eta^2}.0<η≤41​,ez​=oz​=0,∣e⋅o∣≤1−4η24η2​. A universal quartic inequality needed for the all-code theorem is reduced analytically to an exact polynomial-positivity problem and closed using rational Bernstein-basis verification. Distributional stability On a fixed labeled history-operator family, the complementary channel, worst-parameter leakage, and all-code minimax value are Lipschitz-stable under changes of the history probability distribution. With dA(p,q)=[∑h(ph−qh)2]1/2,d_{\mathrm A}(p,q) = \left[ \sum_h \left(\sqrt{p_h}-\sqrt{q_h}\right)^2 \right]^{1/2},dA​(p,q)=[∑h​(ph​​−qh​​)2]1/2, the minimax value satisfies ∣Λ(p)−Λ(q)∣≤2dA(p,q).\vert{}\Lambda(p)-\Lambda(q)\vert{} \le 2d_{\mathrm A}(p,q).∣Λ(p)−Λ(q)∣≤2dA​(p,q). Consequently, key quantitative implications of the balanced complete solution—including the minimax value, principal near-minimizer coordinate constraints, and a universal operational recovery lower bound—remain stable under nearby biased or correlated perturbations.
Quantum diffusion models typically parameterize forward corruption by raw channel strength, even though this parameter does not directly quantify how much ensemble information is erased or how difficult the corresponding reverse problem is. We introduce the classical--quantum information decrement Δt=I(X:Qt−1)−I(X:Qt)Δ_t=I(X{:}Q_{t-1})-I(X{:}Q_t)Δt​=I(X:Qt−1​)−I(X:Qt​) as an intrinsic diffusion coordinate that links forward noise allocation to reverse recoverability. Along depolarization, equalizing ΔtΔ_tΔt​ yields the unique minimax discretization of the forward information loss, while universal recoverability gives the same quantity an operational interpretation as a physically attainable local recovery budget. We further show that such local calibration is not sufficient for stochastic generation: models can satisfy the same recovery criterion while producing substantially different state distributions. This motivates a stochastic learner that combines information-calibrated recovery constraints with distribution matching. We establish finite-sample calibration and compositional trace-Wasserstein control for the resulting learner. Controlled quantum experiments validate the predicted information--recovery alignment, show that the recovery constraints improve local inversion, and confirm the complementary role of distribution matching in endpoint generation. The resulting framework also achieves stronger endpoint trace-Wasserstein performance than an official QuDDPM implementation with fewer trainable parameters. Overall, our work provides a unified information-theoretic principle for designing forward schedules, calibrating reverse steps, and separating physical recovery from generative coverage in quantum diffusion.
Extracting classical information from quantum systems is an essential step of many quantum algorithms. However, this information could be corrupted as the systems are prone to quantum noises, and its distortion under quantum dynamics has not been adequately investigated. In this work, we introduce a systematic framework to study how well we can retrieve information from noisy quantum states. Given a noisy quantum channel, we fully characterize the range of recoverable classical information. This condition allows a natural measure quantifying the information recoverability of a channel. Moreover, we resolve the minimum information retrieving cost, which, along with the corresponding optimal protocol, is efficiently computable by semidefinite programming. As applications, we establish the limits on the information retrieving cost for practical quantum noises and employ the corresponding protocols to mitigate errors in ground state energy estimation. Our work gives the first full characterization of information recoverability of noisy quantum states from the recoverable range to the recovering cost, revealing the ultimate limit of probabilistic error cancellation.