返回
Quantum compiling by deep reinforcement learning
DOI:10.1038/s42005-021-00684-3.png)
摘要
En 中文
The general problem of quantum compiling is to approximate any unitary transformation that describes the quantum computation as a sequence of elements selected from a finite base of universal quantum gates. The Solovay-Kitaev theorem guarantees the existence of such an approximating sequence. Though, the solutions to the quantum compiling problem suffer from a tradeoff between the length of the sequences, the precompilation time, and the execution time. Traditional approaches are time-consuming, unsuitable to be employed during computation. Here, we propose a deep reinforcement learning method as an alternative strategy, which requires a single precompilation procedure to learn a general strategy to approximate single-qubit unitaries. We show that this approach reduces the overall execution time, improving the tradeoff between the length of the sequence and execution time, potentially allowing real-time operations. Quantum compilers are characterized by a trade-off between the length of the sequences, the precompilation time, and the execution time. Here, the authors propose an approach based on deep reinforcement learning to approximate unitary operators as circuits, and show that this approach decreases the execution time, potentially allowing real-time quantum compiling.
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.8
论文数:
2.8K
被引数:
9.2K
机构
引用论文
Does it take older adults longer than younger adults to perceptually segregate a speech target from a background masker?在感知上将语音目标与背景掩蔽器隔离开来是否需要老年人比年轻人更长的时间?
Study of bi-directional buck-boost converter topologies for application in electrical vehicle motor drives应用于电动汽车电机驱动的双向buck-boost变换器拓扑研究
Coherent tunneling by adiabatic passage of an exchange-only spin qubit in a double quantum dot chain
PHYSICAL REVIEW B
IF3.7

