The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Robust online Hamiltonian learning
Open accessAbstract
In this work we combine two distinct machine learning methodologies, sequential Monte Carlo and Bayesian experimental design, and apply them to the problem of inferring the dynamical parameters of a quantum system. We design the algorithm with practicality in mind by including parameters that control trade-offs between the requirements on computational and experimental resources. The algorithm can be implemented online (during experimental data collection), avoiding the need for storage and post-processing. Most importantly, our algorithm is capable of learning Hamiltonian parameters even when the parameters change from experiment-to-experiment, and also when additional noise processes are present and unknown. The algorithm also numerically estimates the Cramer–Rao lower bound, certifying its own performance.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 generators of quantum dynamical semigroups
Lindblad, G. (1976) · Communications in Mathematical Physics · doi:10.1007/bf01608499 · Cited by 7,548
Quantum simulation of frustrated Ising spins with trapped ions
Kim, K., Chang, M.-S., Korenblit, S., Islam, R., Edwards, E. E., Freericks, J. K., Lin, G.-D., Duan, L.-M., & Monroe, C. (2010) · Nature · doi:10.1038/nature09071 · Cited by 750
Universal Digital Quantum Simulation with Trapped Ions
Lanyon, B. P., Hempel, C., Nigg, D., Müller, M., Gerritsma, R., Zähringer, F., Schindler, P., Barreiro, J. T., Rambach, M., Kirchmair, G., et al. (2011) · Science · doi:10.1126/science.1208001 · Cited by 613
Direct Fidelity Estimation from Few Pauli Measurements
Flammia, S. T., & Liu, Y.-K. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.230501 · Cited by 449
Simulation-based optimal bayesian experimental design for nonlinear systems
Huan, X., & Marzouk, Y. M. (2013) · Journal of Computational Physics · doi:10.1016/j.jcp.2012.08.013 · Cited by 438
Quantum Simulation of the Klein Paradox with Trapped Ions
Gerritsma, R., Lanyon, B. P., Kirchmair, G., Zähringer, F., Hempel, C., Casanova, J., García-Ripoll, J. J., Solano, E., Blatt, R., & Roos, C. F. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.060503 · Cited by 204
Quantum process tomography of the quantum Fourier transform
Weinstein, Y. S., Havel, T. F., Emerson, J., Boulant, N., Saraceno, M., Lloyd, S., & Cory, D. G. (2004) · The Journal of Chemical Physics · doi:10.1063/1.1785151 · Cited by 178
Self-citation
Cited by
Biamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779
Self-citationElucidating reaction mechanisms on quantum computers
Reiher, M., Wiebe, N., Svore, K. M., Wecker, D., & Troyer, M. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1619152114 · Cited by 745
Self-citationPolino, E., Valeri, M., Spagnolo, N., & Sciarrino, F. (2020) · AVS Quantum Science · doi:10.1116/5.0007577 · Cited by 414
Efficient and noise resilient measurements for quantum chemistry on near-term quantum computers
Huggins, W. J., McClean, J. R., Rubin, N. C., Jiang, Z., Wiebe, N., Whaley, K. B., & Babbush, R. (2021) · npj Quantum Information · doi:10.1038/s41534-020-00341-7 · Cited by 256
Self-citationOptimal measurements for simultaneous quantum estimation of multiple phases
Pezzè, L., Ciampini, M. A., Spagnolo, N., Humphreys, P. C., Datta, A., Walmsley, I. A., Barbieri, M., Sciarrino, F., & Smerzi, A. (2017) · Physical Review Letters · doi:10.1103/physrevlett.119.130504 · Cited by 200
Metadata
- Authors
- Granade, C. E., Ferrie, C., Wiebe, N., & Cory, D. G.
- Venue
- New Journal of Physics
- Publisher
- IOP Publishing
- Published
- 2012-10-03
- Volume
- 14
- Issue
- 10
- Pages
- 103013
- ISSN
- 1367-2630 (ISSN-L)
- OpenAlex
- W2595654587
- Cited by
- 196
- References
- 7
- FWCI
- 7.60
- Type
- journal article
- Language
- en
- Open access
- gold
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Robust online Hamiltonian learning. https://app.cochat.ai/papers/10.1088/1367-2630/14/10/103013
- The paper
- Granade, C. E., Ferrie, C., Wiebe, N., & Cory, D. G. (2012). Robust online Hamiltonian learning. New Journal of Physics. https://doi.org/10.1088/1367-2630/14/10/103013
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.