Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 267

The DOI matches its Crossref record; 84 of the 84 references it cites were found in a registry or an index.

Comparing, optimizing, and benchmarking quantum-control algorithms in a unifying programming framework

Open access
Machnes, S., Sander, U., Glaser, S. J., de Fouquières, P., Gruslys, A., Schirmer, S., Schulte-Herbrüggen, T. · 2011 · Physical Review A

Abstract

For paving the way to novel applications in quantum simulation, computation, and technology, increasingly large quantum systems have to be steered with high precision. It is a typical task amenable to numerical optimal control to turn the time course of pulses, i.e., piecewise constant control amplitudes, iteratively into an optimized shape. Here, we present a comparative study of optimal-control algorithms for a wide range of finite-dimensional applications. We focus on the most commonly used algorithms: GRAPE methods which update all controls concurrently, and Krotov-type methods which do so sequentially. Guidelines for their use are given and open research questions are pointed out. Moreover, we introduce a unifying algorithmic framework, DYNAMO (dynamic optimization platform), designed to provide the quantum-technology community with a convenient matlab-based tool set for optimal control. In addition, it gives researchers in optimal-control techniques a framework for benchmarking and comparing newly proposed algorithms with the state of the art. It allows a mix-and-match approach with various types of gradients, update and step-size methods as well as subspace choices. Open-source code including examples is made available at http://qlib.info.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physreva.84.022305

Cites

84 of 84 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Research works printed but not linked: 16

  1. A. G. Butkovskiy, 1979, Autom. Remote Control (USSR), 40, 485
  2. A. G. Butkovskiy, 1979, Autom. Remote Control (USSR), 40, 629
  3. A. G. Butkovskiy, 1980, Dokl. Akad. Nauk. USSR, 250, 22
  4. V. F. Krotov, 1996, Global Methods in Optimal Control
  5. V. F. Krotov, 1983, Eng. Cybern., 21, 123
  6. V. F. Krotov, 1983, Izv. Akad. Nauk. SSSR Tekh. Kibern., 1983, 162
  7. A. I. Konnov, 1999, Autom. Remote Control, 60, 1427
  8. A. I. Konnov, 1999, Avtom. Telemekh., 1999, 77
  9. 10.1103/PhysRevA.81.063426 · DOI
  10. 10.1088/0305-4470/35/9/319 · doi:10.1088/0305-4470/35/9/319
  11. 10.2307/2318209 · doi:10.2307/2318209
  12. E. B. Bliss, 1946, Lectures on the Calculus of Variations
  13. 10.1063/1.1724318 · doi:10.1063/1.1724318
  14. F. Mezzadri, 2007, Notices Amer. Math. Soc., 54, 592
  15. 10.1137/030601880 · doi:10.1137/030601880
  16. W. W. Hager, 2006, Pac. J. Optim., 2, 35

Cited by

See all 267

Metadata

Authors
Machnes, S., Sander, U., Glaser, S. J., de Fouquières, P., Gruslys, A., Schirmer, S., & Schulte-Herbrüggen, T.
Venue
Physical Review A
Published
2011-08-03
Volume
84
Issue
2
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W2166978156
Cited by
267
References
84
FWCI
13.01
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.