YYYue Yu

Yue Yu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Yue Yu has a total of 27 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Linear combination of Schr\"odingerization for quantum linear systems with optimal matrix-query complexity

    by Yin Yang, Yue Yu, Long Zhang

    Quantum linear systems algorithms (QLSAs) aim to solve linear systems $A\bb{x}=\bb{b}$ exponentially faster than classical methods under certain conditions. In this work, we develop quantum algorithms for solving linear algebraic equations from an ODE-based perspective. Inspired by the linear combination of Hamiltonian simulation (LCHS) representation in the Fourier approach \cite{Childs2017QLSA}, we express the solution $\bb{x}$ as a linear combination of solutions to a system of linear convection equations, which become Schr\"odinger-type equations with unitary evolutions in the Fourier domain. We refer to this representation as LC-Schr\"odingerization. Based on this result, we construct an LCHS-based quantum algorithm with two LCHS instances: one for time-marching and one for numerical integration. The key construction uses the derivative of a Gaussian-smoothed hat function and recovers the solution over a fixed auxiliary interval. This permits a truncation time independent of the target accuracy and avoids the loss in success probability from selecting a single grid point. Periodization and explicit Fourier coefficients provide the corresponding projection error bounds. Under the stated oracle assumptions and given a constant-factor estimate of the solution norm, direct simulation of the select operators and block preconditioning achieve the optimal matrix-query complexity $\mathcal{O}(\kappa_A\log\frac1\varepsilon)$ without using variable-time amplitude amplification (VTAA). The same upper bound holds for queries to the right-hand-side preparation oracle.

  • Open Access

    Time-marching representation based quantum algorithms for the Lattice Boltzmann model of the advection-diffusion equation

    by Yuan He, Yuan Yu, Yue Yu

    This article introduces a novel framework for developing quantum algorithms for the Lattice Boltzmann Method (LBM) applied to the advection-diffusion equation. We formulate the collision-streaming evolution of the LBM as a compact time-marching scheme and rigorously establish its stability under low Mach number conditions. This unified formulation eliminates the need for classical measurement at each time step, enabling a systematic and fully quantum implementation. Building upon this representation, we investigate two distinct quantum algorithmic approaches. The first is a time-marching quantum algorithm realized through sequential evolution operators, for which we provide a detailed implementation—including block-encoding and dilating unitarization—along with a full complexity analysis. The second employs a quantum linear systems algorithm, which encodes the entire time evolution into a single global linear system. We demonstrate that both methods achieve comparable asymptotic time complexities. The proposed algorithms are validated through numerical simulations of benchmark problems in one and two dimensions. This work provides a systematic, measurement-free pathway for the quantum simulation of advection-diffusion processes via the lattice Boltzmann paradigm.

  • Open Access

    Time-marching representation based quantum algorithms for the Lattice Boltzmann model of the advection-diffusion equation

    by Yuan He, Yuan Yu, Yue Yu

    This article introduces a novel framework for developing quantum algorithms for the Lattice Boltzmann Method (LBM) applied to the advection-diffusion equation. We formulate the collision-streaming evolution of the LBM as a compact time-marching scheme and rigorously establish its stability under low Mach number conditions. This unified formulation eliminates the need for classical measurement at each time step, enabling a systematic and fully quantum implementation. Building upon this representation, we investigate two distinct quantum algorithmic approaches. The first is a time-marching quantum algorithm realized through sequential evolution operators, for which we provide a detailed implementation-including block-encoding and dilating unitarization-along with a full complexity analysis. The second employs a quantum linear systems algorithm, which encodes the entire time evolution into a single global linear system. We demonstrate that both methods achieve comparable asymptotic time complexities. The proposed algorithms are validated through numerical simulations of benchmark problems in one and two dimensions. This work provides a systematic, measurement-free pathway for the quantum simulation of advection-diffusion processes via the lattice Boltzmann paradigm.

  • Top Cited Papers
    Open Access

    Quantum Simulation of the Fokker-Planck Equation via Schr dingerization

    by Shi Jin, Nana Liu, Yue Yu

    This paper studies a quantum simulation technique for solving the Fokker-Planck equation. Traditional semi-discretization methods often fail to preserve the underlying Hamiltonian dynamics and may even modify the Hamiltonian structure, particularly when incorporating boundary conditions. We address this challenge by employing the Schrödingerization method – it converts any linear partial and ordinary differential equation with non-Hermitian dynamics into systems of Schrödinger-type equations. It does so via the so-called warped phase transformation that maps the equation into one higher dimension. We explore the application in two distinct forms of the Fokker-Planck equation. For the conservation form, we show that the semi-discretization-based Schrödingerization is preferable, especially when dealing with non-periodic boundary conditions. Additionally, we analyze the Schrödingerization approach for unstable systems that possess positive eigenvalues in the real part of the coefficient matrix or differential operator. Our analysis reveals that the direct use of Schrödingerization has the same effect as a stabilization procedure. For the heat equation form, we propose a quantum simulation procedure based on the time-splitting technique, and give explicitly its corresponding quantum circuit. We discuss the relationship between operator splitting in the Schrödingerization method and its application directly to the original problem, illustrating how the Schrödingerization method accurately reproduces the time-splitting solutions at each step. Furthermore, we explore finite difference discretizations of the heat equation form using shift operators. Utilizing Fourier bases, we diagonalize the shift operators, enabling efficient simulation in the frequency space. Providing additional guidance on implementing the diagonal unitary operators, we conduct a comparative analysis between diagonalizations in the Bell and the Fourier bases, and show that the former generally exhibits greater efficiency than the latter.


  • Open Access

    Schrodingerization based quantum algorithms for the time-fractional heat equation

    by Shi Jin, Nana Liu, Yue Yu

    We develop a quantum algorithm for solving high-dimensional time-fractional heat equations. By applying the dimension extension technique from [FKW23], the $d+1$-dimensional time-fractional equation is reformulated as a local partial differential equation in $d+2$ dimensions. Through discretization along both the extended and spatial domains, a stable system of ordinary differential equations is obtained by a simple change of variables. We propose a quantum algorithm for the resulting semi-discrete problem using the Schrodingerization approach from [JLY24a,JLY23,JL24a]. The Schrodingerization technique transforms general linear partial and ordinary differential equations into Schrodinger-type systems--with unitary evolution, making them suitable for quantum simulation. This is accomplished via the warped phase transformation, which maps the equation into a higher-dimensional space. We provide detailed implementations of this method and conduct a comprehensive complexity analysis, demonstrating up to exponential advantage--with respect to the inverse of the mesh size in high dimensions~--~compared to its classical counterparts. Specifically, to compute the solution to time $T$, while the classical method requires at least $\mathcal{O}(N_t d h^{-(d+0.5)})$ matrix-vector multiplications, where $N_t $ is the number of time steps (which is, for example, $\mathcal{O}(Tdh^{-2})$ for the forward Euler method), our quantum algorithms requires $\widetilde{\mathcal{O}}(T^2d^4 h^{-8})$ queries to the block-encoding input models, with the quantum complexity being independent of the dimension $d$ in terms of the inverse mesh size $h^{-1}$. Numerical experiments are performed to validate our formulation.

  • Open Access

    The Arrow-Hurwicz iteration for virtual element discretizations of the incompressible Navier-Stokes equations

    by Binbin Du, Shenxiang Cheng, Yue Yu, Chuanjun Chen

    This article presents a detailed analysis of the Arrow-Hurwicz iteration applied to the solution of the incompressible Navier-Stokes equations, discretized by a divergence-free mixed virtual element method. Under a set of appropriate assumptions, it is rigorously demonstrated that the method exhibits geometric convergence, with a contraction factor that remains independent of the mesh sizes. A series of numerical experiments are conducted to validate the theoretical findings and to assess the computational performance of the proposed method.

  • Open Access

    Quantum preconditioning method for linear systems problems via Schrödingerization

    by Shi Jin, Nana Liu, Chuwen Ma, Yue Yu

    We present a quantum computational framework that systematically converts classical linear iterative algorithms with fixed iteration operators into their quantum counterparts using the Schrödingerization technique [Shi Jin, Nana Liu and Yue Yu, Phys. Rev. Lett., vol. 133 No. 230602,2024]. This is achieved by capturing the steady state of the associated differential equations. The Schrödingerization technique transforms linear partial and ordinary differential equations into Schrödinger-type systems, making them suitable for quantum computing. This is accomplished through the so-called warped phase transformation, which maps the equation into a higher-dimensional space. Building on this framework, we develop a quantum preconditioning algorithm that leverages the well-known BPX multilevel preconditioner for the finite element discretization of the Poisson equation. The algorithm achieves a near-optimal dependence on the number of queries to our established input models, with a complexity of $\mathscr{O}(\text{polylog} \frac{1}{\varepsilon})$ for a target accuracy of $\varepsilon$ when the dimension $d\geq 2$. This improvement results from the Hamiltonian simulation strategy applied to the Schrödingerized preconditioning dynamics, coupled with the smoothing of initial data in the extended space.