Experimental Deep Reinforcement Learning for Error-Robust Gate-Set Design on a Superconducting Quantum Computer
Open accessThe DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.
Abstract
A bottleneck for scaling quantum hardware is solved: An AI-based technique to design quantum gates without knowledge of the physical model or the noise processes is demonstrated experimentally, outperforming the best human-designed gates.
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
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Quantum supremacy using a programmable superconducting processor
Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J. C., Barends, R., Biswas, R., Boixo, S., Brandao, F. G. S. L., Buell, D. A., et al. (2019) · Nature · doi:10.1038/s41586-019-1666-5 · Cited by 7,720
Quantum computational advantage using photons
Zhong, H.-S., Wang, H., Deng, Y.-H., Chen, M.-C., Peng, L.-C., Luo, Y.-H., Qin, J., Wu, D., Ding, X., Hu, Y., et al. (2020) · Science · doi:10.1126/science.abe8770 · Cited by 2,405
Khaneja, N., Reiss, T., Kehlet, C., Schulte-Herbrüggen, T., & Glaser, S. J. (2005) · Journal of Magnetic Resonance · doi:10.1016/j.jmr.2004.11.004 · Cited by 1,854
Randomized benchmarking of quantum gates
Knill, E., Leibfried, D., Reichle, R., Britton, J., Blakestad, R. B., Jost, J. D., Langer, C., Ozeri, R., Seidelin, S., & Wineland, D. J. (2008) · Physical Review A · doi:10.1103/physreva.77.012307 · Cited by 1,019
Simple statistical gradient-following algorithms for connectionist reinforcement learning
Williams, R. J. (1992) · Machine Learning · doi:10.1023/a:1022672621406 · Cited by 817
Simple Pulses for Elimination of Leakage in Weakly Nonlinear Qubits
Motzoi, F., Gambetta, J. M., Rebentrost, P., & Wilhelm, F. K. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.110501 · Cited by 814
Optimized dynamical decoupling in a model quantum memory
Biercuk, M. J., Uys, H., VanDevender, A. P., Shiga, N., Itano, W. M., & Bollinger, J. J. (2009) · Nature · doi:10.1038/nature07951 · Cited by 654
Self-citationQuantum Control of the Hyperfine Spin of a Cs Atom Ensemble
Chaudhury, S., Merkel, S., Herr, T., Silberfarb, A., Deutsch, I. H., & Jessen, P. S. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.163002 · Cited by 139
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
Cited by
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
Fast universal control of an oscillator with weak dispersive coupling to a qubit
Eickbusch, A., Sivak, V., Ding, A. Z., Elder, S. S., Jha, S. R., Venkatraman, J., Royer, B., Girvin, S. M., Schoelkopf, R. J., & Devoret, M. H. (2022) · Nature Physics · doi:10.1038/s41567-022-01776-9 · Cited by 173
“This is especially important when considering the implementation model-free closed-loop optimization strategies such as reinforcement learning [55, 56].”
Artificial intelligence and machine learning for quantum technologies
Krenn, M., Landgraf, J., Foesel, T., & Marquardt, F. (2023) · Physical Review A · doi:10.1103/physreva.107.010101 · Cited by 162
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
“This working principle is in stark contrast with popular optimization algorithms such as the NM simplex search [6 – 8] or SA [40], where each update of the simplex (in NM) or the state (in SA) can result in a drastically different policy.”
InfluentialOptimal Control of Families of Quantum Gates
Sauvage, F., & Mintert, F. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.050507 · Cited by 31
Metadata
- Authors
- Baum, Y., Amico, M., Howell, S., Hush, M., Liuzzi, M., Mundada, P., Merkh, T., Carvalho, A. R. R., & Biercuk, M. J.
- Venue
- PRX Quantum
- Publisher
- American Physical Society (APS)
- Published
- 2021-11-04
- Volume
- 2
- Issue
- 4
- ISSN
- 2691-3399 (ISSN-L)
- OpenAlex
- W3159827211
- Cited by
- 116
- References
- 13
- FWCI
- 6.70
- 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
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.