arXiv subjects

Chenghua Duan

Publications and source records attributed to Chenghua Duan.

10 recordsLinked to original sources

arXiv2026

Not All EEG Moments Are Equal: Position-Adaptive Time Scheduling for EEG Generation

Electroencephalography (EEG) generation is essential for alleviating data scarcity and enabling large scale neural modeling in brain computer interface applications. However, existing flow based approaches assume that every channel and every time segment within a sample shares a single global time progression, overlooking the fact that not all EEG moments are equal. To address this overlooked heterogeneity, we propose an adaptive EEG generation framework built on conditional flow matching. The framework introduces Position-Adaptive Time Scheduling, which tracks per position reconstruction error to modulate a position specific time progress within the flow matching trajectory. It further incorporates Factorized Spatio-Temporal Attention and a frequency aligned multi resolution spectral consistency loss to model inter channel dependencies induced by volume conduction and compensate for the power law spectral bias of EEG, thereby improving the quality of generated signals. Extensive experiments on three EEG datasets with distinct acquisition protocols and task semantics show that our framework consistently outperforms the strongest baseline, reducing TS-FID by up to 62.2\% and improving downstream classification accuracy gain by up to 6.77 percentage points. These results suggest that the proposed method represents a promising step toward scalable, high fidelity data augmentation for real world brain computer interface applications.

eess.SP↗

arXiv2026

A Resource-Aligned Hybrid Quantum-Classical Framework for Multimodal Face Anti-Spoofing

Embedding high-dimensional data into resource-limited quantum devices remains a significant challenge for practical quantum machine learning. In multimodal face anti-spoofing, while linear compression methods such as principal component analysis can reduce dimensionality to accommodate limited quantum budgets, such approaches often lose critical high-order cross-modal correlations due to the loss of structural information. To this end, we propose a hybrid Matrix Product State (MPS)-Variational Quantum Circuit (VQC) framework, where the MPS serves as a structured, differentiable pre-quantum compression and fusion module, and the VQC acts as the quantum classifier. Built upon the low-rank structure controlled by the virtual bond dimension and integrated with a configurable nonlinear enhancement mechanism, this MPS module explicitly models long-range cross-modal correlations while compressing multimodal data into a compact representation matching the quantum budget and improving numerical stability under extreme compression. Experiments on the CASIA-SURF benchmark demonstrate that MPS-VQC achieves accuracy comparable to strong classical neural network baselines with fewer than 0.25M parameters, highlighting the parameter efficiency of tensor-network representations for high-dimensional multimodal data under tight resource budgets. Leveraging the intrinsic compatibility between MPS structures and quantum circuit topology, this framework not only provides a viable technological pathway for efficient multimodal anti-spoofing on NISQ devices but also serves as a stepping stone toward fully quantum implementations of such tasks in the future.

quant-ph↗

arXiv2025

A brain-inspired paradigm for scalable quantum vision

One of the fundamental tasks in machine learning is image classification, which serves as a key benchmark for validating algorithm performance and practical potential. However, effectively processing high-dimensional, detail-rich images, a capability that is inherent in biological vision, remains a persistent challenge. Inspired by the human brain's efficient ``Forest Before Trees'' cognition, we propose a novel Guiding Paradigm for image recognition, leveraging classical neural networks to analyze global low-frequency information and guide targeted quantum circuit towards critical high-frequency image regions. We present the Brain-Inspired Quantum Classifier (BIQC), implementing this paradigm via a complementarity architecture where a quantum pathway analyzes the localized intricate details identified by the classical pathway. Numerical simulations on diverse datasets, including high-resolution images, show the BIQC's superior accuracy and scalability compared to existing methods. This highlights the promise of brain-inspired, hybrid quantum-classical approach for developing next-generation visual systems.

quant-ph↗

arXiv2025

Noise-Mitigated Variational Quantum Eigensolver with Pre-training and Zero-Noise Extrapolation

