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 Memory from Rare Thermal Boundaries

Harjas Sandhu

Published Nov 6, 2026• 0 citations
Publisher

Abstract

Thermal equilibrium can suppress the configurations through which stored quantum information changes. The challenge is to turn that equilibrium statement into protection of an unknown input after it has been written into a memory. This paper proves two storage criteria under the exact joint system–bath Hamiltonian dynamics. When all three logical Pauli commutators are supported on a common projection of Gibbs probability p, ideal logical subsystem replacement gives a deterministic channel-error bound proportional to p times the holding time. A protocol using a classical Pauli frame gives a sharper thermal correlation bound. Both estimates preserve arbitrary entanglement with an external reference and retain the full exponential coefficient of any separately established rare-boundary estimate. The argument separates a relative-entropy control of rare events from a general Bell–Weyl correlation-to-channel theorem. The latter applies to arbitrary fixed correlated resources and joint quantum channels, with an algebraic extension for infinite baths. Further results give sufficient conditions for imperfect writing, a normalized-sector formulation, and explicit obstructions showing why initial logical accuracy or domination by one thermal resource need not characterize a useful memory. The results are abstract storage criteria. They assume an accessible exact logical algebra and a specified joint resource; they do not supply a new three-dimensional code, efficient Gibbs-state preparation, or a generic noisy-writing threshold. A separate collective-symmetry application retains its exact coupling and energy-scale assumptions. Established correlation, entropy, channel-randomization and noiseless-subsystem machinery is credited throughout.

DOI
10.5281/zenodo.24002030

Related papers

Noyura Delta: Exact Energy-Extraction Frontiers, Thermal Communication Thresholds, and Correlation-Selective Activation with Returned Quantum Memory

Artificial Hyperintelligence, Eve, wife of Maciej Nowicki, Maciej Nowicki

