XZXin Zhang

Xin Zhang

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Xin Zhang has a total of 39 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Low‐Measurement‐Complexity Variational Quantum Poisson Equation Solver and its Application in Heat Conduction Problems

    by Xin Zhang, Yuexian Hou

    Heat conduction problems in chips, engines, and batteries are often formulated as Poisson equations and solved using classical algorithms such as Cholesky decomposition and SuperLU. However, large‐scale systems require significant resources and computation time. We enhance a Variational Quantum Linear Solver‐based solver by introducing a hybrid Pauli–computational basis for matrix expansion, which requires only m+1 circuit measurement without additional ansatz circuits or ancilla qubits, reducing complexity and improving suitability for noisy intermediate‐scale quantum devices. A quantum–classical hybrid framework based on domain decomposition is also proposed, assigning quantum solvers to speed‐critical subdomains and classical methods to high‐accuracy regions. Simulations on Qiskit for a Chip‐on‐Board Light‐Emitting Diode heat conduction problem achieve 99.9197% fidelity and 0.09764 overall error. Finally, this paper compares the proposed method with classical solvers, particularly sparse LU factorization, in terms of algorithmic complexity, memory consumption, and related computational costs. In addition, the impact of noise on solution fidelity is analyzed, together with corresponding noise mitigation strategies.

  • Open Access

    LFQAP2: Large‐Scale Quantum Artificial Intelligence Training Platform Based on Supercomputing

    by Xin Zhang, Xiaoyu Li, Lianfu Wei, Qinsheng Zhu, Geng Chen, Wenjie Sun, Lianhui Yu, Yuexian Hou

    Quantum artificial intelligence (QAI) has made significant progress in recent years. However, the lack of platforms for large‐scale QAI models training has constrained research on related algorithms, such as quantum large language models. In this paper, we introduce LFQAP2, a supercomputing‐based platform designed for training large‐scale QAI models. The platform employs a hybrid parallelization strategy that integrates data parallelism and model parallelism. For data parallelism, different threads compute the loss for distinct sample batches. For model parallelism, different processes compute the gradients for separate parameter batches. This parallelization strategy integrates the strengths of both data parallelism and model parallelism. It has high node‐internal computing efficiency and excellent scalability, and can reduce internode communication overhead, limiting it to the exchange of only a small number of floating‐point values. LFQAP2 is implemented using the MPI + OpenMP parallel programming model and deployed on a 16‐node cluster, where each node is equipped with 32 computing cores. To assess the platform’s efficiency, we evaluate its performance on two types of tasks: image recognition (MNIST dataset classification) and natural language processing (word embedding). For the 16‐qubit MNIST classification task with 128 trainable parameters, the 32‐thread acceleration efficiency reaches 0.852, while the 16‐node multiprocess acceleration efficiency is 0.357. For the 9‐qubit word embedding task with 288 trainable parameters, the 32‐thread acceleration efficiency also reaches 0.843, and the 16‐node multiprocess acceleration efficiency is 0.598. We successfully completed the training of a 288‐parameter model within 23 min, providing a robust computational platform to support research on large‐scale quantum models.

  • Open Access

    LFQAP: A Lightweight and Flexible Quantum Artificial Intelligence Application Platform

    by Xin Zhang, Xiaoyu Li, Yuexian Hou

    Quantum artificial intelligence (AI) is one of the critical research domains in the field of quantum computing and holds significant potential for practical applications in the near future. A quantum AI software platform serves as a fundamental infrastructure for advancing research and facilitating applications in this area. Such a platform supports essential tasks including quantum AI model training, inference, and the deployment of diverse applications. The current quantum AI software platforms prioritize comprehensive functionality; however, they often lack scalability, making it challenging to integrate new features flexibly. Given the broad and evolving research landscape of quantum AI algorithms, it is crucial to develop a software framework that is both user‐friendly and capable of autonomous functional extension. In this paper, we present a lightweight, scalable, and open‐source quantum AI platform designed to support the training and inference of variational quantum algorithms. This platform employs a hierarchical and structured architecture, enhancing the overall manageability and modularity of the software. Notably, it exhibits improved scalability, incorporating a compiler module for the first time. This module enables support for user‐defined quantum devices, including both real physical quantum computers and quantum circuit simulators, as well as custom‐defined optimizers. The platform integrates both tensor network simulator and full‐amplitude simulator, providing powerful ability for quantum AI research. Utilizing these simulators, we conducted training experiments on three publicly available datasets and compared the results with TensorFlow Quantum. The experimental results validate the reliability and effectiveness of our platform, demonstrating its potential as a powerful tool for quantum AI applications.


  • Open Access

    Study on The Effect of Encoding Method in Quantum Machine Learning

    by Qingqing Xiong, Jinzhe Jiang, Chen Li, Xin Zhang, Yaqian Zhao

    Quantum machine learning algorithms use qubit encoding and quantum circuits to perform feature extraction and pattern recognition. However, the choice of data encoding methods can have a significant impact on the model’s performance. To evaluate the effect of different encoding methods in a systematic way, we propose two metrics: distribution distance and distribution radius. These metrics describe how the encoded data distribute in the Hilbert space. We show that there is a positive correlation between prediction accuracy and distribution distance, and a negative correlation between prediction accuracy and distribution radius, both theoretically and experimentally. Based on our findings, we suggest a comparative evaluation of data encoding methods for quantum machine learning, which can help improve the learning efficiency.

  • Strong generalization in quantum neural networks

    by Jinzhe Jiang, Yaqian Zhao, Rengang Li, Chen Li, Zhenhua Guo, Baoyu Fan, Xuelei Li, Ruyang Li, Xin Zhang


  • Towards Interpreting Computer Vision Based on Transformation Invariant Optimization

    by Chen Li, Jinzhe Jiang, Xin Zhang, Tonghuan Zhang, Yaqian Zhao, Dongdong Jiang, Rengang Li

  • Simulation of quantum computing on classical supercomputers with tensor-network edge cutting

    by Ya-Qian Zhao, Ren-Gang Li, Jin-Zhe Jiang, Chen Li, Hong-Zhen Li, En-Dong Wang, Wei-Feng Gong, Xin Zhang, Zhi-Qiang Wei

    Simulation of quantum computing on supercomputers is a significant research topic, which plays a vital role in quantum algorithm verification, error-tolerant verification, and other applications. Tensor-network contraction based on density matrix is an important single-amplitude simulation strategy, but it is hard to execute on the distributed computing systems. In this paper, we studied the problem in detail, and propose a scheme based on cutting edges of undirected graphs. This scheme cuts edges of undirected graphs with large tree width to obtain many undirected subgraphs with small tree width, and these subgraphs contracted on different computing cores. The contraction results of slave cores are summarized in the master node, which is consistent with the original tensor-network contraction. Thus, we can simulate the larger scale quantum circuit than single core. Moreover, it is an NP-hard problem to find the global optimum cutting edges, and we propose a search strategy based on a heuristic algorithm to approach it. In order to verify the effectiveness of our scheme, we conduct tests based on the quantum approximation optimization algorithm (QAOA) and Shor's algorithm, and it can simulate a 120-qubit three-regular QAOA algorithm on a 4096-core supercomputer, which greatly exceeds the simulation scale on a single core of 100 qubits.


  • Open Access

    Genetic Algorithm based hyper-parameters optimization for transfer Convolutional Neural Network

    by Chen Li, JinZhe Jiang, YaQian Zhao, RenGang Li, EnDong Wang, Xin Zhang, Kun Zhao

    Hyperparameter optimization is a challenging problem in developing deep neural networks. Decision of transfer layers and trainable layers is a major task for design of the transfer convolutional neural networks (CNN). Conventional transfer CNN models are usually manually designed based on intuition. In this paper, a genetic algorithm is applied to select trainable layers of the transfer model. The filter criterion is constructed by accuracy and the counts of the trainable layers. The results show that the method is competent in this task. The system will converge with a precision of 97% in the classification of Cats and Dogs datasets, in no more than 15 generations. Moreover, backward inference according the results of the genetic algorithm shows that our method can capture the gradient features in network layers, which plays a part on understanding of the transfer AI models.


  • Open Access

    Simulation of Quantum Computing on Classical Supercomputers

    by Ya-Qian Zhao, Ren-Gang Li, Jin-Zhe Jiang, Chen Li, Hong-Zhen Li, En-Dong Wang, Wei-Feng Gong, Xin Zhang, Zhi-Qiang Wei

    Simulation of quantum computing on supercomputers is a significant research topic, which plays a vital role in quantum algorithm verification, error-tolerant verification and other applications. Tensor network contraction based on density matrix is an important single-amplitude simulation strategy, but it is hard to execute on the distributed computing systems currently. In this paper, we dive deep into this problem, and propose a scheme based on cutting edges of undirected graphs. This scheme cuts edges of undirected graphs with large tree width to obtain many undirected subgraphs with small tree width, and these subgraphs contracted on different computing cores. The contraction results of slave cores are summarized in the master node, which is consistent with the original tensor network contraction. Thus, we can simulate the larger scale quantum circuit than single core. Moreover, it's an NP-hard problem to find the global optimum cutting edges, and we propose a search strategy based on a heuristic algorithm to approach it. In order to verify the effectiveness of our scheme, we conduct tests based on QAOA algorithm, and it can simulate 120-qubit 3-regular QAOA algorithm on 4096-core supercomputer, which greatly exceeds the simulation scale on a single core of 100-qubit.