As a hybrid quantum-classical algorithm, the variational quantum eigensolver is widely applied in quantum chemistry simulations, especially in computing the electronic structure of complex molecular systems. However, on existing noisy intermediate-scale quantum devices, some factors such as quantum decoherence, measurement errors, and gate operation imprecisions are unavoidable. To overcome these challenges, this study proposes an efficient noise-mitigating variational quantum eigensolver for accurate computation of molecular ground state energies in noisy environments. We design the quantum circuit with reference to the structure of matrix product states and utilize it to pre-train the circuit parameters, which ensures circuit stability and mitigates fluctuations caused by initialization. We also employ zero-noise extrapolation to mitigate quantum noise and combine it with neural networks to improve the accuracy of the noise-fitting function, which significantly eliminates noise interference. Furthermore, we implement an intelligent grouping strategy for measuring Hamiltonian Pauli strings, which not only reduces measurement errors but also improves sampling efficiency. We perform numerical simulations to solve the ground state energy of the $H_4$ molecule by using MindSpore Quantum framework, and the results demonstrate that our algorithm can constrain noise errors within the range of $\mathcal{O}(10^{-2}) \sim \mathcal{O}(10^{-1})$, outperforming mainstream variational quantum eigensolvers. This work provides a new strategy for high-precision quantum chemistry calculations on near-term noisy quantum hardware. The updated code is available at https://gitee.com/mindspore/mindquantum/tree/research/paper_with_code/eigensolver_with_mps_and_ZNE or https://github.com/mindspore-lab/models/tree/master/research/arxiv_papers/MPS_eigensolver_with_ZNE.

quant-ph↗

arXiv2023

The Cumulative Distribution Function Based Method for Random Drift Model

In this paper, we propose a numerical method to uniformly handle the random genetic drift model for pure drift with or without natural selection and mutation. For pure drift and natural selection case, the Dirac $δ$ singularity will develop at two boundary ends and the mass lumped at the two ends stands for the fixation probability. For the one-way mutation case, known as Muller's ratchet, the accumulation of deleterious mutations leads to the loss of the fittest gene, the Dirac $δ$ singularity will spike only at one boundary end, which stands for the fixation of the deleterious gene and loss of the fittest one. For two-way mutation case, the singularity with negative power law may emerge near boundary points. We first rewrite the original model on the probability density function (PDF) to one with respect to the cumulative distribution function (CDF). Dirac $δ$ singularity of the PDF becomes the discontinuity of the CDF. Then we establish a upwind scheme, which keeps the total probability, is positivity preserving and unconditionally stable. For pure drift, the scheme also keeps the conservation of expectation. It can catch the discontinuous jump of the CDF, then predicts accurately the fixation probability for pure drift with or without natural selection and one-way mutation. For two-way mutation case, it can catch the power law of the singularity. %Moreover, some artificial algorithms or additional boundary criteria is not needed in the numerical simulation. The numerical results show the effectiveness of the scheme.

math.NA↗

arXiv2020

Structure-Preserving Numerical Methods for Nonlinear Fokker--Planck Equations with Nonlocal Interactions by an Energetic Variational Approach

In this work, we develop novel structure-preserving numerical schemes for a class of nonlinear Fokker--Planck equations with nonlocal interactions. Such equations can cover many cases of importance, such as porous medium equations with external potentials, optimal transport problems, and aggregation-diffusion models. Based on the Energetic Variational Approach, a trajectory equation is first derived by using the balance between the maximal dissipation principle and least action principle. By a convex-splitting technique, we propose energy dissipating numerical schemes for the trajectory equation. Rigorous numerical analysis reveals that the nonlinear numerical schemes are uniquely solvable, naturally respect mass conservation and positivity at fully discrete level, and preserve steady states. Under certain smoothness assumptions, the numerical schemes are shown to be second order accurate in space and first order accurate in time. Extensive numerical simulations are performed to demonstrate several valuable features of the proposed schemes. In addition to the preservation of physical structures, such as positivity, mass conservation, discrete energy dissipation, blue and steady states, numerical simulations further reveal that our numerical schemes are capable of solving \emph{degenerate} cases of the Fokker--Planck equations effectively and robustly. It is shown that the developed numerical schemes have convergence order even in degenerate cases with the presence of solutions having compact support, can accurately and robustly compute the waiting time of free boundaries without any oscillation, and can approximate blow-up singularity up to machine precision.

