Programming quantum annealing computers using machine learning
Commercial quantum annealing (QA) machines are now being built with hundreds of quantum bits (qubits). These are used as analog computers, to solve optimization problems by annealing to an unknown ground state (the solution), given the Hamiltonian for that problem. We propose and develop a new appro...
Saved in:
Published in | 2017 IEEE International Conference on Systems, Man, and Cybernetics (SMC) pp. 288 - 293 |
---|---|
Main Authors | , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE
01.10.2017
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Commercial quantum annealing (QA) machines are now being built with hundreds of quantum bits (qubits). These are used as analog computers, to solve optimization problems by annealing to an unknown ground state (the solution), given the Hamiltonian for that problem. We propose and develop a new approach, in which we use machine learning to do the inverse problem: to find the Hamiltonian that will produce a given, desired ground state. We demonstrate successful learning to produce a desired fully entangled state for a two-qubit system, then bootstrap to do the same for three, four, five and six qubits; the amount of additional learning necessary decreases. With these new capabilities the computing possibilities for QA arrays are greatly expanded. |
---|---|
DOI: | 10.1109/SMC.2017.8122617 |