Understanding and mitigating noise in molecular quantum linear response for spectroscopic properties on quantum computers

The promise of quantum computing to circumvent the exponential scaling of quantum chemistry has sparked a race to develop chemistry algorithms for quantum architecture. However, most works neglect the quantum-inherent shot noise, let alone the effect of current noisy devices. Here, we present a comprehensive study of quantum linear response (qLR) theory obtaining spectroscopic properties on simulated fault-tolerant quantum computers and present-day near-term quantum hardware. This work introduces novel metrics to analyze and predict the origins of noise in the quantum algorithm, proposes an Ansatz-based error mitigation technique, and reveals the significant impact of Pauli saving in reducing measurement costs and noise in subspace methods. Our hardware results using up to cc-pVTZ basis set serve as proof of principle for obtaining absorption spectra on quantum hardware in a general approach with the accuracy of classical multi-configurational methods. Importantly, our results exemplify that substantial improvements in hardware error rates and measurement speed are necessary to lift quantum computational chemistry from proof of concept to an actual impact in the field.

Authors

Institutions

Publication Details

Journal
Chemical Science
Published
2025-01-01
DOI
https://doi.org/10.1039/d4sc05839a
Citations
6
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
14.89

Funders

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

Understanding and mitigating noise in molecular quantum linear response for spectroscopic properties on quantum computers

Erik Rosendahl Kjellgren, Karl Michael Ziems, Sonia Coriani, Stephan P. A. Sauer et al.
6 citations
Chemical Science
Quantum Computing Algorithms and Architecture
14.89
article

Understanding and mitigating noise in molecular quantum linear response for spectroscopic properties on quantum computers

Erik Rosendahl Kjellgren, Karl Michael Ziems, Sonia Coriani, Stephan P. A. Sauer, Jacob Kongsted
article en
6 citations

Abstract

The promise of quantum computing to circumvent the exponential scaling of quantum chemistry has sparked a race to develop chemistry algorithms for quantum architecture. However, most works neglect the quantum-inherent shot noise, let alone the effect of current noisy devices. Here, we present a comprehensive study of quantum linear response (qLR) theory obtaining spectroscopic properties on simulated fault-tolerant quantum computers and present-day near-term quantum hardware. This work introduces novel metrics to analyze and predict the origins of noise in the quantum algorithm, proposes an Ansatz-based error mitigation technique, and reveals the significant impact of Pauli saving in reducing measurement costs and noise in subspace methods. Our hardware results using up to cc-pVTZ basis set serve as proof of principle for obtaining absorption spectra on quantum hardware in a general approach with the accuracy of classical multi-configurational methods. Importantly, our results exemplify that substantial improvements in hardware error rates and measurement speed are necessary to lift quantum computational chemistry from proof of concept to an actual impact in the field.

Chemical ScienceVol. 16(10)
University of Copenhagen (DK), University of Southern Denmark (DK), University of Southampton (GB), Technical University of Denmark (DK)
Novo Nordisk, Novo Nordisk Fonden
Openalex Percentile: Top 2%
Quantum Computing Algorithms and Architecture
14.89
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.