Pengyu Zhou

Pengyu Zhou

Auto-generated profile, based on publicly available information

Pengyu Zhou

Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
11 November 2023
Verified
Conference Paper
Open access
YWYangjun Wu
Yangjun Wu
CGChu Guo
Chu Guo
YFYi Fan
Yi Fan
PZPengyu Zhou
Pengyu Zhou
HSHonghui Shang
Honghui Shang
Neural network quantum state (NNQS) has emerged as a promising candidate for quantum many-body problems, but its practical applications are often hindered by the high cost of sampling and local energy calculation. We develop a high-performance NNQS method for ab initio electronic structure calculations. The major innovations include: (1) A transformer based architecture as the quantum wave function ansatz; (2) A data-centric parallelization scheme for the variational Monte Carlo (VMC) algorithm which preserves data locality and well adapts for different computing architectures; (3) A parallel batch sampling strategy which reduces the sampling cost and achieves good load balance; (4) A parallel local energy evaluation scheme which is both memory and computationally efficient; (5) Study of real chemical systems demonstrates both the superior accuracy of our method compared to state-of-the-art and the strong and weak scalability for large molecular systems with up to 120 spin orbitals.


5 November 2024 in Physica Scripta
Verified
Journal Article
Closed access
PZPengyu Zhou
Pengyu Zhou
HSHonghui Shang
Honghui Shang
Quantum computing in the noisy intermediate-scale quantum (NISQ) era has foregrounded the importance of Variational Quantum algorithms (VQAs). These algorithms are crucial for addressing complex quantum mechanical problems that challenge classical computers. One such problem is the electron-phonon (e-ph) interaction, which is essential for determining the zero-point renormalization (ZPR) of electronic structure properties. The calculation of ZPR of fundamental gap relies on the accurate computation of ionization potential (IP) and electron affinity (EA) energy levels in molecular systems, where the VQAs offer the promising solutions. Despite the critical importance of IP, EA energies and ZPR in quantum chemistry calculations, research into the application of quantum algorithms for these calculations remains limited. To address these challenges, we propose two quantum algorithms for ZPR of fundamental gap calculation using Variational Quantum Deflation (VQD) and Quantum equation of Motion (QEOM) algorithm for several molecular systems. This work opens up new possibilities for the accurate and efficient study of e-ph interaction in electronic structure calculations, even with NISQ-era hardware.

13 July 2026
Verified
Conference Paper
Open access
DSDaran Sun
Daran Sun
BKBowen Kan
Bowen Kan
HLHaoquan Long
Haoquan Long
HZHairui Zhao
Hairui Zhao
HLHaoxu Li
Haoxu Li
GTGuangming Tan
Guangming Tan
AI-driven methods have demonstrated considerable success in tackling the central challenge of accurately solving the Schrödinger equation for complex many-body systems. Among neural network quantum state (NNQS) approaches, the NNQS-SCI (Selected Configuration Interaction) method stands out as a state-of-the-art technique, recognized for its high accuracy and scalability. However, its application to larger systems is severely constrained by a hybrid CPU-GPU architecture. Specifically, centralized CPU-based global de-duplication creates a severe scalability barrier due to communication bottlenecks, while host-resident coupled-configuration generation induces prohibitive computational overheads. We introduce QiankunNet-cuSCI, a fully GPU-accelerated SCI framework designed to overcome these bottlenecks. It first integrates a distributed, load-balanced global de-duplication algorithm to minimize redundancy and communication overhead at scale. To address compute limitations, it employs specialized, fine-grained CUDA kernels for exact coupled configuration generation. Finally, to break the single-GPU memory barrier exposed by this full acceleration, it incorporates a GPU memory-centric runtime featuring GPU-side pooling, streaming mini-batches, and overlapped offloading. This design enables much larger configuration spaces and shifts the bottleneck from host-side limitations back to on-device inference. Our evaluation demonstrates that our work fundamentally expands the scale of solvable problems. On an NVIDIA A100 cluster with 64 GPUs, our work achieves up to 2.32 × end-to-end speedup over the highly-optimized NNQS-SCI baseline while preserving the same chemical accuracy. Furthermore, it demonstrates excellent distributed performance, maintaining over 90% parallel efficiency in strong scaling tests.