Abstract ABSTRACT Quantum computing harnesses the principles of quantum mechanics to solve problems that are intractable for classical computers. Quantum annealing, a specialized approach within quantum computing, is particularly effective for optimization tasks, as it leverages quantum tunneling to escape local minima and efficiently explore complex energy landscapes. In geosciences, many problems are framed as high-dimensional optimization problems, including seismic inversion, which aims to estimate subsurface impedances from seismic data for accurate geological interpretation and resource exploration. A novel application of quantum computing for seismic inversion is presented, marking the first instance of inverting seismic data to estimate both P-wave and S-wave impedances using a quantum annealer. Building upon the prior work, which demonstrated the estimation of acoustic impedances from post-stack data using a two-step framework, we propose an enhanced workflow capable of inverting both post-stack and pre-stack seismic data in a single step. This advancement significantly reduces the number of qubits per model parameter (from 20 to 5) while improving computational speed (from 20 seconds to 6.3 seconds). The seismic inversion is implemented using the D-Wave Leap hybrid solver, achieving impedance estimation within 4-9 seconds, with the quantum processing unit (QPU) contributing just 0.043-0.085 seconds. Comparative analysis with simulated annealing reveals that quantum annealing produces impedance models closely matching true values in a single epoch, whereas simulated annealing requires 10 epochs for improved accuracy. These findings underscore the transformative potential of quantum computing for real-time, high-precision seismic inversion, marking a crucial step toward fully quantum-driven geophysical solutions.
Abstract ABSTRACT Quantum computing harnesses the principles of quantum mechanics to solve problems that are intractable for classical computers. Quantum annealing, a specialized approach within quantum computing, is particularly effective for optimization tasks, as it leverages quantum tunneling to escape local minima and efficiently explore complex energy landscapes. In geosciences, many problems are framed as high-dimensional optimization problems, including seismic inversion, which aims to estimate subsurface impedances from seismic data for accurate geological interpretation and resource exploration. A novel application of quantum computing for seismic inversion is presented, marking the first instance of inverting seismic data to estimate both P-wave and S-wave impedances using a quantum annealer. Building upon the prior work, which demonstrated the estimation of acoustic impedances from post-stack data using a two-step framework, we propose an enhanced workflow capable of inverting both post-stack and pre-stack seismic data in a single step. This advancement significantly reduces the number of qubits per model parameter (from 20 to 5) while improving computational speed (from 20 seconds to 6.3 seconds). The seismic inversion is implemented using the D-Wave Leap hybrid solver, achieving impedance estimation within 4-9 seconds, with the quantum processing unit (QPU) contributing just 0.043-0.085 seconds. Comparative analysis with simulated annealing reveals that quantum annealing produces impedance models closely matching true values in a single epoch, whereas simulated annealing requires 10 epochs for improved accuracy. These findings underscore the transformative potential of quantum computing for real-time, high-precision seismic inversion, marking a crucial step toward fully quantum-driven geophysical solutions.
Quantum computing is increasingly recognized as a transformative technology in geophysics, offering the potential to significantly enhance computational power and efficiency. This advancement holds promise for the simulation and processing of complex geological data at unprecedented speeds. Recent studies have begun exploring the application of quantum computing methods to simplified versions of seismic inversion problems, underscoring the technology’s capability to address real-world inverse problems. The primary aim of this study is to tackle a realistic, scalable, and business-relevant problem by estimating acoustic impedances from seismic trace data using a quantum computer. To the best of our knowledge, this is the first instance of seismic impedances being predicted from seismic data through quantum computing, with a discussion on the advantages of solving the inverse problem on quantum processing units (QPUs). In this paper, we leverage the D-Wave quantum annealer to tackle the poststack seismic inversion problem, employing a novel two-step workflow. In the first step, we utilize the quantum annealer to estimate reflectivities from seismic data. Subsequently, these estimated normal-incidence reflectivities serve as the basis for predicting acoustic impedances with the same quantum technology. To validate the effectiveness of our approach, we present five examples, juxtaposing the impedance predictions from the D-Wave quantum annealer against those obtained through Simulated Annealing—a stochastic global optimizer traditionally employed for seismic inversion. Remarkably, the impedances derived from the quantum annealer matched closely with the true values in just a single epoch, whereas simulated annealing required 10 epochs to achieve a similar accuracy. Furthermore, the QPUs within our hybrid solver took only about 0.08 seconds to estimate these seismic impedances. This is remarkably efficient when compared to the time needed by both the classical component of the hybrid solver and simulated annealing, which each took over 10 seconds. This highlights the potential of QPUs to entirely resolve the seismic inverse problem in under a second, underscoring the transformative impact that quantum computing can have in the field of geophysics.
Seismic inversion-including post-stack, pre-stack, and full waveform inversion is compute and memory-intensive. Recently, several approaches, including physics-informed machine learning, have been developed to address some of these limitations. Motivated by the potential of quantum computing, we report on our attempt to map one such classical physics-informed algorithm to a quantum framework. The primary goal is to investigate the technical challenges of this mapping, given that quantum algorithms rely on computing principles fundamentally different from those in classical computing. Quantum computers operate using qubits, which exploit superposition and entanglement, offering the potential to solve classically intractable problems. While current quantum hardware is limited, hybrid quantum-classical algorithms-particularly in quantum machine learning (QML)-demonstrate potential for near-term applications and can be readily simulated. We apply QML to subsurface imaging through the development of a hybrid quantum physics-informed neural network (HQ-PINN) for post-stack and pre-stack seismic inversion. The HQ-PINN architecture adopts an encoder-decoder structure: a hybrid quantum neural network encoder estimates P- and S-impedances from seismic data, while the decoder reconstructs seismic responses using geophysical relationships. Training is guided by minimizing the misfit between the input and reconstructed seismic traces. We systematically assess the impact of quantum layer design, differentiation strategies, and simulator backends on inversion performance. We demonstrate the efficacy of our approach through the inversion of both synthetic and the Sleipner field datasets. The HQ-PINN framework consistently yields accurate results, showcasing quantum computing's promise for geosciences and paving the way for future quantum-enhanced geophysical workflows.
This study demonstrates the application of quantum computing based quantum annealing to seismic traveltime inversion, a critical approach for inverting highly accurate velocity models. The seismic inversion problem is first converted into a Quadratic Unconstrained Binary Optimization problem, which the quantum annealer is specifically designed to solve. We then solve the problem via quantum annealing method. The inversion is applied on a synthetic velocity model, presenting a carbon storage scenario at depths of 1000-1300 m. As an application example, we also show the capacity of quantum computing to handle complex, noisy data environments. This work highlights the emerging potential of quantum computing in geophysical applications, providing a foundation for future developments in high-precision seismic imaging.
Quantum computing exploits quantum mechanics to perform certain computations more efficiently than classical computers. Current quantum computers have performed carefully tailored computational tasks that would be difficult or impossible for even the fastest supercomputers in the world. This “quantum supremacy” result demonstrates that quantum computing is more powerful than classical computing in some computational regimes. At present, it is unknown if any computational problems related to the Earth's subsurface fall within these regimes. Here, we describe an approach to performing seismic inverse analysis that combines a type of quantum computer called a quantum annealer with classical computing. This approach improves upon past work on applying quantum computing to the subsurface (via subsurface hydrology) in two ways. First, the seismic inverse problem enables better performance from the quantum annealer because of the Earth's relatively narrow distribution of P-wave velocities compared to the broad distribution of hydraulic conductivities. Second, we develop an iterative approach to quantum-computational inverse analysis, which works with a realistic set of observations. By contrast, the previous method used an inverse method that depended on an impractically dense set of observations. In combination, these two advances significantly narrow the gap a quantum-computational advantage for a practical subsurface geoscience problem. Closing the gap completely requires more work, but has the potential to dramatically accelerate inverse analyses for subsurface geoscience.
Quantum computing has advanced enough that solving basic inverse problems in exploration seismology may be beneficial to show proof-of-concept results. The problems solved should be simple enough to work with the current early state of quantum computing hardware, which would be comparable to problems solved in the early stages of classical computing. We introduce an iterative algorithm for solving PDE-constrained optimization problems on a quantum annealer. We then use this method to invert for subsurface P-wave velocity—using a hybrid of classical and quantum computing—in a simple seismic experiment. Presentation Date: Tuesday, October 13, 2020 Session Start Time: 9:20 AM Presentation Time: 10:10 AM Location: Poster Station 11 Presentation Type: Poster
ABSTRACT Much of recent progress in geophysics can be attributed to the adaptation of heterogeneous high-performance computing architectures. It is projected that the next major leap in many areas of science, and hence hopefully in geophysics too, will be due to the emergence of quantum computers. Finding a right combination of hardware, algorithms, and a use case, however, proves to be a very challenging task — especially when looking for a relevant application that scales efficiently on a quantum computer and is difficult to solve using classical means. We find that maximizing stack power for residual statics correction, an NP-hard combinatorial optimization problem, appears to naturally fit a particular type of quantum computing known as quantum annealing. We express the underlying objective function as a quadratic unconstrained binary optimization, which is a quantum-native formulation of the problem. We choose some solution space and define a proper encoding to translate the problem variables into qubit states. We find that these choices can have a significant impact on the maximum problem size that can fit on the quantum annealer and on the fidelity of the final result. To improve the latter, we embed the quantum optimization step in a hybrid classical-quantum workflow, which aims to increase the frequency of finding the global, rather than some local, optimum of the objective function. Finally, we find that a generic, black-box, hybrid classical-quantum solver also could be used to solve stack-power maximization problems proximal to industrial relevance and capable of surpassing deterministic solvers prone to cycle skipping. A custom-built workflow capable of solving larger problems with an even higher robustness and greater control of the user appears to be within reach in the very near future.