Adiabatic Quantum Computation Applied to Deep Learning Networks
- Univ. of Southern California, Los Angeles, CA (United States). Dept. of Computer Science; Univ. of Southern California, Marina del Rey, CA (United States). Information Sciences Inst.
- Univ. of Southern California, Marina del Rey, CA (United States). Information Sciences Inst.; Univ. of Southern California, Los Angeles, CA (United States). Dept. of Electrical Engineering
- Univ. of Southern California, Marina del Rey, CA (United States). Information Sciences Inst.
- Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States). Computational Data Analytics Group
- Univ. of Tennessee, Knoxville, TN (United States). Dept. of Electrical Engineering & Computer Science
Training deep learning networks is a difficult task due to computational complexity, and this is traditionally handled by simplifying network topology to enable parallel computation on graphical processing units (GPUs). However, the emergence of quantum devices allows reconsideration of complex topologies. We illustrate a particular network topology that can be trained to classify MNIST data (an image dataset of handwritten digits) and neutrino detection data using a restricted form of adiabatic quantum computation known as quantum annealing performed by a D-Wave processor. We provide a brief description of the hardware and how it solves Ising models, how we translate our data into the corresponding Ising models, and how we use available expanded topology options to explore potential performance improvements. Although we focus on the application of quantum annealing in this article, the work discussed here is just one of three approaches we explored as part of a larger project that considers alternative means for training deep learning networks. The other approaches involve using a high performance computing (HPC) environment to automatically find network topologies with good performance and using neuromorphic computing to find a low-power solution for training deep learning networks. Our results show that our quantum approach can find good network parameters in a reasonable time despite increased network topology complexity; that HPC can find good parameters for traditional, simplified network topologies; and that neuromorphic computers can use low power memristive hardware to represent complex topologies and parameters derived from other architecture choices.
- Research Organization:
- Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States). Oak Ridge Leadership Computing Facility (OLCF)
- Sponsoring Organization:
- USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)
- Grant/Contract Number:
- AC05-00OR22725
- OSTI ID:
- 1468121
- Journal Information:
- Entropy, Vol. 20, Issue 5; ISSN 1099-4300
- Publisher:
- MDPICopyright Statement
- Country of Publication:
- United States
- Language:
- English
Web of Science
Experiments testing the commutativity of finite-dimensional algebras with a quantum adiabatic algorithm: Testing commutativity FD algebras with a QAA
|
journal | January 2019 |
Scalable Emulation of Sign-Problem–Free Hamiltonians with Room-Temperature -bits
|
journal | September 2019 |
Special Issue “Quantum Foundations: 90 Years of Uncertainty”
|
journal | February 2019 |
A Quantum Annealing Approach for Dynamic Multi-Depot Capacitated Vehicle Routing Problem | preprint | January 2020 |
Similar Records
A Study of Complex Deep Learning Networks on High Performance, Neuromorphic, and Quantum Computers
A Study of Complex Deep Learning Networks on High-Performance, Neuromorphic, and Quantum Computers