BEINIT: Avoiding Barren Plateaus in Variational Quantum Algorithms
원문 초록
Barren plateaus are a notorious problem in the optimization of variational quantum algorithms and pose a critical obstacle in the quest for more efficient quantum machine learning algorithms. Many potential reasons for barren plateaus have been identified but few solutions have been proposed to avoid them in practice. Existing solutions are mainly focused on the initialization of unitary gate parameters without taking into account the changes induced by input data. In this paper, we propose an alternative strategy which initializes the parameters of a unitary gate by drawing from a beta distribution. The hyperparameters of the beta distribution are estimated from the data. To further prevent barren plateau during training we add a novel perturbation at every gradient descent step. Taking these ideas together, we empirically show that our proposed framework significantly reduces the possibility of a complex quantum neural network getting stuck in a barren plateau.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
The interplay of robustness and generalization in quantum machine learning
Qiskit Machine Learning: an open-source library for quantum machine learning tasks at scale on quantum hardware and classical simulators
QuXAI: Explainers for Hybrid Quantum Machine Learning Models
Distributed Quantum Neural Networks on Distributed Photonic Quantum Computing
Quorum: Zero-Training Unsupervised Anomaly Detection using Quantum Autoencoders
Fine-Tuning Large Language Models on Quantum Optimization Problems for Circuit Generation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.