Classical Sampling and Fault-Tolerant Computation in Warm Quantum Devices

When can a classical computer reproduce the entire measurement record of a driven quantum device, and when can the same kind of device compute reliably using the bath alone to renew purity? This paper gives sufficient bounds for both regimes in a two-dimensional spin array with bounded local Hamiltonian control and independent thermal relaxation and dephasing. At sufficiently low stationary bath polarization, a classical algorithm samples the joint outcomes of arbitrary local terminal measurements from a bath-product start, for every allowed drive and time. The runtime is polynomial in the complete specified input and inverse total-variation error, including when evolution time is written in binary. In the same regime, a common continuation erases earlier accessible quantum writes, with a reference-sensitive bound for a local injection. A separate theorem allows arbitrary product starts at a smaller polarization scale after a size-independent exposure. At a larger sufficient polarization on the same small-noise scale, predetermined local controls concentrate and replenish bath purity to sustain fault-tolerant quantum computation. Efficient classical sampling at fixed total-variation error in this regime would imply BQP = BPP. The interval between the sufficient bounds remains open. The paper also analyzes a 256-spin correlation experiment in a separate structured model.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-21
DOI
https://doi.org/10.5281/zenodo.24409841
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Classical Sampling and Fault-Tolerant Computation in Warm Quantum Devices

Harjas Sandhu
Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
preprint

Classical Sampling and Fault-Tolerant Computation in Warm Quantum Devices

Harjas Sandhu
preprint en

Abstract

When can a classical computer reproduce the entire measurement record of a driven quantum device, and when can the same kind of device compute reliably using the bath alone to renew purity? This paper gives sufficient bounds for both regimes in a two-dimensional spin array with bounded local Hamiltonian control and independent thermal relaxation and dephasing. At sufficiently low stationary bath polarization, a classical algorithm samples the joint outcomes of arbitrary local terminal measurements from a bath-product start, for every allowed drive and time. The runtime is polynomial in the complete specified input and inverse total-variation error, including when evolution time is written in binary. In the same regime, a common continuation erases earlier accessible quantum writes, with a reference-sensitive bound for a local injection. A separate theorem allows arbitrary product starts at a smaller polarization scale after a size-independent exposure. At a larger sufficient polarization on the same small-noise scale, predetermined local controls concentrate and replenish bath purity to sustain fault-tolerant quantum computation. Efficient classical sampling at fixed total-variation error in this regime would imply BQP = BPP. The interval between the sufficient bounds remains open. The paper also analyzes a 256-spin correlation experiment in a separate structured model.

Zenodo (CERN European Organization for Nuclear Research)
The University of Queensland (AU)
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Classical Sampling and Fault-Tolerant Computation in Warm Quantum Devices — Harjas Sandhu · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS