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

International Congress of the Brazilian Geophysical Society

QFT-Based Simulation: Applications in Seismic Attributes and Convolution

Caio Leão, Daniel E. Revelo, Yan Alef Chagas Silva, Max Smith da Motta

Published Nov 1, 2025• 0 citations
Publisher

Abstract

Due to the increasing volume and complexity of seismic datasets, seismic processing is confronted with increasing computational demands, which necessitate the implementation of innovative solutions such as quantum computing. This study applies the Quantum Fourier Transform (QFT), implemented via the Qiskit framework, to two geophysical applications: computing instantaneous seismic attributes and performing Multi-Dimensional Convolution (MDC). We present a workflow for preparing seismic data for QFT processing, demonstrating results with accuracy comparable to conventional Fourier Transform (FT)-based methods. Although executed on a quantum simulator, the approach is compatible with quantum hardware, promising significant performance gains through qubit superposition. This work offers a new framework for integrating quantum algorithms into geophysical processing workflows, highlighting their potential to improve efficiency and scalability as quantum technology advances.

DOI
10.22564/19cisbgf2025.309

Related papers

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

Seismic impedance estimation from poststack seismic data using quantum computing

Divakar Vashisth, Rodney Lessard

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.

Second International Meeting for Applied Geoscience & Energy•Dec 16, 2024•1 citation

Quantum Computation for End-to-End Seismic Data Processing with Its Computational Advantages and Economic Sustainability

Ashutosh Kumar

Abstract Mathematical and computational challenges involved in seismic data processing presents an opportunity for early adoption of quantum computation methods for end-to-end seismic data processing. Existing methods of seismic data processing involve processes with exponential complexities that result in approximations as well as conversion of some of the continuous phenomena into a stochastic one. In the classical computation methods, the mentioned approximations and assumptions enable us to obtain acceptable results in commercially viable time. This paper proposes alternatives of the classical computations that exist in the quantum computation ecosystem along with the computational advantages it holds. The paper also presents potential contributions of the petroleum industry towards sustaining the quantum computation technologies. Fundamentally seismic data processing involves solutions for systems of linear equations and its derivatives. Quantum computation ecosystem holds efficient solutions for systems of linear equations. In the frequency domain, Finite-Difference modelling reduces seismic-wave equations to systems of linear equations. In the classical computational setup the seismic acquisition involves treatment of the recorded waves as rays and has limited summation provision for recreating the natural reflection or refraction phenomena that is continuous instead of being a stochastic process. The algorithms in the quantum ecosystem allow us to consider summation of signals from all possible paths between the source and the receiver, by amplitude-probability. In addition to the systems of linear equations and their solution with corresponding methods in the quantum ecosystem the fourier transformation and partial differential equations enable us to decompose the waves and apply the physics equation to obtain the desired objective. Quantum-algorithms facilitate exponential speed-up in seismic data processing. The PDE-constrained optimization inverts subsurface P-wave velocity. While going through the seismic data processing steps it is found that the fourier transformation algorithms are derived as a decomposition of the diagonal matrix. The key difference between the fast fourier transform and the quantum fourier transform is that the quantum fourier transformation is used as the building block of several quantum algorithms. Seismic inversion involves laws of physics and calculation that are guided by the ordinary differential equations. In the quantum computation ecosystem these algorithms for linear ordinary differential equations for linear partial differential equations have the complexity of (1/e), where ‘e’ is the tolerance. The insights brought by successful implementation of end-to-end seismic data processing with algorithms in the quantum computation domain enables us to drill most optimally located wells and hence facilitate cost saving. Even with a reduction of 10% in the total number of wells that we drill, we can possibly fund development of one quantum computer hence ensuring economic sustainability of the technology. The novelty of the presented paper lies in the comparative analysis of the classical methods with its counterparts in the quantum ecosystem. It explains the technological and economical aspects of the technology such that extensive knowledge of quantum technology is not compulsory for grasping its contents.

Abu Dhabi International Petroleum Exhibition & Conference (ADIPEC)•Oct 31, 2022•3 citations

Industry First Quantum-Based Seismic Attribute

O. Alsalmi, Saleh Al Dossary

Summary With the growing size of seismic data, high performance computing is critical in seismic processing tasks. In this paper, we leverage quantum computing principles to break beyond classical computing limitations and develop the industry first quantum-based seismic attribute computation algorithm. The experimental results from our algorithm are comparable in quality to classical Sobel-filter based similarity (or coherence) attribute. The algorithm was run on a quantum simulator, an exponential speed up is expected on a real quantum hardware by virtue of the superposition characteristics of quantum bits (qubits). This approach has the potential to change how we do seismic attribute computation in the future, reducing cost and time significantly.

