PIRSA:16080004

Learning in Quantum Control: High-Dimensional Global Optimization for Noisy Quantum Dynamics

APA

Sanders, B. (2016). Learning in Quantum Control: High-Dimensional Global Optimization for Noisy Quantum Dynamics. Perimeter Institute for Theoretical Physics. https://pirsa.org/16080004

MLA

Sanders, Barry. Learning in Quantum Control: High-Dimensional Global Optimization for Noisy Quantum Dynamics. Perimeter Institute for Theoretical Physics, Aug. 08, 2016, https://pirsa.org/16080004

BibTex

          @misc{ scivideos_PIRSA:16080004,
            doi = {10.48660/16080004},
            url = {https://pirsa.org/16080004},
            author = {Sanders, Barry},
            keywords = {Quantum Matter},
            language = {en},
            title = {Learning in Quantum Control: High-Dimensional Global Optimization for Noisy Quantum Dynamics},
            publisher = {Perimeter Institute for Theoretical Physics},
            year = {2016},
            month = {aug},
            note = {PIRSA:16080004 see, \url{https://scivideos.org/pirsa/16080004}}
          }
          

Barry Sanders University of Calgary

Talk numberPIRSA:16080004
Source RepositoryPIRSA
Talk Type Conference

Abstract

Quantum control is valuable for various quantum technologies such as high-fidelity gates for universal quantum computing, adaptive quantum-enhanced metrology, and ultra-cold atom manipulation. Although supervised machine learning and reinforcement learning are widely used for optimizing control parameters in classical systems, quantum control for parameter optimization is mainly pursued via gradient-based greedy algorithms. Although the quantum fitness landscape is often compatible for greedy algorithms, sometimes greedy algorithms yield poor results, especially for large-dimensional quantum systems. We employ differential evolution algorithms to circumvent the stagnation problem of non-convex optimization, and we average over the objective function to improve quantum control fidelity for noisy systems. To reduce computational cost, we introduce heuristics for early termination of runs and for adaptive selection of search subspaces. Our implementation is massively parallel and vectorized to reduce run time even further. We demonstrate our methods with two examples, namely quantum phase estimation and quantum gate design, for which we achieve superior fidelity and scalability than obtained using greedy algorithms.