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.39528

Optimal local recovery cannot alter critical orthogonality exponents in quantum spin environments

Zhixuan Zhao, Jun Li

quant-phcond-mat.stat-mechcond-mat.str-elSubmitted Sep 30, 2026• Announced Oct 1, 2026• 0 citations
arXivHTMLPDF

Abstract

We prove a local amplitude-ratio bound for positive ground states and an explicit reverse comparison for fidelity under finite-region erasure. An exact lattice calculation for a connected critical Ising chain gives amplitude exponent $1/8$, preserved by arbitrary optimal control on any fixed spin set and, at the level of logarithmic exponents, on $o(\log N)$ spins. We derive the finite Cauchy product and its uniform strip asymptotics, and document exact two-spin optimization and an interferometric protocol for measuring the recovery. A separate finite-mediator theorem quantifies local compression and a decoder while retaining the rest of the environment exactly. We also give a ground-preparation Ramsey bound, counterexamples to stronger projected-state inferences, and independent full-Hamiltonian calculations.

AI Summary

The paper asks whether optimal control of a small part of a spin environment can undo the loss of probe visibility caused by ground-state orthogonality. Recovery is a deterministic, probe-conditioned unitary on selected spins $M$; its optimal visibility $F_R$ equals the root fidelity of the uncontrolled remainder. For strictly positive ground states of stoquastic Hamiltonians, with selected-spin transverse fields $h_\ell>0$ and bounded diagonal half-splittings $B_\ell$, it proves $F\le F_R\le e^{\Lambda_M}F$, where $F$ is the original overlap and $\Lambda_M=\tfrac12\sum_{\ell\in M}\log[1+(B_\ell/h_\ell)^2]$. The proof bounds ground-state component ratios using an invariant imaginary-time cone, then bounds conditional classical fidelities. The constant is sharp and requires no many-body gap assumption. For a connected critical open Ising chain whose branches differ by one bond sign, an exact lattice determinant/product calculation gives $F=A_*N^{-1/8}[1+O(N^{-1})]$. Any $k$ physical spins satisfy $F\le F_R\le5^{k/2}F$: fixed-size recovery preserves the amplitude exponent, and $k=o(\log N)$ preserves its logarithmic value. Two-spin optimization gives $F_R/F\simeq1.13278$ at $N=2048$. A separate 12-spin auxiliary-spin example raises squared visibility from $0.04379$ to $0.98099$ by controlling four leaves. The conclusions require positivity, the specified transverse-flip structure, and bounded bias-to-field ratios. The logarithmic control-cost bound is necessary, not sufficient; full recovery in the critical example uses a half-chain flip. An interferometric test and a finite-mediator compression/decoder construction are also presented.

No sign of AI-generated textStrong assumptions

Error found: The supplied paper omits the finite Cauchy product and uniform asymptotic estimates advertised as establishing the critical Ising overlap formula, referring instead to unavailable Supplemental Material. The advertised finite-mediator compression and decoder theorem has no quantitative statement or error bound in the supplied paper, which delegates those details to unavailable Supplemental Material.

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

Related papers

Sharp Logarithmic Retained-Score Laws for Local Decoders in Critical Planar Ising Models

Tao Lin

We study the loss incurred when a raw observation that is sufficient for the global-spin-even quotient scores considered here is processed only by a spatially local additive decoder. The nearest-neighbor bond field determines the spin configuration modulo the global spin flip, so every even score used below is measurable from the raw observation; the loss instead comes from the restricted decoder architecture. In the critical nearest-neighbor square-lattice model, for every fixed decoder radius we prove a sharp inverse-log optimal retained-score law over the full fixed-range nonlinear local bond algebra. We also exhibit a mixed free-boundary/bulk protocol with a two-log law. Finally, for each fixed finite-range, translation-invariant, spin-flip-even perturbation potential in a constructive renormalization-group class, we prove a boundary-source/bulk-energy three-log law at sufficiently small coupling along the tuned critical family. The common mechanism is a separation between global score information and the marginal thermal or boundary channels accessible to a restricted local-additive decoder. The proof combines exact quotient structure, finite Pfaffian reductions, discrete $s$-holomorphic regularity, boundary primary-field convergence and fusion, correlation sign control, and source-weighted Gallavotti–Nicolò expansions. We do not claim that the exponents $1, 2, 3$ form a universal classification, nor that the associated amplitudes are universal.

