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 paper introduces a hybrid quantum-classical framework that reduces quantum circuit depth by partitioning circuits and using classical backpropagation, leading to more accurate observable estimates in quantum simulations.
Contribution
It presents a novel operator backpropagation method that combines classical and quantum computations to improve quantum simulation accuracy.
Findings
Reduced quantum circuit depth achieved
More accurate expectation value estimates
Effective on Hamiltonian simulation problems
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\"odinger 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture
