The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
Gate Set Tomography
Open accessAbstract
Gate set tomography (GST) is a protocol for detailed, predictive characterization of logic operations (gates) on quantum computing processors. Early versions of GST emerged around 2012-13, and since then it has been refined, demonstrated, and used in a large number of experiments. This paper presents the foundations of GST in comprehensive detail. The most important feature of GST, compared to older state and process tomography protocols, is that it is calibration-free. GST does not rely on pre-calibrated state preparations and measurements. Instead, it characterizes all the operations in a gate set simultaneously and self-consistently, relative to each other. Long sequence GST can estimate gates with very high precision and efficiency, achieving Heisenberg scaling in regimes of practical interest. In this paper, we cover GST's intellectual history, the techniques and experiments used to achieve its intended purpose, data analysis, gauge freedom and fixing, error bars, and the interpretation of gauge-fixed estimates of gate sets. Our focus is fundamental mathematical aspects of GST, rather than implementation details, but we touch on some of the foundational algorithmic tricks used in the pyGSTi implementation.
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 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
On the generators of quantum dynamical semigroups
Lindblad, G. (1976) · Communications in Mathematical Physics · doi:10.1007/bf01608499 · Cited by 7,548
Completely positive linear maps on complex matrices
Choi, M.-D. (1975) · Linear Algebra and its Applications · doi:10.1016/0024-3795(75)90075-0 · Cited by 2,659
James, D. F. V., Kwiat, P. G., Munro, W. J., & White, A. G. (2001) · Physical Review A · doi:10.1103/physreva.64.052312 · Cited by 2,176
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
States, Effects, and Operations Fundamental Notions of Quantum Theory
(1983) · Lecture Notes in Physics · doi:10.1007/3-540-12732-1 · Cited by 1,565
Linear transformations which preserve trace and positive semidefiniteness of operators
Jamiołkowski, A. (1972) · Reports on Mathematical Physics · doi:10.1016/0034-4877(72)90011-0 · Cited by 1,512
Nonparametric estimates of standard error: The jackknife, the bootstrap and other methods
EFRON, B. (1981) · Biometrika · doi:10.1093/biomet/68.3.589 · Cited by 1,399
Predicting many properties of a quantum system from very few measurements
Huang, H.-Y., Kueng, R., & Preskill, J. (2020) · Nature Physics · doi:10.1038/s41567-020-0932-7 · Cited by 1,240
Quantum computing with realistically noisy devices
Knill, E. (2005) · Nature · doi:10.1038/nature03350 · Cited by 1,184
Cited by
Burkard, G., Ladd, T. D., Pan, A., Nichol, J. M., & Petta, J. R. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.025003 · Cited by 715
Quantum logic with spin qubits crossing the surface code threshold
Xue, X., Russ, M., Samkharadze, N., Undseth, B., Sammak, A., Scappucci, G., & Vandersypen, L. M. K. (2022) · Nature · doi:10.1038/s41586-021-04273-w · Cited by 524
The randomized measurement toolbox
Elben, A., Flammia, S. T., Huang, H.-Y., Kueng, R., Preskill, J., Vermersch, B., & Zoller, P. (2022) · Nature Reviews Physics · doi:10.1038/s42254-022-00535-2 · Cited by 355
Two-qubit silicon quantum processor with operation fidelity exceeding 99%
Mills, A. R., Guinn, C. R., Gullans, M. J., Sigillito, A. J., Feldman, M. M., Nielsen, E., & Petta, J. R. (2022) · Science Advances · doi:10.1126/sciadv.abn5130 · Cited by 329
Self-citationBenchmarking a trapped-ion quantum computer with 30 qubits
Chen, J.-S., Nielsen, E., Ebert, M., Inlek, V., Wright, K., Chaplin, V., Maksymov, A., Páez, E., Poudel, A., Maunz, P., et al. (2024) · Quantum · doi:10.22331/q-2024-11-07-1516 · Cited by 103
Self-citation
Metadata
- Authors
- Nielsen, E., Gamble, J. K., Rudinger, K., Scholten, T., Young, K., & Blume-Kohout, R.
- Venue
- Quantum
- Published
- 2021-10-05
- Volume
- 5
- Pages
- 557
- ISSN
- 2521-327X (ISSN-L)
- OpenAlex
- W2471819066
- Cited by
- 189
- References
- 31
- FWCI
- 10.59
- 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: Gate Set Tomography. https://app.cochat.ai/papers/10.22331/q-2021-10-05-557
- The paper
- Nielsen, E., Gamble, J. K., Rudinger, K., Scholten, T., Young, K., & Blume-Kohout, R. (2021). Gate Set Tomography. Quantum. https://doi.org/10.22331/q-2021-10-05-557
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.