EAGE Annual Conference & Exhibition•Jan 1, 2023•1 citation

Quantum Algorithms and Hybrid Solutions for Real-Time Vision Applications: Evaluation and Comparison

Mahdi Seyfipoor, Mohammad Javad Samii Zafarqandi, Siamak Mohammadi

This paper presents an evaluation of various quantum algorithms for their potential application in real-time vision applications. By analyzing the underlying principles and mechanisms of key quantum algorithms, including those based on the Quantum Fourier Transform (QFT), amplitude amplification, quantum walks, and quantum optimization, the study aims to assess their suitability for enhancing vision tasks. The computational advantages offered by these quantum algorithms, such as speed and efficiency, are highlighted, particularly in comparison to classical approaches. Algorithms based on amplitude amplification, like Grover’s Algorithm and Quantum Counting, demonstrate significant promise for improving the accuracy and speed of object detection, especially in scenarios requiring real-time processing. Similarly, quantum walk algorithms show potential in navigating structured data efficiently, making them relevant for rapid detection tasks. The paper further explores the integration of quantum algorithms with classical techniques, emphasizing the development of hybrid models, such as Quantum Convolutional Neural Networks (QCNNs). Experimental comparisons between traditional Convolutional Neural Networks (CNNs) and QCNNs reveal that quantum-enhanced models may offer advantages in initial training phases, suggesting enhanced capabilities in feature extraction and pattern recognition. The results indicate that while quantum algorithms hold considerable promise for advancing the field of object detection, particularly in real-time applications, further research is needed to fully realize their potential. This study contributes to the growing field of quantum computing by providing a detailed analysis of how various quantum algorithms can be applied to complex data processing tasks in computer vision, offering new directions for the development of more efficient detection systems.

International Symposium on Telecommunications•Oct 9, 2024•1 citation

Quantum Algorithms for Image Processing: Enhancing Computational Efficiency and Accuracy in High-Dimensional Visual Data Analysis

Ata Ulaş Güler

Quantum algorithms have emerged as a transformative approach to address the computational challenges of high-dimensional image processing tasks. This research investigates the integration of quantum computing principles, such as Quantum Fourier Transform (QFT) and Quantum Principal Component Analysis (QPCA), to optimize processes like edge detection, noise reduction, and image segmentation. These quantum-enhanced techniques promise significant improvements in computational efficiency and accuracy compared to classical methods, especially when handling complex visual data in real-time applications like medical imaging, satellite imagery, and autonomous systems. Additionally, the study explores hybrid quantum-classical architectures to bridge current limitations in noisy intermediate-scale quantum (NISQ) devices, ensuring resource optimization and scalability. The potential of quantum algorithms to provide faster, more precise solutions is evaluated alongside challenges like error mitigation and algorithmic stability. This research highlights the future role of quantum computing in revolutionizing image processing, paving the way for breakthroughs in computer vision and artificial intelligence.

