Model-Based Reinforcement Learning for Quantum Circuit Synthesis
ORAL
Abstract
Quantum circuit synthesis is a compilation primitive that constructs implementations of algorithms based on functional descriptions. These tools can discover new implementations of algorithms and are powerful circuit optimizers. The run time required to synthesize quantum circuits grows exponentially with the number of qubits. Much of this run time is used to search for parameterized circuit templates or ansatzes that define the structure of the synthesized circuit. Past work has shown how Machine Learning (ML) can be used to accelerate this process by providing seed circuits from which to start synthesis. This work addresses scalability issues present in this previous work. Instead of enumerating possible output circuits, this work demonstrates how techniques in generative ML can be used to produce seed circuit templates.
* This work was supported by the DOE under contract DE-5AC02-05CH11231 through the Office of Advanced Scientific Computing Research (ASCR) Quantum Algorithms Team and Accelerated Research in Quantum Computing programs, and by the NSF Challenge Institute for Quantum Computation (CIQC) program under award OMA-2016245.
–
Publication: Deep Ansatz Generation for Seeded Quantum Circuit Synthesis (planned paper)
Presenters
-
Mathias T Weiden
University of California, Berkeley
Authors
-
Mathias T Weiden
University of California, Berkeley
-
Ed Younis
Lawrence Berkeley National Laboratory
-
John D Kubiatowicz
UC Berkeley, University of California, Berkeley
-
Costin C Iancu
Lawrence Berkeley National Laboratory