Among recent insights into learning quantum states, online learning and shadow tomography procedures are notable for their ability to accurately predict expectation values even of adaptively chosen observables. In contrast to the state case, quantum process learning tasks with a similarly adaptive nature have received little attention. In this work, we investigate online learning tasks for quantum processes. Whereas online learning is infeasible for general quantum channels, we show that channels of bounded gate complexity as well as Pauli channels can be online learned in the regret and mistake-bounded models of online learning. In fact, we can online learn probabilistic mixtures of any exponentially large set of known channels. We also provide a provably sample-efficient shadow tomography procedure for Pauli channels. Our results extend beyond quantum channels to non-Markovian multi-time processes, with favorable regret and mistake bounds, as well as a shadow tomography procedure. We complement our online learning upper bounds with mistake as well as computational lower bounds. On the technical side, we make use of the multiplicative weights update algorithm, classical adaptive data analysis, and Bell sampling, as well as tools from the theory of quantum combs for multi-time quantum processes. Our work initiates a study of online learning for classes of quantum channels and, more generally, non-Markovian quantum processes. Given the importance of online learning for state shadow tomography, this may serve as a step towards quantum channel variants of adaptive shadow tomography.
Regret Lower Bound for Online Learning of Quantum States with Logarithmic Loss, with Applications to Quantum State Tomography and Confidence Sequences for Matrix Means
National Taiwan University(台湾大学);Center for Quantum Science and Engineering, National Taiwan University(台湾大学量子科学与工程中心)
Dynamic Estimation Loss Control in Variational Quantum Sensing via Online Conformal Inference
Signal Processing Systems Group, Department of Electrical Engineering, Eindhoven University of Technology(埃因霍温理工大学电子工程系信号处理系统组);KCLIP lab, Center for Intelligent Information Processing Systems, Department of Engineering, King’s College London(伦敦国王学院工程系智能信息处理系统中心)
Online Job Scheduler for Fault-tolerant Quantum Multiprogramming
Department of Physics and Astronomy, University College London(伦敦大学学院物理与天文系);Graduate School of Informatics, Kyoto University(京都大学情报学研究科);Graduate School of Media and Governance, Keio University(庆应义塾大学媒体治理学研究科);Center for Quantum Computing, RIKEN(理化学研究所量子计算中心)
Measurement-enabled online quantum processing with amplitude encoding
ICFO-Institut de Ciències Fotòniques, The Barcelona Institute of Science and Technology(光子科学研究所,巴塞罗那科学与技术研究院);Instituut-Lorentz, Universiteit Leiden(洛伦兹研究所,莱顿大学);Applied Quantum Algorithms, Leiden University(莱顿大学应用量子算法);Donostia International Physics Center(圣塞巴斯蒂安国际物理中心)