The DOI matches its Crossref record; 41 of the 42 references it cites were found in a registry or an index.
Bounding the average gate fidelity of composite channels using the unitarity
Open accessAbstract
There is currently a significant need for robust and efficient methods for characterizing quantum devices. While there has been significant progress in this direction, there remains a crucial need to precisely determine the strength and type of errors on individual gate operations, in order to assess and improve control as well as reliably bound the total error in a quantum circuit given some partial information about the errors on the components. In this work, we first provide an optimal bound on the total fidelity of a circuit in terms of component fidelities, which can be efficiently experimentally estimated via randomized benchmarking (RB). We then derive a tighter bound that applies under additional information about the coherence of the error, namely, the unitarity, which can also be estimated via a related experimental protocol. This improved bound smoothly interpolates between the worst-case quadratic and best-case linear scaling for composite error channels. As an application we show how our analysis substantially improves the achievable precision on estimates of the infidelities of individual gates under interleaved RB, enabling greater precision for current experimental methods to assess and tune-up control over quantum gate operations.
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
Bhatia, R. (1996) · Cited by 2,847
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
An addressable quantum dot qubit with fault-tolerant control-fidelity
Veldhorst, M., Hwang, J. C. C., Yang, C. H., Leenstra, A. W., de Ronde, B., Dehollain, J. P., Muhonen, J. T., Hudson, F. E., Itoh, K. M., Morello, A., et al. (2014) · Nature Nanotechnology · doi:10.1038/nnano.2014.216 · Cited by 940
A quantum-dot spin qubit with coherence limited by charge noise and fidelity higher than 99.9%
Yoneda, J., Takeda, K., Otsuka, T., Nakajima, T., Delbecq, M. R., Allison, G., Honda, T., Kodera, T., Oda, S., Hoshi, Y., et al. (2018) · Nature Nanotechnology · doi:10.1038/s41565-017-0014-x · Cited by 900
Scalable and Robust Randomized Benchmarking of Quantum Processes
Magesan, E., Gambetta, J. M., & Emerson, J. (2011) · Physical Review Letters · doi:10.1103/physrevlett.106.180504 · Cited by 724
Self-citationExact and approximate unitary 2-designs and their application to fidelity estimation
Dankert, C., Cleve, R., Emerson, J., & Livine, E. (2009) · Physical Review A · doi:10.1103/physreva.80.012304 · Cited by 685
Self-citationEfficient Z gates for quantum computing
McKay, D. C., Wood, C. J., Sheldon, S., Chow, J. M., & Gambetta, J. M. (2017) · Physical Review A · doi:10.1103/physreva.96.022330 · Cited by 557
Noise tailoring for scalable quantum computation via randomized compiling
Wallman, J. J., & Emerson, J. (2016) · Physical Review A · doi:10.1103/physreva.94.052325 · Cited by 535
Self-citationScalable 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
Self-citationProcedure for systematically tuning up cross-talk in the cross-resonance gate
Sheldon, S., Magesan, E., Chow, J. M., & Gambetta, J. M. (2016) · Physical Review A · doi:10.1103/physreva.93.060302 · Cited by 477
Cited by
Characterizing large-scale quantum computers via cycle benchmarking
Erhard, A., Wallman, J. J., Postler, L., Meth, M., Stricker, R., Martinez, E. A., Schindler, P., Monz, T., Emerson, J., & Blatt, R. (2019) · Nature Communications · doi:10.1038/s41467-019-13068-7 · Cited by 253
Self-citationPrecision tomography of a three-qubit donor quantum processor in silicon
Mądzik, M. T., Asaad, S., Youssry, A., Joecker, B., Rudinger, K. M., Nielsen, E., Young, K. C., Proctor, T. J., Baczewski, A. D., Laucht, A., et al. (2022) · Nature · doi:10.1038/s41586-021-04292-7 · Cited by 241
Silicon qubit fidelities approaching incoherent noise limits via pulse engineering
Yang, C. H., Chan, K. W., Harper, R., Huang, W., Evans, T., Hwang, J. C. C., Hensen, B., Laucht, A., Tanttu, T., Hudson, F. E., et al. (2019) · Nature Electronics · doi:10.1038/s41928-019-0234-1 · Cited by 201
General Framework for Randomized Benchmarking
Helsen, J., Roth, I., Onorati, E., Werner, A. H., & Eisert, J. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.020357 · Cited by 254
“We emphasize here that we discuss the so-called ‘interleaved step of the interleaved RB protocol, and do not interpret the resulting decay rate (for a thorough discussion of the relationship of interleaved RB decay rates and their interpretation see [72]).”
BackgroundTheory of Quantum System Certification
Kliesch, M., & Roth, I. (2021) · PRX Quantum · doi:10.1103/prxquantum.2.010201 · Cited by 237
“Theorem 58 (Composite channel bound [70]):”
MethodInfluential
Metadata
- Authors
- Carignan-Dugas, A., Wallman, J. J., & Emerson, J.
- Affiliations
- University of Waterloo (CA)
- Canadian Institute for Advanced Research (CA)
- Corresponding author
- Carignan-Dugas, Arnaud
- Venue
- New Journal of Physics
- Publisher
- IOP Publishing
- Published
- 2019-05-01
- Volume
- 21
- Issue
- 5
- Pages
- 053016
- ISSN
- 1367-2630 (ISSN-L)
- OpenAlex
- W2952072673
- Cited by
- 44
- References
- 42
- Citations by year
- 2025: 4 · 2024: 2 · 2023: 13 · 2022: 6 · 2021: 13 · 2020: 4 · 2019: 2
- FWCI
- 2.88
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- cc-by
- creativecommons.org/licenses/by/3.0/ (vor, 7 d)
- iopscience.iop.org/info/page/text-and-data-mining (tdm, 7 d)
- Locations
- New Journal of Physics (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion)
- arXiv (Cornell University)
- Funders
- Natural Sciences and Engineering Research Council of Canada (PGS D)
- Army Research Office (W911NF-14-1-010)
- Canadian Institute for Advanced Research
- Canada First Research Excellence Fund
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- average gate fidelity, unitarity, randomized benchmarking, quantum device characterization, error bounds, quantum circuit fidelity
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: Bounding the average gate fidelity of composite channels using the unitarity. https://app.cochat.ai/papers/10.1088/1367-2630/ab1800
- The paper
- Carignan-Dugas, A., Wallman, J. J., & Emerson, J. (2019). Bounding the average gate fidelity of composite channels using the unitarity. New Journal of Physics. https://doi.org/10.1088/1367-2630/ab1800
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.