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

Minimum Quantum Storage from Incomplete Channel Observations

Jeremy Rodgers

Published Sep 6, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.5281/zenodo.22458529

Related papers

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

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

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

Optimal entanglement weights for heterodyne uncertainty with finite quantum memory

Zixuan He

A finite quantum memory is specified by more than its entanglement entropy. This paper determines how to shape its Schmidt weights and allocate optical photons to minimize the quantum conditional uncertainty of a prescribed heterodyne measurement. The resulting resource laws let researchers compare a uniformly weighted entangled source with a shaped source, and assess when sharing one memory across optical modes is more efficient than independently preparing mode–memory pairs. Complete preparation model and sharp leading resource law. Let \(V_{m,D}(E)\) be the minimum of \(H_\mu(Z|B)=h_\mu(Z)-\chi(Z:B)\) over all normal, possibly mixed optical–memory states with total mean photon number at most \(E\) and total accessible memory dimension at most \(D\). Here \(Z\) is the outcome of an \(m\)-mode heterodyne measurement, \(B\) is the retained quantum memory, \(\chi\) is Holevo information, and \(d\mu=\pi^{-m}d^{2m}z\). Accessible flags count toward the same memory budget. For every fixed \(m\) and every joint limit \(D,E\to\infty\), \[V_{m,D}(E)\sim\frac{\Lambda_m(E/T_D)}{T_D},\qquad T_D=(m!D)^{1/m}.\] The function \(\Lambda_m\) is an explicitly characterized constrained radial ground-state energy. Its Kummer and Bessel profiles give legal attaining preparations. The converse retains arbitrary coherent inputs and their photon tails, rather than optimizing only a diagonal ansatz. Why shaping changes the resource exponent. At the common photon ceiling \(E=T_D\), optimally shaped sources have uncertainty of order \(D^{-1/m}\), whereas final flat Schmidt spectra have optimal order \(D^{-1/(2m)}\), even after optimizing the occupied optical subspace. Flat weights create a sharp support boundary; tapering the weights replaces its boundary-layer cost by a smaller gradient cost. To reach a small target uncertainty \(\varepsilon\), this changes the leading memory requirement from \(2m\log_2(1/\varepsilon)\) to \(m\log_2(1/\varepsilon)\), and the attainable photon scaling from quadratic to linear in \(1/\varepsilon\). This improvement is compatible with nearly maximal entanglement entropy. For the explicit canonical saturated construction, \[S(\rho_{B,D})=\ln D-c_m+o(1),\qquad \|\rho_{B,D}-I_D/D\|_1\longrightarrow L_m>0.\] The full trace-norm limits are approximately \(L_1=0.8771\) and \(L_2=1.1170\); the half-trace-distance convention halves these numbers. Thus a vanishing relative entropy deficit does not make the optimized spectrum uniform. Collective preparation at fully counted resources. For two modes in the energy-sufficient asymptotic regime, sharing quantum memory reduces the leading conditional entropy by about \(10.24\%\) relative to the optimized independent mode–memory preparation class. That comparator includes local state optimization, integer memory and energy allocations, mixtures and charged accessible flags; it is not the class of all separable joint states. A separate finite construction uses seven coherent optical inputs, three retained qubits and \(0.21\) input photons. Under the specified loss, phase and stochastic memory-fault contract, its retained photon budget is at most \(0.200781\), and its conditional entropy is strictly lower than that of the same independent comparator by more than \(0.00547535\) nats. The integrated article gives the preparation circuit, one-sided numerical bounds and complete same-source error accounting. Interpretation. The objective uses quantum side information. A classical measurement of the memory generally has accessible information below \(\chi(Z:B)\), so the conditional-entropy advantages do not by themselves assert the same improvement in estimation precision or classical readout performance. The finite circuit is a rigorously specified source model, not a qualification of an implemented laboratory apparatus. The single PDF contains the article, five figures, full proofs and references.

•Oct 25, 2026•0 citations

Exact Robustness Frontiers and Fidelity Limits for Qubit Memories

Ying Xie

