Training variational quantum algorithms with random gate activation
Shuo Liu, Shi-Xin Zhang, Shao-Kai Jian, Hong Yao

TL;DR
This paper introduces a novel training algorithm for variational quantum algorithms that uses random gate activation to mitigate barren plateaus, escape local minima, and improve noise resilience, leading to better performance in quantum simulations.
Contribution
The paper proposes a new random gate activation training method for VQAs that reduces parameters, mitigates barren plateaus, and enhances optimization success.
Findings
Effective mitigation of barren plateaus.
Improved ability to escape local minima.
Enhanced noise resilience and resource efficiency.
Abstract
Variational quantum algorithms (VQAs) hold great potentials for near-term applications and are promising to achieve quantum advantage on practical tasks. However, VQAs suffer from severe barren plateau problem as well as have a large probability of being trapped in local minima. In this Letter, we propose a novel training algorithm with random quantum gate activation for VQAs to efficiently address these two issues. This new algorithm processes effectively much fewer training parameters than the conventional plain optimization strategy, which efficiently mitigates barren plateaus with the same expressive capability. Additionally, by randomly adding two-qubit gates to the circuit ansatz, the optimization trajectories can escape from local minima and reach the global minimum more frequently due to more sources of randomness. In real quantum experiments, the new training algorithm can also…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Neural Networks and Reservoir Computing · Quantum Information and Cryptography
