The DOI matches its Crossref record; 43 of the 43 references it cites were found in a registry or an index.
Second order gradient ascent pulse engineering
Open accessAbstract
We report some improvements to the gradient ascent pulse engineering (GRAPE) algorithm for optimal control of spin ensembles and other quantum systems. These include more accurate gradients, convergence acceleration using the Broyden-Fletcher-Goldfarb-Shanno (BFGS) quasi-Newton algorithm as well as faster control derivative calculation algorithms. In all test systems, the wall clock time and the convergence rates show a considerable improvement over the approximate gradient ascent.
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.
Integrity signals
Registry
Cites
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.
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
On the limited memory BFGS method for large scale optimization
Liu, D. C., & Nocedal, J. (1989) · Mathematical Programming · doi:10.1007/bf01589116 · Cited by 8,560
Practical Methods of Optimization
Fletcher, R. (2000) · Wiley eBooks · doi:10.1002/9781118723203 · Cited by 7,605
Practical methods of optimization
(1988) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(88)90129-2 · Cited by 5,818
The Mathematical Theory of Optimal Processes.
Blum, E. K., Pontryagin, Boltyanskii, Gamkrelidze, & Mishchenko (1963) · The American Mathematical Monthly · doi:10.2307/2312867 · Cited by 4,261
Principles of Nuclear Magnetic Resonance in One and Two Dimensions
Ernst, R. R., Bodenhausen, G., Wokaun, A., & Redfield, A. G. (1989) · Physics Today · doi:10.1063/1.2811094 · Cited by 4,201
Mathematical Theory of Optimal Processes
Pontryagin, L. S. (2018) · Routledge eBooks · doi:10.1201/9780203749319 · Cited by 3,713
Practical Methods of Optimization.
Witzgall, C., & Fletcher, R. (1989) · Mathematics of Computation · doi:10.2307/2008742 · Cited by 3,591
An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
Coleman, T. F., & Li, Y. (1996) · SIAM Journal on Optimization · doi:10.1137/0806023 · Cited by 3,320
The Mathematical Theory of Optimal Processes
Chambers, M. L., Pontryagin, L. S., Boltyanskii, V. G., Gamkrelidze, R. V., Mishchenko, E. F., & Brown, D. E. (1965) · OR · doi:10.2307/3006724 · Cited by 3,243
Lewis, F. L. (1986) · Cited by 2,948
Cited by
Glaser, S. J., Boscain, U., Calarco, T., Koch, C. P., Köckenberger, W., Kosloff, R., Kuprov, I., Luy, B., Schirmer, S., Schulte-Herbrüggen, T., et al. (2015) · The European Physical Journal D · doi:10.1140/epjd/e2015-60464-1 · Cited by 774
Self-citationNew Class of Quantum Error-Correcting Codes for a Bosonic Mode
Michael, M. H., Silveri, M., Brierley, R. T., Albert, V. V., Salmilehto, J., Jiang, L., & Girvin, S. M. (2016) · Physical Review X · doi:10.1103/physrevx.6.031006 · Cited by 419
Koch, C. P., Boscain, U., Calarco, T., Dirr, G., Filipp, S., Glaser, S. J., Kosloff, R., Montangero, S., Schulte-Herbrüggen, T., Sugny, D., et al. (2022) · EPJ Quantum Technology · doi:10.1140/epjqt/s40507-022-00138-x · Cited by 405
Self-citationReinforcement Learning in Different Phases of Quantum Control
Bukov, M., Day, A. G. R., Sels, D., Weinberg, P., Polkovnikov, A., & Mehta, P. (2018) · Physical Review X · doi:10.1103/physrevx.8.031086 · Cited by 310
Implementing a universal gate set on a logical qubit encoded in an oscillator
Heeres, R. W., Reinhold, P., Ofek, N., Frunzio, L., Jiang, L., Devoret, M. H., & Schoelkopf, R. J. (2017) · Nature Communications · doi:10.1038/s41467-017-00045-1 · Cited by 307
Quantum error correction and universal gate set operation on a binomial bosonic logical qubit
Hu, L., Ma, Y., Cai, W., Mu, X., Xu, Y., Wang, W., Wu, Y., Wang, H., Song, Y. P., Zou, C.-L., et al. (2019) · Nature Physics · doi:10.1038/s41567-018-0414-3 · Cited by 286
Hybrid Quantum-Classical Approach to Quantum Optimal Control
Li, J., Yang, X., Peng, X., & Sun, C.-P. (2017) · Physical Review Letters · doi:10.1103/physrevlett.118.150503 · Cited by 278
Model-Free Quantum Control with Reinforcement Learning
Sivak, V. V., Eickbusch, A., Liu, H., Royer, B., Tsioutsios, I., & Devoret, M. H. (2022) · Physical Review X · doi:10.1103/physrevx.12.011059 · Cited by 130
“In actor-critic methods [3], which PPO also belongs to, the value function Vθ′ (critic) is learned concurrently with the policy πθ (actor) to predict the partial return R(τ ; st).”
(2019) · doi:10.1145/3297858.3304018 · Cited by 118
“Quantum optimal control algorithms find the optimal evolution path from a starting quantum state to a final quantum state, typically by performing gradient descent methods, such as the GRadient Ascent Pulse Engineering (GRAPE) [5, 27] algorithm.”
MethodControl-enhanced multiparameter quantum estimation
Liu, J., & Yuan, H. (2017) · Physical Review A · doi:10.1103/physreva.96.042114 · Cited by 105
“GRAPE can be further improved via the quasiNewton optimization [60], which utilize the gradient history to construct an approximation to the Hessian matrix.”
MethodGenetic algorithm optimized triply compensated pulses in NMR spectroscopy
Manu, V. S., & Veglia, G. (2015) · Journal of Magnetic Resonance · doi:10.1016/j.jmr.2015.09.010 · Cited by 26
Manu, V. S., & Veglia, G. (2016) · Journal of Magnetic Resonance · doi:10.1016/j.jmr.2016.09.021 · Cited by 14
Metadata
- Authors
- de Fouquieres, P., Schirmer, S. G., Glaser, S. J., & Kuprov, I.
- Venue
- Journal of Magnetic Resonance
- Publisher
- Elsevier BV
- Published
- 2011-10
- Volume
- 212
- Issue
- 2
- Pages
- 412-417
- ISSN
- 1090-7807 (ISSN-L)
- OpenAlex
- W2022878879
- Cited by
- 299
- References
- 43
- FWCI
- 4.38
- 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.