Realization of quantum signal processing on a noisy quantum computer
- URL: http://arxiv.org/abs/2303.05533v3
- Date: Wed, 27 Sep 2023 13:30:55 GMT
- Title: Realization of quantum signal processing on a noisy quantum computer
- Authors: Yuta Kikuchi, Conor Mc Keever, Luuk Coopmans, Michael Lubasch,
Marcello Benedetti
- Abstract summary: We propose a strategy to run an entire QSP protocol on noisy quantum hardware by carefully reducing overhead costs at each step.
We test the protocol by running the algorithm on the Quantinuum H1-1 trapped-ion quantum computer powered by Honeywell.
Our results are the first step in the experimental realization of QSP-based quantum algorithms.
- Score: 0.4593579891394288
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum signal processing (QSP) is a powerful toolbox for the design of
quantum algorithms and can lead to asymptotically optimal computational costs.
Its realization on noisy quantum computers without fault tolerance, however, is
challenging because it requires a deep quantum circuit in general. We propose a
strategy to run an entire QSP protocol on noisy quantum hardware by carefully
reducing overhead costs at each step. To illustrate the approach, we consider
the application of Hamiltonian simulation for which QSP implements a polynomial
approximation of the time evolution operator. We test the protocol by running
the algorithm on the Quantinuum H1-1 trapped-ion quantum computer powered by
Honeywell. In particular, we compute the time dependence of bipartite
entanglement entropies for Ising spin chains and find good agreements with
exact numerical simulations. To make the best use of the device, we determine
optimal experimental parameters by using a simplified error model for the
hardware and numerically studying the trade-off between Hamiltonian simulation
time, polynomial degree, and total accuracy. Our results are the first step in
the experimental realization of QSP-based quantum algorithms.
Related papers
- Parallel Quantum Computing Simulations via Quantum Accelerator Platform Virtualization [44.99833362998488]
We present a model for parallelizing simulation of quantum circuit executions.
The model can take advantage of its backend-agnostic features, enabling parallel quantum circuit execution over any target backend.
arXiv Detail & Related papers (2024-06-05T17:16:07Z) - Resource Bounds for Quantum Circuit Mapping via Quantum Circuit
Complexity [1.0879875537360844]
We show that a minimal SWAP gate count for executing a quantum circuit on a device emerges via the minimization of the distance between quantum states.
This work constitutes the first use of quantum circuit uncomplexity to practically-relevant quantum computing.
arXiv Detail & Related papers (2024-02-01T10:32:05Z) - 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) - Quantum Simulation of Dissipative Energy Transfer via Noisy Quantum
Computer [0.40964539027092917]
We propose a practical approach to simulate the dynamics of an open quantum system on a noisy computer.
Our method leverages gate noises on the IBM-Q real device, enabling us to perform calculations using only two qubits.
In the last, to deal with the increasing depth of quantum circuits when doing Trotter expansion, we introduced the transfer tensor method(TTM) to extend our short-term dynamics simulation.
arXiv Detail & Related papers (2023-12-03T13:56:41Z) - Hamiltonian Encoding for Quantum Approximate Time Evolution of Kinetic
Energy Operator [2.184775414778289]
The time evolution operator plays a crucial role in the precise computation of chemical experiments on quantum computers.
We have proposed a new encoding method, namely quantum approximate time evolution (QATE) for the quantum implementation of the kinetic energy operator.
arXiv Detail & Related papers (2023-10-05T05:25:38Z) - An Introduction to Quantum Machine Learning for Engineers [36.18344598412261]
Quantum machine learning is emerging as a dominant paradigm to program gate-based quantum computers.
This book provides a self-contained introduction to quantum machine learning for an audience of engineers with a background in probability and linear algebra.
arXiv Detail & Related papers (2022-05-11T12:10:52Z) - Variational Quantum Pulse Learning [28.040754288931897]
We propose variational quantum pulses (VQP), a novel paradigm to directly train quantum pulses for learning tasks.
VQP manipulates variational quantum pulses by pulling and pushing the amplitudes of pulses in an optimization framework.
Our framework to train pulses maintains the robustness to noise on Noisy Intermediate-Scale Quantum (NISQ) computers.
arXiv Detail & Related papers (2022-03-31T17:58:13Z) - 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) - The Variational Quantum Eigensolver: a review of methods and best
practices [3.628860803653535]
The variational quantum eigensolver (or VQE) uses the variational principle to compute the ground state energy of a Hamiltonian.
This review aims to provide an overview of the progress that has been made on the different parts of the algorithm.
arXiv Detail & Related papers (2021-11-09T14:40:18Z) - The Cost of Improving the Precision of the Variational Quantum
Eigensolver for Quantum Chemistry [0.0]
We study how various types of errors affect the variational quantum eigensolver (VQE)
We find that the optimal way of running the hybrid classical-quantum optimization is to allow some noise in intermediate energy evaluations.
arXiv Detail & Related papers (2021-11-09T06:24:52Z) - An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian
Simulation [55.41644538483948]
Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates.
We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions.
The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
arXiv Detail & Related papers (2021-08-06T19:38:03Z)
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.