Noisy intermediate-scale quantum simulation of the one-dimensional wave
equation
- URL: http://arxiv.org/abs/2402.19247v1
- Date: Thu, 29 Feb 2024 15:21:41 GMT
- Title: Noisy intermediate-scale quantum simulation of the one-dimensional wave
equation
- Authors: Lewis Wright, Conor Mc Keever, Jeremy T. First, Rory Johnston, Jeremy
Tillay, Skylar Chaney, Matthias Rosenkranz, Michael Lubasch
- Abstract summary: We design and implement quantum circuits for the simulation of the one-dimensional wave equation on the Quantinuum H1-1 quantum computer.
Our approach to simulating the wave equation can readily be adapted to other quantum processors and serve as an application-oriented benchmark.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: We design and implement quantum circuits for the simulation of the
one-dimensional wave equation on the Quantinuum H1-1 quantum computer. The
circuit depth of our approach scales as $O(n^{2})$ for $n$ qubits representing
the solution on $2^n$ grid points, and leads to infidelities of $O(2^{-4n}
t^{2})$ for simulation time $t$ assuming smooth initial conditions. By varying
the qubit count we study the interplay between the algorithmic and physical
gate errors to identify the optimal working point of minimum total error. Our
approach to simulating the wave equation can readily be adapted to other
quantum processors and serve as an application-oriented benchmark.
Related papers
- Towards large-scale quantum optimization solvers with few qubits [59.63282173947468]
We introduce a variational quantum solver for optimizations over $m=mathcalO(nk)$ binary variables using only $n$ qubits, with tunable $k>1$.
We analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature.
arXiv Detail & Related papers (2024-01-17T18:59:38Z) - Realization of quantum signal processing on a noisy quantum computer [0.4593579891394288]
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.
arXiv Detail & Related papers (2023-03-09T19:00:17Z) - Approximate Quantum Compiling for Quantum Simulation: A Tensor Network based approach [1.237454174824584]
We introduce AQCtensor, a novel algorithm to produce short-depth quantum circuits from Matrix Product States (MPS)
Our approach is specifically tailored to the preparation of quantum states generated from the time evolution of quantum many-body Hamiltonians.
For simulation problems on 100 qubits, we show that AQCtensor achieves at least an order of magnitude reduction in the depth of the resulting optimized circuit.
arXiv Detail & Related papers (2023-01-20T14:40:29Z) - Phenomenological Theory of Variational Quantum Ground-State Preparation [0.0]
The variational quantum eigensolver (VQE) algorithm aims to prepare the ground state of a Hamiltonian exploiting parametrized quantum circuits.
We show that the algorithm's success crucially depends on other parameters such as the learning rate.
We propose a symmetry-enhanced simulation protocol that should be used if the gap closes.
arXiv Detail & Related papers (2022-05-12T18:00:04Z) - Quantum State Preparation with Optimal Circuit Depth: Implementations
and Applications [10.436969366019015]
We show that any $Theta(n)$-depth circuit can be prepared with a $Theta(log(nd)) with $O(ndlog d)$ ancillary qubits.
We discuss applications of the results in different quantum computing tasks, such as Hamiltonian simulation, solving linear systems of equations, and realizing quantum random access memories.
arXiv Detail & Related papers (2022-01-27T13:16:30Z) - Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems.
By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
arXiv Detail & Related papers (2021-08-03T17:49:09Z) - Fixed Depth Hamiltonian Simulation via Cartan Decomposition [59.20417091220753]
We present a constructive algorithm for generating quantum circuits with time-independent depth.
We highlight our algorithm for special classes of models, including Anderson localization in one dimensional transverse field XY model.
In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
arXiv Detail & Related papers (2021-04-01T19:06:00Z) - Low-depth Hamiltonian Simulation by Adaptive Product Formula [3.050399782773013]
Various Hamiltonian simulation algorithms have been proposed to efficiently study the dynamics of quantum systems on a quantum computer.
Here, we propose an adaptive approach to construct a low-depth time evolution circuit.
Our work sheds light on practical Hamiltonian simulation with noisy-intermediate-scale-quantum devices.
arXiv Detail & Related papers (2020-11-10T18:00:42Z) - Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
We study two different methods to prepare excited states on a quantum computer.
We benchmark these techniques on emulated and real quantum devices.
These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
arXiv Detail & Related papers (2020-09-28T17:21:25Z) - Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware.
On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
arXiv Detail & Related papers (2020-04-15T05:16:24Z) - Quantum Algorithms for Simulating the Lattice Schwinger Model [63.18141027763459]
We give scalable, explicit digital quantum algorithms to simulate the lattice Schwinger model in both NISQ and fault-tolerant settings.
In lattice units, we find a Schwinger model on $N/2$ physical sites with coupling constant $x-1/2$ and electric field cutoff $x-1/2Lambda$.
We estimate observables which we cost in both the NISQ and fault-tolerant settings by assuming a simple target observable---the mean pair density.
arXiv Detail & Related papers (2020-02-25T19:18:36Z)
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.