Geng Chen
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
Research Subjects
Geng Chen has a total of 31 co-authors. Here are the top co-authors by number of shared publications:
- Lianhui Yu
The School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, Sichuan, China
4 shared publications - Xiaoyu Li
School of Information and Software Engineering, University of Electronic Science and Technology of China, Chengdu, China
4 shared publications - Wenjie Sun
The School of Electronic Science and Engineering, University of Electronic Science and Technology of China, Chengdu, Sichuan, China
3 shared publications - Jiale Zhang
College of Computer Science and Technology, Jilin University, Changchun, Jilin, China
2 shared publications - Qin-Sheng Zhu
Univ Elect Sci & Technol China, Sch Phys, Chengdu 610054, Peoples R China
2 shared publications - Zhigang Wang
School of Electronic Science and Engineering, University of Electronic Science and Technology of China, Chengdu, China
2 shared publications
Latest Publications
- Open Access
- 27 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 167-174
A Structure-Aware Homotopy Continuation Method for Finding Bifurcation Points in Ising Optimization
Combinatorial optimization problems like Ising and HUBO models are pivotal yet often solved by opaque heuristic algorithms. We propose a novel homotopy-based quantum-inspired algorithm to explicitly calculate and visualize bifurcation points in the optimization landscape. Utilizing arc-length continuation and Jacobian singularity detection, our method traces solution paths and switches branches to explore lower-energy regions. We demonstrate this framework on large-scale HUBO instances (> 1000 nodes), visualizing solution evolution via bifurcation diagrams and Principal Component Analysis (PCA) trajectories. Results identify critical phase transitions around the homotopy parameter p ≈ 0.18 and reveal U-shaped path topologies indicative of bypassing energy barriers. This approach not only ensures high-performance solving but also serves as a powerful analytical tool for unveiling the topological structure of complex energy landscapes.
- 27 March 2026
- Published by Association for Computing Machinery (ACM)
- p. 167-174
Open AccessA Structure-Aware Homotopy Continuation Method for Finding Bifurcation Points in Ising Optimization
Combinatorial optimization problems like Ising and HUBO models are pivotal yet often solved by opaque heuristic algorithms. We propose a novel homotopy-based quantum-inspired algorithm to explicitly calculate and visualize bifurcation points in the optimization landscape. Utilizing arc-length continuation and Jacobian singularity detection, our method traces solution paths and switches branches to explore lower-energy regions. We demonstrate this framework on large-scale HUBO instances (> 1000 nodes), visualizing solution evolution via bifurcation diagrams and Principal Component Analysis (PCA) trajectories. Results identify critical phase transitions around the homotopy parameter p ≈ 0.18 and reveal U-shaped path topologies indicative of bypassing energy barriers. This approach not only ensures high-performance solving but also serves as a powerful analytical tool for unveiling the topological structure of complex energy landscapes.
- 21 November 2025
- Published by Elsevier in Applied Soft Computing
- Vol. 187
Design and implementation of run-length encoding on quantum computers for resource-efficient data representation
- 21 November 2025
- Published by Elsevier in Applied Soft Computing
- Vol. 187
Design and implementation of run-length encoding on quantum computers for resource-efficient data representation
- 22 May 2025
- Published by Elsevier in Future Generation Computer Systems
- Vol. 173
MLQM: Machine learning approach for accelerating optimal qubit mapping
- 22 May 2025
- Published by Elsevier in Future Generation Computer Systems
- Vol. 173
MLQM: Machine learning approach for accelerating optimal qubit mapping
- Open Access
- 1 January 2025
- Published by Wiley in Quantum Engineering
- Vol. 2025 (1)
LFQAP2: Large‐Scale Quantum Artificial Intelligence Training Platform Based on Supercomputing
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.
- 1 January 2025
- Published by Wiley in Quantum Engineering
- Vol. 2025 (1)
Open AccessLFQAP2: Large‐Scale Quantum Artificial Intelligence Training Platform Based on Supercomputing
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
- 13 September 2024
- Published by Association for Computing Machinery (ACM)
- p. 601-608
Generator and training technique in quantum generative adversarial networks
Parameterized quantum circuits play an essential role in the performance of many variational hybrid quantum-classical (HQC) algorithms. One challenge in implementing such algorithms is to choose an effective circuit that well represents the solution space while maintaining a low circuit depth and number of parameters. In this paper, we delve into the influence of utilizing quantum circuits with different types, depths, and widths in the Quantum Generative Adversarial Network (QGAN) generator on its overall performance. Our findings reveal that employing parametric two-qubit gates in the QGAN generator slightly outperforms the use of fixed-parameter two-qubit gates. Additionally, as the number of quantum circuit layers increases (i.e., the circuit depth), the performance of the QGAN generator improves, though there exists ’saturation’ where further layer addition leads to a decline in performance. Furthermore, considering the number of qubits available for the QGAN generator to accomplish the generation task, we observe a gradual decline in QGAN's performance as the number of ancillary qubits (i.e., circuit width) increases, though it still outperforms the scenario without auxiliary qubits. Additionally, we introduce the Unrolled QGAN model, which incorporates the Unrolled training technique to improve the performance of QGAN. Our experimental results demonstrate that this technique effectively enhances the performance of the QGAN.
- 13 September 2024
- Published by Association for Computing Machinery (ACM)
- p. 601-608
Open AccessGenerator and training technique in quantum generative adversarial networks
Parameterized quantum circuits play an essential role in the performance of many variational hybrid quantum-classical (HQC) algorithms. One challenge in implementing such algorithms is to choose an effective circuit that well represents the solution space while maintaining a low circuit depth and number of parameters. In this paper, we delve into the influence of utilizing quantum circuits with different types, depths, and widths in the Quantum Generative Adversarial Network (QGAN) generator on its overall performance. Our findings reveal that employing parametric two-qubit gates in the QGAN generator slightly outperforms the use of fixed-parameter two-qubit gates. Additionally, as the number of quantum circuit layers increases (i.e., the circuit depth), the performance of the QGAN generator improves, though there exists ’saturation’ where further layer addition leads to a decline in performance. Furthermore, considering the number of qubits available for the QGAN generator to accomplish the generation task, we observe a gradual decline in QGAN's performance as the number of ancillary qubits (i.e., circuit width) increases, though it still outperforms the scenario without auxiliary qubits. Additionally, we introduce the Unrolled QGAN model, which incorporates the Unrolled training technique to improve the performance of QGAN. Our experimental results demonstrate that this technique effectively enhances the performance of the QGAN.
- 22 August 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 258
QUSL: Quantum unsupervised image similarity learning with enhanced performance
- 22 August 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 258
QUSL: Quantum unsupervised image similarity learning with enhanced performance
- 14 February 2023
- Published by AIP Publishing in Journal of Applied Physics
- Vol. 133 (6) , 064402
Quantum identity authentication protocol based on flexible quantum homomorphic encryption with qubit rotation
Quantum identity authentication (QIA) ensures that entities of quantum communication will not be impersonated by attackers. As an auxiliary protocol, an ideal QIA protocol cannot take up too many quantum resources and needs to be embedded in the original protocol to enhance security. In this paper, we propose a flexible ternary quantum homomorphic encryption (QHE) protocol using qubit rotation and indicate that the QHE framework can be used to design QIA protocols. The ternary QIA protocol based on QHE can be embedded in the original protocol because both protocols use the same quantum resources. The proposed protocol uses different vouchers from previous protocols, allowing it to prevent various types of attacks and performs well in terms of communication efficiency. The QHE framework can benefit other quantum cryptographic fields.
- 14 February 2023
- Published by AIP Publishing in Journal of Applied Physics
- Vol. 133 (6) , 064402
Quantum identity authentication protocol based on flexible quantum homomorphic encryption with qubit rotation
Quantum identity authentication (QIA) ensures that entities of quantum communication will not be impersonated by attackers. As an auxiliary protocol, an ideal QIA protocol cannot take up too many quantum resources and needs to be embedded in the original protocol to enhance security. In this paper, we propose a flexible ternary quantum homomorphic encryption (QHE) protocol using qubit rotation and indicate that the QHE framework can be used to design QIA protocols. The ternary QIA protocol based on QHE can be embedded in the original protocol because both protocols use the same quantum resources. The proposed protocol uses different vouchers from previous protocols, allowing it to prevent various types of attacks and performs well in terms of communication efficiency. The QHE framework can benefit other quantum cryptographic fields.