Machine Learning for Discriminating Quantum Measurement Trajectories and Improving Readout
Open accessThe DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
Current methods for classifying measurement trajectories in superconducting qubit systems produce fidelities systematically lower than those predicted by experimental parameters. Here, we place current classification methods within the framework of machine learning (ML) algorithms and improve on them by investigating more sophisticated ML approaches. We find that nonlinear algorithms and clustering methods produce significantly higher assignment fidelities that help close the gap to the fidelity possible under ideal noise conditions. Clustering methods group trajectories into natural subsets within the data, which allows for the diagnosis of systematic errors. We find large clusters in the data associated with T1 processes and show these are the main source of discrepancy between our experimental and ideal fidelities. These error diagnosis techniques help provide a path forward to improve qubit measurements.
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
Cortes, C., & Vapnik, V. (1995) · Machine Learning · doi:10.1007/bf00994018 · Cited by 59,421
Least squares quantization in PCM
Lloyd, S. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056489 · Cited by 15,836
THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS
FISHER, R. A. (1936) · Annals of Eugenics · doi:10.1111/j.1469-1809.1936.tb02137.x · Cited by 15,227
Charge-insensitive qubit design derived from the Cooper pair box
Koch, J., Yu, T. M., Gambetta, J., Houck, A. A., Schuster, D. I., Majer, J., Blais, A., Devoret, M. H., Girvin, S. M., & Schoelkopf, R. J. (2007) · Physical Review A · doi:10.1103/physreva.76.042319 · Cited by 3,351
Self-citationCover, T. M. (1965) · IEEE Transactions on Electronic Computers · doi:10.1109/pgec.1965.264137 · Cited by 2,044
Superconducting quantum circuits at the surface code threshold for fault tolerance
Barends, R., Kelly, J., Megrant, A., Veitia, A., Sank, D., Jeffrey, E., White, T. C., Mutus, J., Fowler, A. G., Campbell, B., et al. (2014) · Nature · doi:10.1038/nature13171 · Cited by 1,733
Coherent Josephson Qubit Suitable for Scalable Quantum Integrated Circuits
Barends, R., Kelly, J., Megrant, A., Sank, D., Jeffrey, E., Chen, Y., Yin, Y., Chiaro, B., Mutus, J., Neill, C., et al. (2013) · Physical Review Letters · doi:10.1103/physrevlett.111.080502 · Cited by 779
Machine learning for precise quantum measurement
Hentschel, A., & Sanders, B. C. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.063603 · Cited by 197
Cited by
Circuit quantum electrodynamics
Blais, A., Grimsmo, A. L., Girvin, S. M., & Wallraff, A. (2021) · Reviews of Modern Physics · doi:10.1103/revmodphys.93.025005 · Cited by 1,931
Photonics for artificial intelligence and neuromorphic computing
Shastri, B. J., Tait, A. N., Ferreira de Lima, T., Pernice, W. H. P., Bhaskaran, H., Wright, C. D., & Prucnal, P. R. (2021) · Nature Photonics · doi:10.1038/s41566-020-00754-y · Cited by 1,756
Building logical qubits in a superconducting quantum computing system
Gambetta, J. M., Chow, J. M., & Steffen, M. (2017) · npj Quantum Information · doi:10.1038/s41534-016-0004-0 · Cited by 622
Self-citationPolino, E., Valeri, M., Spagnolo, N., & Sciarrino, F. (2020) · AVS Quantum Science · doi:10.1116/5.0007577 · Cited by 414
Demonstration of universal parametric entangling gates on a multi-qubit lattice
Reagor, M., Osborn, C. B., Tezak, N., Staley, A., Prawiroatmodjo, G., Scheer, M., Alidoust, N., Sete, E. A., Didier, N., da Silva, M. P., et al. (2018) · Science Advances · doi:10.1126/sciadv.aao3603 · Cited by 297
Metadata
- Authors
- Magesan, E., Gambetta, J. M., Córcoles, A. D., & Chow, J. M.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2015-05-18
- Volume
- 114
- Issue
- 20
- Pages
- 200501-200501
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W1613088149
- Cited by
- 128
- References
- 8
- FWCI
- 8.45
- 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.