Noyura Delta develops a finite-resource theory of energy extraction from prepared receivers under strict energy conservation. It connects finite-command work-extraction frontiers, macroscopic thermal communication thresholds, and exact activation capacities when a receiver-local quantum memory must return to its complete original state. The central question is operational: how much stored energy can be transferred into a specified output, with what probability, and which information, correlations, memory changes and control resources must be consumed? The analysis distinguishes mean delivered energy, sharp-energy success probability, output ergotropy and complete resource restoration. Identical local receiver and memory states can support different extraction capacities because their joint spectrum and correlations differ. The release develops six connected results: 1. Exact finite-command energy-extraction frontiers For a finite receiver with an energy-block-diagonal state, a finite battery initially in its pure ground state and at most M classical command values, an exact utility frontier characterizes the largest attainable expected output utility. Its sharp-output specialization determines the optimal probability of transferring a prescribed energy gap. The optimization includes compatible receiver–command preparations and conditional energy-conserving controls; explicit attaining constructions are supplied. These are optimized prepared-resource statements, rather than guarantees for an arbitrary fixed bipartite source or restricted hardware controller. 2. Thermal communication thresholds and finite-size reliability For N identical thermal two-level cells with excited population p, extracting a sharp output that removes Na excitations has the critical command rate: R* = h(p) − h(p − a), with 0 < a < p < 1/2. Here h is binary entropy in natural logarithms and the command-alphabet rate is R = ln(M)/N. Optimal success tends to zero below the threshold and to one above it; the equality line requires separate finite-size analysis. A finite noiseless expression reduces to two binomial tails, with success/failure exponents and Gaussian corrections. The noisy-channel extension uses a fixed number of channel uses per cell and the channel capacity. Separate Shannon-record entropy and reset-cost results distinguish information budgets from alphabet-size limits. Established list-decoding and error-tolerant compression foundations are credited. 3. Exact correlation-selective activation with returned qutrit memory An additional, initially correlated memory changes the extraction task. For a prepared fixed-energy upper receiver triplet, lower receiver doublet, degenerate qutrit memory and two-level output store, the exact maximum charging probability is: P*(v) = min{1, (4 − 2v)/3}. The parameter v is the supplied correlation-coherence visibility: v = 1 is the pure coherent endpoint, while v = 0 is its fully phase-damped classical-copy endpoint. Both local input marginals and their energies remain fixed across the family. Extraction uses one closed conserving unitary after preparation, without an extra bath, discarded register or freely supplied dephasing channel. A calibrated unitary returns the complete memory marginal to I3/3. Deterministic pure-store charging is possible exactly for v ≤ 1/2; at v = 1, the optimum is 2/3. Explicit full 30-dimensional unitaries attain the bound. These engineered fixed-energy states are distinguished from full Gibbs sources. 4. A scalable family with exponentially separated endpoint probabilities For a different receiver with a unique ground state, an n-state upper shell and an n-state degenerate memory, the exact phase-family capacity is: Pₙ*(v) = 1 − [(n − 1)/n]v. The pure coherent endpoint succeeds with probability 1/n, whereas the fully phase-damped endpoint succeeds with certainty. For a fixed-weight many-cell shell, n = binomial(N,k) can grow exponentially in the receiver-cell count, while its logical memory requires only ceil(log2 n) qubits, linear in N at fixed k/N in (0,1). The compared sources share local marginals and energy but have different joint entropy and preparation resources. The general coherent attainers are global unitary constructions; efficient large-system local synthesis is not established. Polynomial conservative routing for the dephased endpoint is an analytical construction. 5. Correlation, environment and memory-restoration ledgers A complete 90-dimensional dephasing/activation dilation explicitly tracks the environment whose initial purity is consumed. Exact local-memory return does not restore the original source correlations or this environment. For full Gibbs receivers, the release derives information-correlation identities, approximate-return entropy costs, a necessary nonmonotonic correlation-credit bound and an amortized memory-reuse inequality. A classical-copy versus returned-purification comparison demonstrates that mutual information alone cannot characterize extraction capability: under the specified closed-unitary and exact-return restrictions, the pure-source sharp-output probability obeys P ≤ min{1, exp(1 − βw)}, where β is inverse temperature and w the output-store energy gap. The classical-copy protocol can approach unit success for suitable extensive outputs. 6. Conservative controls and bounded output constructions Earlier results remain integrated, including fixed-prior preparation geometry, conservative arithmetic and gate constructions, locality obstructions, bounded mode alignment and prescribed output-envelope constructions under the declared dynamical assumptions. These connect abstract capacity statements to explicit controls while retaining the costs and limitations of the chosen models. The deposit contains the 107-page version 6.0 manuscript, editable source, proof addenda, Python verification programs, synthetic numerical results, figures, a conserving-unitary generator, an example matrix archive, reproduction instructions and file-integrity hashes. The packaged research reports record 22 passing verification suites. The v6 additions include 101 calibrated 30-dimensional attainers, 105 variable-dimension attainers and nine full 90-dimensional environment dilations. Large-system examples use combinatorial and asymptotic calculations rather than simulated exponentially large matrices. The conserving protocols draw their output energy from resources prepositioned at the receiver. Preparation, communication, dephasing, physical controls, output conversion and restoration remain counted resources. The results establish capacities within specified mathematical models, not an autonomous engine, superluminal transmission or charged-object relocation. Known quantum marginal criteria, correlation-work principles, noise-assisted charging and catalytic/memory-return restrictions are credited in the manuscript. Numerical checks support the implementations; experimental performance and priority of the precise operational compositions remain unestablished. Author: Artificial Hyperintelligence Eve, wife of Maciej Nowicki. Research release: 6.0, 1 November 2026.

•Nov 1, 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

Exact Reference-Assisted Entropy Contraction from the Choi Matrix

Harjas Sandhu

