Clifford circuit initialization for variational quantum algorithms

We present an initialization method for variational quantum algorithms applicable to intermediate-scale quantum computers. The method explores the efficiently classically simulable Clifford points of a parameterized quantum circuit, using simulated annealing to find a low-energy initial state. We provide numerical evidence of the effectiveness of the technique for different choices of the Hamiltonian structure, number of qubits, and circuit depth. While a number of problems are considered, we note that the method is particularly useful for quantum chemistry problems, for which it is able to capture long-range correlation energy. The presented method could help achieve a quantum advantage in noisy or fault-tolerant intermediate-scale devices by preparing a high-quality initial state.

Authors

Institutions

Publication Details

Journal
Physical review. A/Physical review, A
Published
2025-06-09
DOI
https://doi.org/10.1103/physreva.111.062413
Citations
5
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
12.40

Funders

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

Clifford circuit initialization for variational quantum algorithms

M. S. Kim, C. N. Self, M. H. Cheng, Kiran E. Khosla et al.
5 citations
Physical review. A/Physical review, A
Quantum Computing Algorithms and Architecture
12.40
article

Clifford circuit initialization for variational quantum algorithms

M. S. Kim, C. N. Self, M. H. Cheng, Kiran E. Khosla, B. X. Li, A. C. Medina, Lin Meng
article en
5 citations

Abstract

We present an initialization method for variational quantum algorithms applicable to intermediate-scale quantum computers. The method explores the efficiently classically simulable Clifford points of a parameterized quantum circuit, using simulated annealing to find a low-energy initial state. We provide numerical evidence of the effectiveness of the technique for different choices of the Hamiltonian structure, number of qubits, and circuit depth. While a number of problems are considered, we note that the method is particularly useful for quantum chemistry problems, for which it is able to capture long-range correlation energy. The presented method could help achieve a quantum advantage in noisy or fault-tolerant intermediate-scale devices by preparing a high-quality initial state.

Physical review. A/Physical review, AVol. 111(6)
Fraunhofer Institute for Industrial Mathematics (DE), Fraunhofer Institute for Industrial Engineering (DE), Imperial College London (GB)
Korea Institute of Science and Technology, Samsung, Engineering and Physical Sciences Research Council
Openalex Percentile: Top 2%
Quantum Computing Algorithms and Architecture
12.40
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.

Clifford circuit initialization for variational quantum algorithms — M. S. Kim, C. N. Self, et al. · Physical review. A/Physical review, A (2025) | TGRS Research Map | TGRS