Noise-induced shallow circuits and absence of barren plateaus
- URL: http://arxiv.org/abs/2403.13927v1
- Date: Wed, 20 Mar 2024 19:00:49 GMT
- Title: Noise-induced shallow circuits and absence of barren plateaus
- Authors: Antonio Anna Mele, Armando Angrisani, Soumik Ghosh, Sumeet Khatri, Jens Eisert, Daniel Stilck França, Yihui Quek,
- Abstract summary: We first show that any noise truncates' most quantum circuits to effectively logarithmic depth.
We then prove that quantum circuits under any non-unital noise exhibit lack of barren plateaus for cost functions composed of local observables.
We also design a classical algorithm to estimate Pauli expectation values within inverse-polynomial additive error.
- Score: 2.5295633594332334
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Motivated by realistic hardware considerations of the pre-fault-tolerant era, we comprehensively study the impact of uncorrected noise on quantum circuits. We first show that any noise `truncates' most quantum circuits to effectively logarithmic depth, in the task of computing Pauli expectation values. We then prove that quantum circuits under any non-unital noise exhibit lack of barren plateaus for cost functions composed of local observables. But, by leveraging the effective shallowness, we also design a classical algorithm to estimate Pauli expectation values within inverse-polynomial additive error with high probability over the ensemble. Its runtime is independent of circuit depth and it operates in polynomial time in the number of qubits for one-dimensional architectures and quasi-polynomial time for higher-dimensional ones. Taken together, our results showcase that, unless we carefully engineer the circuits to take advantage of the noise, it is unlikely that noisy quantum circuits are preferable over shallow quantum circuits for algorithms that output Pauli expectation value estimates, like many variational quantum machine learning proposals. Moreover, we anticipate that our work could provide valuable insights into the fundamental open question about the complexity of sampling from (possibly non-unital) noisy random circuits.
Related papers
- A polynomial-time classical algorithm for noisy quantum circuits [1.2708457954150887]
We provide a-time classical algorithm for noisy quantum circuits.
Our approach is based upon the intuition that noise exponentially damps non-local correlations.
arXiv Detail & Related papers (2024-07-17T17:48:39Z) - 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) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Efficient learning of the structure and parameters of local Pauli noise
channels [1.5229257192293197]
We present a novel approach for learning Pauli noise channels over n qubits.
We achieve our results by leveraging a groundbreaking result by Bresler for efficiently learning Gibbs measures.
Our method is efficient both in the number of samples and postprocessing without giving up on other desirable features.
arXiv Detail & Related papers (2023-07-06T12:42:49Z) - Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most.
We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
arXiv Detail & Related papers (2022-04-12T19:39:31Z) - Limitations of variational quantum algorithms: a quantum optimal
transport approach [11.202435939275675]
We obtain extremely tight bounds for standard NISQ proposals in both the noisy and noiseless regimes.
The bounds limit the performance of both circuit model algorithms, such as QAOA, and also continuous-time algorithms, such as quantum annealing.
arXiv Detail & Related papers (2022-04-07T13:58:44Z) - Gaussian initializations help deep variational quantum circuits escape
from the barren plateau [87.04438831673063]
Variational quantum circuits have been widely employed in quantum simulation and quantum machine learning in recent years.
However, quantum circuits with random structures have poor trainability due to the exponentially vanishing gradient with respect to the circuit depth and the qubit number.
This result leads to a general belief that deep quantum circuits will not be feasible for practical tasks.
arXiv Detail & Related papers (2022-03-17T15:06:40Z) - Probabilistic error cancellation with sparse Pauli-Lindblad models on
noisy quantum processors [0.7299729677753102]
We present a protocol for learning and inverting a sparse noise model that is able to capture correlated noise and scales to large quantum devices.
These advances allow us to demonstrate PEC on a superconducting quantum processor with crosstalk errors.
arXiv Detail & Related papers (2022-01-24T18:40:43Z) - Achieving fault tolerance against amplitude-damping noise [1.7289359743609742]
We develop a protocol for fault-tolerant encoded quantum computing components in the presence of amplitude-damping noise.
We describe a universal set of fault-tolerant encoded gadgets and compute the pseudothreshold for the noise.
Our work demonstrates the possibility of applying the ideas of quantum fault tolerance to targeted noise models.
arXiv Detail & Related papers (2021-07-12T14:59:54Z) - Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
We propose a resource and runtime efficient scheme termed quantum architecture search (QAS)
QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates.
We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
arXiv Detail & Related papers (2020-10-20T12:06:27Z) - Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling.
We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
arXiv Detail & Related papers (2020-05-05T20:11:53Z)
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.