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

Journal of Computational Physics

Heat semigroup representation of Laplacian

Evgueni Dinvay

Published Mar 24, 2026• 0 citations
Publisher

Abstract

This work introduces a heat semigroup representation of the Laplace operator aimed at enabling stable time evolution methods within multiresolution analysis. While convolution-based Laplacian approximations are not universally advantageous, they become attractive in multiwavelet frameworks where heat equation solvers are highly optimized. The primary motivation is to support iterative application in dynamical quantum simulations, where propagators constructed from repeated multiwavelet differentiation suffer from noise amplification. The proposed representation is validated through self-consistent field calculations, demonstrating compatibility with electronic structure theory, and through time propagation of a harmonic oscillator, illustrating stable iterative behavior. These results indicate the feasibility of heat-based Laplacian representations as a foundation for future multiwavelet approaches to attosecond dynamics.

DOI
10.1016/j.jcp.2026.114878

Related papers

Multiresolution of the one dimensional free-particle propagator. Part 2: Implementation

Evgueni Dinvay

A novel method to integrate the time-dependent Schrödinger equation within the framework of multiresolution analysis is presented. The method is based on symplectic splitting algorithms to separate the kinetic and potential parts of the corresponding propagator. The semigroup associated with the free-particle Schrödinger operator is represented in a multiwavelet basis. The propagator is effectively discretised with a contour deformation technique, which overcomes the challenges presented by previous discretisation methods. The discretised operator is then employed in simple numerical simulations to test the validity of the implementation and to benchmark its precision.

Computer Physics Communications•Nov 19, 2024•1 citation

Variational quantum evolution equation solver

Fong Yew Leong, Wei-Bin Ewe, Dax Enshan Koh

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.

arXiv:2204.02912•Scientific Reports•Jun 25, 2022•45 citations

Multiscale quantum propagation using compact-support wavelets in space and time

Haixiang Wang, Ramiro Acevedo, Heather Mollé +3 more

Orthogonal compact-support Daubechies wavelets are employed as bases for both space and time variables in the solution of the time-dependent Schrodinger equation. Initial value conditions are enforced using special early-time wavelets analogous to edge wavelets used in boundary-value problems. It is shown that the quantum equations may be solved directly and accurately in the discrete wavelet representation, an important finding for the eventual goal of highly adaptive multiresolution Schrodinger equation solvers. While the temporal part of the basis is not sharp in either time or frequency, the Chebyshev method used for pure time-domain propagations is adapted to use in the mixed domain and is able to take advantage of Hamiltonian matrix sparseness. The orthogonal separation into different time scales is determined theoretically to persist throughout the evolution and is demonstrated numerically in a partially adaptive treatment of scattering from an asymmetric Eckart barrier.

The Journal of Chemical Physics•Oct 12, 2004•7 citations

Application of a variational hybrid quantum-classical algorithm to heat conduction equation and analysis of time complexity

Y. Y. Liu, Zhen Chen, Chang Shu +4 more

The prosperous development of both hardware and algorithms for quantum computing (QC) potentially prompts a paradigm shift in scientific computing in various fields. As an increasingly active topic in QC, the variational quantum algorithm leads a promising tool for solving partial differential equations on noisy intermediate scale quantum devices. Although a clear perspective on the advantages of QC over classical computing techniques for specific mathematical and physical problems exists, applications of QC in computational fluid dynamics to solve practical flow problems, though promising, are still at the early stage of development. To explore QC in practical simulation of flow problems, this work applies a variational hybrid quantum-classical algorithm, namely the variational quantum linear solver (VQLS), to resolve the heat conduction equation through finite difference discretization of the Laplacian operator. Details of the VQLS implementation are discussed by various test instances of linear systems. The effect of the number of shots on the accuracy is studied, which reveals a logarithmic relationship. Furthermore, the heuristic scaling of the VQLS with the precision ε, the number of qubits n and the condition number k validates its time complexity reported in the literature. In addition, the successful state vector simulations of the heat conduction equation in one and two dimensions demonstrate the validity of the present VQLS-based algorithm by proof-of-concept results. Finally, the heuristic scaling for the heat conduction problem indicates that the time complexity of the present approach is logarithmically dependent on the precision ε and linearly dependent on the number of qubits n.

arXiv:2207.14630•Physics of Fluids•Oct 29, 2022•44 citations

Quantum Haar Wavelet Transform methods applications and hardware realizations in quantum computing

Wael Badawy

