Classical simulations of noisy variational quantum circuits

Noise detrimentally affects quantum computations so that they not only become less accurate but also easier to simulate classically as systems scale up. We construct a classical simulation algorithm, lowesa (low weight efficient simulation algorithm), for estimating expectation values of noisy parameterised quantum circuits with a fixed observable. It combines previous results on spectral analysis of parameterised circuits with Pauli back-propagation and recent ideas for simulations of noisy random circuits. We show, under some conditions on the circuits and mild assumptions on noise, that lowesa gives an efficient, polynomial algorithm in the number of qubits (and depth), with approximation error that vanishes exponentially in the physical error rate and a controllable cutoff parameter. This is valid for any expectation value that may be efficiently evaluated on a quantum computer. We discuss the practical limitations of the method for circuit classes with correlated parameters and its scaling with decreasing error rates.

Authors

Institutions

Publication Details

Journal
npj Quantum Information
Published
2025-05-22
DOI
https://doi.org/10.1038/s41534-024-00955-1
Citations
6
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
14.89

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Classical simulations of noisy variational quantum circuits

Cristina Cîrstoiu, Ivan Rungger, Manuel S. Rudolph, Ross Duncan et al.
6 citations
npj Quantum Information
Quantum Computing Algorithms and Architecture
14.89
article

Classical simulations of noisy variational quantum circuits

Cristina Cîrstoiu, Ivan Rungger, Manuel S. Rudolph, Ross Duncan, Enrico Fontana
article en
6 citations

Abstract

Noise detrimentally affects quantum computations so that they not only become less accurate but also easier to simulate classically as systems scale up. We construct a classical simulation algorithm, lowesa (low weight efficient simulation algorithm), for estimating expectation values of noisy parameterised quantum circuits with a fixed observable. It combines previous results on spectral analysis of parameterised circuits with Pauli back-propagation and recent ideas for simulations of noisy random circuits. We show, under some conditions on the circuits and mild assumptions on noise, that lowesa gives an efficient, polynomial algorithm in the number of qubits (and depth), with approximation error that vanishes exponentially in the physical error rate and a controllable cutoff parameter. This is valid for any expectation value that may be efficiently evaluated on a quantum computer. We discuss the practical limitations of the method for circuit classes with correlated parameters and its scaling with decreasing error rates.

npj Quantum InformationVol. 11(1)
National Physical Laboratory (GB), University of Strathclyde (GB), Cambridge Quantum Computing (United Kingdom) (GB), École Polytechnique Fédérale de Lausanne (CH)
Government of the United Kingdom, Engineering and Physical Sciences Research Council, Innovate UK, National Physical Laboratory
Openalex Percentile: Top 1%
Quantum Computing Algorithms and Architecture
14.89
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.