Quantum logic gate synthesis as a Markov decision process
Journal Article
·
· npj Quantum Information
- Fermi National Accelerator Laboratory (FNAL), Batavia, IL (United States); Rigetti Computing, Berkeley, CA (United States); NASA Ames Research Center (ARC), Moffett Field, Mountain View, CA (United States)
- Univ. of Maryland, College Park, MD (United States); Ames Lab., and Iowa State Univ., Ames, IA (United States)
- Fermi National Accelerator Laboratory (FNAL), Batavia, IL (United States); Ames Lab., and Iowa State Univ., Ames, IA (United States)
Reinforcement learning has witnessed recent applications to a variety of tasks in quantum programming. The underlying assumption is that those tasks could be modeled as Markov decision processes (MDPs). Here, we investigate the feasibility of this assumption by exploring its consequences for single-qubit quantum state preparation and gate compilation. By forming discrete MDPs, we solve for the optimal policy exactly through policy iteration. We find optimal paths that correspond to the shortest possible sequence of gates to prepare a state or compile a gate, up to some target accuracy. Our method works in both the absence and presence of noise and compares favorably to other quantum compilation methods, such as the Ross–Selinger algorithm. This work provides theoretical insight into why reinforcement learning may be successfully used to find optimally short gate sequences in quantum programming.
- Research Organization:
- Ames Laboratory (AMES), Ames, IA (United States)
- Sponsoring Organization:
- USDOE Office of Science (SC); National Aeronautics and Space Administration (NASA)
- Grant/Contract Number:
- AC02-07CH11358; AC02-07CH11359
- OSTI ID:
- 2216915
- Alternate ID(s):
- OSTI ID: 2287671
- Report Number(s):
- IS-J--11179
- Journal Information:
- npj Quantum Information, Journal Name: npj Quantum Information Journal Issue: 1 Vol. 9; ISSN 2056-6387
- Publisher:
- Nature Partner JournalsCopyright Statement
- Country of Publication:
- United States
- Language:
- English
Similar Records
Mean-Variance Problems for Finite Horizon Semi-Markov Decision Processes
K-Spin Hamiltonian for Quantum-Resolvable Markov Decision Processes
Journal Article
·
Thu Oct 15 00:00:00 EDT 2015
· Applied Mathematics and Optimization
·
OSTI ID:22722847
K-Spin Hamiltonian for Quantum-Resolvable Markov Decision Processes
Journal Article
·
Fri Oct 30 00:00:00 EDT 2020
· Quantum Machine Intelligence
·
OSTI ID:1885979