A Universal Training Algorithm for Quantum Deep Learning
Guillaume Verdon, Jason Pye, Michael Broughton

TL;DR
This paper introduces Baqprop, a universal quantum training algorithm that unifies quantum phase error encoding with classical backpropagation, enabling efficient optimization of quantum and hybrid neural networks.
Contribution
It presents Baqprop as a foundational principle for quantum deep learning, along with two novel heuristics, QDD and MoMGrad, for quantum-enhanced network training.
Findings
Demonstrates quantum tunneling in parameter optimization.
Shows effective gradient estimation using Baqprop.
Provides numerical simulations validating the proposed methods.
Abstract
We introduce the Backwards Quantum Propagation of Phase errors (Baqprop) principle, a central theme upon which we construct multiple universal optimization heuristics for training both parametrized quantum circuits and classical deep neural networks on a quantum computer. Baqprop encodes error information in relative phases of a quantum wavefunction defined over the space of network parameters; it can be thought of as the unification of the phase kickback principle of quantum computation and of the backpropagation algorithm from classical deep learning. We propose two core heuristics which leverage Baqprop for quantum-enhanced optimization of network parameters: Quantum Dynamical Descent (QDD) and Momentum Measurement Gradient Descent (MoMGrad). QDD uses simulated quantum coherent dynamics for parameter optimization, allowing for quantum tunneling through the hypothesis space landscape.…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum and electron transport phenomena
