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

Programming and Computer Software

Evaluation of Differential Equation Solutions through Traditional Techniques and Neural Networks in Quantum Simulations

Romik Sargsyan, Roman Sahakyan, E. A. Gazazyan, Sh. Sargsyan, Sevak Sargsyan, Hrachya V. Astsatryan

Published Oct 1, 2024• 2 citations
Publisher

Abstract

Abstract The study presents a comparative analysis of algorithms of traditional numerical methods and methods using neural networks for solving ordinary differential equations. The evaluation includes both mathematical aspects and aspects of machine learning. Using the Julia programming language, neural networks and the necessary algorithms for conducting practical experiments are implemented. These experiments demonstrate outstanding achievements in the field of quantum computing. Moreover, comparing the efficiency metrics of solving differential equations using numerical methods and neural networks reveals interesting results, depending on the chosen architecture and network parameters.

DOI
10.1134/s0361768824700452

Related papers

Neural Networks vs. Traditional Techniques: Differential Equation Approaches in Quantum Gate Analysis

Romik Sargsyan, Ruben O. Sahakyan, E. A. Gazazyan +3 more

The research evaluates the traditional numerical algorithms and neural network-based methods for solving ordinary differential equations. The evaluation covers both mathematical and machine learning perspectives. Practical experiments are carried out by implementing neural networks and the necessary algorithms using the Julia programming language. These experiments highlight significant advancements in the realm of quantum computing. Additionally, analyzing the efficiency metrics of solving differential equations with numerical methods versus neural networks uncovers intriguing results, which vary based on the chosen architecture and network parameters.

Workshop on Data Analytics and Mathematical Modeling•Jun 26, 2024•0 citations

Experimental Evaluation of Quantum Machine Learning Algorithms

Ricardo Daniel Monteiro Simoes, Patrick Huber, Nicola Meier +3 more

Machine learning and quantum computing are both areas with considerable progress in recent years. The combination of these disciplines holds great promise for both research and practical applications. Recently there have also been many theoretical contributions of quantum machine learning algorithms with experiments performed on quantum simulators. However, most questions concerning the potential of machine learning on quantum computers are still unanswered such as How well do current quantum machine learning algorithms work in practice? How do they compare with classical approaches? Moreover, most experiments use different datasets and hence it is currently not possible to systematically compare different approaches. In this paper we analyze how quantum machine learning can be used for solving small, yet practical problems. In particular, we perform an experimental analysis of kernel-based quantum support vector machines and quantum neural networks. We evaluate these algorithm on 5 different datasets using different combinations of quantum feature maps. Our experimental results show that quantum support vector machines outperform their classical counterparts on average by 3 to 4% in accuracy both on a quantum simulator as well as on a real quantum computer. Moreover, quantum neural networks executed on a quantum computer further outperform quantum support vector machines on average by up to 5% and classical neural networks by 7%.

IEEE Access•Jan 1, 2023•75 citations

Evaluating the performance of classical, quantum, and hybrid quantum neural networks in solving differential equations

Navid Markazi, Behrouz Mirza

We investigate the performance of classical, quantum, and hybrid quantum neural networks in solving partial differential equations through both supervised and unsupervised learning. The performance of each type of network is evaluated in solving the damped harmonic oscillator, the Einstein field equations, and the time-independent Schrödinger equation. We employed physics-informed supervised neural networks to solve the damped harmonic oscillator and the Einstein field equations, and developed an unsupervised neural network algorithm based on the shooting method for the time-independent Schrödinger equation. For the quantum neural networks, we introduced three variational parameterized quantum feature maps and two quantum circuits for the hybrid quantum neural networks. Each network was examined in three different configurations and evaluated across multiple random seeds. Under favorable parameter initializations, the hybrid quantum neural networks achieve higher accuracy than the classical neural networks in most cases across all tested problems. In contrast, the quantum neural networks attain the best accuracy for the damped harmonic oscillator and also perform well in the Schrödinger equation problem. Both the quantum and the hybrid quantum neural networks require fewer parameters than the classical neural networks and converge faster during optimization. All three models exhibit sensitivity to parameter initialization, with the quantum neural networks displaying the highest variability across different problems.

Scientific Reports•Nov 10, 2025•3 citations

Quantum Fourier networks for solving parametric PDEs

Nishant Jain, Jonas Landman, Natansh Mathur +1 more

