Cheng Xue

Cheng Xue

Auto-generated profile, based on publicly available information

Cheng Xue

Hefei Comprehensive National Science Center

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
1 December 2021 in New Journal of Physics
Verified
Journal Article
Open access
PDF file
CXCheng Xue
Cheng Xue
YWYu-Chun Wu
Yu-Chun Wu
GGGuo-Ping Guo
Guo-Ping Guo
While quantum computing provides an exponential advantage in solving linear differential equations, there are relatively few quantum algorithms for solving nonlinear differential equations. In our work, based on the homotopy perturbation method, we propose a quantum algorithm for solving n-dimensional nonlinear dissipative ordinary differential equations (ODEs). Our algorithm first converts the original nonlinear ODEs into the other nonlinear ODEs which can be embedded into finite-dimensional linear ODEs. Then we solve the embedded linear ODEs with quantum linear ODEs algorithm and obtain a state ϵ-close to the normalized exact solution of the original nonlinear ODEs with success probability Ω(1). The complexity of our algorithm is O(gηT poly(log(nT/ϵ))), where η, g measure the decay of the solution. Our algorithm provides exponential improvement over the best classical algorithms or previous quantum algorithms in n or ϵ.

31 March 2022 in Quantum Information Processing
Verified
Journal Article
Closed access
PDF file
ZCZhao-Yun Chen
Zhao-Yun Chen
CXCheng Xue
Cheng Xue
SCSi-Ming Chen
Si-Ming Chen
BLBing-Han Lu
Bing-Han Lu
YWYu-Chun Wu
Yu-Chun Wu
GGGuo-Ping Guo
Guo-Ping Guo

27 October 2023 in Journal of Environmental Management
Verified
Journal Article
Open access
ZCZhenhua Cao
Zhenhua Cao
YLYuhan Long
Yuhan Long
PYPeizhen Yang
Peizhen Yang
WLWenhao Liu
Wenhao Liu
CXCheng Xue
Cheng Xue
WHWenli Huang
Wenli Huang
Herein, an alumina-based bimetallic catalyst (Cu1Mn7@γ-Al2O3) was synthesized for bisphenol A (BPA) degradation in the catalytic ozonation process. The catalytic ozonation system could degrade 93.9% of BPA within 30 min under the conditions of pH = 7.0, 10 mg L-1 O3 concentration, and 24 g L-1 catalyst dosage compared to ozone alone (21.0%). The enhanced BPA degradation efficiency was attributed to the abundant catalytic sites and synergistic effects of Cu and Mn. The results revealed that the synergistic interaction between Cu and Mn effectively accelerated the electron transfer process on the catalyst surface, thus promoting the generation of reactive oxygen species (ROS). Further studies indicated that the BPA degradation in Cu1Mn7@γ-Al2O3/O3 system predominantly followed the ·OH and O2·- oxidation pathway. Based on the density functional theory (DFT) calculations and intermediates detected by LC-MS analysis, two pathways for BPA degradation in the Cu1Mn7@γ-Al2O3/O3 system were proposed. The toxicity estimation illustrated that the toxicity of BPA and its byproducts was effectively reduced in the Cu1Mn7@γ-Al2O3/O3 system. This work provides a new protocol for O3 activation and pollutant elimination through a novel bimetallic catalyst during water purification.

22 September 2022 in Physical Review A
Verified
Journal Article
Closed access
PDF file
CXCheng Xue
Cheng Xue
XXXiao-Fan Xu
Xiao-Fan Xu
YWYu-Chun Wu
Yu-Chun Wu
GGGuo-Ping Guo
Guo-Ping Guo
Solving a quadratic nonlinear system of equations (QNSE) is a fundamental, but important, task in nonlinear science. We propose an efficient quantum algorithm for solving n-dimensional QNSE. Our algorithm embeds QNSE into a finite-dimensional system of linear equations using the homotopy perturbation method and a linearization technique; then we solve the linear equations with a quantum linear system solver and obtain a state which is ε-close to the normalized exact solution of the QNSE with success probability Ω(1). The complexity of our algorithm is O(polylog(n/ε)), which provides an exponential improvement over the optimal classical algorithm in dimension n, and the dependence on ε is almost optimal. Therefore, our algorithm exponentially accelerates the solution of QNSE and has wide applications in all kinds of nonlinear problems, contributing to the research progress of nonlinear science.

