Lie-algebraic classical simulations for quantum computing

The classical simulation of quantum dynamics plays an important role in our understanding of quantum complexity and in the development of quantum technologies. Efficient techniques such as those based on the Gottesman-Knill theorem for Clifford circuits, tensor networks for low entanglement-generating circuits, or Wick's theorem for fermionic Gaussian states have become central tools in quantum computing. In this work, we contribute to this body of knowledge by presenting a framework for classical simulations, dubbed “<a:math xmlns:a="http://www.w3.org/1998/Math/MathML"><a:mrow><a:mi mathvariant="fraktur">g</a:mi><a:mtext>-sim</a:mtext></a:mrow></a:math>”, which is based on the underlying Lie algebraic structure of the dynamical process. When the dimension of the algebra grows at most polynomially in the system size, there exist observables for which the simulation is efficient. Indeed, we show that <c:math xmlns:c="http://www.w3.org/1998/Math/MathML"><c:mrow><c:mi mathvariant="fraktur">g</c:mi><c:mtext>-sim</c:mtext></c:mrow></c:math> enables new regimes for classical simulations, is able to deal with certain forms of noise in the evolution, as well as can be used to tackle several paradigmatic variational and nonvariational quantum computing tasks. For the former, we perform Lie-algebraic simulations to train and optimize parametrized quantum circuits (thus effectively showing that some variational models can be dequantized), design enhanced parameter initialization strategies, solve tasks of quantum circuit synthesis, and train a quantum-phase classifier. For the latter, we report large-scale noiseless and noisy simulations on benchmark problems. By comparing the limitations of <e:math xmlns:e="http://www.w3.org/1998/Math/MathML"><e:mrow><e:mi mathvariant="fraktur">g</e:mi><e:mtext>-sim</e:mtext></e:mrow></e:math> and certain Wick's theorem-based simulations, we find that the two methods become inefficient for different types of states or observables, hinting at the existence of distinct, nonequivalent resources for classical simulation.

Authors

Institutions

Publication Details

Journal
Physical Review Research
Published
2025-08-22
DOI
https://doi.org/10.1103/3y65-f5w6
Citations
10
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
24.81
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Lie-algebraic classical simulations for quantum computing

Łukasz Cincio, Matthew L. Goh, M. Cerezo, Frédéric Sauvage et al.
10 citations
Physical Review Research
Quantum Computing Algorithms and Architecture
24.81
article

Lie-algebraic classical simulations for quantum computing

Łukasz Cincio, Matthew L. Goh, M. Cerezo, Frédéric Sauvage, Martín Larocca
article en
10 citations

Abstract

The classical simulation of quantum dynamics plays an important role in our understanding of quantum complexity and in the development of quantum technologies. Efficient techniques such as those based on the Gottesman-Knill theorem for Clifford circuits, tensor networks for low entanglement-generating circuits, or Wick's theorem for fermionic Gaussian states have become central tools in quantum computing. In this work, we contribute to this body of knowledge by presenting a framework for classical simulations, dubbed “<a:math xmlns:a="http://www.w3.org/1998/Math/MathML"><a:mrow><a:mi mathvariant="fraktur">g</a:mi><a:mtext>-sim</a:mtext></a:mrow></a:math>”, which is based on the underlying Lie algebraic structure of the dynamical process. When the dimension of the algebra grows at most polynomially in the system size, there exist observables for which the simulation is efficient. Indeed, we show that <c:math xmlns:c="http://www.w3.org/1998/Math/MathML"><c:mrow><c:mi mathvariant="fraktur">g</c:mi><c:mtext>-sim</c:mtext></c:mrow></c:math> enables new regimes for classical simulations, is able to deal with certain forms of noise in the evolution, as well as can be used to tackle several paradigmatic variational and nonvariational quantum computing tasks. For the former, we perform Lie-algebraic simulations to train and optimize parametrized quantum circuits (thus effectively showing that some variational models can be dequantized), design enhanced parameter initialization strategies, solve tasks of quantum circuit synthesis, and train a quantum-phase classifier. For the latter, we report large-scale noiseless and noisy simulations on benchmark problems. By comparing the limitations of <e:math xmlns:e="http://www.w3.org/1998/Math/MathML"><e:mrow><e:mi mathvariant="fraktur">g</e:mi><e:mtext>-sim</e:mtext></e:mrow></e:math> and certain Wick's theorem-based simulations, we find that the two methods become inefficient for different types of states or observables, hinting at the existence of distinct, nonequivalent resources for classical simulation.

Physical Review ResearchVol. 7(3)
Los Alamos National Laboratory (US), University of Oxford (GB)
Openalex Percentile: Top 1%
Quantum Computing Algorithms and Architecture
24.81
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.