How much can we learn from quantum random circuit sampling?

• URL: http://arxiv.org/abs/2510.09919v1
• Date: Fri, 10 Oct 2025 23:35:16 GMT
• Title: How much can we learn from quantum random circuit sampling?
• Authors: Tudor Manole, Daniel K. Mark, Wenjie Gong, Bingtian Ye, Yury Polyanskiy, Soonwon Choi,
• Abstract summary: We introduce new benchmarking methods based on random circuit sampling (RCS)<n>We develop techniques that achieve this task without classically intractable simulations of the quantum circuit.<n>Our results establish both practical benchmarking protocols for current and future quantum computers.
• Score: 15.583163083958008
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Benchmarking quantum devices is a foundational task for the sustained development of quantum technologies. However, accurate in situ characterization of large-scale quantum devices remains a formidable challenge: such systems experience many different sources of errors, and cannot be simulated on classical computers. Here, we introduce new benchmarking methods based on random circuit sampling (RCS), that substantially extend the scope of conventional approaches. Unlike existing benchmarks that report only a single quantity--the circuit fidelity--our framework extracts rich diagnostic information, including spatiotemporal error profiles, correlated and contextual errors, and biased readout errors, without requiring any modifications of the experiment. Furthermore, we develop techniques that achieve this task without classically intractable simulations of the quantum circuit, by leveraging side information, in the form of bitstring samples obtained from reference quantum devices. Our approach is based on advanced high-dimensional statistical modeling of RCS data. We sharply characterize the information-theoretic limits of error estimation, deriving matching upper and lower bounds on the sample complexity across all regimes of side information. We identify surprising phase transitions in learnability as the amount of side information varies. We demonstrate our methods using publicly available RCS data from a state-of-the-art superconducting processor, obtaining in situ characterizations that are qualitatively consistent yet quantitatively distinct from component-level calibrations. Our results establish both practical benchmarking protocols for current and future quantum computers and fundamental information-theoretic limits on how much can be learned from RCS data.

Related papers

• AQER: a scalable and efficient data loader for digital quantum computers [62.40228216126285]
  We develop AQER, a scalable AQL method that constructs the loading circuit by systematically reducing entanglement in target states.<n>We conduct systematic experiments to evaluate the effectiveness of AQER, using synthetic datasets, classical image and language datasets, and a quantum many-body state datasets with up to 50 qubits.
  arXiv  Detail & Related papers  (2026-02-02T14:39:42Z)
• Quantum Machine Learning via Contrastive Training [12.83661402071417]
  We introduce self-supervised pretraining of quantum representations that reduces reliance on labeled data.<n>We implement this paradigm on a programmable trapped-ion quantum computer, encoding images as quantum states.<n>Performance improvement is especially significant in regimes with limited labeled training data.
  arXiv  Detail & Related papers  (2025-11-17T15:36:23Z)
• Minimal Quantum Reservoirs with Hamiltonian Encoding [72.27323884094953]
  We investigate a minimal architecture for quantum reservoir computing based on Hamiltonian encoding.<n>This approach circumvents many of the experimental overheads typically associated with quantum machine learning.
  arXiv  Detail & Related papers  (2025-05-28T16:50:05Z)
• Enhancing Network Anomaly Detection with Quantum GANs and Successive Data Injection for Multivariate Time Series [6.576759206183036]
  We introduce a quantum generative adversarial network (QGAN) architecture for anomaly detection.<n>By integrating data re-uploading and SuDaI, the approach maps classical data into quantum states efficiently.<n>The QGAN achieves a accuracy high along with high recall and F1-scores in anomaly detection, and attains a lower MSE compared to the classical model.
  arXiv  Detail & Related papers  (2025-05-16T18:47:42Z)
• Near-Term Fermionic Simulation with Subspace Noise Tailored Quantum Error Mitigation [0.0]
  We introduce the Subspace Noise Tailoring (SNT) algorithm, which efficiently combines Symmetry Verification (SV) and low bias of Probabilistic Error Cancellation (PEC) QEM techniques.<n>We study the performance of our method by simulating the Trotterized time evolution of the spin-1/2 Fermi-Hubbard model (FHM) using a variety of local fermion-to-qubit encodings.
  arXiv  Detail & Related papers  (2025-03-14T18:20:54Z)
• Machine Learning Methods as Robust Quantum Noise Estimators [0.0]
  We show how traditional machine learning models can estimate quantum noise by analyzing circuit composition. Our results illustrate how this approach can accurately predict the robustness of circuits with a low error rate. These techniques can be used to assess the quality and security of quantum code, leading to more reliable quantum products.
  arXiv  Detail & Related papers  (2024-09-23T09:00:12Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• On the use of calibration data in error-aware compilation techniques for NISQ devices [0.0]
  We study how different usage of calibration data impacts the circuit fidelity, by using several compilation techniques and quantum processors. Our experiments yield valuable insights into the effects of noise-aware methodologies and the employment of calibration data.
  arXiv  Detail & Related papers  (2024-07-31T09:20:31Z)
• Benchmarking quantum gates and circuits [1.6163129903911515]
  This paper reviews a variety of key benchmarking techniques, including Randomized Benchmarking, Quantum Process Tomography, Gate Set Tomography, Process Fidelity Estimation, Direct Fidelity Estimation, and Cross-Entropy Benchmarking.<n>We introduce deterministic benchmarking (DB), a novel protocol that minimizes the number of experimental runs, exhibits resilience to SPAM errors, and effectively characterizes both coherent and incoherent errors.
  arXiv  Detail & Related papers  (2024-07-13T16:36:02Z)
• Pre-training Tensor-Train Networks Facilitates Machine Learning with Variational Quantum Circuits [70.97518416003358]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning on noisy intermediate-scale quantum (NISQ) devices. While tensor-train networks (TTNs) can enhance VQC representation and generalization, the resulting hybrid model, TTN-VQC, faces optimization challenges due to the Polyak-Lojasiewicz (PL) condition. To mitigate this challenge, we introduce Pre+TTN-VQC, a pre-trained TTN model combined with a VQC.
  arXiv  Detail & Related papers  (2023-05-18T03:08:18Z)
• A didactic approach to quantum machine learning with a single qubit [68.8204255655161]
  We focus on the case of learning with a single qubit, using data re-uploading techniques. We implement the different proposed formulations in toy and real-world datasets using the qiskit quantum computing SDK.
  arXiv  Detail & Related papers  (2022-11-23T18:25:32Z)
• 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)
• Quantum-tailored machine-learning characterization of a superconducting qubit [50.591267188664666]
  We develop an approach to characterize the dynamics of a quantum device and learn device parameters. This approach outperforms physics-agnostic recurrent neural networks trained on numerically generated and experimental data. This demonstration shows how leveraging domain knowledge improves the accuracy and efficiency of this characterization task.
  arXiv  Detail & Related papers  (2021-06-24T15:58:57Z)

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.