2020
DOI: 10.1103/physreva.101.052317
|View full text |Cite
|
Sign up to set email alerts
|

Robust quantum control in games: An adversarial learning approach

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
22
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
3
2

Relationship

2
7

Authors

Journals

citations
Cited by 50 publications
(24 citation statements)
references
References 35 publications
0
22
0
Order By: Relevance
“…where represents the uncertainty parameter(s). Empirical analyses via stochastic gradient-descent algorithms [40,61] or min-max algorithms [62] were conducted to optimize robust control fields. The analyses collectively indicate that the algorithms almost always successfully find high-quality robust and high-precision control solutions.…”
Section: Unitary Control Objectivementioning
confidence: 99%
“…where represents the uncertainty parameter(s). Empirical analyses via stochastic gradient-descent algorithms [40,61] or min-max algorithms [62] were conducted to optimize robust control fields. The analyses collectively indicate that the algorithms almost always successfully find high-quality robust and high-precision control solutions.…”
Section: Unitary Control Objectivementioning
confidence: 99%
“…Such hybrid approach has been experimentally demonstrated with the nuclear magnetic resonance [131][132][133]. Other hybrid variants of GRAPE have also been proposed [134][135][136][137], which can be employed in quantum metrology.…”
Section: A Quantum Controlmentioning
confidence: 99%
“…The basic idea thereof is to formulate the robust control design as the minimization of an empirical loss function evaluated over uncertainty samples. The loss function is usually chosen as the average error or the worstcase error, based on which various gradient-based algorithms were proposed for the training of robust controls, e.g., the sampling-based learning [13,14], stochastic gradient-based algorithms [15,16], the sequential convex programming (SCP) [17,18] and the adversarial training based a-GRAPE [19]. These algorithms have been shown effective in im- * Electronic address: rbwu@tsinghua.edu.cn proving the robustness against various uncertainties, e.g., coupling uncertainty [15,19], energy broadening [13,14,20], inhomogeneity of control field pulses [13,14,21] and clock noises [22].…”
Section: Introductionmentioning
confidence: 99%
“…These facts show that the two loss functions make different trade-offs between the precision and the robustness. In our recent work [19], we illustrate that the a-GRAPE approaches can adjust the trade-off by purposely using poor-performance uncertainty samples. However, many hyper-parameters in the algorithm have to be empirically tuned, which is computationally costly when the control parameters or the uncertainty parameters are high-dimensional.…”
Section: Introductionmentioning
confidence: 99%