We propose a numerical homogenization method for scalar linear partial differential equations with rough coefficients that integrates classical coarse-scale solvers with quantum subroutines for fine-scale corrections. Inspired by the Localized Orthogonal Decomposition, we employ quantum local problem solvers to capture fine-scale features efficiently. Unlike periodic homogenization approaches, it does not rely on any periodicity assumption. Moreover, the coupling between quantum computation and the coarse model requires only selected measurements of quantum representative volume elements, thereby mitigating the quantum-interface information bottleneck that could otherwise negate a potential speed-up. We show that the local quantum solver can achieve solutions with the required level of accuracy with an operation count that scales only logarithmically with the fine-scale resolution, as determined by the smallest length scale encoded in the diffusion coefficient. The potential of the approach is illustrated through two-dimensional numerical experiments, using a classical simulation of the local quantum solver.
We propose a numerical homogenization method for scalar linear partial differential equations with rough coefficients that integrates classical coarse-scale solvers with quantum subroutines for fine-scale corrections. Inspired by the Localized Orthogonal Decomposition, we employ quantum local problem solvers to capture fine-scale features efficiently. Unlike periodic homogenization approaches, it does not rely on any periodicity assumption. Moreover, the coupling between quantum computation and the coarse model requires only selected measurements of quantum representative volume elements, thereby mitigating the quantum-interface information bottleneck that could otherwise negate a potential speed-up. We show that the local quantum solver can achieve solutions with the required level of accuracy with an operation count that scales only logarithmically with the fine-scale resolution, as determined by the smallest length scale encoded in the diffusion coefficient. The potential of the approach is illustrated through two-dimensional numerical experiments, using a classical simulation of the local quantum solver.
Quantum linear system algorithms offer theoretical potential for solving large sparse systems from PDE discretizations. However, applying them directly to fine-scale problems remains impractical on near-term hardware because of limited qubits, restricted circuit depth, and noise. They also prepare a quantum state rather than solution coefficients, whose recovery requires measurement and reconstruction. In this work, we develop a hybrid quantum-classical coarse-to-fine finite element framework for heterogeneous Darcy flow. We investigate whether a measured quantum coarse solution improves fine-grid initialization and reduces subsequent classical solver work. Rather than solve the full fine-scale system on a quantum device, we apply a method inspired by the Variational Quantum Linear Solver (VQLS) to the Galerkin coarse system. We reconstruct the approximate coarse solution from measurements, prolongate it to the fine grid, and use it to initialize a classical preconditioned iterative solve.} Numerical experiments on steady heterogeneous Darcy flow and a time-dependent SPE10-based problem show that measured quantum coarse solutions can improve fine-grid initialization, while classical correction recovers accurate pressure fields. The effect on classical solver iterations depends on the problem. All quantum computations were simulated using Qiskit Aer.
We study quantum algorithms for nonlinear and stochastic homogenization via a Young-measure based linear programming (LP) formulation, which lifts the nonlinear problem to a linear one in higher dimensions by treating the microscale, the gradient, and possible random variables as independent variables, thereby capturing effective macroscopic quantities without directly resolving fine-scale oscillations. The resulting LP is large but structured, and its high-dimensional nature creates regimes in which quantum LP solvers outperform direct classical solvers: in the deterministic setting, polynomial quantum speedup arises when moderate homogenized accuracy suffices; in the stochastic setting, encoding all random realizations simultaneously in a single LP yields a quantum square-root reduction in stochastic sampling cost that grows with the number of random variables. Regularity or sparsity of the Young measure may further extend these advantages to fine-scale accuracy. Numerical experiments on one- and two-dimensional benchmarks confirm the correctness of the Young-measure LP formulation.
Quantum computing has the potential to transform computational problem-solving by leveraging quantum mechanical principles of superposition and entanglement. This capability is particularly important for the numerical solution of complex and/or multidimensional partial differential equations (PDEs). There are currently many quantum techniques available for solving PDEs, which are mainly based on variational quantum algorithms (VQAs). However, the existing quantum PDE solvers, particularly those based on VQAs suffer from limitations such as low accuracy, high execution times, and low scalability on both simulators as well as on real quantum devices. In this work, we propose an efficient and scalable algorithm for solving multidimensional PDEs. We present two variants of our algorithm: the first leverages finite-difference method (FDM), classical-to-quantum (C2Q) encoding, and numerical instantiation, while the second employs FDM, C2Q, and column-by-column decomposition (CCD). Both variants are designed to enhance accuracy and scalability while reducing execution times. We have validated our proposed algorithm by solving several practically useful PDEs such as Poisson, heat, Black-Scholes, and Navier-Stokes equations. Our results demonstrate higher accuracy, higher scalability, and faster execution times compared to VQA-based solvers on noise-free and noisy quantum simulators from IBM and achieved promising results on real quantum hardware.
Quantum algorithms for partial differential equations (PDEs) face severe practical constraints on near-term hardware: limited qubit counts restrict spatial resolution to coarse grids, while circuit depth limitations prevent accurate long-time integration. These hardware bottlenecks confine quantum PDE solvers to low-fidelity regimes despite their theoretical potential for computational speedup. We introduce a multifidelity learning framework that corrects coarse quantum solutions to high-fidelity accuracy using sparse classical training data, facilitating the path toward practical quantum utility for scientific computing. The approach trains a low-fidelity surrogate on abundant quantum solver outputs, then learns correction mappings through a multifidelity neural architecture that balances linear and nonlinear transformations. Demonstrated on benchmark nonlinear PDEs including viscous Burgers equation and incompressible Navier-Stokes flows via quantum lattice Boltzmann methods, the framework successfully corrects coarse quantum predictions and achieves temporal extrapolation well beyond the classical training window. This strategy illustrates how one can reduce expensive high-fidelity simulation requirements while producing predictions that are competitive with classical accuracy. By bridging the gap between hardware-limited quantum simulations and application requirements, this work establishes a pathway for extracting computational value from current quantum devices in real-world scientific applications, advancing both algorithm development and practical deployment of near-term quantum computing for computational physics.
Quantum computing has the potential to revolutionize computational problem-solving by leveraging the quantum mechanical phenomena such as superposition and entanglement, enabling fundamentally different computational strategies compared to classical computing. Classical methods for solving complex and high dimensional partial differential equations (PDEs), crucial for modeling diverse physical phenomena, suffer from an exponential growth in computational complexity known as the curse of dimensionality. This can limit their effectiveness for certain high-resolution simulations and real-time computational applications. In contrast, quantum computing inherently exploits superposition and entanglement to efficiently represent and simultaneously manipulate large-scale discretized PDEs, using exponentially fewer resources compared to classical systems. There are currently many quantum techniques available for solving partial differential equations (PDEs), which are mainly based on variational quantum circuits. However, the existing quantum PDE solvers, particularly those based on variational quantum eigensolver (VQE) techniques, suffer from several limitations. These include low accuracy, high execution times, and low scalability on quantum simulators as well as on noisy intermediate-scale quantum (NISQ) devices, especially for multidimensional PDEs. In this work, we propose an efficient and scalable algorithm for solving multidimensional PDEs. We present two variants of our algorithm: the first leverages finite-difference method (FDM), classical-to-quantum (C2Q) encoding, and numerical instantiation, while the second employs FDM, C2Q, and column-by-column decomposition (CCD). Both variants are designed to enhance accuracy and scalability while reducing execution times. We have validated and evaluated our proposed concepts using a number of case studies including multidimensional Poisson equation, multidimensional heat equation, Black Scholes equation for financial option pricing, and Navier-Stokes equation for computational fluid dynamics (CFD), achieving promising results. Our results demonstrate higher accuracy, higher scalability, and faster execution times compared to VQE-based solvers on noise-free and noisy quantum simulators from IBM. Additionally, we validated our approach on hardware emulators and actual quantum hardware, employing noise mitigation techniques. This work establishes a practical and effective approach for solving PDEs using quantum computing for engineering and scientific applications.
Spatial derivatives pose a basic challenge for quantum algorithms for partial differential equations: their standard discretizations have operator norms that grow as the mesh is refined, leading to large block-encoding normalization factors. Even when preconditioning improves access to the solution, estimating derivative-dependent physical observables can reintroduce polynomial dependence on the inverse mesh width. We develop a multilevel quantum algorithm for estimating linear and quadratic observables of elliptic equations that addresses this readout cost. The algorithm decomposes the output into corrections across nested discretizations and realizes fine--coarse cancellation coherently, before measurement. A Ritz-complement factorization connects the O(h2) size of the corrected response with a block encoding at the same scale, allowing this decay to offset growing readout normalizations. Under efficient quantum access to the corrected coordinates, input data, and readouts, observables with readout scale O(h−χ), 0≤χ≤2, can be estimated to additive accuracy ε at cost O(ε−1) using amplitude estimation or O(ε−2) using direct sampling, with only polylogarithmic dependence on the inverse finest mesh width hL−1. We give explicit constructions of the required operator oracles for one-dimensional piecewise linear finite elements with diffusion piecewise constant on a fixed coarsest partition, and for Fourier spectral hierarchies. Output-specific bias estimates connect the discrete results to continuum accuracy.