Statistical Aspects of the Quantum Supremacy Demonstration
- URL: http://arxiv.org/abs/2008.05177v3
- Date: Tue, 13 Jul 2021 19:24:41 GMT
- Title: Statistical Aspects of the Quantum Supremacy Demonstration
- Authors: Yosef Rinott, Tomer Shoham, and Gil Kalai
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The notable claim of quantum supremacy presented by Google's team in 2019
consists of demonstrating the ability of a quantum circuit to generate, albeit
with considerable noise, bitstrings from a distribution that is considered hard
to simulate on classical computers. Verifying that the generated data is indeed
from the claimed distribution and assessing the circuit's noise level and its
fidelity is a purely statistical undertaking. The objective of this paper is to
explain the relations between quantum computing and some of the statistical
aspects involved in demonstrating quantum supremacy in terms that are
accessible to statisticians, computer scientists, and mathematicians. Starting
with the statistical analysis in Google's demonstration, which we explain, we
study various estimators of the fidelity, and different approaches to testing
the distributions generated by the quantum computer. We propose different noise
models, and discuss their implications. A preliminary study of the Google data,
focusing mostly on circuits of 12 and 14 qubits is discussed throughout the
paper.
Related papers
- Random Circuit Sampling: Fourier Expansion and Statistics [0.0]
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.
arXiv Detail & Related papers (2024-04-01T05:41:18Z) - Power Characterization of Noisy Quantum Kernels [52.47151453259434]
We show that noise may make quantum kernel methods to only have poor prediction capability, even when the generalization error is small.
We provide a crucial warning to employ noisy quantum kernel methods for quantum computation.
arXiv Detail & Related papers (2024-01-31T01:02:16Z) - Quantum data learning for quantum simulations in high-energy physics [55.41644538483948]
We explore the applicability of quantum-data learning to practical problems in high-energy physics.
We make use of ansatz based on quantum convolutional neural networks and numerically show that it is capable of recognizing quantum phases of ground states.
The observation of non-trivial learning properties demonstrated in these benchmarks will motivate further exploration of the quantum-data learning architecture in high-energy physics.
arXiv Detail & Related papers (2023-06-29T18:00:01Z) - 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) - 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) - Diagnostics of quantum-gate coherences via end-point-measurement
statistics [0.0]
We consider a figure of merit encoding the information on how the coherence generated on average by a quantum gate is affected by unitary errors.
We provide numerical evidence that such information is well captured by the statistics of local energy measurements on the output states of the gate.
arXiv Detail & Related papers (2022-09-05T16:39:21Z) - On Quantum Circuits for Discrete Graphical Models [1.0965065178451106]
We provide the first method that allows one to provably generate unbiased and independent samples from general discrete factor models.
Our method is compatible with multi-body interactions and its success probability does not depend on the number of variables.
Experiments with quantum simulation as well as actual quantum hardware show that our method can carry out sampling and parameter learning on quantum computers.
arXiv Detail & Related papers (2022-06-01T11:03:51Z) - Noisy Quantum Kernel Machines [58.09028887465797]
An emerging class of quantum learning machines is that based on the paradigm of quantum kernels.
We study how dissipation and decoherence affect their performance.
We show that decoherence and dissipation can be seen as an implicit regularization for the quantum kernel machines.
arXiv Detail & Related papers (2022-04-26T09:52:02Z) - Quantum Local Differential Privacy and Quantum Statistical Query Model [0.7673339435080445]
Quantum statistical queries provide a theoretical framework for investigating the computational power of a learner with limited quantum resources.
In this work, we establish an equivalence between quantum statistical queries and quantum differential privacy in the local model.
We consider the task of quantum multi-party computation under local differential privacy.
arXiv Detail & Related papers (2022-03-07T18:38: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) - 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.