Abstract Quantum Haar Wavelet Transform (QHWT) methods connect multiresolution analysis with quantum information processing through reversible averaging and differencing operations that can be implemented with comparatively compact circuits. Their localized basis functions, real-valued binary structure, and compatibility with hierarchical state representations make them attractive for resource-constrained quantum processing. Nevertheless, claims of practical superiority are difficult to generalize because published studies use heterogeneous encodings, simulators, hardware platforms, noise models, and evaluation metrics. This systematic review examines scholarly work on Haar-based quantum methods published between 1997 and March 2025. A PRISMA-oriented protocol was used to search major engineering and computing databases, remove duplicates, screen records, assess eligibility, and construct a qualitative evidence corpus. The review includes peer-reviewed journal and conference studies together with a limited number of historically influential technical reports and preprints; therefore, the corpus is described as scholarly literature rather than as a uniformly peer-reviewed dataset. Because the reported experiments are not sufficiently homogeneous for statistical pooling, numerical results are treated as study-specific evidence rather than global averages. The review makes three analytical contributions. First, it introduces a unified conceptual framework that links mathematical foundations, circuit realization, application design, hardware evaluation, and research translation. Second, it develops a taxonomy spanning transform theory, quantum image and signal processing, hardware implementation, and emerging quantum artificial intelligence and security applications. Third, it critically compares QHWT with Quantum Fourier Transform and higher-order wavelet approaches by distinguishing circuit depth, gate complexity, approximation behavior, hardware assumptions, and empirical validation. The synthesis indicates that QHWT is most compelling when localization, reversible multiresolution processing, and shallow circuit structure are more important than smooth-basis approximation. Individual studies report promising compression, feature-extraction, and hardware-efficiency results, but these findings remain conditional on encoding choices and platform constraints. Important limitations include sparse cross-platform benchmarking, limited fault-tolerant analysis, noise sensitivity, uncertain scaling, and optimization difficulties in variational quantum learning, including barren plateaus. The resulting roadmap prioritizes reproducible benchmarks, hardware-aware circuit design, explicit complexity reporting, error-mitigation studies, and validation on larger quantum systems.

Discover Applied Sciences•Oct 2, 2026•0 citations

Two-dimensional quantum propagation using wavelets in space and time

Douglas K. Sparks, Bruce R. Johnson

A recent method for solving the time-dependent Schrodinger equation has been developed using expansions in compact-support wavelet bases in both space and time [H. Wang et al., J. Chem. Phys. 121, 7647 (2004)]. This method represents an exact quantum mixed time-frequency approach, with special initial temporal wavelets used to solve the initial value problem. The present work is a first extension of the method to multiple spatial dimensions applied to a simple two-dimensional (2D) coupled anharmonic oscillator problem. A wavelet-discretized version of norm preservation for time-independent Hamiltonians discovered in the earlier one-dimensional investigation is verified to hold as well in 2D and, by implication, in higher numbers of spatial dimensions. The wavelet bases are not restricted to rectangular domains, a fact which is exploited here in a 2D adaptive version of the algorithm.

