Efficient Simulation of Quantum Chemistry Problems in an Enlarged Basis Set

We propose a quantum algorithm to simulate the dynamics in quantum chemistry problems. It is based on adding fresh qubits at each Trotter step, which enables a simpler implementation of the dynamics in the extended system. After each step, the extra qubits are recycled, so that the whole process accurately approximates the correct unitary evolution. A key ingredient of the approach is an isometry that maps a simple diagonal Hamiltonian in the extended system to the original one, and we give a procedure to compute this isometry. We estimate the error at each time step, as well as the number of gates, which scales as <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><a:mi>O</a:mi><a:mo stretchy="false">(</a:mo><a:msup><a:mi>N</a:mi><a:mn>2</a:mn></a:msup><a:mo stretchy="false">)</a:mo></a:math>, where <f:math xmlns:f="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><f:mi>N</f:mi></f:math> is the number of orbitals. We illustrate our results with three examples: the hydrogen chain, small molecules, and the FeMoco (<i:math xmlns:i="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><i:mi>Fe</i:mi></i:math><l:math xmlns:l="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><l:msub><l:mi/><l:mn>7</l:mn></l:msub></l:math><o:math xmlns:o="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><o:mrow><o:mi>Mo</o:mi><o:mi mathvariant="normal">S</o:mi></o:mrow></o:math><s:math xmlns:s="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><s:msub><s:mi/><s:mn>9</s:mn></s:msub></s:math><v:math xmlns:v="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><v:mrow><v:mrow><v:mi mathvariant="normal">C</v:mi></v:mrow></v:mrow></v:math>) molecule. In the hydrogen chain and the hydrogen molecule, we observe that the error scales in the same way as the Trotter error. For FeMoco, we estimate the number of gates in a fault-tolerant setup.

Authors

Institutions

Publication Details

Journal
PRX Quantum
Published
2025-03-20
DOI
https://doi.org/10.1103/prxquantum.6.010355
Citations
3
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
7.44

Funders

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

Efficient Simulation of Quantum Chemistry Problems in an Enlarged Basis Set

J. I. Cirac, Maxine Luo
3 citations
PRX Quantum
Quantum Computing Algorithms and Architecture
7.44
article

Efficient Simulation of Quantum Chemistry Problems in an Enlarged Basis Set

J. I. Cirac, Maxine Luo
article en
3 citations

Abstract

We propose a quantum algorithm to simulate the dynamics in quantum chemistry problems. It is based on adding fresh qubits at each Trotter step, which enables a simpler implementation of the dynamics in the extended system. After each step, the extra qubits are recycled, so that the whole process accurately approximates the correct unitary evolution. A key ingredient of the approach is an isometry that maps a simple diagonal Hamiltonian in the extended system to the original one, and we give a procedure to compute this isometry. We estimate the error at each time step, as well as the number of gates, which scales as <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><a:mi>O</a:mi><a:mo stretchy="false">(</a:mo><a:msup><a:mi>N</a:mi><a:mn>2</a:mn></a:msup><a:mo stretchy="false">)</a:mo></a:math>, where <f:math xmlns:f="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><f:mi>N</f:mi></f:math> is the number of orbitals. We illustrate our results with three examples: the hydrogen chain, small molecules, and the FeMoco (<i:math xmlns:i="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><i:mi>Fe</i:mi></i:math><l:math xmlns:l="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><l:msub><l:mi/><l:mn>7</l:mn></l:msub></l:math><o:math xmlns:o="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><o:mrow><o:mi>Mo</o:mi><o:mi mathvariant="normal">S</o:mi></o:mrow></o:math><s:math xmlns:s="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><s:msub><s:mi/><s:mn>9</s:mn></s:msub></s:math><v:math xmlns:v="http://www.w3.org/1998/Math/MathML" display="inline" overflow="scroll"><v:mrow><v:mrow><v:mi mathvariant="normal">C</v:mi></v:mrow></v:mrow></v:math>) molecule. In the hydrogen chain and the hydrogen molecule, we observe that the error scales in the same way as the Trotter error. For FeMoco, we estimate the number of gates in a fault-tolerant setup.

PRX QuantumVol. 6(1)
Max Planck Institute of Quantum Optics (DE), Munich Center for Quantum Science and Technology (DE)
Bundesministerium für Bildung und Forschung
Openalex Percentile: Top 4%
Quantum Computing Algorithms and Architecture
7.44
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.