Large-scale sparse wave function circuit simulator for applications with the variational quantum eigensolver

The standard paradigm for state preparation on quantum computers for the simulation of physical systems in the near term has been widely explored with different algorithmic methods. One such approach is the optimization of parameterized circuits, but this becomes increasingly challenging with circuit size. As a consequence, the utility of large-scale circuit optimization is relatively unknown. In this work we demonstrate that purely classical resources can be used to optimize quantum circuits in an approximate but robust manner such that we can bridge the resources that we have from high performance computing and see a direct transition to quantum advantage. We show this through the sparse wave function circuit solvers, which we detail here, and demonstrate a region of efficient classic simulation. With such tools, we can avoid the many problems that plague circuit optimization for circuits with hundreds of qubits using only practical and reasonable classical computing resources. These tools allow us to probe the true benefit of variational optimization approaches on quantum computers, thus opening the window to what can be expected with near term hardware for physical systems. We demonstrate this with a unitary coupled cluster ansatz on various molecules up to 64 qubits with tens of thousands of variational parameters.

Authors

Institutions

Publication Details

Journal
The Journal of Chemical Physics
Published
2025-02-21
DOI
https://doi.org/10.1063/5.0251601
Citations
7
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
17.37
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Large-scale sparse wave function circuit simulator for applications with the variational quantum eigensolver

J. Wayne Mullinax, Norm M. Tubman
7 citations
The Journal of Chemical Physics
Quantum Computing Algorithms and Architecture
17.37
article

Large-scale sparse wave function circuit simulator for applications with the variational quantum eigensolver

J. Wayne Mullinax, Norm M. Tubman
article en
7 citations

Abstract

The standard paradigm for state preparation on quantum computers for the simulation of physical systems in the near term has been widely explored with different algorithmic methods. One such approach is the optimization of parameterized circuits, but this becomes increasingly challenging with circuit size. As a consequence, the utility of large-scale circuit optimization is relatively unknown. In this work we demonstrate that purely classical resources can be used to optimize quantum circuits in an approximate but robust manner such that we can bridge the resources that we have from high performance computing and see a direct transition to quantum advantage. We show this through the sparse wave function circuit solvers, which we detail here, and demonstrate a region of efficient classic simulation. With such tools, we can avoid the many problems that plague circuit optimization for circuits with hundreds of qubits using only practical and reasonable classical computing resources. These tools allow us to probe the true benefit of variational optimization approaches on quantum computers, thus opening the window to what can be expected with near term hardware for physical systems. We demonstrate this with a unitary coupled cluster ansatz on various molecules up to 64 qubits with tens of thousands of variational parameters.

The Journal of Chemical PhysicsVol. 162(7)
Ames Research Center (US), Intel (United States) (US)
Openalex Percentile: Top 1%
Quantum Computing Algorithms and Architecture
17.37
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.