A quantum algorithm to train neural networks using low-depth circuits
Guillaume Verdon, Michael Broughton, Jacob Biamonte

TL;DR
This paper presents a low-depth quantum algorithm that uses variational circuits and the quantum approximate optimization algorithm to train generative neural networks, demonstrating convergence under noisy conditions.
Contribution
It introduces a novel hybrid quantum-classical approach combining variational circuits and QAOA for neural network training on near-term quantum devices.
Findings
Successful training convergence with up to 4% depolarizing noise
Uses QAOA as a subroutine for sampling low-energy states
Demonstrates potential for quantum advantage in neural network training
Abstract
Can near-term gate model based quantum processors offer quantum advantage for practical applications in the pre-fault tolerance noise regime? A class of algorithms which have shown some promise in this regard are the so-called classical-quantum hybrid variational algorithms. Here we develop a low-depth quantum algorithm to generative neural networks using variational quantum circuits. We introduce a method which employs the quantum approximate optimization algorithm as a subroutine in order produce then sample low-energy distributions of Ising Hamiltonians. We sample these states to train neural networks and demonstrate training convergence for numerically simulated noisy circuits with depolarizing errors of rates of up to .
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-Dot Cellular Automata