math.NA↗

arXiv2020

A second order accurate numerical scheme for the porous medium equation by an energetic variational approach

The porous medium equation (PME) is a typical nonlinear degenerate parabolic equation. An energetic variational approach has been studied in a recent work [6], in which the trajectory equation is obtained, and a few first order accurate numerical schemes have been developed and analyzed. In this paper, we construct and analyze a second order accurate numerical scheme in both time and space. The unique solvability, energy stability are established, based on the convexity analysis. In addition, we provide a detailed convergence analysis for the proposed numerical scheme. A careful higher order asymptotic expansion is performed and two step error estimates are undertaken. In more details, a rough estimate is needed to control the highly nonlinear term in a discrete $W^{1,\infty}$ norm, and a refined estimate is applied to derive the optimal error order. Some numerical examples are presented as well.

math.NA↗

arXiv2019

Convergence analysis of a numerical scheme for the porous medium equation by an energetic variational approach

The porous medium equation (PME) is a typical nonlinear degenerate parabolic equation. We have studied numerical methods for PME by an energetic variational approach in [C. Duan et al, J. Comput. Phys., 385 (2019) 13-32], where the trajectory equation can be obtained and two numerical schemes have been developed based on different dissipative energy laws. It is also proved that the nonlinear scheme, based on $f \log f$ as the total energy form of the dissipative law, is uniquely solvable on an admissible convex set and preserves the corresponding discrete dissipation law. Moreover, under certain smoothness assumption, we have also obtained the second order convergence in space and the first order convergence in time for the scheme. In this paper, we provide a rigorous proof of the error estimate by a careful higher order asymptotic expansion and two step error estimates. The latter technique contains a rough estimate to control the highly nonlinear term in a discrete $W^{1,\infty}$ norm, and a refined estimate is applied to derive the optimal error order.

math.NA↗

arXiv2018

Numerical methods for Porous Medium Equation by an Energetic Variational Approach

We study numerical methods for porous media equation (PME). There are two important characteristics: the finite speed propagation of the free boundary and the potential waiting time, which make the problem not easy to handle. Based on different dissipative energy laws, we develop two numerical schemes by an energetic variational approach. Firstly, based on $f \log f$ as the total energy form of the dissipative law, we obtain the trajectory equation, and then construct a fully discrete scheme. It is proved that the scheme is uniquely solvable on an admissible convex set by taking the advantage of the singularity of the total energy. Next, based on $\frac{1}{2 f}$ as the total energy form of the dissipation law, we construct a linear numerical scheme for the corresponding trajectory equation. Both schemes preserve the corresponding discrete dissipation law. Meanwhile, under some smoothness assumption, it is proved, by a higher order expansion technique, that both schemes are second-order convergent in space and first-order convergent in time. Each scheme yields a good approximation for the solution and the free boundary. No oscillation is observed for the numerical solution around the free boundary. Furthermore, the waiting time problem could be naturally treated, which has been a well-known difficult issue for all the existence methods. Due to its linear nature, the second scheme is more efficient.

math.NA↗

arXiv2018

Numerical Complete Solution for Random Genetic Drift by Energetic Variational Approach

In this paper, we focus on numerical solutions for random genetic drift problem, which is governed by a degenerated convection-dominated parabolic equation. Due to the fixation phenomenon of genes, Dirac delta singularities will develop at boundary points as time evolves. Based on an energetic variational approach (EnVarA), a balance between the maximal dissipation principle (MDP) and least action principle (LAP), we obtain the trajectory equation. In turn, a numerical scheme is proposed using a convex splitting technique, with the unique solvability (on a convex set) and the energy decay property (in time) justified at a theoretical level. Numerical examples are presented for cases of pure drift and drift with semi-selection. The remarkable advantage of this method is its ability to catch the Dirac delta singularity close to machine precision over any equidistant grid.

math.NA↗