Consistent initial states with constant circuit depth for quantum computational chemistry

Variational quantum eigensolvers have been extensively studied, yet there are still no methods that offer black-box applicability with consistent performance. Separable pair approximations promise to be candidates for such methods: they compile to shallow constant-depth quantum circuits with linear gate count and parameter dependence and circumvent most bottlenecks of variational quantum algorithms through their classical simulability. At the same time, they seamlessly integrate into prominent more general circuit designs and subspace strategies. So far, their capability as a consistent method has only been indicated and demonstrations have been restricted to manually designed model systems. In this work, we extensively evaluate the consistency of SPA states for hydrogen chains, alkanes, and small molecules within an orbital-optimized VQE framework. Our benchmarks demonstrate consistent approximations with classical complexity comparable to Hartree-Fock. While SPA can serve as a useful low-cost standalone approximation, its restriction to the seniority-zero subspace makes it best suited as a scalable, chemically consistent initial state for more expressive correlation treatments when high quantitative accuracy is required. Our open-source implementation within the tequila framework allows convenient use of the algorithms as a standalone method or as a subpart of more extensive procedures.

Authors

Institutions

Publication Details

Journal
RSC Advances
Published
2026-11-17
DOI
https://doi.org/10.1039/d6ra08073a
Citations
1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
1.06

Funders

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

Consistent initial states with constant circuit depth for quantum computational chemistry

Jakob S. Kottmann, Lily Barta
1 citations
RSC Advances
Quantum Computing Algorithms and Architecture
1.06
article

Consistent initial states with constant circuit depth for quantum computational chemistry

Jakob S. Kottmann, Lily Barta
article en
1 citations

Abstract

Variational quantum eigensolvers have been extensively studied, yet there are still no methods that offer black-box applicability with consistent performance. Separable pair approximations promise to be candidates for such methods: they compile to shallow constant-depth quantum circuits with linear gate count and parameter dependence and circumvent most bottlenecks of variational quantum algorithms through their classical simulability. At the same time, they seamlessly integrate into prominent more general circuit designs and subspace strategies. So far, their capability as a consistent method has only been indicated and demonstrations have been restricted to manually designed model systems. In this work, we extensively evaluate the consistency of SPA states for hydrogen chains, alkanes, and small molecules within an orbital-optimized VQE framework. Our benchmarks demonstrate consistent approximations with classical complexity comparable to Hartree-Fock. While SPA can serve as a useful low-cost standalone approximation, its restriction to the seniority-zero subspace makes it best suited as a scalable, chemically consistent initial state for more expressive correlation treatments when high quantitative accuracy is required. Our open-source implementation within the tequila framework allows convenient use of the algorithms as a standalone method or as a subpart of more extensive procedures.

RSC Advances
University of Augsburg (DE)
Deutsche Forschungsgemeinschaft, Bundesministerium für Bildung und Forschung
Openalex Percentile: Top 22%
Quantum Computing Algorithms and Architecture
1.06
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.

Laika access coming soon