Nana Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Nana Liu has a total of 75 co-authors. Here are the top co-authors by number of shared publications:
- Shi Jin
Southeast University
19 shared publications - Yue Yu
School of Mathematics and Computational Science, Hunan Key Laboratory for Computation and Simulation in Science and Engineering, Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education, National Center for Applied Mathematics in Hunan, Xiangtan University, Xiangtan, China
13 shared publications Shi Jin
School of Mathematical Sciences, Shanghai Jiao Tong University, Shanghai 200240, People’s Republic of China
10 shared publications- Lei Zhang
School of Mathematical Sciences Shanghai Jiao Tong University 200240 Shanghai P. R. China
5 shared publications - Jayne Thompson
Centre for Quantum Technologies National University of Singapore 3 Science Drive 2 117543 Singapore
3 shared publications - Mile Gu
Nanyang Technological University
3 shared publications
Latest Publications
- Open Access
- 10 June 2026
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 123 (24)
Quantum algorithms for viscosity solutions to nonlinear Hamilton–Jacobi equations based on an entropy penalization method
We present a framework for efficient extraction of the viscosity solutions of nonlinear Hamilton–Jacobi equations with convex Hamiltonians. These viscosity solutions play a central role in areas such as front propagation, mean-field games, optimal control, machine learning, and a direct application to the forced Burgers’ equation. Our method is based on an entropy penalization method which generalizes the Cole–Hopf transform from quadratic to general convex Hamiltonians, allowing an approximation of viscous Hamilton–Jacobi dynamics by a discrete-time linear dynamics which approximates a linear heat-like parabolic equation, and thus can also extend to continuous-time dynamics. This makes the method suitable for quantum simulation. The validity of these results hold for arbitrary nonlinearity that correspond to convex Hamiltonians, and for arbitrarily long times, thus obviating a chief obstacle in most quantum algorithms for nonlinear partial differential equations. We provide quantum algorithms—both analog and digital—for extracting pointwise values, gradients, minima, and function evaluations at the minimizer of the viscosity solution, without requiring nonlinear updates or full state reconstruction.
- 10 June 2026
- Published by National Academy of Sciences in Proceedings of the National Academy of Sciences
- Vol. 123 (24)
Open AccessQuantum algorithms for viscosity solutions to nonlinear Hamilton–Jacobi equations based on an entropy penalization method
We present a framework for efficient extraction of the viscosity solutions of nonlinear Hamilton–Jacobi equations with convex Hamiltonians. These viscosity solutions play a central role in areas such as front propagation, mean-field games, optimal control, machine learning, and a direct application to the forced Burgers’ equation. Our method is based on an entropy penalization method which generalizes the Cole–Hopf transform from quadratic to general convex Hamiltonians, allowing an approximation of viscous Hamilton–Jacobi dynamics by a discrete-time linear dynamics which approximates a linear heat-like parabolic equation, and thus can also extend to continuous-time dynamics. This makes the method suitable for quantum simulation. The validity of these results hold for arbitrary nonlinearity that correspond to convex Hamiltonians, and for arbitrarily long times, thus obviating a chief obstacle in most quantum algorithms for nonlinear partial differential equations. We provide quantum algorithms—both analog and digital—for extracting pointwise values, gradients, minima, and function evaluations at the minimizer of the viscosity solution, without requiring nonlinear updates or full state reconstruction.
- 2 April 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (4)
Constrained free energy minimization for the design of thermal states and stabilizer thermodynamic systems
- 2 April 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (4)
Constrained free energy minimization for the design of thermal states and stabilizer thermodynamic systems
- Open Access
Fundamental questions on robustness and accuracy for classical and quantum learning algorithms
This chapter introduces and investigates some fundamental questions on the relationship between accuracy and robustness in both classical and quantum classification algorithms under noisy and adversarial conditions. We introduce and clarify various definitions of robustness and accuracy, including corrupted-instance robustness accuracy and prediction-change robustness, distinguishing them from conventional accuracy and robustness measures. Through theoretical analysis and toy models, we establish conditions under which trade-offs between accuracy and robustness accuracy arise and identify scenarios where such trade-offs can be avoided. The framework developed highlights the nuanced interplay between model bias, noise characteristics, and perturbation types, including relevant and irrelevant perturbations. We explore the implications of some of these results for incompatible noise, adversarial quantum perturbations, the no free lunch theorem, and suggest future methods to examine these problems from the lens of dynamical systems.
Open AccessFundamental questions on robustness and accuracy for classical and quantum learning algorithms
This chapter introduces and investigates some fundamental questions on the relationship between accuracy and robustness in both classical and quantum classification algorithms under noisy and adversarial conditions. We introduce and clarify various definitions of robustness and accuracy, including corrupted-instance robustness accuracy and prediction-change robustness, distinguishing them from conventional accuracy and robustness measures. Through theoretical analysis and toy models, we establish conditions under which trade-offs between accuracy and robustness accuracy arise and identify scenarios where such trade-offs can be avoided. The framework developed highlights the nuanced interplay between model bias, noise characteristics, and perturbation types, including relevant and irrelevant perturbations. We explore the implications of some of these results for incompatible noise, adversarial quantum perturbations, the no free lunch theorem, and suggest future methods to examine these problems from the lens of dynamical systems.
- Open Access
- 27 January 2026
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 11 (1)
Quantum framework for simulating linear PDEs with Robin boundary conditions
We propose an explicit quantum framework for numerically simulating general linear partial differential equations (PDEs), extending previous work \cite{guseynov2024efficientPDE} to incorporate (a) Robin boundary conditions—which include Neumann and Dirichlet conditions as special cases—(b) inhomogeneous terms, and (c) variable coefficients in space and time. Our approach begins with a general finite-difference discretization and applies the Schr"{o}dingerisation technique to transform the resulting system into one that admits unitary quantum evolution, enabling quantum simulation. For the Schr"{o}dinger equation corresponding to the discretized PDE, we construct an efficient block-encoding of the Hamiltonian $H$ that scales polylogarithmically with the number of grid points $N$. This encoding is compatible with quantum signal processing and allows for the implementation of the evolution operator $e^{-iHt}$. The explicit circuit construction in our method permits complexity to be measured in fundamental gate units—namely, CNOT gates and single-qubit rotations—bypassing the inefficiencies of oracle queries. Consequently, the overall algorithm scales polynomially with $N$ and linearly with the spatial dimension $d$. Under certain input/output assumptions our method achieves a polynomial speedup in $N$ and an exponential advantage in $d$ for a wide class of PDEs, thereby mitigating the classical curse of dimensionality. The validity and efficiency of the proposed approach are further substantiated by numerical simulations. By explicitly defining the quantum operations and quantifying their resource requirements, our approach offers a practical alternative for numerically solving PDEs, distinct from others that rely on oracle queries and purely asymptotic scaling methods.- 27 January 2026
- Published by IOP Publishing in Quantum Science and Technology
- Vol. 11 (1)
Open AccessQuantum framework for simulating linear PDEs with Robin boundary conditions
We propose an explicit quantum framework for numerically simulating general linear partial differential equations (PDEs), extending previous work \cite{guseynov2024efficientPDE} to incorporate (a) Robin boundary conditions—which include Neumann and Dirichlet conditions as special cases—(b) inhomogeneous terms, and (c) variable coefficients in space and time. Our approach begins with a general finite-difference discretization and applies the Schr"{o}dingerisation technique to transform the resulting system into one that admits unitary quantum evolution, enabling quantum simulation. For the Schr"{o}dinger equation corresponding to the discretized PDE, we construct an efficient block-encoding of the Hamiltonian $H$ that scales polylogarithmically with the number of grid points $N$. This encoding is compatible with quantum signal processing and allows for the implementation of the evolution operator $e^{-iHt}$. The explicit circuit construction in our method permits complexity to be measured in fundamental gate units—namely, CNOT gates and single-qubit rotations—bypassing the inefficiencies of oracle queries. Consequently, the overall algorithm scales polynomially with $N$ and linearly with the spatial dimension $d$. Under certain input/output assumptions our method achieves a polynomial speedup in $N$ and an exponential advantage in $d$ for a wide class of PDEs, thereby mitigating the classical curse of dimensionality. The validity and efficiency of the proposed approach are further substantiated by numerical simulations. By explicitly defining the quantum operations and quantifying their resource requirements, our approach offers a practical alternative for numerically solving PDEs, distinct from others that rely on oracle queries and purely asymptotic scaling methods. - Top Cited PapersOpen Access
- 18 January 2026
- Published by Global Science Press in Communications in Computational Physics
- Vol. 39 (4) , 969-1001
Quantum Simulation of the Fokker-Planck Equation via Schr dingerization
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.
- 18 January 2026
- Published by Global Science Press in Communications in Computational Physics
- Vol. 39 (4) , 969-1001
Top Cited PapersOpen AccessQuantum Simulation of the Fokker-Planck Equation via Schr dingerization
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.
- Top Cited PapersOpen Access
- 2 January 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (1)
Efficient explicit circuit for quantum state preparation of piecewise continuous functions
Efficiently uploading data into quantum states is essential for many quantum algorithms to achieve advantage across various applications. In this paper, we address this challenge by developing a method to upload a polynomial function f ( x ) on the interval x ∈ [ − 1 , 1 ] into a pure quantum state consisting of qubits, where a discretized f ( x ) is the amplitude of this state. The preparation cost has O ( n log n ) scaling in the number of qubits n and linear scaling with the degree of the polynomial Q . This efficiency allows the preparation of states whose amplitudes correspond to high-degree polynomials (up to 10 4 ), enabling accurate approximation of functions that admit efficient polynomial series representations and whose amplitude profiles are not extremely localized. We provide a fully explicit circuit realization, based on four real polynomials that meet specific parity and boundedness conditions. We extend this construction to cover piecewise polynomial functions, a case not previously addressed explicitly in the literature, the algorithm scaling linearly with the number of piecewise parts. Our method achieves efficient quantum circuit implementation and we present detailed gate counting and resource analysis.
- 2 January 2026
- Published by American Physical Society (APS) in Physical Review A
- Vol. 113 (1)
Top Cited PapersOpen AccessEfficient explicit circuit for quantum state preparation of piecewise continuous functions
Efficiently uploading data into quantum states is essential for many quantum algorithms to achieve advantage across various applications. In this paper, we address this challenge by developing a method to upload a polynomial function f ( x ) on the interval x ∈ [ − 1 , 1 ] into a pure quantum state consisting of qubits, where a discretized f ( x ) is the amplitude of this state. The preparation cost has O ( n log n ) scaling in the number of qubits n and linear scaling with the degree of the polynomial Q . This efficiency allows the preparation of states whose amplitudes correspond to high-degree polynomials (up to 10 4 ), enabling accurate approximation of functions that admit efficient polynomial series representations and whose amplitude profiles are not extremely localized. We provide a fully explicit circuit realization, based on four real polynomials that meet specific parity and boundedness conditions. We extend this construction to cover piecewise polynomial functions, a case not previously addressed explicitly in the literature, the algorithm scaling linearly with the number of piecewise parts. Our method achieves efficient quantum circuit implementation and we present detailed gate counting and resource analysis.
- Open Access
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems
- Vol. 55, 497-519
Quantum random feature method for solving partial differential equations
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 present a mesh-free alternative to solve partial differential equations (PDEs), their accuracy is difficult to achieve since one needs to solve a high-dimensional non-convex optimization problem using the stochastic gradient descent method and its variants, the convergence of which is difficult to prove and cannot be guaranteed. The classical random feature method (RFM) effectively merges advantages from both classical numerical analysis and neural network based techniques, achieving spectral accuracy and a natural adaptability to complex geometries. In this work, we introduce a quantum random feature method (QRFM) that leverages quantum computing to accelerate the classical RFM framework. Our method constructs PDE solutions using quantum-generated random features and enforces the governing equations via a collocation approach. A complexity analysis demonstrates that this hybrid quantum-classical algorithm can achieve a quadratic speedup over the classical RFM.
- 1 January 2026
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems
- Vol. 55, 497-519
Open AccessQuantum random feature method for solving partial differential equations
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 present a mesh-free alternative to solve partial differential equations (PDEs), their accuracy is difficult to achieve since one needs to solve a high-dimensional non-convex optimization problem using the stochastic gradient descent method and its variants, the convergence of which is difficult to prove and cannot be guaranteed. The classical random feature method (RFM) effectively merges advantages from both classical numerical analysis and neural network based techniques, achieving spectral accuracy and a natural adaptability to complex geometries. In this work, we introduce a quantum random feature method (QRFM) that leverages quantum computing to accelerate the classical RFM framework. Our method constructs PDE solutions using quantum-generated random features and enforces the governing equations via a collocation approach. A complexity analysis demonstrates that this hybrid quantum-classical algorithm can achieve a quadratic speedup over the classical RFM.
- Open Access
- 19 November 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (4)
Unifying framework for quantum simulation algorithms for time-dependent Hamiltonian dynamics
Recently, there has been growing interest in simulating time-dependent Hamiltonians using quantum algorithms, driven by diverse applications, such as quantum adiabatic computing. While techniques for simulating time-independent Hamiltonian dynamics are well established, time-dependent Hamiltonian dynamics is less explored and it is unclear how to systematically organize existing methods and to find new methods. Sambe-Howland's continuous clock elegantly transforms time-dependent Hamiltonian dynamics into time-independent Hamiltonian dynamics, which means that by taking different discretizations, existing methods for time-independent Hamiltonian dynamics can be exploited for time-dependent dynamics. In this work, we systemically investigate how Sambe-Howland's clock can serve as a unifying framework for simulating time-dependent Hamiltonian dynamics. First, we demonstrate the versatility of this approach by showcasing its compatibility with analog quantum computing and digital quantum computing. Second, for digital quantum computers, we illustrate how this framework, combined with time-independent methods (e.g., product formulas, multiproduct formulas, qDrift, and linear combination of unitaries-Taylor), can facilitate the development of efficient algorithms for simulating time-dependent dynamics. This framework allows us to (1) resolve the problem of finding minimum-gate time-dependent product formulas; (2) establish a unified picture of both Suzuki's and Huyghebaert and De Raedt's approaches; (3) generalize Huyghebaert and De Raedt's first- and second-order formula to arbitrary orders; (4) answer an unsolved question in establishing time-dependent multiproduct formulas; (5) and recover continuous qDrift on the same footing as time-independent qDrift. Third, we demonstrate the efficacy of our higher-order Huyghebaert and De Raedt's algorithm through digital adiabatic simulation.
- 19 November 2025
- Published by American Physical Society (APS) in Physical Review Research
- Vol. 7 (4)
Open AccessUnifying framework for quantum simulation algorithms for time-dependent Hamiltonian dynamics
Recently, there has been growing interest in simulating time-dependent Hamiltonians using quantum algorithms, driven by diverse applications, such as quantum adiabatic computing. While techniques for simulating time-independent Hamiltonian dynamics are well established, time-dependent Hamiltonian dynamics is less explored and it is unclear how to systematically organize existing methods and to find new methods. Sambe-Howland's continuous clock elegantly transforms time-dependent Hamiltonian dynamics into time-independent Hamiltonian dynamics, which means that by taking different discretizations, existing methods for time-independent Hamiltonian dynamics can be exploited for time-dependent dynamics. In this work, we systemically investigate how Sambe-Howland's clock can serve as a unifying framework for simulating time-dependent Hamiltonian dynamics. First, we demonstrate the versatility of this approach by showcasing its compatibility with analog quantum computing and digital quantum computing. Second, for digital quantum computers, we illustrate how this framework, combined with time-independent methods (e.g., product formulas, multiproduct formulas, qDrift, and linear combination of unitaries-Taylor), can facilitate the development of efficient algorithms for simulating time-dependent dynamics. This framework allows us to (1) resolve the problem of finding minimum-gate time-dependent product formulas; (2) establish a unified picture of both Suzuki's and Huyghebaert and De Raedt's approaches; (3) generalize Huyghebaert and De Raedt's first- and second-order formula to arbitrary orders; (4) answer an unsolved question in establishing time-dependent multiproduct formulas; (5) and recover continuous qDrift on the same footing as time-independent qDrift. Third, we demonstrate the efficacy of our higher-order Huyghebaert and De Raedt's algorithm through digital adiabatic simulation.
- Open Access
Improved Offline Reinforcement Learning via Quantum Metric Encoding
Reinforcement learning (RL) with limited samples is common in real-world applications. However, offline RL performance under this constraint is often suboptimal. We consider an alternative approach to dealing with limited samples by introducing the Quantum Metric Encoder (QME). In this methodology, instead of applying the RL framework directly on the original states and rewards, we embed the states into a more compact and meaningful representation, where the structure of the encoding is inspired by quantum circuits. For classical data, QME is a classically simulable, trainable unitary embedding and thus serves as a quantum-inspired module, on a classical device. For quantum data in the form of quantum states, QME can be implemented directly on quantum hardware, allowing for training without measurement or re-encoding. We evaluated QME on three datasets, each limited to 100 samples. We use Soft-Actor-Critic (SAC) and Implicit-Q-Learning (IQL), two well-known RL algorithms, to demonstrate the effectiveness of our approach. From the experimental results, we find that training offline RL agents on QME-embedded states with decoded rewards yields significantly better performance than training on the original states and rewards. On average across the three datasets, for maximum reward performance, we achieve a 116.2% improvement for SAC and 117.6% for IQL. We further investigate the $Δ$-hyperbolicity of our framework, a geometric property of the state space known to be important for the RL training efficacy. The QME-embedded states exhibit low $Δ$-hyperbolicity, suggesting that the improvement after embedding arises from the modified geometry of the state space induced by QME. Thus, the low $Δ$-hyperbolicity and the corresponding effectiveness of QME could provide valuable information for developing efficient offline RL methods under limited-sample conditions.
Open AccessImproved Offline Reinforcement Learning via Quantum Metric Encoding
Reinforcement learning (RL) with limited samples is common in real-world applications. However, offline RL performance under this constraint is often suboptimal. We consider an alternative approach to dealing with limited samples by introducing the Quantum Metric Encoder (QME). In this methodology, instead of applying the RL framework directly on the original states and rewards, we embed the states into a more compact and meaningful representation, where the structure of the encoding is inspired by quantum circuits. For classical data, QME is a classically simulable, trainable unitary embedding and thus serves as a quantum-inspired module, on a classical device. For quantum data in the form of quantum states, QME can be implemented directly on quantum hardware, allowing for training without measurement or re-encoding. We evaluated QME on three datasets, each limited to 100 samples. We use Soft-Actor-Critic (SAC) and Implicit-Q-Learning (IQL), two well-known RL algorithms, to demonstrate the effectiveness of our approach. From the experimental results, we find that training offline RL agents on QME-embedded states with decoded rewards yields significantly better performance than training on the original states and rewards. On average across the three datasets, for maximum reward performance, we achieve a 116.2% improvement for SAC and 117.6% for IQL. We further investigate the $Δ$-hyperbolicity of our framework, a geometric property of the state space known to be important for the RL training efficacy. The QME-embedded states exhibit low $Δ$-hyperbolicity, suggesting that the improvement after embedding arises from the modified geometry of the state space induced by QME. Thus, the low $Δ$-hyperbolicity and the corresponding effectiveness of QME could provide valuable information for developing efficient offline RL methods under limited-sample conditions.
- Open Access
Quantum Random Feature Method for Solving Partial Differential Equations
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 present a mesh-free alternative to solve partial differential equations (PDEs), their accuracy is difficult to achieve since one needs to solve a high-dimensional non-convex optimization problem using the stochastic gradient descent method and its variants, the convergence of which is difficult to prove and cannot be guaranteed. The classical random feature method (RFM) effectively merges advantages from both classical numerical analysis and neural network based techniques, achieving spectral accuracy and a natural adaptability to complex geometries. In this work, we introduce a quantum random feature method (QRFM) that leverages quantum computing to accelerate the classical RFM framework. Our method constructs PDE solutions using quantum-generated random features and enforces the governing equations via a collocation approach. A complexity analysis demonstrates that this hybrid quantum-classical algorithm can achieve a quadratic speedup over the classical RFM.
Open AccessQuantum Random Feature Method for Solving Partial Differential Equations
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 present a mesh-free alternative to solve partial differential equations (PDEs), their accuracy is difficult to achieve since one needs to solve a high-dimensional non-convex optimization problem using the stochastic gradient descent method and its variants, the convergence of which is difficult to prove and cannot be guaranteed. The classical random feature method (RFM) effectively merges advantages from both classical numerical analysis and neural network based techniques, achieving spectral accuracy and a natural adaptability to complex geometries. In this work, we introduce a quantum random feature method (QRFM) that leverages quantum computing to accelerate the classical RFM framework. Our method constructs PDE solutions using quantum-generated random features and enforces the governing equations via a collocation approach. A complexity analysis demonstrates that this hybrid quantum-classical algorithm can achieve a quadratic speedup over the classical RFM.