Search arXivSearch

arXiv · 2605.02057

Fault-tolerant quantum processing of physical experiments

Abstract

Quantum computers may reveal features of Nature inaccessible to conventional experiments, but manipulating raw quantum data introduces noise that degrades inference even when the processor is fault-tolerant, creating a data-input bottleneck for robust quantum learning. Here we show that quantum fault tolerance can substantially improve the sample complexity of learning from noisy experiments. We encode unknown quantum states from physical experiments into protected quantum memory, enabling fault-tolerant implementations of quantum learning algorithms otherwise degraded by errors. Using this quantum uploading procedure, we prove that noisy randomized measurement and multi-copy learning tasks can be performed exponentially faster than by any adaptive strategy that does not immediately encode physical states into error-corrected memory. These separations are not simply due to a reduced effective noise rate: they hold even when uploading is substantially noisier than the bare experimental interface, rigorously establishing immediate encoding as the optimal approach to noise-robust learning. We numerically illustrate the speedups in astronomical imaging, where quantum processing of uploaded photons locates an exoplanet obscured by a bright star using orders of magnitude fewer shots than unencoded baselines. Our results establish a robust interface between quantum computers and natural systems, enabling powerful and practical quantum-enhanced experiments.

Explore related subjects

Keep this discovery

BibTeXRIS

Ishaan Kannan, Harald Putterman, Jordan Cotler. 2026-09-06. Fault-tolerant quantum processing of physical experiments. https://arxiv.org/abs/2605.02057

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

Discover connections

Connections use source metadata and explicit phrase matches, not verified experimental comparisons.

KEEP EXPLORING

Related papers

2-Fold Forrelation is in QAC$^0$

We show that 2-fold Forrelation with inverse-polylogarithmic promise gap can be solved, with bounded error, by polynomial-size QAC$^0$ circuits. Unlike the standard oracle-based Forrelation algorithm, our circuits receive the input explicitly, in the same form as the AC$^0$ circuits against which Forrelation is known to be hard. At constant gap, this yields a natural promise-problem separation between QAC$^0$ and AC$^0$.

quant-ph

Has quantum advantage been achieved?

Quantum computational advantage was claimed for the first time in 2019 and several experiments since then have reinforced and strengthened the claim. At the same time, a new generation of quantum computing devices with 100 logical qubits is being built. This raises two questions: Has quantum advantage actually been achieved? And what should our next milestones be for the upcoming 100-logical-qubit era? In this perspective, I argue that, in fact, quantum advantage has been achieved. The status today is analogous to Bell-inequality violations in the 1980s where some loopholes remain open, specifically, scalability and verifiability. I then outline three milestones for the 100-logical-qubit era aiming to close those loopholes: demonstrate fault-tolerant quantum advantage, perform efficiently verifiable advantage using random circuits with symmetries, and eventually demonstrate classically verifiable advantage with applications to certified randomness. These milestones are also natural stepping stones towards running algorithms with cryptographic applications.

quant-ph