.png){kind=icon}
Return
An improved differential evolution algorithm for learning high-fidelity quantum controls
.png){kind=icon}
PRE
AI
DOI：10.1016/j.scib.2019.07.013.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Precisely and efficiently designing control pulses for the preparation of quantum states and quantum gates are the fundamental tasks for quantum computation. Gradient-based optimal control methods are the routine to design such pulses. However, the gradient information is often difficult to calculate or measure, especially when the system is not well calibrated or in the presence of various uncertainties. Gradient-free evolutionary algorithm is an alternative choice to accomplish this task but usually with low-efficiency. Here, we design an efficient mutation rule by using the information of the current and the former individuals together. This leads to our improved differential evolution algorithm, called daDE. To demonstrate its performance, we numerically benchmark the pulse optimization for quantum states and quantum gates preparations on small-scale NMR system. Further numerical comparisons with conventional differential evolution algorithms show that daDE has great advantages on the convergence speed and robustness to several uncertainties including pulse imperfections and measurement errors. (C) 2019 Science China Press. Published by Elsevier B.V. and Science China Press. All rights reserved.
Keywords:
Control pulses searching
Differential evolution
Quantum states and gates preparation
Pulse imperfections
Random measurement errors
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
21.1
Papers:
5.2K
Citations:
2.2W
Organization
Cited Papers
.png){kind=icon}
ShareSave
ShareSaveShareSaveShareSave
View more