Lu Wei

Ms. Lu Wei

orcid

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 August 2025 in Physical Review B
Verified
Journal Article
Closed access
PDF file
LWLu Wei
Lu Wei
ZJZhian Jia
Zhian Jia
YWYufeng Wang
Yufeng Wang
DKDagomir Kaszlikowski
Dagomir Kaszlikowski
HLHaibin Ling
Haibin Ling
The biological basis of human attention has been greatly advanced through the use of nonhuman primates as model organisms. Humans are old world primates, and our visual system is highly similar to other old world primates such as macaque monkeys. Monkeys can be...

11 November 2026 in Preprints.org
Verified
Preprint
Open access
PDF file
LWLu Wei
Lu Wei
YWYufeng Wang
Yufeng Wang
CCChenfeng Cao
Chenfeng Cao
HLHaibin Ling
Haibin Ling
Finite-shot quantum tomography often leaves a posterior over many density matrices compatible with the same measurement record, but fast reconstruction methods collapse this uncertainty to a single state. We frame this setting as amortized posterior sampling and introduce BuresTomFlow, a measurement-conditioned Flow Matching sampler for full-rank density matrices. The method transports base density matrices along Bures-Wasserstein paths on the positive matrix cone, projects the path back to the trace-one state space, and trains the velocity field with a Bures-aligned tangent loss. Thus the sampler is trained in the same fidelity-based geometry used to judge posterior quality. We evaluate BuresTomFlow in dense four-qubit simulations with count, shadow, and mixed measurement records. Against Cholesky, log-density, and generic Riemannian Flow Matching controls at comparable learned-sampler runtime, BuresTomFlow improves Bures distance, credible-ball coverage, and held-out observable prediction. In the main comparison across multiple seeds, mean Bures distance decreases from 0.618 for the Cholesky baseline to 0.367 for BuresTomFlow, and mean coverage error decreases from 0.203 to 0.100. These results show that the value of Bures geometry is not merely enforcing physical states, but producing calibrated posterior uncertainty when finite-record tomography cannot be reduced to one reconstruction.

23 June 2026 in Journal of Imaging
Verified
Journal Article
Open access
PDF file
MRMaqsudur Rahman
Maqsudur Rahman
RLRui Liu
Rui Liu
AMANUP MAJUMDER
ANUP MAJUMDER
PPPintu Chandra Paul
Pintu Chandra Paul
KMKangtong Mo
Kangtong Mo
JZJun Zhuang
Jun Zhuang
Barren plateaus (BPs) pose a major trainability challenge for quantum neural networks (QNNs) by causing gradients to concentrate near zero as circuit size, depth, or expressibility increases. This study presents a comparative benchmark of 10 BP mitigation strategies across six qubit settings (2, 4, 8, 12, 16, and 20) and three datasets of increasing complexity: Iris, MNIST, and MedMNIST. The evaluated methods include eight initialization-based strategies (Beta, Gaussian, Uniform Norm, CNN-based initialization, He-normal, He-uniform, Xavier-normal, and Xavier-uniform), one model-based variational encoder, and one optimization-based time-nonlocal Fourier parameterization. Experiments were implemented using PennyLane 3.10 and PyTorch 2.5 with simulator backends. We evaluate trainability using gradient variance and training loss, and we clarify that the benchmark analyzes simulated QNN optimization behavior rather than hardware-noise-resilient or noisy-label learning. Across the tested two-layer circuit configurations, the mitigation strategies maintained measurable gradient variance and stable loss reduction, suggesting that severe barren plateau behavior was not observed under the benchmark conditions. CNN-based and Beta initialization showed strong empirical behavior in variance retention and convergence speed, while Gaussian initialization was comparatively weaker in higher-dimensional settings. The study provides a reproducible benchmark structure for comparing BP mitigation behavior and identifies important limitations related to circuit depth, hardware noise, feature encoding, and classification performance that should be addressed in future QNN benchmarking.