A qubit-efficient variational selected configuration-interaction method

Abstract Finding the ground-state energy of molecules is an important and challenging computational problem for which quantum computing can potentially find efficient solutions. The variational quantum eigensolver (VQE) is a quantum algorithm that tackles the molecular groundstate problem and is regarded as one of the flagships of quantum computing. Yet, to date, only very small molecules were computed via VQE, due to high noise levels in current quantum devices. Here we present an alternative variational quantum scheme that requires significantly less qubits than VQE. The reduction in the qubit number allows for shallower circuits to be sufficient, rendering the method more resistant to noise. The proposed algorithm, termed variational quantum selected-configuration-interaction (VQ-SCI), is based on: (a) representing the target groundstate as a superposition of Slater determinant configurations, encoded directly upon the quantum computational basis states; and (b) selecting a-priory only the most dominant configurations. This is demonstrated through a set of groundstate calculations of the H 2 , LiH, BeH 2 , H 2 O, NH 3 and C 2 H 4 molecules in the sto-3g basis set, performed on IBM quantum devices. We show that the VQ-SCI reaches the full configuration interaction energy within chemical accuracy using the lowest number of qubits reported to date. Moreover, when the SCI matrix is generated ‘on the fly’, the VQ-SCI requires exponentially less memory than classical SCI methods. This offers a potential remedy to a severe memory bottleneck problem in classical SCI calculations. Finally, the proposed scheme is general and can be straightforwardly applied for finding the groundstate of any Hermitian matrix, outside the chemical context.

Authors

Institutions

Publication Details

Journal
Quantum Science and Technology
Published
2024-09-19
DOI
https://doi.org/10.1088/2058-9565/ad7d32
Citations
4
Primary Topic
Graph Theory and Algorithms
Type
article
Field-Weighted Citation Impact
0.75
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A qubit-efficient variational selected configuration-interaction method

Amir Natan, Daniel Yoffe, Adi Makmal, Noga Entin
4 citations
Quantum Science and Technology
Graph Theory and Algorithms
0.75
article

A qubit-efficient variational selected configuration-interaction method

Amir Natan, Daniel Yoffe, Adi Makmal, Noga Entin
article en
4 citations

Abstract

Abstract Finding the ground-state energy of molecules is an important and challenging computational problem for which quantum computing can potentially find efficient solutions. The variational quantum eigensolver (VQE) is a quantum algorithm that tackles the molecular groundstate problem and is regarded as one of the flagships of quantum computing. Yet, to date, only very small molecules were computed via VQE, due to high noise levels in current quantum devices. Here we present an alternative variational quantum scheme that requires significantly less qubits than VQE. The reduction in the qubit number allows for shallower circuits to be sufficient, rendering the method more resistant to noise. The proposed algorithm, termed variational quantum selected-configuration-interaction (VQ-SCI), is based on: (a) representing the target groundstate as a superposition of Slater determinant configurations, encoded directly upon the quantum computational basis states; and (b) selecting a-priory only the most dominant configurations. This is demonstrated through a set of groundstate calculations of the H 2 , LiH, BeH 2 , H 2 O, NH 3 and C 2 H 4 molecules in the sto-3g basis set, performed on IBM quantum devices. We show that the VQ-SCI reaches the full configuration interaction energy within chemical accuracy using the lowest number of qubits reported to date. Moreover, when the SCI matrix is generated ‘on the fly’, the VQ-SCI requires exponentially less memory than classical SCI methods. This offers a potential remedy to a severe memory bottleneck problem in classical SCI calculations. Finally, the proposed scheme is general and can be straightforwardly applied for finding the groundstate of any Hermitian matrix, outside the chemical context.

Quantum Science and TechnologyVol. 10(1)
Bar-Ilan University (IL), Tel Aviv University (IL)
Openalex Percentile: Top 28%
Graph Theory and Algorithms
0.75
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.