Robust Extraction of Tomographic Information via Randomized Benchmarking
Open accessThe DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Abstract
Quantum processing tomography typically reconstructs an unknown quantum dynamical operation by measuring its effects on known states of a quantum device. Taking a different approach of comparing the operation of interest to a set of finite and easily implementable reference operations, a new method can reconstruct any quantum operation reliably.
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
Mixed-state entanglement and quantum error correction
Bennett, C. H., DiVincenzo, D. P., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.3824 · Cited by 5,272
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
States, Effects, and Operations Fundamental Notions of Quantum Theory
(1983) · Lecture Notes in Physics · doi:10.1007/3-540-12732-1 · Cited by 1,928 · cited 1×
“The map E is CP iff χE is positive semidefinite, and the TP condition E†(Î) = Î translates to trχE = 1 [1].”
BackgroundImproved simulation of stabilizer circuits
Aaronson, S., & Gottesman, D. (2004) · Physical Review A · doi:10.1103/physreva.70.052328 · Cited by 1,515 · cited 2×
“In particular, Aaronson and Gottesman [39] have proven that circuits consisting of Clifford group maps and a logarithmic number of maps outside the Clifford group can be simulated efficiently.”
BackgroundLinear 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
Geometry of Quantum States: An Introduction to Quantum Entanglement
Bengtsson, I., & Zyczkowski, K. (2006) · doi:10.1017/cbo9780511535048 · Cited by 1,357
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
General 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
Prescription for experimental determination of the dynamics of a quantum black box
Chuang, I. L., & Nielsen, M. A. (1997) · Journal of Modern Optics · doi:10.1080/09500349708231894 · Cited by 949 · cited 2×
“While quantum process tomography [1] is a conceptually simple approach to the characterization of quantum operations on states, its implementation suffers from a number of fundamental drawbacks.”
BackgroundReference frames, superselection rules, and quantum information
Bartlett, S. D., Rudolph, T., & Spekkens, R. W. (2007) · Reviews of Modern Physics · doi:10.1103/revmodphys.79.555 · Cited by 827
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 · cited 1×
“The average fidelity is closely related to the trace overlap tr[E(U (PL))†] between E and U , as well as to χE◦U † 00 , by the formulas [25, 26]”
BackgroundScalable 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
The Heisenberg Representation of Quantum Computers
Gottesman, D. (1998) · arXiv · doi:10.48550/arxiv.quant-ph/9807006 · Cited by 489
Characterizing 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
An analysis of completely-positive trace-preserving maps on M2
Beth Ruskai, M., Szarek, S., & Werner, E. (2002) · Linear Algebra and its Applications · doi:10.1016/s0024-3795(01)00547-x · Cited by 366 · cited 1×
“However, it is easy to show [46] that Eqs.”
BackgroundClassical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
Bremner, M. J., Jozsa, R., & Shepherd, D. J. (2011) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2010.0301 · Cited by 308 · cited 1×
“However, there are strong indications that quantum computers are strictly more powerful than classical computers; for example, if classical computers could efficiently simulate certain classes of nonuniversal quantum circuits, it would imply a collapse of the polynomial hierarchy [37]; thus, it is considered highly un…”
BackgroundQuantum 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
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×
“This is a recent development sometimes referred to as interleaved RB [11,12], but we do not make such a distinction in this paper.”
Background
Cited by
Quantum information processing with superconducting circuits: a review
Wendin, G. (2017) · Reports on Progress in Physics · doi:10.1088/1361-6633/aa7e1a · Cited by 890
Blume-Kohout, R., Gamble, J. K., Nielsen, E., Rudinger, K., Mizrahi, J., Fortier, K., & Maunz, P. (2017) · Nature Communications · doi:10.1038/ncomms14485 · Cited by 401
Randomized benchmarking with confidence
Wallman, J. J., & Flammia, S. T. (2014) · New Journal of Physics · doi:10.1088/1367-2630/16/10/103032 · Cited by 164
Limitations of Linear Cross-Entropy as a Measure for Quantum Advantage
Gao, X., Kalinowski, M., Chou, C.-N., Lukin, M. D., Barak, B., & Choi, S. (2021) · arXiv · doi:10.48550/arxiv.2112.01657 · Cited by 54
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
Metadata
- Authors
- Kimmel, S., da Silva, M. P., Ryan, C. A., Johnson, B. R., & Ohki, T.
- Venue
- Physical Review X
- Publisher
- American Physical Society (APS)
- Published
- 2014-03-25
- Volume
- 4
- Issue
- 1
- ISSN
- 2160-3308 (ISSN-L)
- OpenAlex
- W2197609911
- Cited by
- 115
- References
- 18
- FWCI
- 11.88
- 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.