When does reinforcement learning stand out in quantum control? A comparative study on state preparation

Zhang, Xiao-Ming, Wei, Zezhu, Asad, Raza, Yang, Xu-Chen, et al. · 2019 · npj Quantum Information

| 编号 NA125 | 主题 强化学习与智能体 | DOI 10.1038/s41534-019-0201-8 |

摘要

摘要保留原文（英文）

摘要取自 arXiv / 出版方元数据，未作翻译，以保证与原文一致。

2019 · npj Quantum Information Abstract Reinforcement learning has been widely used in many problems, including quantum control of qubits. However, such problems can, at the same time, be solved by traditional, non-machine-learning methods, such as stochastic gradient descent and Krotov algorithms, and it remains unclear which one is most suitable when the control has specific constraints. In this work, we perform a comparative study on the efficacy of three reinforcement learning algorithms: tabular Q-learning, deep Q-learning, and policy gradient, as well as two non-machine-learning methods: stochastic gradient descent and Krotov algorithms, in the problem of preparing a desired quantum state. We found that overall, the deep Q-learning and policy gradient algorithms outperform others when the problem is discretized, e.g. allowing discrete values of control, and when the problem scales up. The reinforcement learning algorithms can also adaptively reduce the complexity of the control sequences, shortening the operation time and improving the fidelity. Our comparison provides insights into the suitability of reinforcement learning in quantum control problems.

全文共 14 页；文本提取件位于 .extracted/papers/NA125.txt（不随站点发布）。

本站词条在引用该文献时，会以 wikilink（sources/NA125）链接到本页；右侧「反向链接」面板自动列出所有引用它的词条。