Abstract Many real-world problems, like modelling environment dynamics, physical processes, time series etc involve solving partial differential equations (PDEs) parameterised by problem-specific conditions. Recently, a deep learning architecture called Fourier neural operator (FNO) proved to be capable of learning solutions of given PDE families for any initial conditions as input. However, it results in a time complexity linear in the number of evaluations of the PDEs while testing. Given the advancements in quantum hardware and the recent results in quantum machine learning methods, we exploit the running efficiency offered by these and propose quantum algorithms inspired by the classical FNO, which result in time complexity logarithmic in the number of evaluations and are expected to be substantially faster than their classical counterpart. At their core, we use the unary encoding paradigm and orthogonal quantum layers and introduce a new quantum Fourier transform in the unary basis. We propose three different quantum circuits to perform a quantum FNO. The proposals differ in their depth and their similarity to the classical FNO. We also benchmark our proposed algorithms on three PDE families, namely Burgers’ equation, Darcy’s flow equation and the Navier–Stokes equation. The results show that our quantum methods are comparable in performance to the classical FNO. We also perform an analysis on small-scale image classification tasks where our proposed algorithms are at par with the performance of classical convolutional neural networks, proving their applicability to other domains as well.

arXiv:2306.15415•Quantum Science and Technology•Apr 24, 2024•21 citations

Quantum Computing to the Advantage of Neural Network

Aditya Maltare, Ishita Jain, Keshav Agrawal +1 more

Artificial neural networks (ANN) have been shown to be effective in various machine learning–based big data analytics challenges. An ANN can learn and generalize the intricate and irregular aspects of the input data. In the era of big data, colossal amounts of data come from various sources. It is anticipated that a point will be reached where even supercomputers will likely be overwhelmed by the enormous data. Due to the volume and scope of the huge data, training an ANN in this situation is a difficult process. To identify patterns and evaluate the data, a vast number of parameters must be employed and tuned in the network. Since a quantum computer may represent data in various ways utilizing qubits, quantum computing (QC) is emerging as a subject that offers a solution to this issue. It is possible to identify hidden patterns in data that are challenging for a classical computer to find by using qubits on quantum computers. As a result, the field of ANN has a wide range of potential applications. In this work, our main goal was to train an artificial neural network with qubits acting as its synthetic neurons. The simulation results demonstrate that, when compared to conventional ANN, our QC solution for ANN (QC ANN) is effective. For a binary classification job, the model that uses qubits as artificial neurons may learn the properties of data with fewer parameters. We employ a quantum simulator to demonstrate our experiment, and a conventional computer is used to optimize the quantum parameters used in the QC ANN.

Wiley eBooks•Oct 13, 2023•0 citations

Neural Network Continuous-Variable Quantum Computing

Martin Knudsen, Christian B. Mendl

We explore how a continuous-variable (CV) quantum computer could solve a classic differential equation, making use of its innate capability to represent real numbers in qumodes. Specifically, we construct variational CV quantum circuits [Killoran et al., Phys.~Rev.~Research 1, 033063 (2019)] to approximate the solution of one-dimensional ordinary differential equations (ODEs), with input encoding based on displacement gates and output via measurement averages. Our simulations and parameter optimization using the PennyLane / Strawberry Fields framework demonstrate good convergence for both linear and non-linear ODEs.

