Benchmarking an 11-qubit quantum computer

By Kenneth Wright, K. Beck, Shantanu Debnath, Jason M. Amini, Y. Nam, Nikodem Grzesiak, Jwo-Sy Chen, N. Pisenti, Mika Chmielewski, Coleman Collins and 14 more. Nature Communications, 2019

554 citations recorded by the source corpus.

The field of quantum computing has grown from concept to demonstration devices over the past 20 years. Universal quantum computing offers efficiency in approaching problems of scientific and commercial interest, such as factoring large numbers, searching databases, simulating intractable models from quantum physics, and optimizing complex cost functions. Here, we present an 11-qubit fully-connected, programmable quantum computer in a trapped ion system composed of 13 171Yb+ ions. We demonstrate average single-qubit gate fidelities of 99.5%\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\%$$\end{document}, average two-qubit-gate fidelities of 97.5%\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\%$$\end{document}, and SPAM errors of 0.7%\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\%$$\end{document}. To illustrate the capabilities of this universal platform and provide a basis for comparison with similarly-sized devices, we compile the Bernstein-Vazirani and Hidden Shift algorithms into our native gates and execute them on the hardware with average success rates of 78%\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\%$$\end{document} and 35%\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\%$$\end{document}, respectively. These algorithms serve as excellent benchmarks for any type of quantum hardware, and show that our system outperforms all other currently available hardware. The growing complexity of quantum computing devices makes presents challenges for benchmarking their performance as previous, exhaustive approaches become infeasible. Here the authors characterise the quality of their 11-qubit device by successfully computing two quantum algorithms.

Subfields: Artificial Intelligence, Atomic and Molecular Physics, and Optics

View Paper: https://www.semanticscholar.org/paper/abac6d39b6aebc7c3e58b7b13f71e6d489c272dc

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Maria Schuld
  2. Josh A. Izaac
  3. Nathan Killoran
  4. Thomas R. Bromley
  5. Ville Bergholm
  6. Nicolás Quesada
  7. Juan Miguel Arrazola
  8. Heliang Huang

In Atomic and Molecular Physics, and Optics

  1. Maria Schuld
  2. Nathan Killoran
  3. Josh A. Izaac
  4. Thomas R. Bromley
  5. Nicolás Quesada
  6. Ville Bergholm
  7. Juan Miguel Arrazola
  8. Heliang Huang

Citations in the corpus