Improved quantum computation using operator backpropagation

Decoherence of quantum hardware is currently limiting its practical applications. At the same time, classical algorithms for simulating quantum circuits have progressed substantially. Here, we demonstrate a hybrid framework that integrates classical simulations with quantum hardware to improve the computation of an observable’s expectation value by reducing the quantum circuit depth. In this framework, a quantum circuit is partitioned into two subcircuits: one that describes the backpropagated Heisenberg evolution of an observable, executed on a classical computer, while the other is a Schrödinger evolution run on quantum processors. The overall effect is to reduce the depths of the circuits executed on quantum devices and enable the recovery of expectation values at intermediate times throughout the classically backpropagated circuit, trading this with classical overhead and an increased number of circuit executions. We demonstrate the effectiveness of this method on a Hamiltonian simulation problem, achieving more accurate expectation value estimates compared to using quantum hardware alone.

Authors

Institutions

Publication Details

Journal
npj Quantum Information
Published
2026-02-19
DOI
https://doi.org/10.1038/s41534-026-01196-0
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00

Funders

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

Improved quantum computation using operator backpropagation

Danylo Lykov, Caleb Johnson, Abhinav Kandala, Minh C. Tran et al.
npj Quantum Information
Quantum Computing Algorithms and Architecture
article

Improved quantum computation using operator backpropagation

Danylo Lykov, Caleb Johnson, Abhinav Kandala, Minh C. Tran, Ken Xuan Wei, DinhDuy Vu, Antonio Mezzacapo, Andre He, Bryce Fuller, Max Rossmannek, Yuri Alexeev, Youngseok Kim, Kunal Sharma
article en

Abstract

Decoherence of quantum hardware is currently limiting its practical applications. At the same time, classical algorithms for simulating quantum circuits have progressed substantially. Here, we demonstrate a hybrid framework that integrates classical simulations with quantum hardware to improve the computation of an observable’s expectation value by reducing the quantum circuit depth. In this framework, a quantum circuit is partitioned into two subcircuits: one that describes the backpropagated Heisenberg evolution of an observable, executed on a classical computer, while the other is a Schrödinger evolution run on quantum processors. The overall effect is to reduce the depths of the circuits executed on quantum devices and enable the recovery of expectation values at intermediate times throughout the classically backpropagated circuit, trading this with classical overhead and an increased number of circuit executions. We demonstrate the effectiveness of this method on a Hamiltonian simulation problem, achieving more accurate expectation value estimates compared to using quantum hardware alone.

npj Quantum InformationVol. 12(1)
Argonne National Laboratory (US), IBM (United States) (US), Harvard University (US), IBM Research - Zurich (CH), Nvidia (United States) (US)
U.S. Department of Energy, Office of Science, Argonne National Laboratory
Openalex Percentile: Top 53%
Quantum Computing Algorithms and Architecture
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.