SearcharxivSearch

arXiv · 2603.12303

Evaluation artifacts in reversible quantum reservoir protocols: a withdrawal of our own claims, and an entangled channel that survives the controls

Abstract

This replaces v1, which reported a ten-order shot-noise suppression from a quantum reservoir autoencoder and a two-phase protocol reconstructing unseen inputs at MSE ~ 10^-4. We withdraw both claims: under one consistent evaluation the suppression reverses sign (reset channels degrade reconstruction 144x), the two-phase target is invertible in closed form without training, and a polynomial using no quantum features matches the full model. We trace these to four evaluation artifacts; the fourth also invalidates the companion latent code, which never leaves its initialization. What survives the same controls is a joint scrambling channel: injected on one reservoir half, read out on the other, decoded by a readout calibrated once on training messages. Over 32 realizations the held-out error is below chance in 31-32 (permutation p<10^-4) with a shuffled control at chance. Scrambler T-doping is necessary for one-shot injection, while interleaved injection supplies its own non-Cliffordness; a matched classical scrambler decodes the task better, so the transport is not evidence of a quantum mechanism. The access threshold, recomputed on nested subsystems with right-censoring, gives interleaved medians f* = 0.25-0.33; one-shot injection reaches full detectability in only half the realizations at the largest settings. A trained variational ansatz loses to the fixed untrained circuit by 2.6-4.4x. Three extensions pass the same discipline: streaming requires dissipative reset of the accessible half; the decoder does not transfer across the eight keys tested; a receiver holding the key matches the supervised ceiling from self-simulated pairs. A first hardware run decodes at 0.23 with the shuffled control at chance, while coherent device errors partially open the t=0 control. We close with the controls that separate transport from interpolation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Hikaru Wakaura, Taiki Tanimae. 2026-03-12. Evaluation artifacts in reversible quantum reservoir protocols: a withdrawal of our own claims, and an entangled channel that survives the controls. https://arxiv.org/abs/2603.12303

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Probing the Error-Mitigation Threshold with Matrix Product States

Quantum error mitigation relies on accurate noise characterization, but mismatches between the actual and characterized noise can be amplified and drive a sharp threshold between successful and failed mitigation. In random circuits, this threshold maps onto a random-field Ising transition, but previous exact numerics were limited to small one-dimensional and all-to-all systems, leaving explicit two-dimensional architectures unresolved. We develop a fixed-bond-dimension matrix-product-state method for the replicated transfer dynamics that extends threshold calculations beyond exact propagation while retaining the finite-size signatures of the transition. At system sizes beyond previous exact studies, we recover the predicted absence of a threshold for quenched disorder in 1D, obtain a sharper annealed all-to-all critical point, and resolve architecture-dependent finite-depth thresholds in 2D square and heavy-hex circuits. These results establish replicated tensor-network dynamics as a practical tool for probing error-mitigation thresholds in large and higher-dimensional noisy circuits.

quant-ph

Low-cost algorithm-to-execution framework for surface-code quantum computing

The execution of useful quantum algorithms on fault-tolerant processors requires more than a mapping from logical gates to encoded operations: the spatial organization, non-Clifford resource supply, and execution schedule must also be determined while keeping physical overhead within practical limits. Although the theoretical hierarchy from logical circuits to fault-tolerant operations is well established, these implementation choices are often specified and optimized separately. Here we develop a low-cost algorithm-to-execution framework for surface-code quantum computing. From hierarchical algorithm descriptions, it constructs dependency-preserving logical schedules and an executable workload capturing logical interactions, operation parallelism, and time-resolved non-Clifford demand, thereby linking logical computation to surface-code organization, resource-state preparation, and fault-tolerant execution in a traceable workflow. We apply the framework to twenty benchmark circuits across seven algorithm families and a hierarchically composed application-scale elliptic-curve discrete-logarithm workload. Physical costs vary substantially even for circuits with similar logical resource counts. Under our direct-rotation calibration, non-Clifford implementation selection reduces space-time volume by up to 241.5 times versus an all-synthesis baseline for the QAOA amplitude-amplification workload. Circuit-specific surface-code layouts reduce routed-latency estimates for all twenty benchmarks; thirteen also reduce space-time volume because communication savings outweigh added spatial overhead. These results show that low-cost fault-tolerant execution depends on computation scheduling and organization, not aggregate logical resource counts alone.

quant-ph

Sample-optimal learning of stabilizer states

It is well-known that learning a pure $n$-qubit stabilizer state $|\psi\rangle$ both requires, and can be accomplished with, access to a number of copies of $|\psi\rangle$ linear in $n$. However, the precise constant coefficient of this scaling does not appear to have been determined. Here we prove that $L_\delta(n)$, the smallest number of copies from which a quantum procedure can identify any stabilizer state with failure probability at most $0<\delta<1/8$, satisfies $n+\lceil\log_2(1/\delta)\rceil-3\leq L_\delta(n)\leq n+\left\lceil\log_2(1/\delta)\right\rceil+4$. We present a polynomial-time quantum learning algorithm that saturates this bound, achieving a constant factor improvement in sample-complexity over previously known approaches. As an immediate corollary, we obtain via the Choi-Jamiolkowski isomorphism an algorithm for learning an unknown $n$-qubit Clifford unitary from $2n+\left\lceil\log_2(1/\delta)\right\rceil+4$ queries, the $n$-dependence of which we show to be optimal. Our proof technique, which involves Fourier analysis on the abelian group $\mathbb{Z}_4^n \times \mathbb{F}_2^{n(n-1)/2}$, seems to be qualitatively different to previous approaches to stabilizer state learning, and may be of some independent interest; in particular, it admits natural generalisations to further problems in quantum learning theory.

quant-ph