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
- Harjas Sandhu
Institutions
- The University of Queensland (AU)
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