•Jan 1, 2020•0 citations
Abstract The study presents a comparative analysis of algorithms of traditional numerical methods and methods using neural networks for solving ordinary differential equations. The evaluation includes both mathematical aspects and aspects of machine learning. Using the Julia programming language, neural networks and the necessary algorithms for conducting practical experiments are implemented. These experiments demonstrate outstanding achievements in the field of quantum computing. Moreover, comparing the efficiency metrics of solving differential equations using numerical methods and neural networks reveals interesting results, depending on the chosen architecture and network parameters.
The research evaluates the traditional numerical algorithms and neural network-based methods for solving ordinary differential equations. The evaluation covers both mathematical and machine learning perspectives. Practical experiments are carried out by implementing neural networks and the necessary algorithms using the Julia programming language. These experiments highlight significant advancements in the realm of quantum computing. Additionally, analyzing the efficiency metrics of solving differential equations with numerical methods versus neural networks uncovers intriguing results, which vary based on the chosen architecture and network parameters.
Machine learning and quantum computing are both areas with considerable progress in recent years. The combination of these disciplines holds great promise for both research and practical applications. Recently there have also been many theoretical contributions of quantum machine learning algorithms with experiments performed on quantum simulators. However, most questions concerning the potential of machine learning on quantum computers are still unanswered such as How well do current quantum machine learning algorithms work in practice? How do they compare with classical approaches? Moreover, most experiments use different datasets and hence it is currently not possible to systematically compare different approaches. In this paper we analyze how quantum machine learning can be used for solving small, yet practical problems. In particular, we perform an experimental analysis of kernel-based quantum support vector machines and quantum neural networks. We evaluate these algorithm on 5 different datasets using different combinations of quantum feature maps. Our experimental results show that quantum support vector machines outperform their classical counterparts on average by 3 to 4% in accuracy both on a quantum simulator as well as on a real quantum computer. Moreover, quantum neural networks executed on a quantum computer further outperform quantum support vector machines on average by up to 5% and classical neural networks by 7%.
We investigate the performance of classical, quantum, and hybrid quantum neural networks in solving partial differential equations through both supervised and unsupervised learning. The performance of each type of network is evaluated in solving the damped harmonic oscillator, the Einstein field equations, and the time-independent Schrödinger equation. We employed physics-informed supervised neural networks to solve the damped harmonic oscillator and the Einstein field equations, and developed an unsupervised neural network algorithm based on the shooting method for the time-independent Schrödinger equation. For the quantum neural networks, we introduced three variational parameterized quantum feature maps and two quantum circuits for the hybrid quantum neural networks. Each network was examined in three different configurations and evaluated across multiple random seeds. Under favorable parameter initializations, the hybrid quantum neural networks achieve higher accuracy than the classical neural networks in most cases across all tested problems. In contrast, the quantum neural networks attain the best accuracy for the damped harmonic oscillator and also perform well in the Schrödinger equation problem. Both the quantum and the hybrid quantum neural networks require fewer parameters than the classical neural networks and converge faster during optimization. All three models exhibit sensitivity to parameter initialization, with the quantum neural networks displaying the highest variability across different problems.
Abstract Many real-world problems, like modelling environment dynamics, physical processes, time series etc involve solving partial differential equations (PDEs) parameterised by problem-specific conditions. Recently, a deep learning architecture called Fourier neural operator (FNO) proved to be capable of learning solutions of given PDE families for any initial conditions as input. However, it results in a time complexity linear in the number of evaluations of the PDEs while testing. Given the advancements in quantum hardware and the recent results in quantum machine learning methods, we exploit the running efficiency offered by these and propose quantum algorithms inspired by the classical FNO, which result in time complexity logarithmic in the number of evaluations and are expected to be substantially faster than their classical counterpart. At their core, we use the unary encoding paradigm and orthogonal quantum layers and introduce a new quantum Fourier transform in the unary basis. We propose three different quantum circuits to perform a quantum FNO. The proposals differ in their depth and their similarity to the classical FNO. We also benchmark our proposed algorithms on three PDE families, namely Burgers’ equation, Darcy’s flow equation and the Navier–Stokes equation. The results show that our quantum methods are comparable in performance to the classical FNO. We also perform an analysis on small-scale image classification tasks where our proposed algorithms are at par with the performance of classical convolutional neural networks, proving their applicability to other domains as well.
Artificial neural networks (ANN) have been shown to be effective in various machine learning–based big data analytics challenges. An ANN can learn and generalize the intricate and irregular aspects of the input data. In the era of big data, colossal amounts of data come from various sources. It is anticipated that a point will be reached where even supercomputers will likely be overwhelmed by the enormous data. Due to the volume and scope of the huge data, training an ANN in this situation is a difficult process. To identify patterns and evaluate the data, a vast number of parameters must be employed and tuned in the network. Since a quantum computer may represent data in various ways utilizing qubits, quantum computing (QC) is emerging as a subject that offers a solution to this issue. It is possible to identify hidden patterns in data that are challenging for a classical computer to find by using qubits on quantum computers. As a result, the field of ANN has a wide range of potential applications. In this work, our main goal was to train an artificial neural network with qubits acting as its synthetic neurons. The simulation results demonstrate that, when compared to conventional ANN, our QC solution for ANN (QC ANN) is effective. For a binary classification job, the model that uses qubits as artificial neurons may learn the properties of data with fewer parameters. We employ a quantum simulator to demonstrate our experiment, and a conventional computer is used to optimize the quantum parameters used in the QC ANN.
We explore how a continuous-variable (CV) quantum computer could solve a classic differential equation, making use of its innate capability to represent real numbers in qumodes. Specifically, we construct variational CV quantum circuits [Killoran et al., Phys.~Rev.~Research 1, 033063 (2019)] to approximate the solution of one-dimensional ordinary differential equations (ODEs), with input encoding based on displacement gates and output via measurement averages. Our simulations and parameter optimization using the PennyLane / Strawberry Fields framework demonstrate good convergence for both linear and non-linear ODEs.