Related papers: A variational quantum algorithm-based numerical me…
Variational quantum algorithms (VQAs) are a modern family of quantum algorithms designed to solve optimization problems using a quantum computer. Typically VQAs rely on a feedback loop between the quantum device and a classical optimization…
This study established a quantum-classical hybrid framework that integrates quantum computing paradigm with meshfree finite particle method. By harnessing quantum superposition and entanglement, it hybridized the critical computational…
Quantum solutions to differential equations represent quantum data -- states that contain relevant information about the system's behavior, yet are difficult to analyze. We propose a toolbox for reading out information from such data, where…
This work uses high-order discontinuous Galerkin discretization techniques as a generic, parameter-free, and reliable tool to accurately predict transitional and turbulent flows through medical devices. Flows through medical devices are…
This work develops an efficient and accurate optimization algorithm to study the optimal mixing problem driven by boundary control of unsteady Stokes flows, based on the theoretical foundation laid by Hu and Wu in a series of work. The…
Simulation of unsteady creeping flows in complex geometries has traditionally required the use of a time-stepping procedure, which is typically costly and unscalable. To reduce the cost and allow for computations at much larger scales, we…
In this paper, we present a novel numerical scheme for simulating deformable and extensible capsules suspended in a Stokesian fluid. The main feature of our scheme is a partition-of-unity (POU) based representation of the surface that…
Recent advances in quantum computing and their increased availability has led to a growing interest in possible applications. Among those is the solution of partial differential equations (PDEs) for, e.g., material or flow simulation.…
Recently a new class of quantum algorithms that are based on the quantum computation of the connected moment expansion has been reported to find the ground and excited state energies. In particular, the Peeters-Devreese-Soldatov (PDS)…
In this work, we analyze an unfitted discontinuous Galerkin discretization for the numerical solution of the Stokes system based on equal higher-order discontinuous velocities and pressures. This approach combines the best from both worlds,…
Governing equations of motion for a viscous incompressible material surface are derived from the balance laws of continuum mechanics. The surface is treated as a time-dependent smooth orientable manifold of codimension one in an ambient…
In this manuscript, we show how flow equation methods can be used to study localisation in disordered quantum systems, and particularly how to use this approach to obtain the non-equilibrium dynamical evolution of observables. We review the…
The Stokes system with constant viscosity can be cast into different formulations by exploiting the incompressibility constraint. For instance the strain in the weak formulation can be replaced by the gradient to decouple the velocity…
For quantum computing (QC) to emerge as a practically indispensable computational tool, there is a need for quantum protocols with an end-to-end practical applications -- in this instance, fluid dynamics. We debut here a high performance…
This study proposes an algorithm for modeling compressible flows in spherical shells in nearly incompressible and weakly compressible regimes based on an implicit direction splitting approach. The method retains theoretically expected…
In the present work, we propose to extend to the Stokes problem a fictitious domain approach inspired by eXtended Finite Element Method and studied for Poisson problem in [Renard]. The method allows computations in domains whose boundaries…
We present a global optimization routine for the variational quantum algorithms, which utilizes the dynamic tunneling flow. Originally designed to leverage information gathered by a gradient-based optimizer around local minima, we adapt the…
This paper introduces a novel theoretical framework and a suite of highly efficient, parallelizable algorithms for solving the large-scale multicommodity flow (MCF) feasibility problem. We reframe the classical constraint-satisfaction…
We derive a compatible discretization method that relies heavily on the underlying geometric structure, and obeys the topological sequences and commuting properties that are constructed. As a sample problem we consider the…
Different hybrid quantum-classical algorithms have recently been developed as a near-term way to solve linear systems of equations on quantum devices. However, the focus has so far been mostly on the methods, rather than the problems that…