.png){kind=icon}
返回
Universal quantum state preparation via revised greedy algorithm
.png){kind=icon}
OA
AI
DOI：10.1088/2058-9565/ac1dfe.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Preparation of quantum state lies at the heart of quantum information processing. The greedy algorithm provides a potential method to effectively prepare quantum state. However, the standard greedy (SG) algorithm, in general, cannot take the global maxima and instead becomes stuck on a local maxima. Based on the SG algorithm, in this paper we propose a revised version to design dynamic pulses to realize universal quantum state preparation, i.e. preparing an arbitrary state from another arbitrary one. As applications, we implement this scheme to the universal preparation of single- and two-qubit state in the context of semiconductor quantum dots and superconducting circuits. Evaluation results show that our scheme outperforms the alternative numerical optimizations with higher preparation quality while possesses the comparable high efficiency. Compared with the emerging machine learning, it shows better accessibility and does not require any training. Moreover, the numerical results show that the pulse sequences generated by our scheme are robust against various errors and noises. Our scheme opens a new avenue of optimization in few-level system and limited action space quantum control problems.
Keyword:
quantum state preparation
semiconductor double quantum dots
superconducting circuits
dynamic control pulses
期刊
IF:
5
论文数:
1.4K
被引数:
5.1K
机构
引用论文
.png){kind=icon}
查看更多内容