arXiv (Cornell University) · 2020 · 44 citations · 28 references
ComputingComputer ScienceMachine LearningQuantum ComputingQuantum MechanicsQuantum AlgorithmsQuantum BitsQuantum ComputationQuantum Machine LearningAccuracyBinary ClassificationQuantum Machine Learning AlgorithmsQuantum Neural NetworksTensor Network SimulationTrainingVanishing Gradient Problem
Quantum Neural Networks (QNNs) have been recently proposed as generalizations of classical neural networks to achieve the quantum speed-up. Despite the potential to outperform classical models, serious bottlenecks exist for training QNNs; namely, QNNs with random structures have poor trainability due to the vanishing gradient with rate exponential to the input qubit number. The vanishing gradient could seriously influence the applications of large-size QNNs. In this work, we provide a viable solution with theoretical guarantees. Specifically, we prove that QNNs with tree tensor and step controlled architectures have gradients that vanish at most polynomially with the qubit number. We numerically demonstrate QNNs with tree tensor and step controlled structures for the application of binary classification. Simulations show faster convergent rates and better accuracy compared to QNNs with random structures.
28
The Graph Neural Network Model
Franco Scarselli, M. Gori, Ah Chung Tsoi et al. · IEEE Transactions on Neural Networks · 2008 · 9.3K citations · Full text
Jacob Biamonte, Péter Wittek, Nicola Pancotti et al. · Nature · 2017 · 4.4K citations · Full text
Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets
Abhinav Kandala, Antonio Mezzacapo, Kristan Temme et al. · Nature · 2017 · 3K citations · Full text
Natural Sciences, Chemistry, Physics +14