A fast quantum algorithm for solving partial differential equations

The numerical solution of partial differential equations (PDEs) is essential in computational physics. Over the past few decades, various quantum-based methods have been developed to formulate and solve PDEs. Solving PDEs incurs high-time complexity for high-dimensional real-world problems, and using traditional methods becomes practically inefficient. This paper presents a fast hybrid classical-quantum paradigm based on successive over-relaxation (SOR) to accelerate solving PDEs. Using the discretization method, this approach reduces the PDE solution to solving a system of linear equations, which is then addressed using the block SOR method. The block SOR method is employed to address qubit limitations, where the entire system of linear equations is decomposed into smaller subsystems. These subsystems are iteratively solved block-wise using Advantage quantum computers developed by D-Wave Systems, and the solutions are subsequently combined to obtain the overall solution. The performance of the proposed method is evaluated by solving the heat equation for a square plate with fixed boundary temperatures and comparing the results with the best existing method. Experimental results show that the proposed method can accelerate the solution of high-dimensional PDEs by using a limited number of qubits up to 2 times the existing method.

Authors

Institutions

Publication Details

Journal
Scientific Reports
Published
2025-02-13
DOI
https://doi.org/10.1038/s41598-025-89302-8
Citations
1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
2.48
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A fast quantum algorithm for solving partial differential equations

Azim Farghadan, Mohammadmahdi Farahani, Mohsen Akbari
1 citations
Scientific Reports
Quantum Computing Algorithms and Architecture
2.48
article

A fast quantum algorithm for solving partial differential equations

Azim Farghadan, Mohammadmahdi Farahani, Mohsen Akbari
article en
1 citations

Abstract

The numerical solution of partial differential equations (PDEs) is essential in computational physics. Over the past few decades, various quantum-based methods have been developed to formulate and solve PDEs. Solving PDEs incurs high-time complexity for high-dimensional real-world problems, and using traditional methods becomes practically inefficient. This paper presents a fast hybrid classical-quantum paradigm based on successive over-relaxation (SOR) to accelerate solving PDEs. Using the discretization method, this approach reduces the PDE solution to solving a system of linear equations, which is then addressed using the block SOR method. The block SOR method is employed to address qubit limitations, where the entire system of linear equations is decomposed into smaller subsystems. These subsystems are iteratively solved block-wise using Advantage quantum computers developed by D-Wave Systems, and the solutions are subsequently combined to obtain the overall solution. The performance of the proposed method is evaluated by solving the heat equation for a square plate with fixed boundary temperatures and comparing the results with the best existing method. Experimental results show that the proposed method can accelerate the solution of high-dimensional PDEs by using a limited number of qubits up to 2 times the existing method.

Scientific ReportsVol. 15(1)
Kharazmi University (IR), Iranian Center for Quantum Technologies (IR)
Openalex Percentile: Top 12%
Quantum Computing Algorithms and Architecture
2.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.