Learning quantum annealing
E.C. Behrman, J.E. Steck, and M.A. Moustafa

TL;DR
This paper introduces a learning procedure for quantum annealing systems to reach specific entangled ground states, demonstrating scalability, pathway construction, and potential for experimental implementation.
Contribution
A novel quantum learning method enabling annealing to target states, including complex entangled states, with demonstrated scalability and pathway-based control.
Findings
Successful learning of entangled two-qubit states
Generalization to larger quantum systems
Effective pathway construction for state preparation
Abstract
We propose and develop a new procedure, whereby a quantum system can learn to anneal to a desired ground state. We demonstrate successful learning to produce an entangled state for a two-qubit system, then demonstrate generalizability to larger systems. The amount of additional learning necessary decreases as the size of the system increases. Because current technologies limit measurement of the states of quantum annealing machines to determination of the average spin at each site, we then construct a "broken pathway" between the initial and desired states, at each step of which the average spins are nonzero, and show successful learning of that pathway. Using this technique we show we can direct annealing to multiqubit GHZ and W states, and verify that we have done so. Because quantum neural networks are robust to noise and decoherence we expect our method to be readily implemented…
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 Information and Cryptography · Quantum Computing Algorithms and Architecture · Neural Networks and Reservoir Computing
