Recoverable Quantum Computation: An Information-Centric Paradigm for Quantum Computing with Errors
Abstract
Quantum computing promises transformative advances in computation, communication, sensing, and machine learning. Yet the realization of large-scale fault-tolerant quantum computers remains hindered by the enormous overhead required for quantum error correction. This challenge raises a fundamental question: Must useful quantum computing wait until fully fault-tolerant quantum hardware becomes available? In this Perspective, we propose Recoverable Quantum Computation (RQC), an information-centric paradigm for quantum computing with errors. Rather than requiring faithful preservation of the complete quantum state, RQC focuses on preserving the computational information required to accomplish a given task. A quantum computation is considered recoverable if the desired computational information can be extracted from noisy quantum outputs with an overhead that preserves quantum advantage relative to the best known classical method. We introduce recoverability as an operational principle for evaluating noisy quantum computations and propose practical metrics based on recovery overhead and recoverability efficiency. We illustrate the framework using quantum Fourier transform period estimation on IBM quantum hardware and a conceptual example from quantum machine learning, demonstrating that useful computational information may remain recoverable despite significant physical errors. Building on these examples, we propose a preliminary classification of quantum applications according to their expected recoverability and outline a research roadmap toward a predictive theory of recoverability. RQC is intended not as an alternative to fault-tolerant quantum computing, but as a complementary paradigm for understanding and evaluating useful quantum computation in the broad intermediate regime between today's noisy quantum processors and tomorrow's fault-tolerant quantum computers.
Versions
Related
- Evaluating quantum circuits in the reservoir computing paradigm
- Storage, Scrambling, and Loss of Information in Quantum Reservoir Computing
- Liouvillian Response for Temporal Information in Quantum Reservoir Computing
- Alphabet-Dependent Bounds for Pure Quantum (r,ρ)-Locally Recoverable Codes
- Force Sensing in a Recoverable Bosonic Quantum Memory
BibTeX
@misc{du2026recoverable,
title = {{Recoverable Quantum Computation: An Information-Centric Paradigm for Quantum Computing with Errors}},
author = {Shengwang Du},
howpublished = {arXiv},
year = {2026},
month = jul,
doi = {10.48550/arxiv.2607.23996},
eprint = {2607.23996},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2607.23996},
}
RIS
TY - UNPB
TI - Recoverable Quantum Computation: An Information-Centric Paradigm for Quantum Computing with Errors
AU - Shengwang Du
PY - 2026
DA - 2026/07/27
PB - arXiv
DO - 10.48550/arxiv.2607.23996
UR - https://arxiv.org/abs/2607.23996
AB - Quantum computing promises transformative advances in computation, communication, sensing, and machine learning. Yet the realization of large-scale fault-tolerant quantum computers remains hindered by the enormous overhead required for quantum error correction. This challenge raises a fundamental question: Must useful quantum computing wait until fully fault-tolerant quantum hardware becomes available? In this Perspective, we propose Recoverable Quantum Computation (RQC), an information-centric paradigm for quantum computing with errors. Rather than requiring faithful preservation of the complete quantum state, RQC focuses on preserving the computational information required to accomplish a given task. A quantum computation is considered recoverable if the desired computational information can be extracted from noisy quantum outputs with an overhead that preserves quantum advantage relative to the best known classical method. We introduce recoverability as an operational principle for evaluating noisy quantum computations and propose practical metrics based on recovery overhead and recoverability efficiency. We illustrate the framework using quantum Fourier transform period estimation on IBM quantum hardware and a conceptual example from quantum machine learning, demonstrating that useful computational information may remain recoverable despite significant physical errors. Building on these examples, we propose a preliminary classification of quantum applications according to their expected recoverability and outline a research roadmap toward a predictive theory of recoverability. RQC is intended not as an alternative to fault-tolerant quantum computing, but as a complementary paradigm for understanding and evaluating useful quantum computation in the broad intermediate regime between today's noisy quantum processors and tomorrow's fault-tolerant quantum computers.
ER -