•Sep 13, 2026•0 citations

Entropy and Routing Obstructions for the Boundary-Field Spin-1 Heisenberg Chain, with Exact AKLT Matrix Elements

Zeraoulia Rafik

We study the odd open spin-1 antiferromagnetic Heisenberg chain with positive endpoint fields through its reversible ground-state transform. The main results are two unconditional all-length obstructions to standard proof strategies. First, a high-magnetization projection recursion gives an explicit product bound on the fully polarized ground-state probability. For every positive field sequence \( h_N=o(N) \) this yields \( \alpha_N(h_N)\to 0 \), \( \qquad \limsup_{N\to\infty}\alpha_N(h_N)\log(N/h_N)\leq \frac{30}{7} \), for the ordinary logarithmic Sobolev constant of the ground-state process, with logarithmic tail coefficient at least (7/6). This does not imply collapse of either the Hamiltonian gap or the modified logarithmic Sobolev constant. Second, for the Diaconis–Stroock/Sinclair length-weighted congestion functional used in this paper, every routing with unit edge lengths has congestion at least linear in N; the same conclusion holds for uniformly comparable edge lengths, while routings forced through a polarized configuration obey a stronger rare-state obstruction. These are limitations of that comparison certificate, not upper bounds on the physical gap.As a complementary exact calculation, transfer matrices for the open AKLT ground space give both the singlet/triplet compression of \( W_m=\sum_{i=1}^{m-1}P_{1,i} \) and its coupling to the orthogonal complement. The compressed spectral diameter is \( O(m3^{-m}) \), whereas \( ||Q_mW_m\mathsf P_m||\sim\sqrt{2(m-1)}/3 \). This finite-block statement quantifies why the bare compressed splitting alone does not control the perturbation at the Heisenberg point; it is not a replacement for a locality-sensitive AKLT stability theorem. Exact rational inertia and interval arithmetic then provide supporting finite-volume certificates: full gaps and the complete AKLT–Heisenberg interpolation are certified for \( N=3,5 \), and at \( N=5,h=1 \) one obtains both a negative pointwise Bakry–Émery curvature witness and [ 27/25<\Delta_5(1)<567/500. \( 27/25<\Delta_5(1)<567/500 \)These finite-volume statements have no asserted local-to-global consequence. The fixed-field uniform boundary-gap problem remains open.

•Oct 6, 2026•0 citations

A Finite-Window Recovery Hierarchy for Local Quantum Memory

Zheng An, Dongyang Cao, Jiangyu Cui

When quantum information initially stored in a local qubit disappears, it need not be lost: it may have moved into nearby degrees of freedom or become inaccessible to shallow local control. We introduce finite-window recoverability as an operational channel benchmark that separates these possibilities. It compares optimal recovery from the target site, recovery by a bounded-depth decoder on a finite window, and the unrestricted optimum for that window. Its operational component, local variational recovery, uses local state preparation, window-local control, and target-qubit Pauli readout to certify recoverable memory beyond the target and quantify how much of the same-window advantage is accessible to shallow control. In a disordered kicked-Ising Floquet chain, a depth-6 decoder on a five-site window realizes $Q^{\mathrm{opt}}_0<Q^{\mathrm{shallow}}_2<Q^{\mathrm{opt}}_2$ across the crossover regime, with positive certified gain for most disorder realizations and substantial shallow-accessibility fractions. The signal differs from target-site persistence and reconstructed coherent-information increments. Positive radius-2 gain also persists when the task is embedded in longer open chains using an independent tensor-network backend. Guided by this hierarchy, we test a carrier-deletion task in which the original target register is reset after the dynamics. A depth-8 decoder repairs the input from a radius-3 surrounding halo with held-out median $F_{\mathrm{avg}}=0.758$, above the single-qubit classical benchmark $2/3$, and outperforms optimal one-, two-, and three-site halo-subwindow counterfactuals. These results establish finite-window recovery as a local-control benchmark for off-site quantum memory, diagnosing both where local quantum information remains and whether bounded-depth control can refocus it.

quant-pharXiv:2608.12803•Aug 14, 2026•4 citations

Spatial Cost of Recovering a Fusion Qubit in a Critical Spin Chain

Yi Liang

Vanishing-error recovery of a fusion qubit from a fixed-sector ground doublet of four Kramers--Wannier defects in a critical Ising chain requires at least the shorter three-defect span of physical spins to leading order. Across arbitrary preselected spin sets and unrestricted joint decoding, this bound holds when the thermodynamic limit precedes large spacings at fixed positive ratios. An exact interval decoder attains it. Collective records of both logical axes in the complement force successful near-minimal supports to concentrate in density on a leading-order shortest interval.

arXiv:2611.06215•Nov 4, 2026•0 citations

Universal Optimization and Tighter Fidelity Bounds for Approximate Quantum Error Correction

Jing Wu, Michele Grossi, Doga Kurkcuoglu +1 more

Approximate quantum error correction (AQEC) extends the framework of discrete- and continuous-variable quantum error correction beyond the Knill-Laflamme (KL) conditions, where the recovery performance is quantified by entanglement fidelity. Recent studies have enabled efficient evaluation of near-optimal entanglement fidelity using transpose-channel recovery. Yet, determining the global optimal recovery map and its entanglement fidelity for general codes beyond the KL conditions remains a major computational challenge. Direct optimization becomes prohibitive as the number of noise Kraus operators grows rapidly with system size, and existing approaches lack rigorous guarantees for reducing this optimization to a tractable dimension. Here, we derive an explicit characterization of the optimal environmental state of complement channel, which transforms the optimization over recovery channels into an equivalent optimization over quotient unitaries. For a broader class of codes that satisfy only the orthogonality part of the KL conditions, we show that the optimal recovery map admits an explicit analytical form. Building on this form, we derive novel rigorous lower bounds of entanglement fidelity that strictly improve upon the transpose-recovery bound. We further develop a novel recovery strategy based on principle components, and derive a rigorous bound on the error introduced by noise truncation. Our approach enables efficient searches for approximate recovery maps for AQEC codes, avoiding the need to optimize over the full Kraus-operator space.

quant-pharXiv:2607.24968•Jul 29, 2026•1 citation

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
We prove a local amplitude-ratio bound for positive ground states and an explicit reverse comparison for fidelity under finite-region erasure. An exact lattice calculation for a connected critical Ising chain gives amplitude exponent 1/81/81/8, preserved by arbitrary optimal control on any fixed spin set and, at the level of logarithmic exponents, on o(log⁡N)o(\log N)o(logN) spins. We derive the finite Cauchy product and its uniform strip asymptotics, and document exact two-spin optimization and an interferometric protocol for measuring the recovery. A separate finite-mediator theorem quantifies local compression and a decoder while retaining the rest of the environment exactly. We also give a ground-preparation Ramsey bound, counterexamples to stronger projected-state inferences, and independent full-Hamiltonian calculations.
The paper asks whether optimal control of a small part of a spin environment can undo the loss of probe visibility caused by ground-state orthogonality. Recovery is a deterministic, probe-conditioned unitary on selected spins MMM; its optimal visibility FRF_RFR​ equals the root fidelity of the uncontrolled remainder.
For strictly positive ground states of stoquastic Hamiltonians, with selected-spin transverse fields hℓ>0h_\ell>0hℓ​>0 and bounded diagonal half-splittings BℓB_\ellBℓ​, it proves F≤FR≤eΛMFF\le F_R\le e^{\Lambda_M}FF≤FR​≤eΛM​F, where FFF is the original overlap and ΛM=12∑ℓ∈Mlog⁡[1+(Bℓ/hℓ)2]\Lambda_M=\tfrac12\sum_{\ell\in M}\log[1+(B_\ell/h_\ell)^2]ΛM​=21​∑ℓ∈M​log[1+(Bℓ​/hℓ​)2]. The proof bounds ground-state component ratios using an invariant imaginary-time cone, then bounds conditional classical fidelities. The constant is sharp and requires no many-body gap assumption.
For a connected critical open Ising chain whose branches differ by one bond sign, an exact lattice determinant/product calculation gives F=A∗N−1/8[1+O(N−1)]F=A_*N^{-1/8}[1+O(N^{-1})]F=A∗​N−1/8[1+O(N−1)]. Any kkk physical spins satisfy F≤FR≤5k/2FF\le F_R\le5^{k/2}FF≤FR​≤5k/2F: fixed-size recovery preserves the amplitude exponent, and k=o(log⁡N)k=o(\log N)k=o(logN) preserves its logarithmic value. Two-spin optimization gives FR/F≃1.13278F_R/F\simeq1.13278FR​/F≃1.13278 at N=2048N=2048N=2048. A separate 12-spin auxiliary-spin example raises squared visibility from 0.043790.043790.04379 to 0.980990.980990.98099 by controlling four leaves.
The conclusions require positivity, the specified transverse-flip structure, and bounded bias-to-field ratios. The logarithmic control-cost bound is necessary, not sufficient; full recovery in the critical example uses a half-chain flip. An interferometric test and a finite-mediator compression/decoder construction are also presented.
We study the loss incurred when a raw observation that is sufficient for the global-spin-even quotient scores considered here is processed only by a spatially local additive decoder. The nearest-neighbor bond field determines the spin configuration modulo the global spin flip, so every even score used below is measurable from the raw observation; the loss instead comes from the restricted decoder architecture. In the critical nearest-neighbor square-lattice model, for every fixed decoder radius we prove a sharp inverse-log optimal retained-score law over the full fixed-range nonlinear local bond algebra. We also exhibit a mixed free-boundary/bulk protocol with a two-log law. Finally, for each fixed finite-range, translation-invariant, spin-flip-even perturbation potential in a constructive renormalization-group class, we prove a boundary-source/bulk-energy three-log law at sufficiently small coupling along the tuned critical family. The common mechanism is a separation between global score information and the marginal thermal or boundary channels accessible to a restricted local-additive decoder. The proof combines exact quotient structure, finite Pfaffian reductions, discrete sss-holomorphic regularity, boundary primary-field convergence and fusion, correlation sign control, and source-weighted Gallavotti–Nicolò expansions. We do not claim that the exponents 1,2,31, 2, 31,2,3 form a universal classification, nor that the associated amplitudes are universal.
We study the odd open spin-1 antiferromagnetic Heisenberg chain with positive endpoint fields through its reversible ground-state transform. The main results are two unconditional all-length obstructions to standard proof strategies. First, a high-magnetization projection recursion gives an explicit product bound on the fully polarized ground-state probability. For every positive field sequence hN=o(N) h_N=o(N) hN​=o(N) this yields αN(hN)→0 \alpha_N(h_N)\to 0 αN​(hN​)→0, lim sup⁡N→∞αN(hN)log⁡(N/hN)≤307 \qquad \limsup_{N\to\infty}\alpha_N(h_N)\log(N/h_N)\leq \frac{30}{7} limsupN→∞​αN​(hN​)log(N/hN​)≤730​, for the ordinary logarithmic Sobolev constant of the ground-state process, with logarithmic tail coefficient at least (7/6). This does not imply collapse of either the Hamiltonian gap or the modified logarithmic Sobolev constant. Second, for the Diaconis–Stroock/Sinclair length-weighted congestion functional used in this paper, every routing with unit edge lengths has congestion at least linear in N; the same conclusion holds for uniformly comparable edge lengths, while routings forced through a polarized configuration obey a stronger rare-state obstruction. These are limitations of that comparison certificate, not upper bounds on the physical gap.As a complementary exact calculation, transfer matrices for the open AKLT ground space give both the singlet/triplet compression of Wm=∑i=1m−1P1,i W_m=\sum_{i=1}^{m-1}P_{1,i} Wm​=∑i=1m−1​P1,i​ and its coupling to the orthogonal complement. The compressed spectral diameter is O(m3−m) O(m3^{-m}) O(m3−m), whereas ∣∣QmWmPm∣∣∼2(m−1)/3 ||Q_mW_m\mathsf P_m||\sim\sqrt{2(m-1)}/3 ∣∣Qm​Wm​Pm​∣∣∼2(m−1)​/3. This finite-block statement quantifies why the bare compressed splitting alone does not control the perturbation at the Heisenberg point; it is not a replacement for a locality-sensitive AKLT stability theorem. Exact rational inertia and interval arithmetic then provide supporting finite-volume certificates: full gaps and the complete AKLT–Heisenberg interpolation are certified for N=3,5 N=3,5 N=3,5, and at N=5,h=1 N=5,h=1 N=5,h=1 one obtains both a negative pointwise Bakry–Émery curvature witness and [ 27/25<\Delta_5(1)<567/500. 27/25<Δ5(1)<567/500 27/25<\Delta_5(1)<567/500 27/25<Δ5​(1)<567/500These finite-volume statements have no asserted local-to-global consequence. The fixed-field uniform boundary-gap problem remains open.
When quantum information initially stored in a local qubit disappears, it need not be lost: it may have moved into nearby degrees of freedom or become inaccessible to shallow local control. We introduce finite-window recoverability as an operational channel benchmark that separates these possibilities. It compares optimal recovery from the target site, recovery by a bounded-depth decoder on a finite window, and the unrestricted optimum for that window. Its operational component, local variational recovery, uses local state preparation, window-local control, and target-qubit Pauli readout to certify recoverable memory beyond the target and quantify how much of the same-window advantage is accessible to shallow control. In a disordered kicked-Ising Floquet chain, a depth-6 decoder on a five-site window realizes Q0opt<Q2shallow<Q2optQ^{\mathrm{opt}}_0<Q^{\mathrm{shallow}}_2<Q^{\mathrm{opt}}_2Q0opt​<Q2shallow​<Q2opt​ across the crossover regime, with positive certified gain for most disorder realizations and substantial shallow-accessibility fractions. The signal differs from target-site persistence and reconstructed coherent-information increments. Positive radius-2 gain also persists when the task is embedded in longer open chains using an independent tensor-network backend. Guided by this hierarchy, we test a carrier-deletion task in which the original target register is reset after the dynamics. A depth-8 decoder repairs the input from a radius-3 surrounding halo with held-out median Favg=0.758F_{\mathrm{avg}}=0.758Favg​=0.758, above the single-qubit classical benchmark 2/32/32/3, and outperforms optimal one-, two-, and three-site halo-subwindow counterfactuals. These results establish finite-window recovery as a local-control benchmark for off-site quantum memory, diagnosing both where local quantum information remains and whether bounded-depth control can refocus it.
Vanishing-error recovery of a fusion qubit from a fixed-sector ground doublet of four Kramers--Wannier defects in a critical Ising chain requires at least the shorter three-defect span of physical spins to leading order. Across arbitrary preselected spin sets and unrestricted joint decoding, this bound holds when the thermodynamic limit precedes large spacings at fixed positive ratios. An exact interval decoder attains it. Collective records of both logical axes in the complement force successful near-minimal supports to concentrate in density on a leading-order shortest interval.
Approximate quantum error correction (AQEC) extends the framework of discrete- and continuous-variable quantum error correction beyond the Knill-Laflamme (KL) conditions, where the recovery performance is quantified by entanglement fidelity. Recent studies have enabled efficient evaluation of near-optimal entanglement fidelity using transpose-channel recovery. Yet, determining the global optimal recovery map and its entanglement fidelity for general codes beyond the KL conditions remains a major computational challenge. Direct optimization becomes prohibitive as the number of noise Kraus operators grows rapidly with system size, and existing approaches lack rigorous guarantees for reducing this optimization to a tractable dimension. Here, we derive an explicit characterization of the optimal environmental state of complement channel, which transforms the optimization over recovery channels into an equivalent optimization over quotient unitaries. For a broader class of codes that satisfy only the orthogonality part of the KL conditions, we show that the optimal recovery map admits an explicit analytical form. Building on this form, we derive novel rigorous lower bounds of entanglement fidelity that strictly improve upon the transpose-recovery bound. We further develop a novel recovery strategy based on principle components, and derive a rigorous bound on the error introduced by noise truncation. Our approach enables efficient searches for approximate recovery maps for AQEC codes, avoiding the need to optimize over the full Kraus-operator space.
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.