Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.23195

Localized charges, reset noise, and boundary memory in matrix-product-conserving quantum chains

Ron Rubin

quant-phcond-mat.stat-mechmath-phSubmitted Sep 19, 2026• Announced Sep 22, 2026• 0 citations
arXivHTMLPDF

Abstract

We construct boundary observables that retain memory for a quantified time window in quantum chains whose basis configurations carry a conserved ordered product of matrix labels. Under strong-irreducibility and proximality hypotheses on the label matrices, projective contraction of random matrix products localizes a conserved charge in the root-mean-square over uniform basis configurations. A finite-time inequality then converts readout overlap and reset leakage into a correlation bound: for a conserved reference observable $H$, a readout $F$, accumulated squared leakage $\mathcal B$, and the normalized Hilbert-Schmidt inner product, $\langle F,Φ(F)\rangle\ge 2\langle H,F\rangle^2/(\|H\|_2^2+\mathcal B)-\|F\|_2^2$. Here $Φ$ is a sequence of conserving channels and partial resets. The bound holds for each such circuit, without averaging its gates. It yields an exponential memory window in the distance from the noisy region, with quantitative corrections for spatially distributed noise and imperfect conservation. For a thirteen-state elementary-matrix model, exact polynomial certificates give root-mean-square localization error $e^{-r/1400}$ between the charge and its restriction to the last $r$ sites, and limiting variance at least $1/19$ for a rational charge. A related normalized-Gram charge gives an eight-site certificate retaining more than half the specified readout correlation through two boundary-reset rounds. Uniform depolarization imposes an inverse-noise-rate lifetime ceiling. A two-qubit IBM experiment illustrates the general reset inequality; it does not realize the matrix-product chain. We provide proofs, exact certificate programs, and an independent recount of the archived experimental outcomes.

AI Summary

The paper asks when an edge observable can retain a classical signal while a distant region is repeatedly randomized. It studies chains whose basis states carry matrix labels and whose interior dynamics conserve their ordered product. Under strong irreducibility and proximality assumptions, random-matrix contraction produces a diagonal conserved charge approximable on the last $r$ sites with root-mean-square error $C e^{-\kappa r}$ under uniform basis configurations, with nonzero limiting variance. A general finite-sequence inequality converts charge–readout overlap and reset leakage into autocorrelation: $\langle F,\Phi(F)\rangle\ge 2\langle H,F\rangle^2/(\|H\|_2^2+\mathcal B)-\|F\|_2^2$, where $\mathcal B=\sum_j p_j\|(I-P_j)H\|_2^2/(2-p_j)$. It follows from Hilbert–Schmidt norm loss and an operator-space geometric argument, and holds for each prescribed sequence of conserving bistochastic channels and partial resets, without gate averaging. Combined with localization, it certifies memory windows scaling as $e^{2\kappa r}$. For a thirteen-state model generating $\mathrm{SL}(3,\mathbb Z)$, exact polynomial certificates establish a rational charge’s localization error $e^{-r/1400}$ and limiting variance at least $1/19$. Exact finite-chain moments certify that a related seven-site readout in an eight-site chain retains more than $5/9$ of its initial correlation after two reset rounds. Uniform single-site depolarization gives an inverse-noise-rate lifetime ceiling. Localization is mean-square, not operator-norm; the charges preserve classical information, not arbitrary quantum states. Asymptotic readouts require thousands of sites. A two-qubit IBM reset echo illustrates only the general inequality, not spatial localization or length-dependent memory.

Little sign of AI-generated textStrong assumptions

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

Comments
43 pages, 3 figures. Ancillary file: exact certificate programs, primary experimental data and offline recount code

Related papers

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

Finite-time quantum equilibration from local correlations

Piotr Ćwikliński

An isolated quantum system evolves reversibly, yet a small subsystem can lose nearly all information about its initial state. Conserved quantities may retain some of this information, depending on how strongly they overlap with local observables. Here we consider a subsystem in an arbitrary initial state coupled to a maximally mixed bath. We show that the worst-input mean-square equilibration error, maximised over window origins, is bounded from above and below by the mean square of a complete local autocorrelation, with the stationary part subtracted. The two mean-square quantities are linearly comparable. A correlation record over a finite interval therefore controls the equilibration error in every interval of the same length, and the result extends to nonnegative observation weights with nonnegative Fourier transform. The result allows arbitrary degeneracies of energies and gaps. We apply it to two static Hamiltonian families. For fixed spin subsystems in the one-particle sector of a bounded-range periodic clock, fixed-accuracy thermalisation is guaranteed on windows that grow only slightly faster than linearly with system size, despite exponentially small positive energies. A random commuting model with logarithmic interaction range retains an extensive set of conserved observables. Its expected mean-square error is bounded by a finite-size term and an inverse-time term. The inverse-time dependence is unavoidable because of the initial transient. These examples show how local relaxation can coexist with exact conservation laws and a finely spaced spectrum.