We determine exact resource limits for a qubit memory with retained classical records. For every qubit noise channel A, the largest output generalized entanglement-breaking robustness under an input budget R_G ≤ r is a semidefinite program in two 4 × 4 positive matrices, attained with at most five classical outcomes. For amplitude damping we solve the full budget curve, including two mixed-state regimes, and attain it with one classical bit. Its contraction coefficient is one, approached with vanishing input resource, although every fixed positive resource budget contracts strictly. A different argument controls memories prepared from a perfect qubit: for prescribed independent noise channels A_1, …, A_n, arbitrary adaptive instruments and finite classical records obey R_G(Γ_n) ≤ R(Γ_n) ≤ ∏_j ν(A_j), where ν(A) = max{0, 2λ_max J_A − 1} and J_A is normalized. The proof propagates a positive 2 × 2 operator over the branches. For amplitude-damping survivals with product b, both robustness optima equal b; the optimal average and worst-case pure-state fidelities are (2+b)/3, the optimal Bell fidelity is (1+b)/2, and the minimum half-diamond error is (1−b)/2. Finite protocols attain all four operational optima simultaneously. Thus classical control can improve fidelity while leaving optimal robustness unchanged. The model permits one persistent qubit and excludes quantum bypass, environment access, and postselection. A visual guide records the reasoning routes, their joint premises, and the distinction between prior tools and the results developed here.

•Nov 12, 2026•0 citations

Quantum limits and one-qubit advantage in optical predictive compression

Zixuan He

What should an optical memory retain when only a limited amount of source information can be kept? This paper gives the complete quantum information frontier for a fixed Gaussian source and relevance channel, and identifies when a single retained qubit preserves correlations that every classical record loses. It also turns that advantage into a concrete test of whether received light belongs to its stored source preparation. The physical experiment and the complete frontier A fixed Gaussian state on \(A\) is prepared with its actual purifier \(C\). A normal encoder acts on \(C\) to produce memory \(M\), while a prescribed Gaussian channel maps \(A\) to the relevant optical output \(B\). The source-information cost and useful correlation are \(r=I(A:M)\) and \(v=I(B:M)\), respectively. All logarithms are natural. The paper determines \[ C_{\mathrm Q}(R)=\sup_{\mathcal N:\,I(A:M)\le R}I(B:M). \] For every fixed faithful finite-mode Gaussian source and finite-mode Gaussian relevance channel, optimization over arbitrary normal quantum encoders reduces to Gaussian supporting values and a mixture of at most two Gaussian branches. The branch flag is physically retained. The unrestricted frontier is a supremum with no imposed memory dimension or memory-energy cap; an explicit finite approximation gives an error uniform in the information budget. Hard finite-dimensional implementations are treated separately. Why one qubit can preserve the leading low-brightness information For a thermal source with mean photon number \(n\) and a thermal attenuator with transmissivity \(0<\eta<1\), write the output occupation as \(\eta n+b\), where \(b\ge0\) is the environment's added thermal occupation. With \(g(x)=(x+1)\log(x+1)-x\log x\), the exact optimum over all normal classical records is \[ C_{\mathrm{cl}}(n,R)=g(\eta n+b)-g(\eta u_R+b),\qquad u_R=g^{-1}\!\bigl(\max\{g(n)-R,0\}\bigr). \] A legal encoder applies vacuum loss with transmissivity \(\lambda\) to the purifier and then coherently retains two levels, resetting the entire higher-photon tail. For fixed \(b>0\) and \(0<\lambda<1/2\), at the common budget \(R_n=g(n)+g(\lambda n)-g((1-\lambda)n)\), its actual relevance satisfies \[ v_2=\frac{\eta\lambda}{1+b}\,n\log(1/n)+O(n),\qquad C_{\mathrm{cl}}(n,R_n)=2\lambda\eta\log(1+1/b)\,n+O\!\left(\frac{n}{\log(1/n)}\right). \] The full optical tail is included in the resource accounting. At \(n=0.01\), \(\eta=b=0.5\), \(\lambda=0.2\) and \(R=0.023875\), the certified predictive-mutual-information advantage exceeds 85%. The leading correlation is quantified by memory-side discord and can survive when the final output–memory state is separable. The vacuum-environment endpoint is evaluated separately for the same encoder. A same-resource correlation decision The receiver distinguishes matched source pairs from independent systems with identical marginals. For \(k\) uses, the retained predictive memory obeys \(\dim K_k\le2^k\) and \(I(A^k:K_k)\le kR\), including all retained flags. Both competitors may make arbitrary joint binary measurements on the received optical modes and their retained memory. The received modes are common observation access, outside the predictive-memory cap. Let \(\alpha_k\) be the missed-correlation probability and \(\beta_k\) the false-match probability. For every classical block encoder, even with an unrestricted classical alphabet, the fixed-error converse is \[ \alpha_k\le\epsilon\quad\Longrightarrow\quad \beta_k\ge\exp\!\left[-\frac{k c_nR+\log2}{1-\epsilon}\right],\qquad c_n=\eta\frac{\log(1+1/(\eta n+b))}{\log(1+1/n)}. \] At the finite parameters above and \(\epsilon=0.1\), the product-qubit encoder achieves an asymptotic false-match exponent of 0.0049 nats per pair, whereas every classical block strategy has exponent below 0.003138386231. This uses one qubit per source pair and identical measurement permissions. It is an asymptotic discrimination guarantee, distinct from the 85% single-copy information comparison; it specifies neither a finite-sample threshold nor a laboratory receiver circuit. The integrated paper contains the complete proofs, resource accounting and figures. The exact thermal classical comparator, the finite-memory construction and the block-testing connection have explicit proof dependencies separate from the general Gaussian-frontier reduction.

