Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Inverse Problems

Solving geophysical inverse problems with simulated Ising systems

Anton H. Ziegon, K. A. Innanen

Published Jul 24, 2026• 0 citations
Publisher

Abstract

Abstract The increasing scale and complexity of modern geophysical inverse problems approaches the limits of conventional computing architectures, motivating the investigation of alternative computational paradigms. Ising computing, whether implemented through emerging analog hardware or simulated on classical machines, offers an intriguing alternative due to its natural alignment with quadratic unconstrained binary optimization. While substantial computational advantages are associated primarily with the parallelization capabilities of Ising computers and thus rely on advances in specialized Ising hardware, simulated Ising computing is crucial for developing compatible algorithms,leading to novel algorithmic insights, with the potential for computational gains when deployed on advanced computing platforms. In this study, we investigate the potential of simulated Ising systems to solve a broad suite of geophysical inverse problems by reformulating them in terms of binary Ising variables, coupling matrices, and external fields. After reviewing the classical Ising model and its Monte Carlo-based simulation, we develop general strategies for mapping geophysical objectives onto Ising Hamiltonians. Four representative problem classes are examined. First, an optimized experimental design problem for timelapse seismic monitoring demonstrates how acquisition sparsity and information content can be encoded directly into the Hamiltonian, enabling substantial data reduction without degrading inversion quality. Second, an amplitude-versus-offset inversion example highlights the challenges of discretizing continuous model parameters and embedding data misfit within the Ising framework. Third, we extend the approach to subsurface reconstruction problems, including traveltime tomography and gravity inversion, illustrating how structural smoothness, physical constraints, and data fidelity can be expressed through coupling and field terms. Finally, we explore a joint inversion formulation in which multiple data types are incorporated into an Ising system. Together, these examples provide insight into the formulations and natural behaviors of these Ising-compatible algorithms. They demonstrate that simulated Ising computing provides a flexible and powerful platform for developing geophysical inversion strategies that may ultimately interface with emerging analog Ising hardware.

DOI
10.1088/1361-6420/ae9005

Related papers

The Future of Quantum Computing for Energy Geosciences

Divakar Vashisth, Rohan Sharma, Tapan Mukerji +1 more

The computational demands of geoscientific workflows are rapidly increasing in both complexity and scale, pushing the limits of classical computing. Quantum computing has emerged as a promising paradigm to address some of these challenges. This paper surveys the growing intersection between quantum computing and energy geosciences, highlighting recent developments and initiatives. To illustrate the practical relevance of this emerging field, we present a case study on seismic traveltime inversion using a variational quantum circuit. In this example, a hybrid quantum-classical workflow is used to reconstruct velocity models from noisy traveltime data, demonstrating how quantum circuits can solve geophysical inverse problems. While modest in scale, the study offers insights into the formulation and implementation of quantumassisted inversion. As quantum hardware advances and algorithmic frameworks mature, quantum computing is poised to become a transformative tool in the computational landscape of energy geosciences.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•0 citations

Seismic inversion using hybrid quantum neural networks

Divakar Vashisth, Rohan Sharma, Tejas Ganesh Iyer +2 more

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.

arXiv:2503.05009•Mar 6, 2025•1 citation

Seismic traveltime inversion with quantum annealing

Hoang Anh Nguyen, Ali Tura

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.

arXiv:2412.06611•Scientific Reports•May 23, 2025•6 citations

An Evolutionary Ising Optimization Framework for Unconstrained Binary Quadratic Programming

Wujie Fu, Anupam Trivedi, Guanyu Chen +3 more

An Ising machine (IM), as a type of analog computer tailored for tackling intractable combinatorial optimization problems, has attracted remarkable attention in recent years. In contrast to the blossoming field of bespoke IM hardware, developing metaheuristics from IMs remains largely uninvestigated. Here, we propose a physics-inspired evolutionary computation paradigm, termed the Ising optimization framework (IOF); it comprises a unique Ising algorithm and a hybrid annealing scheme, which together are well-suited for solving quadratic unconstrained binary optimization (QUBO) problems embedded in Ising system energy. The Ising algorithm leverages a set of iterated self-mapping functions to evolve an Ising-spin swarm, enabling efficient energy minimization in artificial Ising systems while mitigating detrimental chaos. Complementing the algorithm, a hybrid annealing scheme integrating singular value dropout, bifurcation control, and a nudging strategy, is devised to augment the overall optimization capacity. The effectiveness of the IOF is validated on various Ising and Max-cut problems with decision variables ranging from 625 to 5000 in number. In comparison to four major types of methods for solving QUBOs, including IM simulations, nature-inspired algorithms, a state-of-the-art heuristic, and the commercial solver Gurobi, the IOF consistently demonstrates notable optimization quality and computational efficiency. This paper provides a theoretical foundation and practical guidelines for bridging Ising-inspired approaches with evolutionary computation, offering an evolutionary perspective on Ising optimizations and suggesting a fertile avenue for future research and application.

IEEE Transactions on Evolutionary Computation•May 7, 2025•3 citations

Pre-stack and post-stack seismic inversion using quantum computing

Divakar Vashisth, Rodney Lessard, Tapan Mukerji

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.

arXiv:2502.03808•Geophysics•Apr 15, 2026•7 citations

Physics-Inspired Optimization in the QUBO Framework: Key Concepts and Approaches

Lien-Po Yu, Chin-Fu Nien

