Noisy Quantum Learning Theory

• URL: http://arxiv.org/abs/2512.10929v1
• Date: Thu, 11 Dec 2025 18:56:32 GMT
• Title: Noisy Quantum Learning Theory
• Authors: Jordan Cotler, Weiyuan Gong, Ishaan Kannan,
• Abstract summary: We develop a framework for learning from noisy quantum experiments.<n>We focus on fault-tolerant devices accessing uncharacterized systems through noisy couplings.
• Score: 2.956729394666618
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We develop a framework for learning from noisy quantum experiments, focusing on fault-tolerant devices accessing uncharacterized systems through noisy couplings. Our starting point is the complexity class $\textsf{NBQP}$ ("noisy BQP"), modeling noisy fault-tolerant quantum computers that cannot, in general, error-correct the oracle systems they query. Using this class, we show that for natural oracle problems, noise can eliminate exponential quantum learning advantages of ideal noiseless learners while preserving a superpolynomial gap between NISQ and fault-tolerant devices. Beyond oracle separations, we study concrete noisy learning tasks. For purity testing, the exponential two-copy advantage collapses under a single application of local depolarizing noise. Nevertheless, we identify a setting motivated by AdS/CFT in which noise-resilient structure restores a quantum learning advantage in a noisy regime. We then analyze noisy Pauli shadow tomography, deriving lower bounds that characterize how instance size, quantum memory, and noise control sample complexity, and design algorithms with parametrically similar scalings. Together, our results show that the Bell-basis and SWAP-test primitives underlying most exponential quantum learning advantages are fundamentally fragile to noise unless the experimental system has latent noise-robust structure. Thus, realizing meaningful quantum advantages in future experiments will require understanding how noise-robust physical properties interface with available algorithmic techniques.

Related papers

• Learning Orthogonal Random Unitary Channels with Contracted Quantum Approaches and Simplex Optimization [41.94295877935867]
  We present a procedure for learning a class of random unitary channels on a quantum computer.<n>Our approach involves a multi-objective, Pauli- and unitary-based minimization, and allows for learning locally equivalent channels.
  arXiv  Detail & Related papers  (2025-01-28T19:02:52Z)
• Bayesian Quantum Amplitude Estimation [46.03321798937855]
  We present BAE, a problem-tailored and noise-aware Bayesian algorithm for quantum amplitude estimation.<n>In a fault tolerant scenario, BAE is capable of saturating the Heisenberg limit; if device noise is present, BAE can dynamically characterize it and self-adapt.<n>We propose a benchmark for amplitude estimation algorithms and use it to test BAE against other approaches.
  arXiv  Detail & Related papers  (2024-12-05T18:09:41Z)
• Classical Verification of Quantum Learning Advantages with Noises [0.27930367518472443]
  We propose an efficient classical error rectification algorithm to reconstruct the noise-free results given by the quantum Fourier sampling circuit. We also prove that a classical client with access to the random example oracle can verify the agnostic parity learning results from the noisy quantum prover.
  arXiv  Detail & Related papers  (2024-11-14T06:14:39Z)
• Quantum Advantage with Faulty Oracle [0.0]
  We focus on the scenario where the oracle is subject to non-unitary (or irreversible) noise. Regev and Schiff (ICALP'08) showed that quantum advantage is lost for the search problem under this noise model. This is the first non-trivial robustification of quantum query algorithms against an oracle that is noisy.
  arXiv  Detail & Related papers  (2024-11-07T18:10:07Z)
• The Learning Stabilizers with Noise problem [46.623273455512106]
  We show that the Learning Parity with Noise (LPN) problem can be seen as the task of decoding a random linear code in the presence of noise.<n>We show that LSN includes as a special case, which suggests that it is at least as hard as its classical counterpart.<n>We identify several applications of our LSN assumption, ranging from the construction of quantum bit schemes to the computational limitations of learning from quantum data.
  arXiv  Detail & Related papers  (2024-10-24T17:53:02Z)
• Efficient self-consistent learning of gate set Pauli noise [6.298222373534273]
  We study the task of gate set Pauli noise learning, where a set of quantum gates, state preparation, and measurements all suffer from unknown Pauli noise channels with a customized noise ansatz.<n>We show that all learnable information about the gate noise can be learned to relative precision, under mild assumptions on the noise ansatz.
  arXiv  Detail & Related papers  (2024-10-04T20:19:57Z)
• Unifying (Quantum) Statistical and Parametrized (Quantum) Algorithms [65.268245109828]
  We take inspiration from Kearns' SQ oracle and Valiant's weak evaluation oracle. We introduce an extensive yet intuitive framework that yields unconditional lower bounds for learning from evaluation queries.
  arXiv  Detail & Related papers  (2023-10-26T18:23:21Z)
• Efficient learning of the structure and parameters of local Pauli noise channels [1.5229257192293197]
  We present a novel approach for learning Pauli noise channels over n qubits. We achieve our results by leveraging a groundbreaking result by Bresler for efficiently learning Gibbs measures. Our method is efficient both in the number of samples and postprocessing without giving up on other desirable features.
  arXiv  Detail & Related papers  (2023-07-06T12:42:49Z)
• Scalable noisy quantum circuits for biased-noise qubits [37.69303106863453]
  We consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to $106$ gates.
  arXiv  Detail & Related papers  (2023-05-03T11:27:50Z)
• Pulse-level noisy quantum circuits with QuTiP [53.356579534933765]
  We introduce new tools in qutip-qip, QuTiP's quantum information processing package. These tools simulate quantum circuits at the pulse level, leveraging QuTiP's quantum dynamics solvers and control optimization features. We show how quantum circuits can be compiled on simulated processors, with control pulses acting on a target Hamiltonian.
  arXiv  Detail & Related papers  (2021-05-20T17:06:52Z)
• Efficient classical simulation and benchmarking of quantum processes in the Weyl basis [0.0]
  We develop a randomized benchmarking algorithm which uses Weyl unitaries to efficiently identify and learn a mixture of error models. We apply our methods to ansatz circuits that appear in the Variational Quantum Eigensolver.
  arXiv  Detail & Related papers  (2020-08-27T16:46:12Z)
• Quantum noise protects quantum classifiers against adversaries [120.08771960032033]
  Noise in quantum information processing is often viewed as a disruptive and difficult-to-avoid feature, especially in near-term quantum technologies. We show that by taking advantage of depolarisation noise in quantum circuits for classification, a robustness bound against adversaries can be derived. This is the first quantum protocol that can be used against the most general adversaries.
  arXiv  Detail & Related papers  (2020-03-20T17:56:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.