•Oct 25, 2026•0 citations
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.
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.
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.
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.
A finite quantum memory is specified by more than its entanglement entropy. This paper determines how to shape its Schmidt weights and allocate optical photons to minimize the quantum conditional uncertainty of a prescribed heterodyne measurement. The resulting resource laws let researchers compare a uniformly weighted entangled source with a shaped source, and assess when sharing one memory across optical modes is more efficient than independently preparing mode–memory pairs. Complete preparation model and sharp leading resource law. Let Vm,D(E)V_{m,D}(E)Vm,D​(E) be the minimum of Hμ(Z∣B)=hμ(Z)−χ(Z:B)H_\mu(Z|B)=h_\mu(Z)-\chi(Z:B)Hμ​(Z∣B)=hμ​(Z)−χ(Z:B) over all normal, possibly mixed optical–memory states with total mean photon number at most EEE and total accessible memory dimension at most DDD. Here ZZZ is the outcome of an mmm-mode heterodyne measurement, BBB is the retained quantum memory, χ\chiχ is Holevo information, and dμ=π−md2mzd\mu=\pi^{-m}d^{2m}zdμ=π−md2mz. Accessible flags count toward the same memory budget. For every fixed mmm and every joint limit D,E→∞D,E\to\inftyD,E→∞, Vm,D(E)∼Λm(E/TD)TD,TD=(m!D)1/m.V_{m,D}(E)\sim\frac{\Lambda_m(E/T_D)}{T_D},\qquad T_D=(m!D)^{1/m}.Vm,D​(E)∼TD​Λm​(E/TD​)​,TD​=(m!D)1/m. The function Λm\Lambda_mΛm​ is an explicitly characterized constrained radial ground-state energy. Its Kummer and Bessel profiles give legal attaining preparations. The converse retains arbitrary coherent inputs and their photon tails, rather than optimizing only a diagonal ansatz. Why shaping changes the resource exponent. At the common photon ceiling E=TDE=T_DE=TD​, optimally shaped sources have uncertainty of order D−1/mD^{-1/m}D−1/m, whereas final flat Schmidt spectra have optimal order D−1/(2m)D^{-1/(2m)}D−1/(2m), even after optimizing the occupied optical subspace. Flat weights create a sharp support boundary; tapering the weights replaces its boundary-layer cost by a smaller gradient cost. To reach a small target uncertainty ε\varepsilonε, this changes the leading memory requirement from 2mlog⁡2(1/ε)2m\log_2(1/\varepsilon)2mlog2​(1/ε) to mlog⁡2(1/ε)m\log_2(1/\varepsilon)mlog2​(1/ε), and the attainable photon scaling from quadratic to linear in 1/ε1/\varepsilon1/ε. This improvement is compatible with nearly maximal entanglement entropy. For the explicit canonical saturated construction, S(ρB,D)=ln⁡D−cm+o(1),∥ρB,D−ID/D∥1⟶Lm>0.S(\rho_{B,D})=\ln D-c_m+o(1),\qquad \|\rho_{B,D}-I_D/D\|_1\longrightarrow L_m>0.S(ρB,D​)=lnD−cm​+o(1),∥ρB,D​−ID​/D∥1​⟶Lm​>0. The full trace-norm limits are approximately L1=0.8771L_1=0.8771L1​=0.8771 and L2=1.1170L_2=1.1170L2​=1.1170; the half-trace-distance convention halves these numbers. Thus a vanishing relative entropy deficit does not make the optimized spectrum uniform. Collective preparation at fully counted resources. For two modes in the energy-sufficient asymptotic regime, sharing quantum memory reduces the leading conditional entropy by about 10.24%10.24\%10.24% relative to the optimized independent mode–memory preparation class. That comparator includes local state optimization, integer memory and energy allocations, mixtures and charged accessible flags; it is not the class of all separable joint states. A separate finite construction uses seven coherent optical inputs, three retained qubits and 0.210.210.21 input photons. Under the specified loss, phase and stochastic memory-fault contract, its retained photon budget is at most 0.2007810.2007810.200781, and its conditional entropy is strictly lower than that of the same independent comparator by more than 0.005475350.005475350.00547535 nats. The integrated article gives the preparation circuit, one-sided numerical bounds and complete same-source error accounting. Interpretation. The objective uses quantum side information. A classical measurement of the memory generally has accessible information below χ(Z:B)\chi(Z:B)χ(Z:B), so the conditional-entropy advantages do not by themselves assert the same improvement in estimation precision or classical readout performance. The finite circuit is a rigorously specified source model, not a qualification of an implemented laboratory apparatus. The single PDF contains the article, five figures, full proofs and references.
We determine exact resource limits for a qubit memory with retained classical records. For every qubit noise channel A, the largest output generalized entanglement-breaking robustness under an input budget R_G ≤ r is a semidefinite program in two 4 × 4 positive matrices, attained with at most five classical outcomes. For amplitude damping we solve the full budget curve, including two mixed-state regimes, and attain it with one classical bit. Its contraction coefficient is one, approached with vanishing input resource, although every fixed positive resource budget contracts strictly. A different argument controls memories prepared from a perfect qubit: for prescribed independent noise channels A_1, …, A_n, arbitrary adaptive instruments and finite classical records obey R_G(Γ_n) ≤ R(Γ_n) ≤ ∏_j ν(A_j), where ν(A) = max{0, 2λ_max J_A − 1} and J_A is normalized. The proof propagates a positive 2 × 2 operator over the branches. For amplitude-damping survivals with product b, both robustness optima equal b; the optimal average and worst-case pure-state fidelities are (2+b)/3, the optimal Bell fidelity is (1+b)/2, and the minimum half-diamond error is (1−b)/2. Finite protocols attain all four operational optima simultaneously. Thus classical control can improve fidelity while leaving optimal robustness unchanged. The model permits one persistent qubit and excludes quantum bypass, environment access, and postselection. A visual guide records the reasoning routes, their joint premises, and the distinction between prior tools and the results developed here.
What should an optical memory retain when only a limited amount of source information can be kept? This paper gives the complete quantum information frontier for a fixed Gaussian source and relevance channel, and identifies when a single retained qubit preserves correlations that every classical record loses. It also turns that advantage into a concrete test of whether received light belongs to its stored source preparation. The physical experiment and the complete frontier A fixed Gaussian state on AAA is prepared with its actual purifier CCC. A normal encoder acts on CCC to produce memory MMM, while a prescribed Gaussian channel maps AAA to the relevant optical output BBB. The source-information cost and useful correlation are r=I(A:M)r=I(A:M)r=I(A:M) and v=I(B:M)v=I(B:M)v=I(B:M), respectively. All logarithms are natural. The paper determines CQ(R)=sup⁡N: I(A:M)≤RI(B:M). C_{\mathrm Q}(R)=\sup_{\mathcal N:\,I(A:M)\le R}I(B:M). CQ​(R)=supN:I(A:M)≤R​I(B:M). For every fixed faithful finite-mode Gaussian source and finite-mode Gaussian relevance channel, optimization over arbitrary normal quantum encoders reduces to Gaussian supporting values and a mixture of at most two Gaussian branches. The branch flag is physically retained. The unrestricted frontier is a supremum with no imposed memory dimension or memory-energy cap; an explicit finite approximation gives an error uniform in the information budget. Hard finite-dimensional implementations are treated separately. Why one qubit can preserve the leading low-brightness information For a thermal source with mean photon number nnn and a thermal attenuator with transmissivity 0<η<10<\eta<10<η<1, write the output occupation as ηn+b\eta n+bηn+b, where b≥0b\ge0b≥0 is the environment's added thermal occupation. With g(x)=(x+1)log⁡(x+1)−xlog⁡xg(x)=(x+1)\log(x+1)-x\log xg(x)=(x+1)log(x+1)−xlogx, the exact optimum over all normal classical records is Ccl(n,R)=g(ηn+b)−g(ηuR+b),uR=g−1 ⁣(max⁡{g(n)−R,0}). C_{\mathrm{cl}}(n,R)=g(\eta n+b)-g(\eta u_R+b),\qquad u_R=g^{-1}\!\bigl(\max\{g(n)-R,0\}\bigr). Ccl​(n,R)=g(ηn+b)−g(ηuR​+b),uR​=g−1(max{g(n)−R,0}). A legal encoder applies vacuum loss with transmissivity λ\lambdaλ to the purifier and then coherently retains two levels, resetting the entire higher-photon tail. For fixed b>0b>0b>0 and 0<λ<1/20<\lambda<1/20<λ<1/2, at the common budget Rn=g(n)+g(λn)−g((1−λ)n)R_n=g(n)+g(\lambda n)-g((1-\lambda)n)Rn​=g(n)+g(λn)−g((1−λ)n), its actual relevance satisfies v2=ηλ1+b nlog⁡(1/n)+O(n),Ccl(n,Rn)=2ληlog⁡(1+1/b) n+O ⁣(nlog⁡(1/n)). v_2=\frac{\eta\lambda}{1+b}\,n\log(1/n)+O(n),\qquad C_{\mathrm{cl}}(n,R_n)=2\lambda\eta\log(1+1/b)\,n+O\!\left(\frac{n}{\log(1/n)}\right). v2​=1+bηλ​nlog(1/n)+O(n),Ccl​(n,Rn​)=2ληlog(1+1/b)n+O(log(1/n)n​). The full optical tail is included in the resource accounting. At n=0.01n=0.01n=0.01, η=b=0.5\eta=b=0.5η=b=0.5, λ=0.2\lambda=0.2λ=0.2 and R=0.023875R=0.023875R=0.023875, the certified predictive-mutual-information advantage exceeds 85%. The leading correlation is quantified by memory-side discord and can survive when the final output–memory state is separable. The vacuum-environment endpoint is evaluated separately for the same encoder. A same-resource correlation decision The receiver distinguishes matched source pairs from independent systems with identical marginals. For kkk uses, the retained predictive memory obeys dim⁡Kk≤2k\dim K_k\le2^kdimKk​≤2k and I(Ak:Kk)≤kRI(A^k:K_k)\le kRI(Ak:Kk​)≤kR, including all retained flags. Both competitors may make arbitrary joint binary measurements on the received optical modes and their retained memory. The received modes are common observation access, outside the predictive-memory cap. Let αk\alpha_kαk​ be the missed-correlation probability and βk\beta_kβk​ the false-match probability. For every classical block encoder, even with an unrestricted classical alphabet, the fixed-error converse is αk≤ϵ⟹βk≥exp⁡ ⁣[−kcnR+log⁡21−ϵ],cn=ηlog⁡(1+1/(ηn+b))log⁡(1+1/n). \alpha_k\le\epsilon\quad\Longrightarrow\quad \beta_k\ge\exp\!\left[-\frac{k c_nR+\log2}{1-\epsilon}\right],\qquad c_n=\eta\frac{\log(1+1/(\eta n+b))}{\log(1+1/n)}. αk​≤ϵ⟹βk​≥exp[−1−ϵkcn​R+log2​],cn​=ηlog(1+1/n)log(1+1/(ηn+b))​. At the finite parameters above and ϵ=0.1\epsilon=0.1ϵ=0.1, the product-qubit encoder achieves an asymptotic false-match exponent of 0.0049 nats per pair, whereas every classical block strategy has exponent below 0.003138386231. This uses one qubit per source pair and identical measurement permissions. It is an asymptotic discrimination guarantee, distinct from the 85% single-copy information comparison; it specifies neither a finite-sample threshold nor a laboratory receiver circuit. The integrated paper contains the complete proofs, resource accounting and figures. The exact thermal classical comparator, the finite-memory construction and the block-testing connection have explicit proof dependencies separate from the general Gaussian-frontier reduction.