Human computer interaction.•Nov 27, 2024•2 citations
Due to the increasing volume and complexity of seismic datasets, seismic processing is confronted with increasing computational demands, which necessitate the implementation of innovative solutions such as quantum computing. This study applies the Quantum Fourier Transform (QFT), implemented via the Qiskit framework, to two geophysical applications: computing instantaneous seismic attributes and performing Multi-Dimensional Convolution (MDC). We present a workflow for preparing seismic data for QFT processing, demonstrating results with accuracy comparable to conventional Fourier Transform (FT)-based methods. Although executed on a quantum simulator, the approach is compatible with quantum hardware, promising significant performance gains through qubit superposition. This work offers a new framework for integrating quantum algorithms into geophysical processing workflows, highlighting their potential to improve efficiency and scalability as quantum technology advances.
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.
Abstract Mathematical and computational challenges involved in seismic data processing presents an opportunity for early adoption of quantum computation methods for end-to-end seismic data processing. Existing methods of seismic data processing involve processes with exponential complexities that result in approximations as well as conversion of some of the continuous phenomena into a stochastic one. In the classical computation methods, the mentioned approximations and assumptions enable us to obtain acceptable results in commercially viable time. This paper proposes alternatives of the classical computations that exist in the quantum computation ecosystem along with the computational advantages it holds. The paper also presents potential contributions of the petroleum industry towards sustaining the quantum computation technologies. Fundamentally seismic data processing involves solutions for systems of linear equations and its derivatives. Quantum computation ecosystem holds efficient solutions for systems of linear equations. In the frequency domain, Finite-Difference modelling reduces seismic-wave equations to systems of linear equations. In the classical computational setup the seismic acquisition involves treatment of the recorded waves as rays and has limited summation provision for recreating the natural reflection or refraction phenomena that is continuous instead of being a stochastic process. The algorithms in the quantum ecosystem allow us to consider summation of signals from all possible paths between the source and the receiver, by amplitude-probability. In addition to the systems of linear equations and their solution with corresponding methods in the quantum ecosystem the fourier transformation and partial differential equations enable us to decompose the waves and apply the physics equation to obtain the desired objective. Quantum-algorithms facilitate exponential speed-up in seismic data processing. The PDE-constrained optimization inverts subsurface P-wave velocity. While going through the seismic data processing steps it is found that the fourier transformation algorithms are derived as a decomposition of the diagonal matrix. The key difference between the fast fourier transform and the quantum fourier transform is that the quantum fourier transformation is used as the building block of several quantum algorithms. Seismic inversion involves laws of physics and calculation that are guided by the ordinary differential equations. In the quantum computation ecosystem these algorithms for linear ordinary differential equations for linear partial differential equations have the complexity of (1/e), where ‘e’ is the tolerance. The insights brought by successful implementation of end-to-end seismic data processing with algorithms in the quantum computation domain enables us to drill most optimally located wells and hence facilitate cost saving. Even with a reduction of 10% in the total number of wells that we drill, we can possibly fund development of one quantum computer hence ensuring economic sustainability of the technology. The novelty of the presented paper lies in the comparative analysis of the classical methods with its counterparts in the quantum ecosystem. It explains the technological and economical aspects of the technology such that extensive knowledge of quantum technology is not compulsory for grasping its contents.
Summary With the growing size of seismic data, high performance computing is critical in seismic processing tasks. In this paper, we leverage quantum computing principles to break beyond classical computing limitations and develop the industry first quantum-based seismic attribute computation algorithm. The experimental results from our algorithm are comparable in quality to classical Sobel-filter based similarity (or coherence) attribute. The algorithm was run on a quantum simulator, an exponential speed up is expected on a real quantum hardware by virtue of the superposition characteristics of quantum bits (qubits). This approach has the potential to change how we do seismic attribute computation in the future, reducing cost and time significantly.
This paper presents an evaluation of various quantum algorithms for their potential application in real-time vision applications. By analyzing the underlying principles and mechanisms of key quantum algorithms, including those based on the Quantum Fourier Transform (QFT), amplitude amplification, quantum walks, and quantum optimization, the study aims to assess their suitability for enhancing vision tasks. The computational advantages offered by these quantum algorithms, such as speed and efficiency, are highlighted, particularly in comparison to classical approaches. Algorithms based on amplitude amplification, like Grover’s Algorithm and Quantum Counting, demonstrate significant promise for improving the accuracy and speed of object detection, especially in scenarios requiring real-time processing. Similarly, quantum walk algorithms show potential in navigating structured data efficiently, making them relevant for rapid detection tasks. The paper further explores the integration of quantum algorithms with classical techniques, emphasizing the development of hybrid models, such as Quantum Convolutional Neural Networks (QCNNs). Experimental comparisons between traditional Convolutional Neural Networks (CNNs) and QCNNs reveal that quantum-enhanced models may offer advantages in initial training phases, suggesting enhanced capabilities in feature extraction and pattern recognition. The results indicate that while quantum algorithms hold considerable promise for advancing the field of object detection, particularly in real-time applications, further research is needed to fully realize their potential. This study contributes to the growing field of quantum computing by providing a detailed analysis of how various quantum algorithms can be applied to complex data processing tasks in computer vision, offering new directions for the development of more efficient detection systems.
Quantum algorithms have emerged as a transformative approach to address the computational challenges of high-dimensional image processing tasks. This research investigates the integration of quantum computing principles, such as Quantum Fourier Transform (QFT) and Quantum Principal Component Analysis (QPCA), to optimize processes like edge detection, noise reduction, and image segmentation. These quantum-enhanced techniques promise significant improvements in computational efficiency and accuracy compared to classical methods, especially when handling complex visual data in real-time applications like medical imaging, satellite imagery, and autonomous systems. Additionally, the study explores hybrid quantum-classical architectures to bridge current limitations in noisy intermediate-scale quantum (NISQ) devices, ensuring resource optimization and scalability. The potential of quantum algorithms to provide faster, more precise solutions is evaluated alongside challenges like error mitigation and algorithmic stability. This research highlights the future role of quantum computing in revolutionizing image processing, paving the way for breakthroughs in computer vision and artificial intelligence.