Improved Quantum Computation using Operator Backpropagation

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Fuller, Bryce, Tran, Minh C., Lykov, Danylo, Johnson, Caleb, Rossmannek, Max, Wei, Ken Xuan, He, Andre, Kim, Youngseok, Vu, DinhDuy, Sharma, Kunal, Alexeev, Yuri, Kandala, Abhinav, Mezzacapo, Antonio
Format: Preprint
Publié: 2025
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866916595654197248
author Fuller, Bryce
Tran, Minh C.
Lykov, Danylo
Johnson, Caleb
Rossmannek, Max
Wei, Ken Xuan
He, Andre
Kim, Youngseok
Vu, DinhDuy
Sharma, Kunal
Alexeev, Yuri
Kandala, Abhinav
Mezzacapo, Antonio
author_facet Fuller, Bryce
Tran, Minh C.
Lykov, Danylo
Johnson, Caleb
Rossmannek, Max
Wei, Ken Xuan
He, Andre
Kim, Youngseok
Vu, DinhDuy
Sharma, Kunal
Alexeev, Yuri
Kandala, Abhinav
Mezzacapo, Antonio
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2502_01897
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Improved Quantum Computation using Operator Backpropagation
Fuller, Bryce
Tran, Minh C.
Lykov, Danylo
Johnson, Caleb
Rossmannek, Max
Wei, Ken Xuan
He, Andre
Kim, Youngseok
Vu, DinhDuy
Sharma, Kunal
Alexeev, Yuri
Kandala, Abhinav
Mezzacapo, Antonio
Quantum Physics
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.
title Improved Quantum Computation using Operator Backpropagation
topic Quantum Physics
url https://arxiv.org/abs/2502.01897