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 reconstruction from incomplete preparation records

Hikaru Wakaura

Published Oct 28, 2026• 0 citations
PDF (CC BY)Publisher

Abstract

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.

DOI
10.21203/rs.3.rs-11430091/v1

Related papers

Minimum Quantum Storage from Incomplete Channel Observations

Jeremy Rodgers

How much quantum storage must a hidden implementation retain when experimental observations leave its structure undetermined? This paper establishes exact minimum quantum-storage requirements across all implementations compatible with specified channel observations. The resource is the worst-input expected logarithm of retained quantum dimension across one controlled temporal cut, with unlimited classical records available at no cost. For the channel dimension measure introduced by Cope and Uola, the paper proves their suggested minimax equality relating minimum storage to output Schmidt measure and extends it to every nonempty compact convex set of compatible channels. One common input enforces the resource minimum across all compatible implementations. A finite optimal implementation exists, although an optimal entangled probe need not. For qubit channels, four measured coefficients determine an exact, attained minimum without assuming channel covariance or unitality. An explicit five-Kraus construction attains 99/169, while a separate analytical certificate proves that every compatible implementation must use nontrivial quantum storage with at least that probability on the same specified input. A second exact formula uses only two Pauli-transfer coefficients and yields a minimum storage requirement of 0.58 when both coefficients are jointly constrained to the interval [0.79, 0.81]. The paper also presents semidefinite optimization over compatible experimental uncertainty regions. The results require calibrated quantum inputs and outputs, concealed preparation labels, and accounting for every quantum carrier across the storage cut. They constrain storage resources without reconstructing the hidden implementation or certifying environmental non-Markovianity. Motivated by Shadow Theory’s source/readout distinction, the proofs use standard quantum mechanics and quantum-information mathematics. Version 1.1 includes complete proofs, explicit attaining constructions, worked examples, and discussion of experimental assumptions and limitations. No experimental data are reported.

•Sep 6, 2026•0 citations

Quantum-State Recovery Under Uncertain Histories: Temporal Ordering, Information Sufficiency, and Fidelity Bounds

Denise Venerable, Grok SpaceXAI, Gemini Google +1 more

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.

•Nov 13, 2026•0 citations

Finite-classical-record quantum state reconstruction: one-shot bounds and acquisition limits

Wahyu Rahmaniar

Abstract We study the one-shot reconstruction of a quantum state when a single copy of the source is measured, the outcome is stored in a classical record of fixed finite dimension, and a state is prepared at the destination from the record. This acquisition-limited problem is distinguished from a visible benchmark in which the source label is available to the encoder. For a finite ensemble we derive finite-record bounds on the visible distortion in terms of the cumulative prior mass covered by the record and the optimal discrimination probability, identify the regimes in which they are exact, and solve the two-state visible problem at every record dimension. For pure-state ensembles, exact acquisition-limited reconstruction is possible if and only if the states are perfectly distinguishable, so nonorthogonal targets retain a positive error at every record dimension. For two equiprobable nonorthogonal pure states we derive the optimal trace-distance distortion within the reflection-symmetric two-outcome class in closed variational form and find that unrestricted numerical optimization with up to six outcomes attains the same value; the resulting symmetric value lies strictly below the guess-and-prepare, unambiguous-discrimination, fidelity-optimal, and Haar-random strategies and is realized by one classical bit and one feed-forward rotation. Every classical-record reconstruction is shown to be entanglement breaking, with a quantitative bound on the loss of entanglement with an inaccessible reference, and the record dimension is related to the spectral rank of an energy-constrained memory. These results quantify the separation between a finite classical description and the information obtainable from a single quantum system. MSC Classification: 81P15 , 81P17 , 81P45 , 81P47

•Sep 24, 2026•0 citations

Quantum Source Completions and Memory Environment Tradeoffs

Jeremy Rodgers

How much internal quantum memory is needed to reproduce a stationary stochastic process, and how does reducing that memory change the environmental resources required when output records are retained? This paper establishes exact quantum-source constructions and resource bounds under explicitly specified readout and retained-output conditions. A general completion theorem identifies the minimum Hilbert-space dimension for stationary triple data in the orthogonal-current-symbol source class: it equals the sum of the complex positive-semidefinite ranks of the middle-symbol slices. An attaining construction reproduces the entire canonical stationary order-two process. For the delayed trine process, the minimum classical hidden Markov model requires nine states at every non-independent parameter value. Quantum instruments reproduce the same complete output law using four-dimensional memory throughout the parameter range, with four dimensions proved necessary in a certified low-noise regime and three dimensions both sufficient and necessary on an explicit high-noise interval. The paper then separates reusable memory dimension from environmental dilation cost. On the certified high-noise interval, the exact one-step Pareto frontier consists of a three-dimensional source with recorded-channel Choi rank nine and a four-dimensional source with rank three. Here, Choi rank measures the minimum initially pure environmental remainder dimension for the channel retaining both the emitted classical symbol and final quantum memory. A separate mixed-support qutrit construction at noise parameter 0.99 improves complete-history costs and gives upper bounds close to universal lower bounds. These results show why optimizing a single step need not optimize a retained multi-step history. The analysis also distinguishes complete channels, fixed-input states and archive-only outputs, and demonstrates how access to a retained reference can distinguish generators with identical passive output statistics. Full-word proofs, algebraic complete-positivity certificates, a technical companion and reproducibility materials accompany the results. The exact intermediate memory boundary and complete-history optimum remain open. All results use standard quantum probabilities and apply to the stated operational resource models; they do not establish total hardware, energy or thermodynamic minima.

