Random Circuit Sampling: Fourier Expansion and Statistics

• URL: http://arxiv.org/abs/2404.00935v1
• Date: Mon, 1 Apr 2024 05:41:18 GMT
• Title: Random Circuit Sampling: Fourier Expansion and Statistics
• Authors: Gil Kalai, Yosef Rinott, Tomer Shoham,
• Abstract summary: In this paper we use Fourier methods combined with statistical analysis to study the effect of noise. We use both analytical methods and simulations to study the effect of readout and gate errors, and we use our analysis to study the samples of Google's 2019 quantum supremacy experiment.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Considerable effort in experimental quantum computing is devoted to noisy intermediate scale quantum computers (NISQ computers). Understanding the effect of noise is important for various aspects of this endeavor including notable claims for achieving quantum supremacy and attempts to demonstrate quantum error correcting codes. In this paper we use Fourier methods combined with statistical analysis to study the effect of noise. In particular, we use Fourier analysis to refine the linear cross-entropy fidelity estimator. We use both analytical methods and simulations to study the effect of readout and gate errors, and we use our analysis to study the samples of Google's 2019 quantum supremacy experiment.

Related papers

• Distinguishing Quantum Software Bugs from Hardware Noise: A Statistical Approach [4.00671924018776]
  We propose a statistical approach to differentiate between quantum software bugs and hardware noise.<n>We evaluate our methodology using well-known quantum algorithms, including Grover's algorithm, Deutsch-Jozsa algorithm, and Simon's algorithm.
  arXiv  Detail & Related papers  (2025-07-28T02:21:39Z)
• Calibration of Quantum Devices via Robust Statistical Methods [45.464983015777314]
  We numerically analyze advanced statistical methods for Bayesian inference against the state-of-the-art in quantum parameter learning.<n>We show advantages of these approaches over existing ones, namely under multi-modality and high dimensionality.<n>Our findings have applications in challenging quantumcharacterization tasks namely learning the dynamics of open quantum systems.
  arXiv  Detail & Related papers  (2025-07-09T15:22:17Z)
• Correlating noise floor with magic and entanglement in Pauli product states [37.69303106863453]
  We show the ability to recover resources specific to quantum computing from noisy states generated by Pauli product formulas.<n>The fidelity of purified states represents the noise floor of a given computation.<n>We experimentally validate these findings by collecting classical shadow data for a range of small circuits.
  arXiv  Detail & Related papers  (2025-05-07T19:24:00Z)
• Noise-resistant adaptive Hamiltonian learning [30.632260870411177]
  An adaptive Hamiltonian learning (AHL) model for data analysis and quantum state simulation is proposed to overcome problems such as low efficiency. A noise-resistant quantum neural network (RQNN) based on AHL is developed, which improves the noise robustness of the quantum neural network.
  arXiv  Detail & Related papers  (2025-01-14T11:12:59Z)
• 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)
• Understanding and mitigating noise in molecular quantum linear response for spectroscopic properties on quantum computers [0.0]
  We present a study of quantum linear response theory obtaining spectroscopic properties on simulated fault-tolerant quantum computers. This work introduces novel metrics to analyze and predict the origins of noise in the quantum algorithm. We highlight the significant impact of Pauli saving in reducing measurement costs and noise.
  arXiv  Detail & Related papers  (2024-08-17T23:46:17Z)
• Quantum noise modeling through Reinforcement Learning [38.47830254923108]
  We introduce a machine learning approach to characterize the noise impacting a quantum chip and emulate it during simulations. Our algorithm leverages reinforcement learning, offering increased flexibility in reproducing various noise models. The effectiveness of the RL agent has been validated through simulations and testing on real superconducting qubits.
  arXiv  Detail & Related papers  (2024-08-02T18:05:21Z)
• Quantum error mitigation for Fourier moment computation [49.1574468325115]
  This paper focuses on the computation of Fourier moments within the context of a nuclear effective field theory on superconducting quantum hardware. The study integrates echo verification and noise renormalization into Hadamard tests using control reversal gates. The analysis, conducted using noise models, reveals a significant reduction in noise strength by two orders of magnitude.
  arXiv  Detail & Related papers  (2024-01-23T19:10:24Z)
• Full-counting statistics of particle distribution on a digital quantum computer [0.0]
  Full-counting statistics (FCS) provides a powerful framework to access the statistical information of a system from the characteristic function. We propose a quantum algorithm for FCS that can obtain both the particle distribution and cumulants of interacting systems. The algorithm suggests an avenue for studying full-counting statistics on quantum computers.
  arXiv  Detail & Related papers  (2023-08-02T16:19:52Z)
• Quantum Conformal Prediction for Reliable Uncertainty Quantification in Quantum Machine Learning [47.991114317813555]
  Quantum models implement implicit probabilistic predictors that produce multiple random decisions for each input through measurement shots. This paper proposes to leverage such randomness to define prediction sets for both classification and regression that provably capture the uncertainty of the model.
  arXiv  Detail & Related papers  (2023-04-06T22:05:21Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• 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)
• Statistical Aspects of the Quantum Supremacy Demonstration [0.0]
  Google's team presented the notable claim of quantum supremacy in 2019. The paper aims to explain the relations between quantum computing and some of the statistical aspects involved in demonstrating quantum supremacy. A preliminary study of the Google data, focusing mostly on circuits of 12 and 14 qubits is discussed throughout the paper.
  arXiv  Detail & Related papers  (2020-08-12T08:46:02Z)
• Noise robustness and experimental demonstration of a quantum generative adversarial network for continuous distributions [0.5249805590164901]
  We numerically simulate the noisy hybrid quantum generative adversarial networks (HQGANs) to learn continuous probability distributions. We also investigate the effect of different parameters on the training time to reduce the computational scaling of the algorithm. Our results pave the way for experimental exploration of different quantum machine learning algorithms on noisy intermediate scale quantum devices.
  arXiv  Detail & Related papers  (2020-06-02T23:14:45Z)

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.