An Application of Quantum Annealing Computing to Seismic Inversion

Abstract

Quantum computing, along with quantum metrology and quantum communication, are disruptive technologies that promise, in the near future, to impact different sectors of academic research and industry. Among the computational challenges with great interest in science and industry are the inversion problems. These kinds of numerical procedures can be described as the process of determining the cause of an event from measurements of its effects. In this paper, we apply a recursive quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. We compare the obtained results from the quantum computer to those derived from a classical algorithm. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.

References in corpus (44)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum algorithm for solving linear systems of equations
• Ising formulations of many NP problems
• Quantum computational advantage using photons
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Adiabatic Quantum Computing
• Superconducting Qubits: Current State of Play
• Trapped-Ion Quantum Computing: Progress and Challenges
• Strong quantum computational advantage using a superconducting quantum processor
• Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
• Defining and detecting quantum speedup
• Experimental Comparison of Two Quantum Computing Architectures
• Architectural considerations in the design of a superconducting quantum annealing processor
• Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
• Preconditioned quantum linear system algorithm
• What is the Computational Value of Finite Range Tunneling?
• A practical heuristic for finding graph minors
• Reverse Quantum Annealing Approach to Portfolio Optimization Problems
• A quantum linear system algorithm for dense matrices
• Demonstration of a scaling advantage for a quantum annealer over simulated annealing
• Expanding the horizon of automated metamaterials discovery via quantum annealing
• Realizable Hamiltonians for Universal Adiabatic Quantum Computers
• Quantum algorithms for systems of linear equations inspired by adiabatic quantum computing
• Quantum annealing versus classical machine learning applied to a simplified computational biology problem
• Probing for quantum speedup in spin glass problems with planted solutions
• Performing Quantum Computing Experiments in the Cloud
• Strengths and weaknesses of weak-strong cluster problems: A detailed overview of state-of-the-art classical heuristics vs quantum approaches
• Improving solutions by embedding larger subproblems in a D-Wave quantum annealer
• Seeking Quantum Speedup Through Spin Glasses: The Good, the Bad, and the Ugly
• Dynamics of reverse annealing for the fully-connected $p$-spin model
• Efficiency of quantum versus classical annealing in non-convex learning problems
• Pegasus: The second connectivity graph for large-scale quantum annealing hardware
• Variable time amplitude amplification and a faster quantum algorithm for solving systems of linear equations
• Reverse quantum annealing of the $p$-spin model with relaxation
• Quantum linear systems algorithms: a primer
• Item Listing Optimization for E-commerce Websites based on Diversity
• Scaling analysis and instantons for thermally-assisted tunneling and Quantum Monte Carlo simulations
• Quantum processor-inspired machine learning in the biomedical sciences
• Mean field analysis of reverse annealing for code-division multiple-access multiuser detection
• Quantum annealing for systems of polynomial equations
• Quantum Monte Carlo Simulations of Tunneling in Quantum Adiabatic Optimization
• Optimizing the spin reversal transform on the D-Wave 2000Q
• Randomized Row and Column Iterative Methods with a Quantum Computer

Cited by in corpus (5)

• Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms
• Hybrid adiabatic quantum computing for tomographic image reconstruction -- opportunities and limitations
• A quantum computing concept for 1-D elastic wave simulation with exponential speedup
• Toward a standardized methodology for constructing quantum computing use cases
• Improving the convergence of an iterative algorithm for solving arbitrary linear equation systems using classical or quantum binary optimization