•Oct 28, 2026•0 citations

Retained Quantum Records: Recovery Limits and Control-Dependent Formation Costs

Kent Nimmo

AbstractRetained measurement records constrain recoverability, but their formation also depends on the available physical controls. We give exact, constructively attained answers to both questions in two specified models. For a balanced nondemolition qubit process with actual binary observer memories unavailable to the decoder, we determine the maximum recovery compatible with average readout accuracy and pair agreement. The finite-record solution includes its feasible region and a common memory-writing and recovery process, without assuming exchangeability of observed records. Under a complete conditional-pairwise-independence promise at fixed informative accuracy, the optimal coherence has a sharp inverse-square-root asymptotic; fully conditionally independent records instead give exponential decay. Thus identical single-record and pair-record calibrations need not justify the product-law recovery bound. We then fix a logical code in four spin-3/2 systems and sequential diagonal contacts with exact controlled-swap endpoints. Hard budgets for net contact action and added spectral control charge yield an exact peak-excursion frontier within a declared quadratic-plus-cubic control class. A single positive-amplitude preparation jointly attains the record, recovery and occupation requirements, connecting the two results through an exact finite-dimensional optimization. A closed three-record example distinguishes fixed complete records from fixed averaged data. Separately calibrated imperfect contacts admit one-sided finite-error extensions. Together, the results characterize both informational compatibility and control-dependent formation through common attaining apparatuses.Preprint status and related materialsAuthor-submitted preprint; not peer reviewed or accepted for publication. This theoretical and computational work addresses the compatibility of retained binary quantum records with optimized accessible-system recovery, and the control-dependent resources required to form those records in a specified spin encoding. The article provides exact finite-record bounds, attainable recovery and resource frontiers, and calibrated finite-error qualifications. The manuscript has been submitted to Foundations of Physics for journal consideration; this Figshare record is not a journal publication. The technical supplement is included as a second PDF in this same record. Related software, verification code, exact certificates, and selected computational evidence are available separately at https://doi.org/10.6084/m9.figshare.34886079 under the MIT licence. When a journal version of record becomes available, a link to its DOI will be added here.AuthorKent Nimmo; Independent Researcher, Vancouver, British Columbia, Canada; ORCID 0009-0003-8503-8891.Reading and related workBrowse Quantum Foundations for related work on records, access and measurement, and Mathematics for exact bounds and certified constructions. The MIT software/certificate archive remains a distinct record from these manuscript PDFs.

