Provable bounds for noise-free expectation values computed from noisy
samples
- URL: http://arxiv.org/abs/2312.00733v1
- Date: Fri, 1 Dec 2023 17:12:18 GMT
- Title: Provable bounds for noise-free expectation values computed from noisy
samples
- Authors: Samantha V. Barron, Daniel J. Egger, Elijah Pelofske, Andreas
B\"artschi, Stephan Eidenbenz, Matthis Lehmkuehler, Stefan Woerner
- Abstract summary: We quantify the sampling overhead to extract good samples from noisy quantum computers.
We show how this allows us to use the Conditional Value at Risk of noisy samples to determine provable bounds on noise-free expectation values.
- Score: 1.3194391758295114
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In this paper, we explore the impact of noise on quantum computing,
particularly focusing on the challenges when sampling bit strings from noisy
quantum computers as well as the implications for optimization and machine
learning applications. We formally quantify the sampling overhead to extract
good samples from noisy quantum computers and relate it to the layer fidelity,
a metric to determine the performance of noisy quantum processors. Further, we
show how this allows us to use the Conditional Value at Risk of noisy samples
to determine provable bounds on noise-free expectation values. We discuss how
to leverage these bounds for different algorithms and demonstrate our findings
through experiments on a real quantum computer involving up to 127 qubits. The
results show a strong alignment with theoretical predictions.
Related papers
- Demonstration of Robust and Efficient Quantum Property Learning with
Shallow Shadows [1.412425180760368]
We propose a robust shallow shadows protocol for characterizing quantum states on current quantum computing platforms.
Our protocol correctly recovers state properties such as expectation values, fidelity, and entanglement entropy, while maintaining a lower sample complexity.
This combined theoretical and experimental analysis positions the robust shallow shadow protocol as a scalable, robust, and sample-efficient protocol.
arXiv Detail & Related papers (2024-02-27T21:53:32Z) - 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) - General noise-resilient quantum amplitude estimation [0.0]
We present a novel algorithm that enhances the estimation of amplitude and observable under noise.
Remarkably, our algorithm exhibits robustness against noise that varies across different depths of the quantum circuits.
arXiv Detail & Related papers (2023-12-02T09:27:40Z) - 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) - Certified Robustness of Quantum Classifiers against Adversarial Examples
through Quantum Noise [68.1992787416233]
We show that adding quantum random rotation noise can improve robustness in quantum classifiers against adversarial attacks.
We derive a certified robustness bound to enable quantum classifiers to defend against adversarial examples.
arXiv Detail & Related papers (2022-11-02T05:17:04Z) - Quantum Noise-Induced Reservoir Computing [0.6738135972929344]
We propose a framework called quantum noise-induced reservoir computing.
We show that some abstract quantum noise models can induce useful information processing capabilities for temporal input data.
Our study opens up a novel path for diverting useful information from quantum computer noises into a more sophisticated information processor.
arXiv Detail & Related papers (2022-07-16T12:21:48Z) - 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) - Noise thresholds for classical simulability of non-linear Boson sampling [4.812718493682455]
We introduce higher order non-linearities as a mean to enhance the computational complexity of the problem and the protocol's robustness against noise.
Our results indicate that the addition of single-mode Kerr non-linearity at the input state preparation level, while retaining a linear-optical evolution, makes the Boson sampling protocol more robust against noise.
arXiv Detail & Related papers (2022-02-24T12:17:28Z) - Noise-Aware Quantum Amplitude Estimation [0.18641315013048293]
We derive a Gaussian noise model for quantum amplitude estimation.
We show that the proposed model is a good fit for real-world experimental data.
We show that the addition of "noise awareness" serves as an effective means of quantum error mitigation.
arXiv Detail & Related papers (2021-09-10T12:49:29Z) - 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)
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.