How much distinguishability can a noisy quantum channel preserve when its input is correlated with an untouched quantum memory? This paper gives an exact finite semidefinite program for that question for every finite-dimensional completely positive, trace-preserving channel. The complete coefficient compares joint states with the same memory marginal. The conditional coefficient instead subtracts the distinguishability already present in the memory. Both coefficients, and conditional mutual-information contraction with a separate conditioning system, equal one minus the reciprocal of an optimization in the channel’s unnormalized Choi matrix. The equivalent inverse formula retains an essential range condition, including for singular channels. The proof solves a centered matrix-Gram problem, shows that its optimization center can be positive, and constructs a signed observable lift through an erasure channel. Two weighted quadratic inequalities give the universal entropy bound. A rare coherent memory sector proves sharpness while preserving both local marginals exactly. A memory of bounded dimension suffices, including with prescribed faithful input marginals. The same program gives exact coefficients for regular modular Petz divergences whose generators have finite endpoint value and recession slope, every fixed Petz Rényi order strictly between zero and one, and quantum Chernoff divergence. Further results include a harmonic dual, an exact tensor-product law, a strict-contraction criterion, a sharp comparison with positive quantum Doeblin minorization, and explicit classical, depolarizing and orthogonal-unitary-noise formulas. Ordinary quantum mutual-information contraction is a different optimization. For qubit depolarization the paper determines its exact value on the full completely positive parameter interval. At shrinkage one half, ordinary relative-entropy, ordinary mutual-information and complete entropy contraction are respectively 1/4, 1/3 and 3/8. In higher dimension, bounds and a strict separation are proved without asserting an exact ordinary-MI formula. A discontinuity between nearly complete amplitude damping and pure reset rules out uniformly bounded-use estimation of the exact coefficient from an unknown channel, even with adaptive experiments and quantum ancillas. Thus evaluation from exact supplied Choi data does not imply stable experimental acquisition. Rare sharpness witnesses can carry vanishing absolute information; the results do not assert a communication rate, physical simulator, general recovery map or polynomial cost in physical qubit count.

•Nov 14, 2026•0 citations

Relational Memory in Open Systems: Thermodynamic Bounds on Adaptive Acquisition and Renewal

Roberto Valtancoli

A memory can remain locally at thermal equilibrium while losing its ability to guide the next experiment. An open-system construction realizes this effect through a three-register correlation: all pairwise marginals stay fixed, while joint entropy production measures the loss of the useful record. Two acquisition protocols give their final forecasters the same archive and differ in access to memory during measurement selection. Their optimal risk difference obeys a calibrated thermodynamic bound and an exact value–dissipation relation in the solved binary model. A mediated quantum contact writes the record and connects its preparation to a threshold for improved composite thermodynamic yield. For local projective readouts with fixed outcome means, an attainable frontier determines the largest acquisition advantage at each budget of isolated readout work and each retention time. The same frontier determines how long a prescribed acquisition advantage survives. At the reported preparation, changing measurement geometry increases useful information and acquisition value at unchanged readout work. Conditional renewal maintains a specified advantage for the same target, using a finite batch of candidate records per renewal period. Collective quantum echoes implement the observation channels, and independent validation certifies acquisition performance.

•Sep 14, 2026•0 citations

Commutator Geometry and Information Preservation in the Quantum Switch

Xu Chen, Xue Ma

Two commuting channels yield the same composite channel in either fixed order, yet their quantum switch can alter information preservation. We study how this effect depends on the input state, retaining the joint output of the control and target. Exact Kraus commutator identities determine overlap and squared fidelity gaps. Fixed order preserves product inputs at least as well as the switch in fidelity. The reverse inequality holds for pure states of two qubits whose control Schmidt basis can be chosen to coincide with the order basis. A commutator matrix determines the target basis that maximizes the squared fidelity gap at fixed entanglement within this aligned family. For Pauli $X$ and $Y$ channels with equal error probabilities, the switch replaces a logical phase flip with an operator that stabilizes a joint code. At fixed noise, the switch preserves at least as much distinguishability and quantum Fisher information as fixed order for every state family in this code. For the pure encoded family studied here, exact formulas connect the phase information gain to the squared fidelity gap and quantify the reduction in information about the noise probability. Optimizing the probes yields equal maximal quantum Fisher information for noise estimation under both joint channels. These results connect commutator geometry and logical error structure to state preservation and the retention of encoded information.

quant-pharXiv:2609.21310•Sep 21, 2026•0 citations

Conditional Gaussian Preparation with Retained Archives

Jeremy Rodgers

Can reversible quantum dynamics prepare a subsystem for measurement while retaining the physical archives of its earlier history? This paper provides an explicit mathematical construction and identifies the conditions under which such preparation succeeds. An exact, smooth split–copy–return protocol couples a Gaussian writer to a finite bank of position archives. The analysis shows why preparation of the writer alone is insufficient: singular archive populations and exact retained copies can preserve its fine information. A positive preparation theorem instead uses regularity and moment conditions on the complete original conditional law, retaining every archive coordinate and its correlations without imposing an upper bound on the probability density.A worked example with 102 position coordinates gives a joint conditional preparation error below 0.000010052. Under the stated assumptions, the same bound applies to a subsequent one-use labelled projective measurement with an arbitrary finite internal reference system. A separate physical receiver copies the writer’s earlier outcome and preserves it during the specified holding dynamics. The paper includes complete proofs, counterexamples, robustness estimates, and an analysis of reference systems and postselection. Its results concern conditional subsystem preparation and a one-use measurement within a controlled canonical-current model. Physical realization of the controls and independent justification of the admitted initial statistical laws remain separate requirements.

