Improved Quantum Computation using Operator Backpropagation
Bryce Fuller, Minh C. Tran, Danylo Lykov, Caleb Johnson, Max Rossmannek, Ken Xuan Wei, Andre He, Youngseok Kim, DinhDuy Vu, Kunal Sharma, Yuri Alexeev, Abhinav Kandala, Antonio Mezzacapo
TL;DR
This work tackles the limitation of decoherence in near-term quantum hardware by introducing Operator Backpropagation (OBP), a hybrid quantum-classical approach that splits a quantum circuit into a classical Heisenberg-backpropagated observable and a quantum Schrödinger-evolved subcircuit. The backpropagated operator $O' = U_C^ abla O U_C$ is decomposed into Pauli strings and measured via the shallower quantum circuit, trading quantum-depth for classical computation and additional circuit executions. The CPT-based OBP method includes truncation budgets across slices, with error bounds derived from both $L_1$ and $L_2$ norms and per-slice budgeting, and can be parallelized using ZX-calculus addressing for distributed Pauli-term deduplication. Experiments on 75- and 127-qubit XY models validate OBP's ability to reduce error in Hamiltonian-time dynamics versus purely quantum runs, illustrating potential for deeper, more accurate simulations on noisy devices and offering a path to extending near-term quantum capabilities. Overall, OBP provides a practical route to higher-precision quantum simulations by balancing depth reduction against classical overhead and measurement commerce, with broad implications for quantum chemistry and condensed-matter physics simulations.
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, 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.
