CXCheng Xue

Cheng Xue

*This is an algorithmically generated author record based on publicly available information.

Cheng Xue has a total of 46 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Depth-reduced quantum simulation of Lindbladian dynamics via adaptive variational quantum trajectory compression

    by Huan-Yu Liu, Cheng Xue, Yun-Jie Wang, Xining Zhuang, Chao Wang, Wu Yu-Chun, Zhao-Yun Chen, GuoPing Guo

    Quantum simulation of open quantum systems in the noisy intermediate-scale quantum (NISQ) era is hindered by the non-unitary nature of dissipative dynamics and the limited quantum resources available on near-term quantum processors, namely restricted qubit counts and noise-limited circuit depths. In this work, we propose an efficient quantum algorithm for simulating Lindbladian dynamics on NISQ devices. For open quantum systems with Pauli dissipations, we first derive a compact and stable mixed-unitary adjoint channel that approximates the target dissipative dynamics and enables ancilla-free implementation through trajectory sampling. To further reduce the circuit depth required for implementing the sampled trajectories, we introduce an adaptive variational quantum trajectory compression framework. In this framework, a depth-adaptive parameterized quantum circuit is trained to approximate repeated Trotterized Hamiltonian simulation operators, which are then used to replace repeated unitary segments appearing in the sampled trajectories. Importantly, the training procedure can also be performed without auxiliary qubits. Numerical simulations of the dissipative quantum XY model and the interacting disordered XXZ chain demonstrate the accuracy and reduced execution gate counts of the proposed algorithm. Our results provide a practical route toward ancilla-free and depth-reduced simulation of open quantum systems on near-term quantum hardware.

  • Quantum simulation of non-Hermitian special functions and dynamics via contour-based matrix decomposition

    by Chao Wang, Huan-Yu Liu, Cheng Xue, Xi-Ning Zhuang, Menghan Dou, Zhao-Yun Chen, Guo-Ping Guo

    Simulating non-Hermitian dynamics on quantum computers is often hindered by the decay of success probability and the instability of non-diagonalizable matrices. Here, we present contour-based matrix decomposition (CBMD), a rigorous and versatile quantum functional calculus framework for simulating non-Hermitian matrix functions. By generalizing the matrix Cauchy residue theorem, CBMD decomposes holomorphic non-Hermitian operators into an analytic infinite contour-residue identity, followed by finite truncation with controlled error to yield linear combinations of Hermitian components. For first-order dynamics, CBMD achieves optimal query complexity across all parameters, strictly matching the optimal performance bounds within the linear combination of Hamiltonian simulation paradigm. Beyond first-order systems, the framework naturally generalizes to complex operator functions, including second-order wave dynamics and non-Hermitian special functions such as Bessel and Airy evolutions. Furthermore, CBMD systematically suppresses the asymptotic growth of non-Hermitian components, yielding a significant reduction in the required number of amplitude amplifications compared to the naive scheme of combining monomials via linear combination of unitaries (LCU) after Taylor expansion. Notably, CBMD avoids explicit dependence on matrix diagonalizability, effectively mitigating the long-standing challenges associated with ill-conditioned eigenvectors and Jordan blocks. Our work establishes a systematic matrix calculus that bridges high-performance classical numerics and fault-tolerant quantum algorithms. It should be noted that CBMD inherits standard LCU overheads, and requires the target function to have a bounded growth order on the real axis.


  • Refined criteria for quantum random-access memory error suppression via an efficient large-scale simulator

    by Yun-Jie Wang, Tai-Ping Sun, Xi-Ning Zhuang, Xiao-Fan Xu, Huan-Yu Liu, Cheng Xue, Yu-Chun Wu, Zhao-Yun Chen, Guo-Ping Guo


  • HiMA: Hierarchical quantum microarchitecture for qubit-scaling and quantum process-level parallelism

    by Qi Zhou, Zi-Hao Mei, Han-Qing Shi, Liang-Liang Guo, Xiao-Yan Yang, Yun-Jie Wang, Xiao-Fan Xu, Cheng Xue, Wei-Cheng Kong, Jun-Chao Wang, et al.


  • Data-driven quantum dynamical embedding method for long-term prediction on near-term quantum computers

    by Tai-Ping Sun, Zhao-Yun Chen, Cheng Xue, Huan-Yu Liu, Xi-Ning Zhuang, Yun-Jie Wang, Shi-Xin Ma, Hai-Feng Zhang, Yu-Chun Wu, Guo-Ping Guo

  • Open Access

    Simulation of open quantum systems on universal quantum computers

    by Huan-Yu Liu, Xiaoshui Lin, Zhao-Yun Chen, Cheng Xue, Tai-Ping Sun, Qing-Song Li, Xi-Ning Zhuang, Yun-Jie Wang, Yu-Chun Wu, Ming Gong, et al.

    The rapid development of quantum computers has enabled demonstrations of quantum advantages on various tasks. However, real quantum systems are always dissipative due to their inevitable interaction with the environment, and the resulting non-unitary dynamics make quantum simulation challenging with only unitary quantum gates. In this work, we present an innovative and scalable method to simulate open quantum systems using quantum computers. We define an adjoint density matrix as a counterpart of the true density matrix, which reduces to a mixed-unitary quantum channel and thus can be effectively sampled using quantum computers. This method has several benefits, including no need for auxiliary qubits and noteworthy scalability. Moreover, some long-time properties like steady states and the thermal equilibrium can also be investigated as the adjoint density matrix and the true dissipated one converge to the same state. Finally, we present deployments of this theory in the dissipative quantum XY model for the evolution of correlation and entropy with short-time dynamics and the disordered Heisenberg model for many-body localization with long-time dynamics. This work promotes the study of real-world many-body dynamics with quantum computers, highlighting the potential to demonstrate practical quantum advantages.


  • Open Access

    Catalytic ozonation of bisphenol A by Cu/Mn@γ-Al2O3: Performance evaluation and mechanism insight

    by Zhenhua Cao, Yuhan Long, Peizhen Yang, Wenhao Liu, Cheng Xue, Weiran Wu, Dongfang Liu, Wenli Huang


  • Open Access

    Quantum Encoding and Analysis on Continuous Time Stochastic Process with Financial Applications

    by Xi-Ning Zhuang, Zhao-Yun Chen, Cheng Xue, Yu-Chun Wu, 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.


  • Open Access

    Quantum Encoding and Analysis on Continuous Time Stochastic Process with Financial Applications

    by Xi-Ning Zhuang, Zhao-Yun Chen, Cheng Xue, Yu-Chun Wu, Guo-Ping Guo

    The continuous time stochastic process is a mainstream mathematical instrument modeling the random world with a wide range of applications involving finance, statistics, physics, and time series analysis, while the simulation and analysis of the continuous time stochastic process is a challenging problem for classical computers. In this work, a general framework is established to prepare the path of a continuous time stochastic process in a quantum computer efficiently. The storage and computation resource is exponentially reduced on the key parameter of holding time, as the qubit number and the circuit depth are both optimized via our compressed state preparation method. The desired information, including the path-dependent and history-sensitive information that is essential for financial problems, can be extracted efficiently from the compressed sampling path, and admits a further quadratic speed-up. Moreover, this extraction method is more sensitive to those discontinuous jumps capturing extreme market events. Two applications of option pricing in Merton jump diffusion model and ruin probability computing in the collective risk model are given.

  • Open Access

    Can Variational Quantum Algorithms Demonstrate Quantum Advantages? Time Really Matters

    by Huan-Yu Liu, Zhao-Yun Chen, Tai-Ping Sun, Cheng Xue, Yu-Chun Wu, Guo-Ping Guo

    Applying low-depth quantum neural networks (QNNs), variational quantum algorithms (VQAs) are both promising and challenging in the noisy intermediate-scale quantum (NISQ) era: Despite its remarkable progress, criticisms on the efficiency and feasibility issues never stopped. However, whether VQAs can demonstrate quantum advantages is still undetermined till now, which will be investigated in this paper. First, we will prove that there exists a dependency between the parameter number and the gradient-evaluation cost when training QNNs. Noticing there is no such direct dependency when training classical neural networks with the backpropagation algorithm, we argue that such a dependency limits the scalability of VQAs. Second, we estimate the time for running VQAs in ideal cases, i.e., without considering realistic limitations like noise and reachability. We will show that the ideal time cost easily reaches the order of a 1-year wall time. Third, by comparing with the time cost using classical simulation of quantum circuits, we will show that VQAs can only outperform the classical simulation case when the time cost reaches the scaling of $10^0$-$10^2$ years. Finally, based on the above results, we argue that it would be difficult for VQAs to outperform classical cases in view of time scaling, and therefore, demonstrate quantum advantages, with the current workflow. Since VQAs as well as quantum computing are developing rapidly, this work does not aim to deny the potential of VQAs. The analysis in this paper provides directions for optimizing VQAs, and in the long run, seeking more natural hybrid quantum-classical algorithms would be meaningful.