quant-pharXiv:2610.16351•Oct 13, 2026•0 citations

Global Readouts of Noisy Quantum Dynamics

Harjas Sandhu

How much of a noisy quantum many-body system can be predicted without reconstructing its full state? This paper gives a classical algorithm for global product readouts in a driven two-dimensional spin system with independent local replacement noise. At every fixed positive noise-to-interaction ratio, the algorithm predicts the expectation of any product of one-qubit Hermitian contractions from a specified product preparation. Its bit complexity is polynomial in the complete binary input, inverse additive error and confidence digits. The controls have an explicit finite description, and the time horizon is paid in binary. Full-rank biased replacement is allowed when the Hamiltonian preserves its faithful product reference. Maximally mixed replacement requires no conservation condition. The proof connects sparse observable propagation to a short-time functional that can actually be evaluated on the chosen input. Weighted hypercontractivity and moving coefficient weights control the error. Two localized strip states, with discarded reset registers retained in a positive enlarged representation, give polynomial tensor dimensions and a bounded overlap estimator. Further results give full-output sampling on architectures with a supplied bounded-cut certificate, late-time relative mixing, and an acquired local-generator table that supports predictions for new preparations and drives with explicit calibration, preparation and model-error budgets. A rare-output reduction shows that uniform relative or logarithmic probability evaluation would imply NP = RP. A noisy-code construction separately shows why accurate product means alone need not determine a distribution in total variation. The polynomial degree depends on the fixed noise ratio and faithfulness bound. The results do not cover arbitrary cooling or general interacting thermal reference states. Full-output sampling on a generic two-dimensional lattice at intermediate times remains open.

•Nov 8, 2026•0 citations

Exact Localized Information Capacity of a Local Observable in a Hilbert-Space-Shattered System

Hikaru Wakaura, Taiki Tanimae

Abstract How many bits of information a local observable can retain forever is a sharp, operational measure of a system's memory, but it has been quantified only for many-body localization, where it rests on approximate integrals of motion, and for generic systems, where it is obtained numerically. Systems with strong Hilbert-space fragmentation possess an \emph{exact and complete} commutant algebra, yet their memory has been characterized only through autocorrelation Mazur bounds or by counting protected qubits---never as an information capacity in bits. Here we define the localized information capacity of a local observable as the Holevo/mutual information its infinite-time-retained state carries about the initial state, and show that in a fragmented system it equals, in \emph{closed form}, the projection of the observable onto the commutant, $\Cuniv=\sum_\alpha[\Tr(A P_\alpha)]^2/(D\,\Tr P_\alpha)$. This value is Hamiltonian-independent and is a rigorous lower bound on the true infinite-time autocorrelation; the excess is non-universal dynamical memory, which we show grows under disorder. For the spin-1 dipole-conserving chain we derive the sector count in closed form from a finite transfer structure on sector boundary types---Pell-number growth, $K_L=2P_{L+1}-1\sim(1+\sqrt2)^L$, the silver ratio; the capacity density provably converges, with the numerical value $\chi_\infty=1.09(1)$ bits per site, and fragmentation nearly doubles the autocorrelation floor guaranteed by all polynomial multipole charges. For the $t$--$J_z$ chain the capacity closes fully: exactly $2/3$ bit per site, the particle density times one retained spin bit. We further show why the complete labelling of the retained bits resists strict locality: the height dynamics is a partially-commutative (trace) monoid whose natural complete invariant---computable by a strictly local sweep---is provably incomplete for the gated physical moves, the missing labels being frozen orderings that are precisely statistically localized data. Our results turn the memory of a shattered Hilbert space into an exact bit count and explain, from first principles, why its complete integrals of motion are statistically rather than sharply localized.

•Jul 16, 2026•0 citations

Complexity of tensor network simulation for noisy quantum circuits

Yuguo Shao, Zishuo Zhao, Song Cheng +1 more

