Chemistry beyond the scale of exact diagonalization on a quantum-centric supercomputer

A universal quantum computer can simulate diverse quantum systems, with electronic structure for chemistry offering challenging problems for practical use cases around the hundred-qubit mark. Although current quantum processors have reached this size, deep circuits and a large number of measurements lead to prohibitive runtimes for quantum computers in isolation. Here, we demonstrate the use of classical distributed computing to offload all but an intrinsically quantum component of a workflow for electronic structure simulations. Using a Heron superconducting processor and the supercomputer Fugaku, we simulate the ground-state dissociation of N<sub>2</sub> and the ground state properties of [2Fe-2S] and [4Fe-4S] clusters, with circuits up to 77 qubits and 10,570 gates. The proposed algorithm processes quantum samples to produce upper bounds for the ground-state energy and sparse approximations to the ground-state wave functions. Our results suggest that, for current error rates, a quantum-centric supercomputing architecture can tackle challenging chemistry problems beyond sizes amenable to exact diagonalization.

Authors

Institutions

Publication Details

Journal
Science Advances
Published
2025-06-18
DOI
https://doi.org/10.1126/sciadv.adu9991
Citations
59
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
146.38
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Chemistry beyond the scale of exact diagonalization on a quantum-centric supercomputer

Mário Motta, Sandeep Sharma, Petar Jurcevic, Maika Takita et al.
59 citations
Science Advances
Quantum Computing Algorithms and Architecture
146.38
article

Chemistry beyond the scale of exact diagonalization on a quantum-centric supercomputer

Mário Motta, Sandeep Sharma, Petar Jurcevic, Maika Takita, Ali Javadi-Abhari, Seiji Yunoki, Minh C. Tran, Rong-Yang Sun, Antonio Mezzacapo, Iskandar Sitdikov, William Kirby, Javier Robledo Moreno, Tomonori Shirakawa, Kunal Sharma, Simon Martiel, Kevin J. Sung, Holger Haas
article en
59 citations

Abstract

A universal quantum computer can simulate diverse quantum systems, with electronic structure for chemistry offering challenging problems for practical use cases around the hundred-qubit mark. Although current quantum processors have reached this size, deep circuits and a large number of measurements lead to prohibitive runtimes for quantum computers in isolation. Here, we demonstrate the use of classical distributed computing to offload all but an intrinsically quantum component of a workflow for electronic structure simulations. Using a Heron superconducting processor and the supercomputer Fugaku, we simulate the ground-state dissociation of N<sub>2</sub> and the ground state properties of [2Fe-2S] and [4Fe-4S] clusters, with circuits up to 77 qubits and 10,570 gates. The proposed algorithm processes quantum samples to produce upper bounds for the ground-state energy and sparse approximations to the ground-state wave functions. Our results suggest that, for current error rates, a quantum-centric supercomputing architecture can tackle challenging chemistry problems beyond sizes amenable to exact diagonalization.

Science AdvancesVol. 11(25)
IBM (United States) (US), University of Colorado Boulder (US), Cambridge Scientific (United States) (US), RIKEN (JP), IBM (France) (FR), RIKEN Center for Computational Science (JP), RIKEN Center for Emergent Matter Science (JP), RIKEN Center for Quantum Computing
Affordable and clean energy
Openalex Percentile: Top 0%
Quantum Computing Algorithms and Architecture
146.38
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.