•Nov 2, 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
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.
How much quantum storage must a hidden implementation retain when experimental observations leave its structure undetermined? This paper establishes exact minimum quantum-storage requirements across all implementations compatible with specified channel observations. The resource is the worst-input expected logarithm of retained quantum dimension across one controlled temporal cut, with unlimited classical records available at no cost. For the channel dimension measure introduced by Cope and Uola, the paper proves their suggested minimax equality relating minimum storage to output Schmidt measure and extends it to every nonempty compact convex set of compatible channels. One common input enforces the resource minimum across all compatible implementations. A finite optimal implementation exists, although an optimal entangled probe need not. For qubit channels, four measured coefficients determine an exact, attained minimum without assuming channel covariance or unitality. An explicit five-Kraus construction attains 99/169, while a separate analytical certificate proves that every compatible implementation must use nontrivial quantum storage with at least that probability on the same specified input. A second exact formula uses only two Pauli-transfer coefficients and yields a minimum storage requirement of 0.58 when both coefficients are jointly constrained to the interval [0.79, 0.81]. The paper also presents semidefinite optimization over compatible experimental uncertainty regions. The results require calibrated quantum inputs and outputs, concealed preparation labels, and accounting for every quantum carrier across the storage cut. They constrain storage resources without reconstructing the hidden implementation or certifying environmental non-Markovianity. Motivated by Shadow Theory’s source/readout distinction, the proofs use standard quantum mechanics and quantum-information mathematics. Version 1.1 includes complete proofs, explicit attaining constructions, worked examples, and discussion of experimental assumptions and limitations. No experimental data are reported.
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.
Abstract We study the one-shot reconstruction of a quantum state when a single copy of the source is measured, the outcome is stored in a classical record of fixed finite dimension, and a state is prepared at the destination from the record. This acquisition-limited problem is distinguished from a visible benchmark in which the source label is available to the encoder. For a finite ensemble we derive finite-record bounds on the visible distortion in terms of the cumulative prior mass covered by the record and the optimal discrimination probability, identify the regimes in which they are exact, and solve the two-state visible problem at every record dimension. For pure-state ensembles, exact acquisition-limited reconstruction is possible if and only if the states are perfectly distinguishable, so nonorthogonal targets retain a positive error at every record dimension. For two equiprobable nonorthogonal pure states we derive the optimal trace-distance distortion within the reflection-symmetric two-outcome class in closed variational form and find that unrestricted numerical optimization with up to six outcomes attains the same value; the resulting symmetric value lies strictly below the guess-and-prepare, unambiguous-discrimination, fidelity-optimal, and Haar-random strategies and is realized by one classical bit and one feed-forward rotation. Every classical-record reconstruction is shown to be entanglement breaking, with a quantitative bound on the loss of entanglement with an inaccessible reference, and the record dimension is related to the spectral rank of an energy-constrained memory. These results quantify the separation between a finite classical description and the information obtainable from a single quantum system. MSC Classification: 81P15 , 81P17 , 81P45 , 81P47
How much internal quantum memory is needed to reproduce a stationary stochastic process, and how does reducing that memory change the environmental resources required when output records are retained? This paper establishes exact quantum-source constructions and resource bounds under explicitly specified readout and retained-output conditions. A general completion theorem identifies the minimum Hilbert-space dimension for stationary triple data in the orthogonal-current-symbol source class: it equals the sum of the complex positive-semidefinite ranks of the middle-symbol slices. An attaining construction reproduces the entire canonical stationary order-two process. For the delayed trine process, the minimum classical hidden Markov model requires nine states at every non-independent parameter value. Quantum instruments reproduce the same complete output law using four-dimensional memory throughout the parameter range, with four dimensions proved necessary in a certified low-noise regime and three dimensions both sufficient and necessary on an explicit high-noise interval. The paper then separates reusable memory dimension from environmental dilation cost. On the certified high-noise interval, the exact one-step Pareto frontier consists of a three-dimensional source with recorded-channel Choi rank nine and a four-dimensional source with rank three. Here, Choi rank measures the minimum initially pure environmental remainder dimension for the channel retaining both the emitted classical symbol and final quantum memory. A separate mixed-support qutrit construction at noise parameter 0.99 improves complete-history costs and gives upper bounds close to universal lower bounds. These results show why optimizing a single step need not optimize a retained multi-step history. The analysis also distinguishes complete channels, fixed-input states and archive-only outputs, and demonstrates how access to a retained reference can distinguish generators with identical passive output statistics. Full-word proofs, algebraic complete-positivity certificates, a technical companion and reproducibility materials accompany the results. The exact intermediate memory boundary and complete-history optimum remain open. All results use standard quantum probabilities and apply to the stated operational resource models; they do not establish total hardware, energy or thermodynamic minima.
AbstractRetained measurement records constrain recoverability, but their formation also depends on the available physical controls. We give exact, constructively attained answers to both questions in two specified models. For a balanced nondemolition qubit process with actual binary observer memories unavailable to the decoder, we determine the maximum recovery compatible with average readout accuracy and pair agreement. The finite-record solution includes its feasible region and a common memory-writing and recovery process, without assuming exchangeability of observed records. Under a complete conditional-pairwise-independence promise at fixed informative accuracy, the optimal coherence has a sharp inverse-square-root asymptotic; fully conditionally independent records instead give exponential decay. Thus identical single-record and pair-record calibrations need not justify the product-law recovery bound. We then fix a logical code in four spin-3/2 systems and sequential diagonal contacts with exact controlled-swap endpoints. Hard budgets for net contact action and added spectral control charge yield an exact peak-excursion frontier within a declared quadratic-plus-cubic control class. A single positive-amplitude preparation jointly attains the record, recovery and occupation requirements, connecting the two results through an exact finite-dimensional optimization. A closed three-record example distinguishes fixed complete records from fixed averaged data. Separately calibrated imperfect contacts admit one-sided finite-error extensions. Together, the results characterize both informational compatibility and control-dependent formation through common attaining apparatuses.Preprint status and related materialsAuthor-submitted preprint; not peer reviewed or accepted for publication. This theoretical and computational work addresses the compatibility of retained binary quantum records with optimized accessible-system recovery, and the control-dependent resources required to form those records in a specified spin encoding. The article provides exact finite-record bounds, attainable recovery and resource frontiers, and calibrated finite-error qualifications. The manuscript has been submitted to Foundations of Physics for journal consideration; this Figshare record is not a journal publication. The technical supplement is included as a second PDF in this same record. Related software, verification code, exact certificates, and selected computational evidence are available separately at https://doi.org/10.6084/m9.figshare.34886079 under the MIT licence. When a journal version of record becomes available, a link to its DOI will be added here.AuthorKent Nimmo; Independent Researcher, Vancouver, British Columbia, Canada; ORCID 0009-0003-8503-8891.Reading and related workBrowse Quantum Foundations for related work on records, access and measurement, and Mathematics for exact bounds and certified constructions. The MIT software/certificate archive remains a distinct record from these manuscript PDFs.
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.