Theory of Quantum System Certification
Open accessThe DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Abstract
The precise control of complex quantum systems promises numerous technological applications including digital quantum computing.The complexity of such devices renders the certification of their correct functioning a challenge.To address this challenge, numerous methods were developed in the last decade.In this tutorial, we explain prominent protocols for certifying the physical layer of quantum devices described by quantum states and processes.Such protocols are particularly important in the development of near-term devices.Specifically, we discuss methods of direct quantum-state certification, direct-fidelity estimation, shadow-fidelity estimation, direct quantum-process certification, randomized benchmarking, and cross-entropy benchmarking.Moreover, we provide an introduction to powerful mathematical methods, which are widely used in quantum-information theory, in order to derive theoretical guarantees for the protocols.
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 Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
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
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
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
The Theory of Quantum Information
Watrous, J. (2018) · doi:10.1017/9781316848142 · Cited by 1,325
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
Characterizing quantum supremacy in near-term devices
Boixo, S., Isakov, S. V., Smelyanskiy, V. N., Babbush, R., Ding, N., Jiang, Z., Bremner, M. J., Martinis, J. M., & Neven, H. (2018) · Nature Physics · doi:10.1038/s41567-018-0124-x · Cited by 1,175 · cited 9×
“Protocol 59 (Cross-entropy benchmarking (XEB) [56, 126]):”
BackgroundMethodInfluentialRandomized 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 · cited 4×
“Another practically very interesting variation of RB arises when one does not draw the gates from the uniform but another distribution over the group [85, 97, 107, 117].”
BackgroundMethodInfluentialGeneral teleportation channel, singlet fraction, and quasidistillation
Horodecki, M., Horodecki, P., & Horodecki, R. (1999) · Physical Review A · doi:10.1103/physreva.60.1888 · Cited by 965
The computational complexity of linear optics
Aaronson, S., & Arkhipov, A. (2011) · Proceedings of the forty-third annual ACM symposium on Theory of computing · doi:10.1145/1993636.1993682 · Cited by 874
A simple formula for the average gate fidelity of a quantum dynamical operation
Nielsen, M. A. (2002) · Physics Letters A · doi:10.1016/s0375-9601(02)01272-0 · Cited by 725
Scalable noise estimation with random unitary operators
Emerson, J., Alicki, R., & Życzkowski, K. (2005) · Journal of Optics B: Quantum and Semiclassical Optics · doi:10.1088/1464-4266/7/10/021 · Cited by 502 · cited 5×
“Randomized benchmarking was originally developed in a series of work focusing on the unitary group and Clifford gates [49, 61, 62, 85, 86].”
BackgroundMethodInfluentialCharacterizing quantum gates via randomized benchmarking
Magesan, E., Gambetta, J. M., & Emerson, J. (2012) · Physical Review A · doi:10.1103/physreva.85.042311 · Cited by 464 · cited 1×
“[86, 96] and Proctor et al.”
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 · cited 7×
“[30] investigates into the idea of removing “bad events” which are those that violate the wellconditioning condition.”
BackgroundMethodInfluentialLocal Random Quantum Circuits are Approximate Polynomial-Designs
Brandão, F. G. S. L., Harrow, A. W., & Horodecki, M. (2016) · Communications in Mathematical Physics · doi:10.1007/s00220-016-2706-8 · Cited by 404
Self-testing of quantum systems: a review
Šupić, I., & Bowles, J. (2020) · Quantum · doi:10.22331/q-2020-09-30-337 · Cited by 365
Evenly distributed unitaries: On the structure of unitary designs
Gross, D., Audenaert, K., & Eisert, J. (2007) · Journal of Mathematical Physics · doi:10.1063/1.2716992 · Cited by 358 · cited 2×
“[48] D.”
BackgroundQuantum computing and the entanglement frontier
Preskill, J. (2012) · arXiv · doi:10.48550/arxiv.1203.5813 · Cited by 308
Average-Case Complexity Versus Approximate Simulation of Commuting Quantum Computations
Bremner, M. J., Montanaro, A., & Shepherd, D. J. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.080501 · Cited by 299
On the complexity and verification of quantum random circuit sampling
Bouland, A., Fefferman, B., Nirkhe, C., & Vazirani, U. (2019) · Nature Physics · doi:10.1038/s41567-018-0318-2 · Cited by 287
Complexity-Theoretic Foundations of Quantum Supremacy Experiments
Aaronson, S., & Chen, L. (2016) · arXiv · doi:10.48550/arxiv.1612.05903 · Cited by 218
Achieving quantum supremacy with sparse and noisy commuting quantum computations
Bremner, M. J., Montanaro, A., & Shepherd, D. J. (2017) · Quantum · doi:10.22331/q-2017-04-25-8 · Cited by 191
Randomized Benchmarking of Multiqubit Gates
Gaebler, J. P., Meier, A. M., Tan, T. R., Bowler, R., Lin, Y., Hanneke, D., Jost, J. D., Home, J. P., Knill, E., Leibfried, D., et al. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.260503 · Cited by 127 · cited 1×
“[94, 110] and demonstrated in practice.”
Direct Randomized Benchmarking for Multiqubit Devices
Proctor, T. J., Carignan-Dugas, A., Rudinger, K., Nielsen, E., Blume-Kohout, R., & Young, K. (2019) · Physical Review Letters · doi:10.1103/physrevlett.123.030503 · Cited by 118 · cited 3×
“Another practically very interesting variation of RB arises when one does not draw the gates from the uniform but another distribution over the group [85, 97, 107, 117].”
BackgroundMethodHow many qubits are needed for quantum computational supremacy?
Dalzell, A. M., Harrow, A. W., Koh, D. E., & La Placa, R. L. (2020) · Quantum · doi:10.22331/q-2020-05-11-264 · Cited by 88
Efficient error characterization in quantum information processing
Lévi, B., López, C. C., Emerson, J., & Cory, D. G. (2007) · Physical Review A · doi:10.1103/physreva.75.022314 · Cited by 65
Anticoncentration theorems for schemes showing a quantum speedup
Hangleiter, D., Bermejo-Vega, J., Schwarz, M., & Eisert, J. (2018) · Quantum · doi:10.22331/q-2018-05-22-65 · Cited by 58
Bounding the average gate fidelity of composite channels using the unitarity
Carignan-Dugas, A., Wallman, J. J., & Emerson, J. (2019) · New Journal of Physics · doi:10.1088/1367-2630/ab1800 · Cited by 44 · cited 4×
“Theorem 58 (Composite channel bound [70]):”
MethodInfluentialEfficient unitarity randomized benchmarking of few-qubit Clifford gates
Dirkse, B., Helsen, J., & Wehner, S. (2019) · Physical Review A · doi:10.1103/physreva.99.012315 · Cited by 20 · cited 2×
“[76, 95].”
BackgroundLogical Randomized Benchmarking
Combes, J., Granade, C., Ferrie, C., & Flammia, S. T. (2017) · arXiv · doi:10.48550/arxiv.1702.03688 · Cited by 20
On the Classical Hardness of Spoofing Linear Cross-Entropy Benchmarking
Aaronson, S., & Gunn, S. (2019) · arXiv · doi:10.48550/arxiv.1910.12085 · Cited by 12
Cited by
Cai, Z., Babbush, R., Benjamin, S. C., Endo, S., Huggins, W. J., Li, Y., McClean, J. R., & O’Brien, T. E. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.045005 · Cited by 591
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
Computational advantage of quantum random sampling
Hangleiter, D., & Eisert, J. (2023) · Reviews of Modern Physics · doi:10.1103/revmodphys.95.035001 · Cited by 145
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
“1 is issued based on the stabilizer measurement outcome.”
InfluentialEstimation of correlations and nonseparability in quantum channels via unitarity benchmarking
Girling, M., Cîrstoiu, C., & Jennings, D. (2022) · Physical Review Research · doi:10.1103/physrevresearch.4.023041 · Cited by 5
“If the gates applied correspond to a (noisy) 2-design, such as Γ being the Clifford group, then it can be shown that [1] the resulting statistics are exponentially decreasing in k, namely E[m(k)] = c1+c2λ, for constants c1 and c2 that contain the state preparation and measurement details.”
Method
Metadata
- Authors
- Kliesch, M., & Roth, I.
- Venue
- PRX Quantum
- Publisher
- American Physical Society (APS)
- Published
- 2021-01-29
- Volume
- 2
- Issue
- 1
- ISSN
- 2691-3399 (ISSN-L)
- OpenAlex
- W3092693562
- Cited by
- 139
- References
- 32
- FWCI
- 7.23
- 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.