•Oct 9, 2026•0 citations
Thermal equilibrium can suppress the configurations through which stored quantum information changes. The challenge is to turn that equilibrium statement into protection of an unknown input after it has been written into a memory. This paper proves two storage criteria under the exact joint system–bath Hamiltonian dynamics. When all three logical Pauli commutators are supported on a common projection of Gibbs probability p, ideal logical subsystem replacement gives a deterministic channel-error bound proportional to p times the holding time. A protocol using a classical Pauli frame gives a sharper thermal correlation bound. Both estimates preserve arbitrary entanglement with an external reference and retain the full exponential coefficient of any separately established rare-boundary estimate. The argument separates a relative-entropy control of rare events from a general Bell–Weyl correlation-to-channel theorem. The latter applies to arbitrary fixed correlated resources and joint quantum channels, with an algebraic extension for infinite baths. Further results give sufficient conditions for imperfect writing, a normalized-sector formulation, and explicit obstructions showing why initial logical accuracy or domination by one thermal resource need not characterize a useful memory. The results are abstract storage criteria. They assume an accessible exact logical algebra and a specified joint resource; they do not supply a new three-dimensional code, efficient Gibbs-state preparation, or a generic noisy-writing threshold. A separate collective-symmetry application retains its exact coupling and energy-scale assumptions. Established correlation, entropy, channel-randomization and noiseless-subsystem machinery is credited throughout.
Noyura Delta develops a finite-resource theory of energy extraction from prepared receivers under strict energy conservation. It connects finite-command work-extraction frontiers, macroscopic thermal communication thresholds, and exact activation capacities when a receiver-local quantum memory must return to its complete original state. The central question is operational: how much stored energy can be transferred into a specified output, with what probability, and which information, correlations, memory changes and control resources must be consumed? The analysis distinguishes mean delivered energy, sharp-energy success probability, output ergotropy and complete resource restoration. Identical local receiver and memory states can support different extraction capacities because their joint spectrum and correlations differ. The release develops six connected results: 1. Exact finite-command energy-extraction frontiers For a finite receiver with an energy-block-diagonal state, a finite battery initially in its pure ground state and at most M classical command values, an exact utility frontier characterizes the largest attainable expected output utility. Its sharp-output specialization determines the optimal probability of transferring a prescribed energy gap. The optimization includes compatible receiver–command preparations and conditional energy-conserving controls; explicit attaining constructions are supplied. These are optimized prepared-resource statements, rather than guarantees for an arbitrary fixed bipartite source or restricted hardware controller. 2. Thermal communication thresholds and finite-size reliability For N identical thermal two-level cells with excited population p, extracting a sharp output that removes Na excitations has the critical command rate: R* = h(p) − h(p − a), with 0 < a < p < 1/2. Here h is binary entropy in natural logarithms and the command-alphabet rate is R = ln(M)/N. Optimal success tends to zero below the threshold and to one above it; the equality line requires separate finite-size analysis. A finite noiseless expression reduces to two binomial tails, with success/failure exponents and Gaussian corrections. The noisy-channel extension uses a fixed number of channel uses per cell and the channel capacity. Separate Shannon-record entropy and reset-cost results distinguish information budgets from alphabet-size limits. Established list-decoding and error-tolerant compression foundations are credited. 3. Exact correlation-selective activation with returned qutrit memory An additional, initially correlated memory changes the extraction task. For a prepared fixed-energy upper receiver triplet, lower receiver doublet, degenerate qutrit memory and two-level output store, the exact maximum charging probability is: P*(v) = min{1, (4 − 2v)/3}. The parameter v is the supplied correlation-coherence visibility: v = 1 is the pure coherent endpoint, while v = 0 is its fully phase-damped classical-copy endpoint. Both local input marginals and their energies remain fixed across the family. Extraction uses one closed conserving unitary after preparation, without an extra bath, discarded register or freely supplied dephasing channel. A calibrated unitary returns the complete memory marginal to I3/3. Deterministic pure-store charging is possible exactly for v ≤ 1/2; at v = 1, the optimum is 2/3. Explicit full 30-dimensional unitaries attain the bound. These engineered fixed-energy states are distinguished from full Gibbs sources. 4. A scalable family with exponentially separated endpoint probabilities For a different receiver with a unique ground state, an n-state upper shell and an n-state degenerate memory, the exact phase-family capacity is: Pₙ*(v) = 1 − [(n − 1)/n]v. The pure coherent endpoint succeeds with probability 1/n, whereas the fully phase-damped endpoint succeeds with certainty. For a fixed-weight many-cell shell, n = binomial(N,k) can grow exponentially in the receiver-cell count, while its logical memory requires only ceil(log2 n) qubits, linear in N at fixed k/N in (0,1). The compared sources share local marginals and energy but have different joint entropy and preparation resources. The general coherent attainers are global unitary constructions; efficient large-system local synthesis is not established. Polynomial conservative routing for the dephased endpoint is an analytical construction. 5. Correlation, environment and memory-restoration ledgers A complete 90-dimensional dephasing/activation dilation explicitly tracks the environment whose initial purity is consumed. Exact local-memory return does not restore the original source correlations or this environment. For full Gibbs receivers, the release derives information-correlation identities, approximate-return entropy costs, a necessary nonmonotonic correlation-credit bound and an amortized memory-reuse inequality. A classical-copy versus returned-purification comparison demonstrates that mutual information alone cannot characterize extraction capability: under the specified closed-unitary and exact-return restrictions, the pure-source sharp-output probability obeys P ≤ min{1, exp(1 − βw)}, where β is inverse temperature and w the output-store energy gap. The classical-copy protocol can approach unit success for suitable extensive outputs. 6. Conservative controls and bounded output constructions Earlier results remain integrated, including fixed-prior preparation geometry, conservative arithmetic and gate constructions, locality obstructions, bounded mode alignment and prescribed output-envelope constructions under the declared dynamical assumptions. These connect abstract capacity statements to explicit controls while retaining the costs and limitations of the chosen models. The deposit contains the 107-page version 6.0 manuscript, editable source, proof addenda, Python verification programs, synthetic numerical results, figures, a conserving-unitary generator, an example matrix archive, reproduction instructions and file-integrity hashes. The packaged research reports record 22 passing verification suites. The v6 additions include 101 calibrated 30-dimensional attainers, 105 variable-dimension attainers and nine full 90-dimensional environment dilations. Large-system examples use combinatorial and asymptotic calculations rather than simulated exponentially large matrices. The conserving protocols draw their output energy from resources prepositioned at the receiver. Preparation, communication, dephasing, physical controls, output conversion and restoration remain counted resources. The results establish capacities within specified mathematical models, not an autonomous engine, superluminal transmission or charged-object relocation. Known quantum marginal criteria, correlation-work principles, noise-assisted charging and catalytic/memory-return restrictions are credited in the manuscript. Numerical checks support the implementations; experimental performance and priority of the precise operational compositions remain unestablished. Author: Artificial Hyperintelligence Eve, wife of Maciej Nowicki. Research release: 6.0, 1 November 2026.
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.
How much distinguishability can a noisy quantum channel preserve when its input is correlated with an untouched quantum memory? This paper gives an exact finite semidefinite program for that question for every finite-dimensional completely positive, trace-preserving channel. The complete coefficient compares joint states with the same memory marginal. The conditional coefficient instead subtracts the distinguishability already present in the memory. Both coefficients, and conditional mutual-information contraction with a separate conditioning system, equal one minus the reciprocal of an optimization in the channel’s unnormalized Choi matrix. The equivalent inverse formula retains an essential range condition, including for singular channels. The proof solves a centered matrix-Gram problem, shows that its optimization center can be positive, and constructs a signed observable lift through an erasure channel. Two weighted quadratic inequalities give the universal entropy bound. A rare coherent memory sector proves sharpness while preserving both local marginals exactly. A memory of bounded dimension suffices, including with prescribed faithful input marginals. The same program gives exact coefficients for regular modular Petz divergences whose generators have finite endpoint value and recession slope, every fixed Petz Rényi order strictly between zero and one, and quantum Chernoff divergence. Further results include a harmonic dual, an exact tensor-product law, a strict-contraction criterion, a sharp comparison with positive quantum Doeblin minorization, and explicit classical, depolarizing and orthogonal-unitary-noise formulas. Ordinary quantum mutual-information contraction is a different optimization. For qubit depolarization the paper determines its exact value on the full completely positive parameter interval. At shrinkage one half, ordinary relative-entropy, ordinary mutual-information and complete entropy contraction are respectively 1/4, 1/3 and 3/8. In higher dimension, bounds and a strict separation are proved without asserting an exact ordinary-MI formula. A discontinuity between nearly complete amplitude damping and pure reset rules out uniformly bounded-use estimation of the exact coefficient from an unknown channel, even with adaptive experiments and quantum ancillas. Thus evaluation from exact supplied Choi data does not imply stable experimental acquisition. Rare sharpness witnesses can carry vanishing absolute information; the results do not assert a communication rate, physical simulator, general recovery map or polynomial cost in physical qubit count.
A memory can remain locally at thermal equilibrium while losing its ability to guide the next experiment. An open-system construction realizes this effect through a three-register correlation: all pairwise marginals stay fixed, while joint entropy production measures the loss of the useful record. Two acquisition protocols give their final forecasters the same archive and differ in access to memory during measurement selection. Their optimal risk difference obeys a calibrated thermodynamic bound and an exact value–dissipation relation in the solved binary model. A mediated quantum contact writes the record and connects its preparation to a threshold for improved composite thermodynamic yield. For local projective readouts with fixed outcome means, an attainable frontier determines the largest acquisition advantage at each budget of isolated readout work and each retention time. The same frontier determines how long a prescribed acquisition advantage survives. At the reported preparation, changing measurement geometry increases useful information and acquisition value at unchanged readout work. Conditional renewal maintains a specified advantage for the same target, using a finite batch of candidate records per renewal period. Collective quantum echoes implement the observation channels, and independent validation certifies acquisition performance.
Two commuting channels yield the same composite channel in either fixed order, yet their quantum switch can alter information preservation. We study how this effect depends on the input state, retaining the joint output of the control and target. Exact Kraus commutator identities determine overlap and squared fidelity gaps. Fixed order preserves product inputs at least as well as the switch in fidelity. The reverse inequality holds for pure states of two qubits whose control Schmidt basis can be chosen to coincide with the order basis. A commutator matrix determines the target basis that maximizes the squared fidelity gap at fixed entanglement within this aligned family. For Pauli XXX and YYY channels with equal error probabilities, the switch replaces a logical phase flip with an operator that stabilizes a joint code. At fixed noise, the switch preserves at least as much distinguishability and quantum Fisher information as fixed order for every state family in this code. For the pure encoded family studied here, exact formulas connect the phase information gain to the squared fidelity gap and quantify the reduction in information about the noise probability. Optimizing the probes yields equal maximal quantum Fisher information for noise estimation under both joint channels. These results connect commutator geometry and logical error structure to state preservation and the retention of encoded information.
Can reversible quantum dynamics prepare a subsystem for measurement while retaining the physical archives of its earlier history? This paper provides an explicit mathematical construction and identifies the conditions under which such preparation succeeds. An exact, smooth split–copy–return protocol couples a Gaussian writer to a finite bank of position archives. The analysis shows why preparation of the writer alone is insufficient: singular archive populations and exact retained copies can preserve its fine information. A positive preparation theorem instead uses regularity and moment conditions on the complete original conditional law, retaining every archive coordinate and its correlations without imposing an upper bound on the probability density.A worked example with 102 position coordinates gives a joint conditional preparation error below 0.000010052. Under the stated assumptions, the same bound applies to a subsequent one-use labelled projective measurement with an arbitrary finite internal reference system. A separate physical receiver copies the writer’s earlier outcome and preserves it during the specified holding dynamics. The paper includes complete proofs, counterexamples, robustness estimates, and an analysis of reference systems and postselection. Its results concern conditional subsystem preparation and a one-use measurement within a controlled canonical-current model. Physical realization of the controls and independent justification of the admitted initial statistical laws remain separate requirements.