Creative Commons Attribution 3.0 Unported license
We provide an algorithm that uses Bayesian randomized benchmarking in concert with a local optimizer, such as SPSA, to find a set of controls that optimizes that average gate fidelity. We call this method Bayesian ACRONYM tuning as a reference to the analogous ACRONYM tuning algorithm. Bayesian ACRONYM distinguishes itself in its ability to retain prior information from experiments that use nearby control parameters; whereas traditional ACRONYM tuning does not use such information and can require many more measurements as a result. We prove that such information reuse is possible under the relatively weak assumption that the true model parameters are Lipschitz-continuous functions of the control parameters. We also perform numerical experiments that demonstrate that over-rotation errors in single qubit gates can be automatically tuned from 88% to 99.95% average gate fidelity using less than 1kB of data and fewer than 20 steps of the optimizer.
@InProceedings{gamble_et_al:LIPIcs.TQC.2019.7,
author = {Gamble, John and Granade, Christopher and Wiebe, Nathan},
title = {{Bayesian ACRONYM Tuning}},
booktitle = {14th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2019)},
pages = {7:1--7:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-112-2},
ISSN = {1868-8969},
year = {2019},
volume = {135},
editor = {van Dam, Wim and Man\v{c}inska, Laura},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TQC.2019.7},
URN = {urn:nbn:de:0030-drops-103995},
doi = {10.4230/LIPIcs.TQC.2019.7},
annote = {Keywords: Quantum Computing, Randomized Benchmarking}
}