Related papers: Problem-Specific Basis Quantum State Readout via P…
Scientific and engineering problems often involve parametric partial differential equations (PDEs), such as uncertainty quantification, optimizations, and inverse problems. However, solving these PDEs repeatedly can be prohibitively…
POD-DL-ROMs have been recently proposed as an extremely versatile strategy to build accurate and reliable reduced order models (ROMs) for nonlinear parametrized partial differential equations, combining (i) a preliminary dimensionality…
We propose a component-based (CB) parametric model order reduction (pMOR) formulation for parameterized {nonlinear} elliptic partial differential equations (PDEs). CB-pMOR is designed to deal with large-scale problems for which full-order…
The application of quantum computation to accelerate machine learning algorithms is one of the most promising areas of research in quantum algorithms. In this paper, we explore the power of quantum learning algorithms in solving an…
Quantum computation has demonstrated a promising alternative to solving the NP-hard combinatorial problems. Specifically, when it comes to optimization, classical approaches become intractable to account for large-scale solutions.…
It is of great interest to solve the inverse problem of stationary radiative transport equation (RTE) in optical tomography. The standard way is to formulate the inverse problem into an optimization problem, but the bottleneck is that one…
Quantum computing holds significant promise for scientific computing due to its potential for polynomial to even exponential speedups over classical methods, which are often hindered by the curse of dimensionality. While neural networks…
Quantum algorithms provide an exponential speedup for solving certain classes of linear systems, including those that model geologic fracture flow. However, this revolutionary gain in efficiency does not come without difficulty. Quantum…
In this paper we utilize the Proper Orthogonal Decomposition (POD) method for model order reduction in application to Smoluchowski aggregation equations with source and sink terms. In particular, we show in practice that there exists a…
In this paper, we propose an equation-based parametric Reduced Order Model (ROM), whose accuracy is improved with data-driven terms added into the reduced equations. These additions have the aim of reintroducing contributions that in…
Shape optimization is a challenging task in many engineering fields, since the numerical solutions of parametric system may be computationally expensive. This work presents a novel optimization procedure based on reduced order modeling,…
The Kolmogorov $n$-width of the solution manifolds of transport-dominated problems can decay slowly. As a result, it can be challenging to design efficient and accurate reduced order models (ROMs) for such problems. To address this issue,…
Reduced-order models (ROMs) are often used to accelerate the simulation of large physical systems. However, traditional ROM techniques, such as those based on proper orthogonal decomposition (POD), often struggle with advection-dominated…
The long runtime of high-fidelity partial differential equation (PDE) solvers makes them unsuitable for time-critical applications. We propose to accelerate PDE solvers using reduced-order modeling (ROM). Whereas prior ROM approaches reduce…
A streaming algorithm to compute the spectral proper orthogonal decomposition (SPOD) of stationary random processes is presented. As new data becomes available, an incremental update of the truncated eigenbasis of the estimated…
We propose a reduced basis method to solve time-dependent partial differential equations based on the Laplace transform. Unlike traditional approaches, we start by applying said transform to the evolution problem, yielding a…
This paper presents a physics-based data-driven method to learn predictive reduced-order models (ROMs) from high-fidelity simulations, and illustrates it in the challenging context of a single-injector combustion process. The method…
We are interested in numerically approximating the solution ${\bf U}(t)$ of the large dimensional semilinear matrix differential equation $\dot{\bf U}(t) = { \bf A}{\bf U}(t) + {\bf U}(t){ \bf B} + {\cal F}({\bf U},t)$, with appropriate…
Scalable estimation of quantum states with readout errors is a central challenge in large multiqubit systems. Existing overlapping-tomography methods improve scalability by working with local subsystems, but they usually assume known or…
Current quantum computers can only solve optimization problems of a very limited size. For larger problems, decomposition methods are required in which the original problem is broken down into several smaller sub-problems. These are then…