The Journal of Chemical Physics•Sep 20, 2006•8 citations
This work introduces a heat semigroup representation of the Laplace operator aimed at enabling stable time evolution methods within multiresolution analysis. While convolution-based Laplacian approximations are not universally advantageous, they become attractive in multiwavelet frameworks where heat equation solvers are highly optimized. The primary motivation is to support iterative application in dynamical quantum simulations, where propagators constructed from repeated multiwavelet differentiation suffer from noise amplification. The proposed representation is validated through self-consistent field calculations, demonstrating compatibility with electronic structure theory, and through time propagation of a harmonic oscillator, illustrating stable iterative behavior. These results indicate the feasibility of heat-based Laplacian representations as a foundation for future multiwavelet approaches to attosecond dynamics.
A novel method to integrate the time-dependent Schrödinger equation within the framework of multiresolution analysis is presented. The method is based on symplectic splitting algorithms to separate the kinetic and potential parts of the corresponding propagator. The semigroup associated with the free-particle Schrödinger operator is represented in a multiwavelet basis. The propagator is effectively discretised with a contour deformation technique, which overcomes the challenges presented by previous discretisation methods. The discretised operator is then employed in simple numerical simulations to test the validity of the implementation and to benchmark its precision.
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.
Orthogonal compact-support Daubechies wavelets are employed as bases for both space and time variables in the solution of the time-dependent Schrodinger equation. Initial value conditions are enforced using special early-time wavelets analogous to edge wavelets used in boundary-value problems. It is shown that the quantum equations may be solved directly and accurately in the discrete wavelet representation, an important finding for the eventual goal of highly adaptive multiresolution Schrodinger equation solvers. While the temporal part of the basis is not sharp in either time or frequency, the Chebyshev method used for pure time-domain propagations is adapted to use in the mixed domain and is able to take advantage of Hamiltonian matrix sparseness. The orthogonal separation into different time scales is determined theoretically to persist throughout the evolution and is demonstrated numerically in a partially adaptive treatment of scattering from an asymmetric Eckart barrier.
The prosperous development of both hardware and algorithms for quantum computing (QC) potentially prompts a paradigm shift in scientific computing in various fields. As an increasingly active topic in QC, the variational quantum algorithm leads a promising tool for solving partial differential equations on noisy intermediate scale quantum devices. Although a clear perspective on the advantages of QC over classical computing techniques for specific mathematical and physical problems exists, applications of QC in computational fluid dynamics to solve practical flow problems, though promising, are still at the early stage of development. To explore QC in practical simulation of flow problems, this work applies a variational hybrid quantum-classical algorithm, namely the variational quantum linear solver (VQLS), to resolve the heat conduction equation through finite difference discretization of the Laplacian operator. Details of the VQLS implementation are discussed by various test instances of linear systems. The effect of the number of shots on the accuracy is studied, which reveals a logarithmic relationship. Furthermore, the heuristic scaling of the VQLS with the precision ε, the number of qubits n and the condition number k validates its time complexity reported in the literature. In addition, the successful state vector simulations of the heat conduction equation in one and two dimensions demonstrate the validity of the present VQLS-based algorithm by proof-of-concept results. Finally, the heuristic scaling for the heat conduction problem indicates that the time complexity of the present approach is logarithmically dependent on the precision ε and linearly dependent on the number of qubits n.
Abstract Quantum Haar Wavelet Transform (QHWT) methods connect multiresolution analysis with quantum information processing through reversible averaging and differencing operations that can be implemented with comparatively compact circuits. Their localized basis functions, real-valued binary structure, and compatibility with hierarchical state representations make them attractive for resource-constrained quantum processing. Nevertheless, claims of practical superiority are difficult to generalize because published studies use heterogeneous encodings, simulators, hardware platforms, noise models, and evaluation metrics. This systematic review examines scholarly work on Haar-based quantum methods published between 1997 and March 2025. A PRISMA-oriented protocol was used to search major engineering and computing databases, remove duplicates, screen records, assess eligibility, and construct a qualitative evidence corpus. The review includes peer-reviewed journal and conference studies together with a limited number of historically influential technical reports and preprints; therefore, the corpus is described as scholarly literature rather than as a uniformly peer-reviewed dataset. Because the reported experiments are not sufficiently homogeneous for statistical pooling, numerical results are treated as study-specific evidence rather than global averages. The review makes three analytical contributions. First, it introduces a unified conceptual framework that links mathematical foundations, circuit realization, application design, hardware evaluation, and research translation. Second, it develops a taxonomy spanning transform theory, quantum image and signal processing, hardware implementation, and emerging quantum artificial intelligence and security applications. Third, it critically compares QHWT with Quantum Fourier Transform and higher-order wavelet approaches by distinguishing circuit depth, gate complexity, approximation behavior, hardware assumptions, and empirical validation. The synthesis indicates that QHWT is most compelling when localization, reversible multiresolution processing, and shallow circuit structure are more important than smooth-basis approximation. Individual studies report promising compression, feature-extraction, and hardware-efficiency results, but these findings remain conditional on encoding choices and platform constraints. Important limitations include sparse cross-platform benchmarking, limited fault-tolerant analysis, noise sensitivity, uncertain scaling, and optimization difficulties in variational quantum learning, including barren plateaus. The resulting roadmap prioritizes reproducible benchmarks, hardware-aware circuit design, explicit complexity reporting, error-mitigation studies, and validation on larger quantum systems.
A recent method for solving the time-dependent Schrodinger equation has been developed using expansions in compact-support wavelet bases in both space and time [H. Wang et al., J. Chem. Phys. 121, 7647 (2004)]. This method represents an exact quantum mixed time-frequency approach, with special initial temporal wavelets used to solve the initial value problem. The present work is a first extension of the method to multiple spatial dimensions applied to a simple two-dimensional (2D) coupled anharmonic oscillator problem. A wavelet-discretized version of norm preservation for time-independent Hamiltonians discovered in the earlier one-dimensional investigation is verified to hold as well in 2D and, by implication, in higher numbers of spatial dimensions. The wavelet bases are not restricted to rectangular domains, a fact which is exploited here in a 2D adaptive version of the algorithm.