Qutrit Randomized Benchmarking
Open accessThe DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Abstract
Ternary quantum processors offer significant potential computational advantages over conventional qubit technologies, leveraging the encoding and processing of quantum information in qutrits (three-level systems). To evaluate and compare the performance of such emerging quantum hardware it is essential to have robust benchmarking methods suitable for a higher-dimensional Hilbert space. We demonstrate extensions of industry standard randomized benchmarking (RB) protocols, developed and used extensively for qubits, suitable for ternary quantum logic. Using a superconducting five-qutrit processor, we find an average single-qutrit process infidelity of 3.8×10^{-3}. Through interleaved RB, we characterize a few relevant gates, and employ simultaneous RB to fully characterize crosstalk errors. Finally, we apply cycle benchmarking to a two-qutrit CSUM gate and obtain a two-qutrit process fidelity of 0.85. Our results present and demonstrate RB-based tools to characterize the performance of a qutrit processor, and a general approach to diagnose control errors in future qudit hardware.
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
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
Simple Pulses for Elimination of Leakage in Weakly Nonlinear Qubits
Motzoi, F., Gambetta, J. M., Rebentrost, P., & Wilhelm, F. K. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.110501 · Cited by 814
Experimental Two-Photon, Three-Dimensional Entanglement for Quantum Communication
Vaziri, A., Weihs, G., & Zeilinger, A. (2002) · Physical Review Letters · doi:10.1103/physrevlett.89.240401 · Cited by 638
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
High-fidelity spin entanglement using optimal control
Dolde, F., Bergholm, V., Wang, Y., Jakobi, I., Naydenov, B., Pezzagna, S., Meijer, J., Jelezko, F., Neumann, P., Schulte-Herbrüggen, T., et al. (2014) · Nature Communications · doi:10.1038/ncomms4371 · Cited by 325
Efficient Toffoli gates using qudits
Ralph, T. C., Resch, K. J., & Gilchrist, A. (2007) · Physical Review A · doi:10.1103/physreva.75.022313 · Cited by 293
High-dimensional optical quantum logic in large operational spaces
Imany, P., Jaramillo-Villegas, J. A., Alshaykh, M. S., Lukens, J. M., Odele, O. D., Moore, A. J., Leaird, D. E., Qi, M., & Weiner, A. M. (2019) · npj Quantum Information · doi:10.1038/s41534-019-0173-8 · Cited by 169
Cited by
Qudits and High-Dimensional Quantum Computing
Wang, Y., Hu, Z., Sanders, B. C., & Kais, S. (2020) · Frontiers in Physics · doi:10.3389/fphy.2020.589504 · Cited by 478
A universal qudit quantum processor with trapped ions
Ringbauer, M., Meth, M., Postler, L., Stricker, R., Blatt, R., Schindler, P., & Monz, T. (2022) · Nature Physics · doi:10.1038/s41567-022-01658-0 · Cited by 351
Engineering high-coherence superconducting qubits
Siddiqi, I. (2021) · Nature Reviews Materials · doi:10.1038/s41578-021-00370-4 · Cited by 311
Self-citationQuantum many-body simulations on digital quantum computers: State-of-the-art and future challenges
Fauseweh, B. (2024) · Nature Communications · doi:10.1038/s41467-024-46402-9 · Cited by 152
Scalable Randomized Benchmarking of Quantum Computers Using Mirror Circuits
Proctor, T., Seritan, S., Rudinger, K., Nielsen, E., Blume-Kohout, R., & Young, K. (2022) · Physical Review Letters · doi:10.1103/physrevlett.129.150502 · Cited by 68
Metadata
- Authors
- Morvan, A., Ramasesh, V. V., Blok, M. S., Kreikebaum, J. M., O’Brien, K., Chen, L., Mitchell, B. K., Naik, R. K., Santiago, D. I., & Siddiqi, I.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2021-05-27
- Volume
- 126
- Issue
- 21
- Pages
- 210504-210504
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W3080935772
- Cited by
- 132
- References
- 8
- FWCI
- 7.32
- Type
- journal article
- Language
- en
- Open access
- bronze
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.