Improved Quantum Computation using Operator Backpropagation
- URL: http://arxiv.org/abs/2502.01897v1
- Date: Tue, 04 Feb 2025 00:03:07 GMT
- Title: Improved Quantum Computation using Operator Backpropagation
- Authors: 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,
- Abstract summary: We show a framework that integrates classical simulations with quantum hardware to improve the computation of an observable's expectation value.
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, and the other is a Schr"odinger evolution run on quantum processors.
We demonstrate the effectiveness of this method on a Hamiltonian simulation problem, achieving more accurate expectation value estimates compared to using quantum hardware alone.
- Score: 5.066470263702309
- License:
- 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 problem, achieving more accurate expectation value estimates compared to using quantum hardware alone.
Related papers
- Correcting and extending Trotterized quantum many-body dynamics [0.0]
We develop a hybrid ansatz that combines the strengths of quantum and classical methods.
We show how this hybrid ansatz can avoid SWAP gates in the quantum circuit.
We also show how it can extend the system size while keeping the number of qubits on the quantum device constant.
arXiv Detail & Related papers (2025-02-19T14:50:12Z) - A Quantum-Classical Collaborative Training Architecture Based on Quantum
State Fidelity [50.387179833629254]
We introduce a collaborative classical-quantum architecture called co-TenQu.
Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting.
It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
arXiv Detail & Related papers (2024-02-23T14:09:41Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Anticipative measurements in hybrid quantum-classical computation [68.8204255655161]
We present an approach where the quantum computation is supplemented by a classical result.
Taking advantage of its anticipation also leads to a new type of quantum measurements, which we call anticipative.
In an anticipative quantum measurement the combination of the results from classical and quantum computations happens only in the end.
arXiv Detail & Related papers (2022-09-12T15:47:44Z) - Escaping from the Barren Plateau via Gaussian Initializations in Deep Variational Quantum Circuits [63.83649593474856]
Variational quantum circuits have been widely employed in quantum simulation and quantum machine learning in recent years.
However, quantum circuits with random structures have poor trainability due to the exponentially vanishing gradient with respect to the circuit depth and the qubit number.
This result leads to a general standpoint that deep quantum circuits would not be feasible for practical tasks.
arXiv Detail & Related papers (2022-03-17T15:06:40Z) - Recompilation-enhanced simulation of electron-phonon dynamics on IBM
Quantum computers [62.997667081978825]
We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems.
We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling.
Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
arXiv Detail & Related papers (2022-02-16T19:00:00Z) - Schr\"odinger-Heisenberg Variational Quantum Algorithms [1.9887498823918806]
Recent breakthroughs have opened the possibility to intermediate-scale quantum computing with tens to hundreds of qubits.
The extremely high accuracy needed to surpass classical computers poses a critical demand to the circuit depth.
Here, we propose a paradigm of Schr"odinger-Heisenberg variational quantum algorithms to resolve this problem.
arXiv Detail & Related papers (2021-12-15T04:53:01Z) - Quantum algorithms for quantum dynamics: A performance study on the
spin-boson model [68.8204255655161]
Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator.
variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware.
We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
arXiv Detail & Related papers (2021-08-09T18:00:05Z) - Exploiting dynamic quantum circuits in a quantum algorithm with
superconducting qubits [0.207811670193148]
We build dynamic quantum circuits on a superconducting-based quantum system.
We exploit one of the most fundamental quantum algorithms, quantum phase estimation, in its adaptive version.
We demonstrate that the version of real-time quantum computing with dynamic circuits can offer a substantial and tangible advantage.
arXiv Detail & Related papers (2021-02-02T18:51:23Z) - Faster Schr\"odinger-style simulation of quantum circuits [2.0940228639403156]
Recent demonstrations of superconducting quantum computers by Google and IBM fueled new research in quantum algorithms.
We advance Schr"odinger-style simulation of quantum circuits that is useful standalone and as a building block in layered simulation algorithms.
arXiv Detail & Related papers (2020-08-01T08:47:24Z) - Bit-Slicing the Hilbert Space: Scaling Up Accurate Quantum Circuit
Simulation to a New Level [10.765480856320018]
We enhance quantum circuit simulation in two dimensions: accuracy and scalability.
Experimental results demonstrate that our method can be superior to the state-of-the-art for various quantum circuits.
arXiv Detail & Related papers (2020-07-18T01:26:40Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.