Binary Optimal Control of Single-Flux-Quantum Pulse Sequences
- 14 November 2022
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Control and Optimization
- Vol. 60 (6) , 3217-3236
Abstract
We introduce a binary, relaxed gradient, trust-region method for optimizing pulse sequences for single flux quanta control of a quantum computer. The pulse sequences are optimized with the goal of realizing unitary gate transformations. Each pulse has a fixed amplitude and duration. We model this process as a binary optimal control problem, constrained by Schrödinger’s equation, where the binary variables indicate whether each pulse is on or off. We introduce a first-order trust-region method, which takes advantage of a relaxed gradient to determine an optimal pulse sequence that minimizes the gate infidelity, while also suppressing leakage to higher energy levels. The proposed algorithm has a computational complexity of \(\mathcal{O}(p\log (p))\) , where \(p\) is the number of pulses in the sequence. We present numerical results for the H and X gates, where the optimized pulse sequences give gate fidelities better than 99.9%, in \(\approx 25\) trust-region iterations.
Keywords
All Related Versions
Funding Information
- Lawrence Livermore National Laboratory (20-ERD-028, 2019-LLNL-SCW-1683)
This publication has 27 references indexed in Scilit:
- Optimal control of coupled spin dynamics: design of NMR pulse sequences by gradient ascent algorithmsJournal of Magnetic Resonance, 2005
- Outer approximation algorithms for separable nonconvex mixed-integer nonlinear programsMathematical Programming, 2004
- Genetic local search for multi-objective combinatorial optimizationEuropean Journal of Operational Research, 2002
- Convexification of different classes of non-convex MINLP problemsComputers & Chemical Engineering, 1999
- Numerical Experience with Lower Bounds for MIQP Branch-And-BoundSIAM Journal on Optimization, 1998
- Global optimization of nonconvex NLPs and MINLPs with applications in process designComputers & Chemical Engineering, 1995
- RSFQ logic/memory family: a new Josephson-junction technology for sub-terahertz-clock-frequency digital systemsIEEE Transactions on Applied Superconductivity, 1991
- Evolution algorithms in combinatorial optimizationParallel Computing, 1988
- Exact methods for the knapsack problem and its generalizationsEuropean Journal of Operational Research, 1987
- Convexification procedures and decomposition methods for nonconvex optimization problemsJournal of Optimization Theory and Applications, 1979