Quantum computing promises to have a tremendous advantage over its classical counterpart for solving computationally hard problems, yet remains in a relatively early stage for practical applications owing to the limited capabilities of today’s quantum computers. The approach to the special purposes of quantum computers by exploiting the special-purpose physics-inspired or quantum-inspired computers is emerging as a novel alternative to its quantum counterpart in tackling hard problems in high-performance computing. Inspired by physics, the Ising machine — a type of special-purpose computer that implements or emulates physics or quantum effects of the Ising model to speed up finding solutions to optimization problems — has recently become an active research area in the field of combinatorial optimization. This paper is to address the key enabling software and hardware technology underlying physics-inspired optimization using Ising machines in the unified quadratic unconstrained binary optimization (QUBO) framework for modeling and solving computationally hard combinatorial optimization problems, and with an aim to shed some light on the challenges and opportunities associated with the ever-growing landscape of this novel high-performance computing.

SPIN•Aug 30, 2023•1 citation
Abstract The increasing scale and complexity of modern geophysical inverse problems approaches the limits of conventional computing architectures, motivating the investigation of alternative computational paradigms. Ising computing, whether implemented through emerging analog hardware or simulated on classical machines, offers an intriguing alternative due to its natural alignment with quadratic unconstrained binary optimization. While substantial computational advantages are associated primarily with the parallelization capabilities of Ising computers and thus rely on advances in specialized Ising hardware, simulated Ising computing is crucial for developing compatible algorithms,leading to novel algorithmic insights, with the potential for computational gains when deployed on advanced computing platforms. In this study, we investigate the potential of simulated Ising systems to solve a broad suite of geophysical inverse problems by reformulating them in terms of binary Ising variables, coupling matrices, and external fields. After reviewing the classical Ising model and its Monte Carlo-based simulation, we develop general strategies for mapping geophysical objectives onto Ising Hamiltonians. Four representative problem classes are examined. First, an optimized experimental design problem for timelapse seismic monitoring demonstrates how acquisition sparsity and information content can be encoded directly into the Hamiltonian, enabling substantial data reduction without degrading inversion quality. Second, an amplitude-versus-offset inversion example highlights the challenges of discretizing continuous model parameters and embedding data misfit within the Ising framework. Third, we extend the approach to subsurface reconstruction problems, including traveltime tomography and gravity inversion, illustrating how structural smoothness, physical constraints, and data fidelity can be expressed through coupling and field terms. Finally, we explore a joint inversion formulation in which multiple data types are incorporated into an Ising system. Together, these examples provide insight into the formulations and natural behaviors of these Ising-compatible algorithms. They demonstrate that simulated Ising computing provides a flexible and powerful platform for developing geophysical inversion strategies that may ultimately interface with emerging analog Ising hardware.
The computational demands of geoscientific workflows are rapidly increasing in both complexity and scale, pushing the limits of classical computing. Quantum computing has emerged as a promising paradigm to address some of these challenges. This paper surveys the growing intersection between quantum computing and energy geosciences, highlighting recent developments and initiatives. To illustrate the practical relevance of this emerging field, we present a case study on seismic traveltime inversion using a variational quantum circuit. In this example, a hybrid quantum-classical workflow is used to reconstruct velocity models from noisy traveltime data, demonstrating how quantum circuits can solve geophysical inverse problems. While modest in scale, the study offers insights into the formulation and implementation of quantumassisted inversion. As quantum hardware advances and algorithmic frameworks mature, quantum computing is poised to become a transformative tool in the computational landscape of energy geosciences.
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.
An Ising machine (IM), as a type of analog computer tailored for tackling intractable combinatorial optimization problems, has attracted remarkable attention in recent years. In contrast to the blossoming field of bespoke IM hardware, developing metaheuristics from IMs remains largely uninvestigated. Here, we propose a physics-inspired evolutionary computation paradigm, termed the Ising optimization framework (IOF); it comprises a unique Ising algorithm and a hybrid annealing scheme, which together are well-suited for solving quadratic unconstrained binary optimization (QUBO) problems embedded in Ising system energy. The Ising algorithm leverages a set of iterated self-mapping functions to evolve an Ising-spin swarm, enabling efficient energy minimization in artificial Ising systems while mitigating detrimental chaos. Complementing the algorithm, a hybrid annealing scheme integrating singular value dropout, bifurcation control, and a nudging strategy, is devised to augment the overall optimization capacity. The effectiveness of the IOF is validated on various Ising and Max-cut problems with decision variables ranging from 625 to 5000 in number. In comparison to four major types of methods for solving QUBOs, including IM simulations, nature-inspired algorithms, a state-of-the-art heuristic, and the commercial solver Gurobi, the IOF consistently demonstrates notable optimization quality and computational efficiency. This paper provides a theoretical foundation and practical guidelines for bridging Ising-inspired approaches with evolutionary computation, offering an evolutionary perspective on Ising optimizations and suggesting a fertile avenue for future research and application.
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 promises to have a tremendous advantage over its classical counterpart for solving computationally hard problems, yet remains in a relatively early stage for practical applications owing to the limited capabilities of today’s quantum computers. The approach to the special purposes of quantum computers by exploiting the special-purpose physics-inspired or quantum-inspired computers is emerging as a novel alternative to its quantum counterpart in tackling hard problems in high-performance computing. Inspired by physics, the Ising machine — a type of special-purpose computer that implements or emulates physics or quantum effects of the Ising model to speed up finding solutions to optimization problems — has recently become an active research area in the field of combinatorial optimization. This paper is to address the key enabling software and hardware technology underlying physics-inspired optimization using Ising machines in the unified quadratic unconstrained binary optimization (QUBO) framework for modeling and solving computationally hard combinatorial optimization problems, and with an aim to shed some light on the challenges and opportunities associated with the ever-growing landscape of this novel high-performance computing.