3 October 2023 in Quantum
Verified
Journal Article
Open access
PDF file
XZXi-Ning Zhuang
Xi-Ning Zhuang
ZCZhao-Yun Chen
Zhao-Yun Chen
CXCheng Xue
Cheng Xue
YWYu-Chun Wu
Yu-Chun Wu
GGGuo-Ping Guo
Guo-Ping Guo
Modeling stochastic phenomena in continuous time is an essential yet challenging problem. Analytic solutions are often unavailable, and numerical methods can be prohibitively time-consuming and computationally expensive. To address this issue, we propose an algorithmic framework tailored for quantum continuous time stochastic processes. This framework consists of two key procedures: data preparation and information extraction. The data preparation procedure is specifically designed to encode and compress information, resulting in a significant reduction in both space and time complexities. This reduction is exponential with respect to a crucial feature parameter of the stochastic process. Additionally, it can serve as a submodule for other quantum algorithms, mitigating the common data input bottleneck. The information extraction procedure is designed to decode and process compressed information with quadratic acceleration, extending the quantum-enhanced Monte Carlo method. The framework demonstrates versatility and flexibility, finding applications in statistics, physics, time series analysis and finance. Illustrative examples include option pricing in the Merton Jump Diffusion Model and ruin probability computing in the Collective Risk Model, showcasing the framework’s ability to capture extreme market events and incorporate history-dependent information. Overall, this quantum algorithmic framework provides a powerful tool for accurate analysis and enhanced understanding of stochastic phenomena.

1 January 2023 in Intelligent Computing
Verified
Journal Article
Closed access
CXCheng Xue
Cheng Xue
ZCZhao-Yun Chen
Zhao-Yun Chen
TSTai-Ping Sun
Tai-Ping Sun
XXXiao-Fan Xu
Xiao-Fan Xu
SCSi-Ming Chen
Si-Ming Chen
GGGuo-Ping Guo
Guo-Ping Guo
The dynamic mode decomposition (DMD) algorithm is a widely used factorization and dimensionality reduction technique in time series analysis. When analyzing high-dimensional time series, the DMD algorithm requires extremely large amounts of computational power. To accelerate the DMD algorithm, we propose a quantum-classical hybrid algorithm that we call the quantum dynamic mode decomposition (QDMD) algorithm. Given a time series X ∈ R n  × ( m  + 1) with n ≫ m , the QDMD algorithm first executes quantum singular value decomposition on a matrix related to X and obtains a quantum state containing the main singular values and singular vectors of the decomposed matrix, then performs a low-sampling-frequency process on the obtained quantum state and computes the low-dimensional projection of the DMD operator through the sampling results. Finally, the algorithm computes the DMD eigenvalues and prepares the amplitude-encoding states of the DMD modes using the obtained classical information and X . Considering the main variables, the complexity of the QDMD algorithm is O ~ M m polylog n / ϵ , where M = O ~ m 3 / ϵ 2 denotes the number of samples. Compared with the classical DMD algorithm, which has complexity O ~ n m 2 log 1 / ϵ , the QDMD algorithm provides an exponential acceleration of n , at the cost of greater dependence on M and ϵ . We test the effects of M on the QDMD algorithm in the specific application scenarios of data denoising, scene background extraction, and fluid dynamics analysis. We determined that the QDMD algorithm requires only a small number of samples M in specific applications, further demonstrating the quantum advantage of the QDMD algorithm in high-dimensional data analysis.