We aim to rigorously address how local noise affects classical simulability of quantum dynamics benchmarked by tensor-network methods. Using operator entanglement entropy (OEE), we prove the following: (1) For single-qubit depolarizing noise on arbitrary circuits, tensor networks with $\mathrm{poly}(n)$ bond dimension suffice for fixed absolute Hilbert-Schmidt error after $\order{1}$ depth, while relative error demands $\order{\log n}$ depth; and this bound is optimal. (2) For single-qubit depolarizing noise on 1D local circuits, the existence of whole-trajectory error-bounded matrix product operator (MPO) of $\mathrm{poly}(n)$ bond dimension at all depths. (3) For general single-qubit noise in 1D brickwall circuits, random two-design gates with contraction coefficient $c<1/3$ yield an $\order{1}$ OEE plateau with probability $1-Te^{-Ω(n)}$, while arbitrary gates with $c<1/48$ give $\order{\log n}$ OEE in the worst case. (4) In higher dimensions, these bounds yield uniform-in-depth $\mathrm{poly}(n)$ average boundary-bond dimensions for projected entangled pair operators~(PEPO) across every cut -- under depolarizing noise at either absolute or relative accuracy, and under general noise with strong contraction at absolute accuracy. Our results establish a rigorous connection between certain noise models, circuit types, and their classical simulability.

cond-mat.str-elCross-listedarXiv:2606.00474•Jun 2, 2026•2 citations

Undecidable quantum storage with seven elementary gates

Seth Douglas, Nidhal Mghirbi

Can the noise rate of one fixed local circuit encode an undecidable quantum-storage problem? Yes: we construct a three-dimensional medium, using only X, H, CNOT, Toffoli, reset, dephasing and identity, whose storage behaviour on explicit rate windows is as hard to decide as the halting problem. A separate construction handles each of whole-site and independent single-qubit depolarization after every layer. Computable disjoint rational rate windows select universal-machine inputs. For each nonhalting input, one computable encoder stores a reference-entangled qubit for a fixed positive multiple of the side length, at every size above a computable input-dependent threshold. On halting windows, every encoding fails after a time uniform in size and rate. A linear whole-channel upper bound makes the nonhalting storage scale sharp; certification of the explicit circuits is Π⁰₁-complete, with exact rational finite tests. The proof combines a noisy classical hierarchical calendar with concatenated binary quantum codes and a two-copy channel extension. A separate four-dimensional medium, under single-qubit depolarization only, has both an uncomputable storage diagram and a designed, decidable window of exponential storage. Interactions are finite-range rather than nearest-neighbour, constants are astronomical, and every finite sample eventually forgets.

