A quantum computing concept for 1-D elastic wave simulation with exponential speedup
arXiv:2312.14747 · doi:10.1093/gji/ggae160
Abstract
Quantum computing has attracted considerable attention in recent years because it promises speed-ups that conventional supercomputers cannot offer, at least for some applications. Though existing quantum computers are, in most cases, still too small to solve significant problems, their future impact on domain sciences is already being explored now. Within this context, we present a quantum computing concept for 1-D elastic wave propagation in heterogeneous media with two components: a theoretical formulation and an implementation on a real quantum computer. The method rests on a finite-difference approximation, followed by a sparsity-preserving transformation of the discrete elastic wave equation to a Schrödinger equation, which can be simulated directly on a gate-based quantum computer. An implementation on an error-free quantum simulator verifies our approach and forms the basis of numerical experiments with small problems on the real quantum computer IBM Brisbane. The latter produce simulation results that qualitatively agree with the error-free version but are contaminated by quantum decoherence and noise effects. Complementing the discrete transformation to the Schrödinger equation by a continuous version allows the replacement of finite differences by other spatial discretisation schemes, such as the spectral-element method. Anticipating the emergence of error-corrected quantum chips, an analogy between our method and analyses of coupled mass-spring systems suggests that our quantum computing approach may lead to wave field simulations that run exponentially faster than simulations on classical computers.
16 pages, 4 figures
References in corpus (47)
- Quantum Computing in the NISQ era and beyond
- Quantum Machine Learning
- Quantum algorithm for solving linear systems of equations
- Variational Quantum Algorithms
- Quantum Simulation
- Barren plateaus in quantum neural network training landscapes
- Adiabatic Quantum Computing
- Quantum Computing with Very Noisy Devices
- Quantum algorithms: an overview
- Hamiltonian Simulation by Qubitization
- Topological Boundary Modes in Isostatic Lattices
- A quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
- Simulating Hamiltonian dynamics with a truncated Taylor series
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Toward the first quantum simulation with quantum speedup
- Quantum advantage in learning from experiments
- A rigorous and robust quantum speed-up in supervised machine learning
- Quantum Data Fitting
- High-threshold and low-overhead fault-tolerant quantum memory
- Real-time quantum error correction beyond break-even
- Classification of topological phonons in linear mechanical metamaterials
- Prediction by linear regression on a quantum computer
- Maximum Likelihood, Minimum Effort
- Finding Exponential Product Formulas of Higher Orders
- Demonstration of a scaling advantage for a quantum annealer over simulated annealing
- How Powerful is Adiabatic Quantum Computation?
- Quantum Algorithm for Simulating the Wave Equation
- Quantum Algorithm Implementations for Beginners
- Closing the "Quantum Supremacy" Gap: Achieving Real-Time Simulation of a Random Quantum Circuit Using a New Sunway Supercomputer
- A Comparison of Various Classical Optimizers for a Variational Quantum Linear Solver
- Quantum Machine Learning: from physics to software engineering
- The Boundary for Quantum Advantage in Gaussian Boson Sampling
- Quantum simulation of partial differential equations via Schrodingerisation: technical details
- Exponential quantum speedup in simulating coupled classical oscillators
- Practical Quantum Computing: solving the wave equation using a quantum approach
- Towards quantum advantage via topological data analysis
- Variational quantum eigensolvers for sparse Hamiltonians
- Realization of quantum signal processing on a noisy quantum computer
- A Framework for Demonstrating Practical Quantum Advantage: Racing Quantum against Classical Generative Models
- Quantum advantage for computations with limited space
- An Application of Quantum Annealing Computing to Seismic Inversion
- Forecasting timelines of quantum computing
- Stability of the Trotter-Suzuki decomposition
- A game of quantum advantage: linking verification and simulation
- Why adiabatic quantum annealing is unlikely to yield speed-up
- Seamless GPU acceleration for C++ based physics with the Metal Shading Language on Apple's M series unified chips
- Quantum simulation of Maxwell's equations via Schrödingersation