Geng Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Geng Liu has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Xin Wang
Hong Kong University of Science and Technology
2 shared publications Hao-Kai Zhang
Institute for Quantum Computing, Baidu Research, Beijing, China
1 shared publication- Hongbin Ren
Baidu Research
1 shared publication - Jiaxin Huang
Institute for Quantum Computing, Baidu Research, Beijing, China
1 shared publication - Mingrui Jing
The Hong Kong University of Science and Technology (Guangzhou)
1 shared publication - Xia Liu
Thrust of Artificial Intelligence, Information Hub, The Hong Kong University of Science and Technology (Guangzhou), Guangdong, China
1 shared publication
Latest Publications
- 18 June 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 109 (6) , 062425
Quantum sequential scattering model for quantum state learning
Learning probability distribution is an essential framework in classical learning theory. As a counterpart, quantum state learning has spurred the exploration of quantum machine learning theory. However, as dimensionality increases, learning a high-dimensional unknown quantum state via conventional quantum neural network approaches remains challenging due to trainability issues. In this work we devise the quantum sequential scattering model, inspired by the classical diffusion model, to overcome this scalability issue. Training of our model could effectively circumvent the vanishing gradient problem for a large class of high-dimensional target states possessing polynomial-scaled Schmidt ranks. Theoretical analysis and numerical experiments provide evidence for our model's effectiveness in learning both physically and algorithmically meaningful quantum states and outperform the conventional approaches in training speed and learning accuracy. Our work indicates that an increasing entanglement (a property of quantum states) in the target states necessitates a larger-scaled model, which could reduce our model's learning performance and efficiency.
- 18 June 2024
- Published by American Physical Society (APS) in Physical Review A
- Vol. 109 (6) , 062425
Quantum sequential scattering model for quantum state learning
Learning probability distribution is an essential framework in classical learning theory. As a counterpart, quantum state learning has spurred the exploration of quantum machine learning theory. However, as dimensionality increases, learning a high-dimensional unknown quantum state via conventional quantum neural network approaches remains challenging due to trainability issues. In this work we devise the quantum sequential scattering model, inspired by the classical diffusion model, to overcome this scalability issue. Training of our model could effectively circumvent the vanishing gradient problem for a large class of high-dimensional target states possessing polynomial-scaled Schmidt ranks. Theoretical analysis and numerical experiments provide evidence for our model's effectiveness in learning both physically and algorithmically meaningful quantum states and outperform the conventional approaches in training speed and learning accuracy. Our work indicates that an increasing entanglement (a property of quantum states) in the target states necessitates a larger-scaled model, which could reduce our model's learning performance and efficiency.
- Open Access
- 29 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 5, 1-19
Mitigating Barren Plateaus of Variational Quantum Eigensolvers
Variational quantum algorithms (VQAs) are expected to establish valuable applications on near-term quantum computers. However, recent works have pointed out that the performance of VQAs greatly relies on the expressibility of the ansatzes and is seriously limited by optimization issues such as barren plateaus (i.e., vanishing gradients). This work proposes the state efficient ansatz (SEA) for accurate ground state preparation with improved trainability. We show that the SEA can generate an arbitrary pure state with much fewer parameters than a universal ansatz, making it efficient for tasks like ground state estimation. Then, we prove that barren plateaus can be efficiently mitigated by the SEA and the trainability can be further improved most quadratically by flexibly adjusting the entangling capability of the SEA. Finally, we investigate a plethora of examples in ground state estimation where we obtain significant improvements in the magnitude of the cost gradient and the convergence speed.
- 29 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 5, 1-19
Open AccessMitigating Barren Plateaus of Variational Quantum Eigensolvers
Variational quantum algorithms (VQAs) are expected to establish valuable applications on near-term quantum computers. However, recent works have pointed out that the performance of VQAs greatly relies on the expressibility of the ansatzes and is seriously limited by optimization issues such as barren plateaus (i.e., vanishing gradients). This work proposes the state efficient ansatz (SEA) for accurate ground state preparation with improved trainability. We show that the SEA can generate an arbitrary pure state with much fewer parameters than a universal ansatz, making it efficient for tasks like ground state estimation. Then, we prove that barren plateaus can be efficiently mitigated by the SEA and the trainability can be further improved most quadratically by flexibly adjusting the entangling capability of the SEA. Finally, we investigate a plethora of examples in ground state estimation where we obtain significant improvements in the magnitude of the cost gradient and the convergence speed.