Evidence of Quantum Machine Learning Advantage with Tens of Noisy Qubits

• URL: http://arxiv.org/abs/2605.21346v1
• Date: Wed, 20 May 2026 16:12:33 GMT
• Title: Evidence of Quantum Machine Learning Advantage with Tens of Noisy Qubits
• Abstract summary: Learning problems involving quantum data are natural candidates for demonstrating an advantage in quantum machine learning.<n>Recent results indicate that, for certain tasks and under noiseless conditions, coherent processing of quantum data outperforms fixed-measurement schemes followed by classical processing.<n>We present simulations and analysis of the performance of existing hardware on a learning problem known to exhibit advantage, now subjected to noisy quantum data.
• Score: 2.8016091833446626
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Learning problems involving quantum data are natural candidates for demonstrating an advantage in quantum machine learning. Recent results indicate that, for certain tasks and under noiseless conditions, coherent processing of quantum data outperforms fixed-measurement schemes followed by classical processing. It remained uncertain whether this performance gap persists at a finite scale, and in the presence of noise that is unavoidable with current quantum devices. In this work, we present simulations and analysis of the performance of existing hardware on a learning problem known to exhibit asymptotic advantage, now subjected to noisy quantum data. Comparing coherent quantum processing directly against fixed-measurement schemes, our results demonstrate a clear performance separation at a scale of just 30 to 40 noisy qubits. Already at this scale, the fundamental bottleneck is no longer classical computation but data acquisition; matching the noisy coherent protocol with measure-first strategies would still require months or even years of measurements. By systematically evaluating hardware constraints such as state preparation, gate errors, readout errors, connectivity, and coherence times, we provide evidence that a demonstration of such a strong learning advantage is accessible on near-term devices.

Related papers

• Digital quantum simulation of many-body systems: Making the most of intermediate-scale, noisy quantum computers [51.56484100374058]
  This thesis is centered around simulating quantum dynamics on quantum devices.<n>We present an overview of the most relevant quantum algorithms for quantum dynamics.<n>We identify relevant problems within quantum dynamics that could benefit from quantum simulation in the near future.
  arXiv  Detail & Related papers  (2025-08-29T10:37:19Z)
• Computational Performance Bounds Prediction in Quantum Computing with Unstable Noise [6.6884244790434195]
  Noise in quantum devices poses significant barriers to realizing this supremacy.<n>Next-generation quantum-centric supercomputing essentially requires efficient and accurate noise characterization.<n>We propose a data-driven workflow, namely QuBound, to predict computational performance bounds.
  arXiv  Detail & Related papers  (2025-07-22T22:00:09Z)
• 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)
• The curse of random quantum data [62.24825255497622]
  We quantify the performances of quantum machine learning in the landscape of quantum data. We find that the training efficiency and generalization capabilities in quantum machine learning will be exponentially suppressed with the increase in qubits. Our findings apply to both the quantum kernel method and the large-width limit of quantum neural networks.
  arXiv  Detail & Related papers  (2024-08-19T12:18:07Z)
• Machine learning on quantum experimental data toward solving quantum many-body problems [0.0]
  We demonstrate the successful implementation of classical machine learning algorithms for systems with up to 44 qubits. We extend the applicability of the hybrid approach to problems of interest in many-body physics.
  arXiv  Detail & Related papers  (2023-10-30T10:25:59Z)
• Classical Verification of Quantum Learning [42.362388367152256]
  We develop a framework for classical verification of quantum learning. We propose a new quantum data access model that we call "mixture-of-superpositions" quantum examples. Our results demonstrate that the potential power of quantum data for learning tasks, while not unlimited, can be utilized by classical agents.
  arXiv  Detail & Related papers  (2023-06-08T00:31:27Z)
• Adaptive quantum error mitigation using pulse-based inverse evolutions [0.0]
  We introduce a QEM method termed Adaptive KIK' that adapts to the noise level of the target device. The implementation of the method is experimentally simple -- it does not involve any tomographic information or machine-learning stage. We demonstrate our findings in the IBM quantum computers and through numerical simulations.
  arXiv  Detail & Related papers  (2023-03-09T02:50:53Z)
• Taking advantage of noise in quantum reservoir computing [0.0]
  We show that quantum noise can be used to improve the performance of quantum reservoir computing. Our results shed new light into the physical mechanisms underlying quantum devices.
  arXiv  Detail & Related papers  (2023-01-17T11:22:02Z)
• Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
  We present an approach where the quantum computation is supplemented by a classical result. Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative. In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
  arXiv  Detail & Related papers  (2022-09-12T15:47:44Z)
• Measuring NISQ Gate-Based Qubit Stability Using a 1+1 Field Theory and Cycle Benchmarking [50.8020641352841]
  We study coherent errors on a quantum hardware platform using a transverse field Ising model Hamiltonian as a sample user application. We identify inter-day and intra-day qubit calibration drift and the impacts of quantum circuit placement on groups of qubits in different physical locations on the processor. This paper also discusses how these measurements can provide a better understanding of these types of errors and how they may improve efforts to validate the accuracy of quantum computations.
  arXiv  Detail & Related papers  (2022-01-08T23:12:55Z)
• Characterizing quantum instruments: from non-demolition measurements to quantum error correction [48.43720700248091]
  In quantum information processing quantum operations are often processed alongside measurements which result in classical data. Non-unitary dynamical processes can take place on the system, for which common quantum channel descriptions fail to describe the time evolution. Quantum measurements are correctly treated by means of so-called quantum instruments capturing both classical outputs and post-measurement quantum states.
  arXiv  Detail & Related papers  (2021-10-13T18:00:13Z)
• 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.