Robust control of quantum gates via sequential convex programming
- 21 November 2013
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 88 (5)
Abstract
Resource trade-offs can often be established by solving an appropriate robust optimization problem for a variety of scenarios involving constraints on optimization variables and uncertainties. Using an approach based on sequential convex programming, we demonstrate that quantum gate transformations can be made substantially robust against uncertainties while simultaneously using limited resources of control amplitude and bandwidth. Achieving such a high degree of robustness requires a quantitative model that specifies the range and character of the uncertainties. Using a model of a controlled one-qubit system for illustrative simulations, we identify robust control fields for a universal gate set and explore the trade-off between the worst-case gate fidelity and the field fluence. Our results demonstrate that, even for this simple model, there exists a rich variety of control design possibilities. In addition, we study the effect of noise represented by a stochastic uncertainty model.Keywords
All Related Versions
This publication has 95 references indexed in Scilit:
- Robust Optimization2009
- Stabilization, Optimal and Robust Control2008
- Signatures of Incoherence in a Quantum Information ProcessorQuantum Information Processing, 2007
- Robust Control Design2007
- Incoherent noise and quantum information processingThe Journal of Chemical Physics, 2004
- Convex Optimization2004
- Robust control of quantum informationThe Journal of Chemical Physics, 2003
- Design of strongly modulating pulses to implement precise effective Hamiltonians for quantum information processingThe Journal of Chemical Physics, 2002
- A Course in Robust Control Theory2000
- Uncertain Models and Robust Control1991