•Nov 15, 2026•0 citations
We construct boundary observables that retain memory for a quantified time window in quantum chains whose basis configurations carry a conserved ordered product of matrix labels. Under strong-irreducibility and proximality hypotheses on the label matrices, projective contraction of random matrix products localizes a conserved charge in the root-mean-square over uniform basis configurations. A finite-time inequality then converts readout overlap and reset leakage into a correlation bound: for a conserved reference observable HHH, a readout FFF, accumulated squared leakage B\mathcal BB, and the normalized Hilbert-Schmidt inner product, ⟨F,Φ(F)⟩≥2⟨H,F⟩2/(∥H∥22+B)−∥F∥22\langle F,Φ(F)\rangle\ge 2\langle H,F\rangle^2/(\|H\|_2^2+\mathcal B)-\|F\|_2^2⟨F,Φ(F)⟩≥2⟨H,F⟩2/(∥H∥22​+B)−∥F∥22​. Here ΦΦΦ is a sequence of conserving channels and partial resets. The bound holds for each such circuit, without averaging its gates. It yields an exponential memory window in the distance from the noisy region, with quantitative corrections for spatially distributed noise and imperfect conservation. For a thirteen-state elementary-matrix model, exact polynomial certificates give root-mean-square localization error e−r/1400e^{-r/1400}e−r/1400 between the charge and its restriction to the last rrr sites, and limiting variance at least 1/191/191/19 for a rational charge. A related normalized-Gram charge gives an eight-site certificate retaining more than half the specified readout correlation through two boundary-reset rounds. Uniform depolarization imposes an inverse-noise-rate lifetime ceiling. A two-qubit IBM experiment illustrates the general reset inequality; it does not realize the matrix-product chain. We provide proofs, exact certificate programs, and an independent recount of the archived experimental outcomes.
The paper asks when an edge observable can retain a classical signal while a distant region is repeatedly randomized. It studies chains whose basis states carry matrix labels and whose interior dynamics conserve their ordered product. Under strong irreducibility and proximality assumptions, random-matrix contraction produces a diagonal conserved charge approximable on the last rrr sites with root-mean-square error Ce−κrC e^{-\kappa r}Ce−κr under uniform basis configurations, with nonzero limiting variance.
A general finite-sequence inequality converts charge–readout overlap and reset leakage into autocorrelation: ⟨F,Φ(F)⟩≥2⟨H,F⟩2/(∥H∥22+B)−∥F∥22\langle F,\Phi(F)\rangle\ge 2\langle H,F\rangle^2/(\|H\|_2^2+\mathcal B)-\|F\|_2^2⟨F,Φ(F)⟩≥2⟨H,F⟩2/(∥H∥22​+B)−∥F∥22​, where B=∑jpj∥(I−Pj)H∥22/(2−pj)\mathcal B=\sum_j p_j\|(I-P_j)H\|_2^2/(2-p_j)B=∑j​pj​∥(I−Pj​)H∥22​/(2−pj​). It follows from Hilbert–Schmidt norm loss and an operator-space geometric argument, and holds for each prescribed sequence of conserving bistochastic channels and partial resets, without gate averaging. Combined with localization, it certifies memory windows scaling as e2κre^{2\kappa r}e2κr.
For a thirteen-state model generating SL(3,Z)\mathrm{SL}(3,\mathbb Z)SL(3,Z), exact polynomial certificates establish a rational charge’s localization error e−r/1400e^{-r/1400}e−r/1400 and limiting variance at least 1/191/191/19. Exact finite-chain moments certify that a related seven-site readout in an eight-site chain retains more than 5/95/95/9 of its initial correlation after two reset rounds. Uniform single-site depolarization gives an inverse-noise-rate lifetime ceiling.
Localization is mean-square, not operator-norm; the charges preserve classical information, not arbitrary quantum states. Asymptotic readouts require thousands of sites. A two-qubit IBM reset echo illustrates only the general inequality, not spatial localization or length-dependent memory.
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.
An isolated quantum system evolves reversibly, yet a small subsystem can lose nearly all information about its initial state. Conserved quantities may retain some of this information, depending on how strongly they overlap with local observables. Here we consider a subsystem in an arbitrary initial state coupled to a maximally mixed bath. We show that the worst-input mean-square equilibration error, maximised over window origins, is bounded from above and below by the mean square of a complete local autocorrelation, with the stationary part subtracted. The two mean-square quantities are linearly comparable. A correlation record over a finite interval therefore controls the equilibration error in every interval of the same length, and the result extends to nonnegative observation weights with nonnegative Fourier transform. The result allows arbitrary degeneracies of energies and gaps. We apply it to two static Hamiltonian families. For fixed spin subsystems in the one-particle sector of a bounded-range periodic clock, fixed-accuracy thermalisation is guaranteed on windows that grow only slightly faster than linearly with system size, despite exponentially small positive energies. A random commuting model with logarithmic interaction range retains an extensive set of conserved observables. Its expected mean-square error is bounded by a finite-size term and an inverse-time term. The inverse-time dependence is unavoidable because of the initial transient. These examples show how local relaxation can coexist with exact conservation laws and a finely spaced spectrum.
How much of a noisy quantum many-body system can be predicted without reconstructing its full state? This paper gives a classical algorithm for global product readouts in a driven two-dimensional spin system with independent local replacement noise. At every fixed positive noise-to-interaction ratio, the algorithm predicts the expectation of any product of one-qubit Hermitian contractions from a specified product preparation. Its bit complexity is polynomial in the complete binary input, inverse additive error and confidence digits. The controls have an explicit finite description, and the time horizon is paid in binary. Full-rank biased replacement is allowed when the Hamiltonian preserves its faithful product reference. Maximally mixed replacement requires no conservation condition. The proof connects sparse observable propagation to a short-time functional that can actually be evaluated on the chosen input. Weighted hypercontractivity and moving coefficient weights control the error. Two localized strip states, with discarded reset registers retained in a positive enlarged representation, give polynomial tensor dimensions and a bounded overlap estimator. Further results give full-output sampling on architectures with a supplied bounded-cut certificate, late-time relative mixing, and an acquired local-generator table that supports predictions for new preparations and drives with explicit calibration, preparation and model-error budgets. A rare-output reduction shows that uniform relative or logarithmic probability evaluation would imply NP = RP. A noisy-code construction separately shows why accurate product means alone need not determine a distribution in total variation. The polynomial degree depends on the fixed noise ratio and faithfulness bound. The results do not cover arbitrary cooling or general interacting thermal reference states. Full-output sampling on a generic two-dimensional lattice at intermediate times remains open.
Abstract How many bits of information a local observable can retain forever is a sharp, operational measure of a system's memory, but it has been quantified only for many-body localization, where it rests on approximate integrals of motion, and for generic systems, where it is obtained numerically. Systems with strong Hilbert-space fragmentation possess an \emph{exact and complete} commutant algebra, yet their memory has been characterized only through autocorrelation Mazur bounds or by counting protected qubits---never as an information capacity in bits. Here we define the localized information capacity of a local observable as the Holevo/mutual information its infinite-time-retained state carries about the initial state, and show that in a fragmented system it equals, in \emph{closed form}, the projection of the observable onto the commutant, $\Cuniv=\sum_\alpha[\Tr(A P_\alpha)]^2/(D\,\Tr P_\alpha)$. This value is Hamiltonian-independent and is a rigorous lower bound on the true infinite-time autocorrelation; the excess is non-universal dynamical memory, which we show grows under disorder. For the spin-1 dipole-conserving chain we derive the sector count in closed form from a finite transfer structure on sector boundary types---Pell-number growth, KL=2PL+1−1∼(1+2)LK_L=2P_{L+1}-1\sim(1+\sqrt2)^LKL​=2PL+1​−1∼(1+2​)L, the silver ratio; the capacity density provably converges, with the numerical value χ∞=1.09(1)\chi_\infty=1.09(1)χ∞​=1.09(1) bits per site, and fragmentation nearly doubles the autocorrelation floor guaranteed by all polynomial multipole charges. For the ttt--JzJ_zJz​ chain the capacity closes fully: exactly 2/32/32/3 bit per site, the particle density times one retained spin bit. We further show why the complete labelling of the retained bits resists strict locality: the height dynamics is a partially-commutative (trace) monoid whose natural complete invariant---computable by a strictly local sweep---is provably incomplete for the gated physical moves, the missing labels being frozen orderings that are precisely statistically localized data. Our results turn the memory of a shattered Hilbert space into an exact bit count and explain, from first principles, why its complete integrals of motion are statistically rather than sharply localized.
We aim to rigorously address how local noise affects classical simulability of quantum dynamics benchmarked by tensor-network methods. Using operator entanglement entropy (OEE), we prove the following: (1) For single-qubit depolarizing noise on arbitrary circuits, tensor networks with poly(n)\mathrm{poly}(n)poly(n) bond dimension suffice for fixed absolute Hilbert-Schmidt error after $\order{1}$ depth, while relative error demands $\order{\log n}$ depth; and this bound is optimal. (2) For single-qubit depolarizing noise on 1D local circuits, the existence of whole-trajectory error-bounded matrix product operator (MPO) of poly(n)\mathrm{poly}(n)poly(n) bond dimension at all depths. (3) For general single-qubit noise in 1D brickwall circuits, random two-design gates with contraction coefficient c<1/3c<1/3c<1/3 yield an $\order{1}$ OEE plateau with probability 1−Te−Ω(n)1-Te^{-Ω(n)}1−Te−Ω(n), while arbitrary gates with c<1/48c<1/48c<1/48 give $\order{\log n}$ OEE in the worst case. (4) In higher dimensions, these bounds yield uniform-in-depth poly(n)\mathrm{poly}(n)poly(n) average boundary-bond dimensions for projected entangled pair operators~(PEPO) across every cut -- under depolarizing noise at either absolute or relative accuracy, and under general noise with strong contraction at absolute accuracy. Our results establish a rigorous connection between certain noise models, circuit types, and their classical simulability.
Can the noise rate of one fixed local circuit encode an undecidable quantum-storage problem? Yes: we construct a three-dimensional medium, using only X, H, CNOT, Toffoli, reset, dephasing and identity, whose storage behaviour on explicit rate windows is as hard to decide as the halting problem. A separate construction handles each of whole-site and independent single-qubit depolarization after every layer. Computable disjoint rational rate windows select universal-machine inputs. For each nonhalting input, one computable encoder stores a reference-entangled qubit for a fixed positive multiple of the side length, at every size above a computable input-dependent threshold. On halting windows, every encoding fails after a time uniform in size and rate. A linear whole-channel upper bound makes the nonhalting storage scale sharp; certification of the explicit circuits is Π⁰₁-complete, with exact rational finite tests. The proof combines a noisy classical hierarchical calendar with concatenated binary quantum codes and a two-copy channel extension. A separate four-dimensional medium, under single-qubit depolarization only, has both an uncomputable storage diagram and a designed, decidable window of exponential storage. Interactions are finite-range rather than nearest-neighbour, constants are astronomical, and every finite sample eventually forgets.