Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat

The DOI matches its Crossref record; 46 of the 47 references it cites were found in a registry or an index.

Partial randomized benchmarking

Open access
Dubovitskii, Kirill, Makhlin, Yuriy · 2022 · Scientific Reports

Abstract

In randomized benchmarking of quantum logical gates, partial twirling can be used for simpler implementation, better scaling, and higher accuracy and reliability. For instance, for two-qubit gates, single-qubit twirling is easier to realize than full averaging. We analyze such simplified, partial twirling and demonstrate that, unlike for the standard randomized benchmarking, the measured decay of fidelity is a linear combination of exponentials with different decay rates (3 for two qubits and single-bit twirling). The evolution with the sequence length is governed by an iteration matrix, whose spectrum gives the decay rates. For generic two-qubit gates one slowest exponential dominates and characterizes gate errors in three channels. Its decay rate is close, but different from that in the standard randomized benchmarking, and we find the leading correction. Using relations to the local invariants of two-qubit gates we identify all exceptional gates with several slow exponentials and analyze possibilities to extract their decay rates from the measured curves.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1038/s41598-022-13813-x

Cites

46 of 46 references verified0 citation errors · 0 not checkable

Statistics

Figures

Figure 1 Distribution of possible values of the entries m1, m2 of the iteration matrix M⁰ for possible two-qubit gates, drawn uniformly from the unitary group U(4). Each point (m1,m2) corresponds to a family of two-qubit gates. Large solid dots correspond to (the families of) the gates SWAP, iSWAP, √SWAP, identity, and CNOT. Boundaries of this region are discussed in the text. The dashed line indicates the family in Eq. (42) with the solid square showing the gate Wλ especially suited for partial RB—with only a single decay factor (here cosλπ=-1/5), see discussion around Eq. (42). Inset: the partial-RB decay factors for each of these gates, that is the eigenvalues of the respective iteration matrix M⁰.
Figure 1 Distribution of possible values of the entries m1, m2 of the iteration matrix M⁰ for possible two-qubit gates, drawn uniformly from the unitary group U(4). Each point (m1,m2) corresponds to a family of two-qubit gates. Large solid dots correspond to (the families of) the gates SWAP, iSWAP, √SWAP, identity, and CNOT. Boundaries of this region are discussed in the text. The dashed line indicates the family in Eq. (42) with the solid square showing the gate Wλ especially suited for partial RB—with only a single decay factor (here cosλπ=-1/5), see discussion around Eq. (42). Inset: the partial-RB decay factors for each of these gates, that is the eigenvalues of the respective iteration matrix M⁰.CC BY · PubMed Central

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 47 references

Research works printed but not linked: 2

  1. Shor, P. W. Fault-tolerant quantum computation. In Proceedings of 37th Conference on Foundations of Computer Science, 56–65 (IEEE press, Los Alamitos, California, 1996).
  2. Meier, A. M. Randomized benchmarking of Clifford operators. Ph.D. thesis, University of Colorado at Boulder (2013).

Cited by

See all 1

Metadata

Authors
Dubovitskii, K., & Makhlin, Y.
Affiliations
  • Moscow Institute of Physics and Technology (RU)
  • National Research University Higher School of Economics (RU)
Corresponding author
Makhlin, Yuriy
Venue
Scientific Reports
Published
2022-06-16
Volume
12
Issue
1
Pages
10129-10129
ISSN
2045-2322 (ISSN-L)
OpenAlex
W4282961692
Cited by
1
References
47
Citations by year
2024: 1
FWCI
0.08
Type
journal article
Language
en
Open access
Licence
Locations
  • Scientific Reports (publishedVersion, cc-by)
  • PubMed Central (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • arXiv (Cornell University)
Funders
Basic research program of HSE
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
gate fidelity, two-qubit gates, exponential decay rate

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: Partial randomized benchmarking. https://app.cochat.ai/papers/10.1038/s41598-022-13813-x
The paper
Dubovitskii, K., & Makhlin, Y. (2022). Partial randomized benchmarking. Scientific Reports. https://doi.org/10.1038/s41598-022-13813-x

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.