arXiv subjects

Wei-Bin Ewe

Publications and source records attributed to Wei-Bin Ewe.

6 recordsLinked to original sources

arXiv2025

Hybrid Quantum Physics-informed Neural Network: Towards Efficient Learning of High-speed Flows

This study benchmarks hybrid quantum physics-informed neural network (HQPINN) to model high-speed flows, compared against classical physics-informed neural networks (PINNs) and fully quantum neural networks (QNNs). The HQPINN architecture integrates a parameterized quantum circuit (PQC) with a classical neural network in parallel, trained via a physics-informed loss. Across harmonic, non-harmonic, and transonic benchmarks, HQPINNs demonstrate balanced performance, offering competitive accuracy and stability with reduced parameter cost. Quantum PINNs are highly efficient for harmonic problems achieving the lowest loss with minimal parameters due to their Fourier structure, but struggle to generalize in non-harmonic settings involving shocks and discontinuities. HQPINNs mitigate such artifacts, and with sufficient parameterization, can match the performance of classical models in more complex regimes. Although constrained by current quantum emulation costs and scalability, HQPINNs show promise as general-purpose solvers, offering parameter efficiency with robust fallback behavior, particularly suited for problems where the nature of the solution is not known a-priori.

physics.comp-ph↗

arXiv2024

Solving Fractional Differential Equations on a Quantum Computer: A Variational Approach

We introduce an efficient variational hybrid quantum-classical algorithm designed for solving Caputo time-fractional partial differential equations. Our method employs an iterable cost function incorporating a linear combination of overlap history states. The proposed algorithm is not only efficient in time complexity, but has lower memory costs compared to classical methods. Our results indicate that solution fidelity is insensitive to the fractional index and that gradient evaluation cost scales economically with the number of time steps. As a proof of concept, we apply our algorithm to solve a range of fractional partial differential equations commonly encountered in engineering applications, such as the sub-diffusion equation, the non-linear Burgers' equation and a coupled diffusive epidemic model. We assess quantum hardware performance under realistic noise conditions, further validating the practical utility of our algorithm.

quant-ph↗

arXiv2023

From Ad-Hoc to Systematic: A Strategy for Imposing General Boundary Conditions in Discretized PDEs in variational quantum algorithm

We proposed a general quantum-computing-based algorithm that harnesses the exponential power of noisy intermediate-scale quantum (NISQ) devices in solving partial differential equations (PDE). This variational quantum eigensolver (VQE)-inspired approach transcends previous idealized model demonstrations constrained by strict and simplistic boundary conditions. It enables the imposition of arbitrary boundary conditions, significantly expanding its potential and adaptability for real-world applications, achieving this "from ad-hoc to systematic" concept. We have implemented this method using the fourth-order PDE (the Euler-Bernoulli beam) as example and showcased its effectiveness with four different boundary conditions. This framework enables expectation evaluations independent of problem size, harnessing the exponentially growing state space inherent in quantum computing, resulting in exceptional scalability. This method paves the way for applying quantum computing to practical engineering applications.

quant-ph↗

arXiv2023

Variational Quantum Simulation of Partial Differential Equations: Applications in Colloidal Transport

We assess the use of variational quantum imaginary time evolution for solving partial differential equations. Our results demonstrate that real-amplitude ansaetze with full circular entangling layers lead to higher-fidelity solutions compared to those with partial or linear entangling layers. To efficiently encode impulse functions, we propose a graphical mapping technique for quantum states that often requires only a single bit-flip of a parametric gate. As a proof of concept, we simulate colloidal deposition on a planar wall by solving the Smoluchowski equation including the Derjaguin-Landau-Verwey-Overbeek (DLVO) potential energy. We find that over-parameterization is necessary to satisfy certain boundary conditions and that higher-order time-stepping can effectively reduce norm errors. Together, our work highlights the potential of variational quantum simulation for solving partial differential equations using near-term quantum devices.

quant-ph↗

arXiv2022

Variational Quantum Evolution Equation Solver

Variational quantum algorithms offer a promising new paradigm for solving partial differential equations on near-term quantum computers. Here, we propose a variational quantum algorithm for solving a general evolution equation through implicit time-stepping of the Laplacian operator. The use of encoded source states informed by preceding solution vectors results in faster convergence compared to random re-initialization. Through statevector simulations of the heat equation, we demonstrate how the time complexity of our algorithm scales with the ansatz volume for gradient estimation and how the time-to-solution scales with the diffusion parameter. Our proposed algorithm extends economically to higher-order time-stepping schemes, such as the Crank-Nicolson method. We present a semi-implicit scheme for solving systems of evolution equations with non-linear terms, such as the reaction-diffusion and the incompressible Navier-Stokes equations, and demonstrate its validity by proof-of-concept results.

quant-ph↗

arXiv2022

Variational Quantum-Based Simulation of Waveguide Modes

Variational quantum algorithms are one of the most promising methods that can be implemented on noisy intermediate-scale quantum (NISQ) machines to achieve a quantum advantage over classical computers. This article describes the use of a variational quantum algorithm in conjunction with the finite difference method for the calculation of propagation modes of an electromagnetic wave in a hollow metallic waveguide. The two-dimensional (2D) waveguide problem, described by the Helmholtz equation, is approximated by a system of linear equations, whose solutions are expressed in terms of simple quantum expectation values that can be evaluated efficiently on quantum hardware. Numerical examples are presented to validate the proposed method for solving 2D waveguide problems.

quant-ph↗