• Open Access

Comparing planar quantum computing platforms at the quantum speed limit

Daniel Basilewitsch, Clemens Dlaska, and Wolfgang Lechner
Phys. Rev. Research 6, 023026 – Published 5 April 2024

Abstract

An important aspect that strongly impacts the experimental feasibility of quantum circuits is the ratio of gate times and typical error time scales. Algorithms with circuit depths that significantly exceed the error time scales will result in faulty quantum states and error correction is inevitable. We present a comparison of the theoretical minimal gate time, i.e., the quantum speed limit (QSL), for realistic two- and multi-qubit gate implementations in neutral atoms and superconducting qubits. Subsequent to finding the QSLs for individual gates by means of optimal control theory we use them to quantify the circuit QSL of the quantum Fourier transform and the quantum approximate optimization algorithm. In particular, we analyze these quantum algorithms in terms of circuit run times and gate counts both in the standard gate model and the parity mapping. We find that neutral atom and superconducting qubit platforms show comparable weighted circuit QSLs with respect to the system size.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 24 May 2023
  • Revised 30 November 2023
  • Accepted 12 March 2024

DOI:https://doi.org/10.1103/PhysRevResearch.6.023026

Published by the American Physical Society under the terms of the Creative Commons Attribution 4.0 International license. Further distribution of this work must maintain attribution to the author(s) and the published article's title, journal citation, and DOI.

Published by the American Physical Society

Physics Subject Headings (PhySH)

Quantum Information, Science & TechnologyCondensed Matter, Materials & Applied PhysicsAtomic, Molecular & Optical

Authors & Affiliations

Daniel Basilewitsch1,*, Clemens Dlaska1, and Wolfgang Lechner1,2

  • 1Institute for Theoretical Physics, University of Innsbruck, A-6020 Innsbruck, Austria
  • 2Parity Quantum Computing GmbH, A-6020 Innsbruck, Austria

  • *daniel.basilewitsch@uibk.ac.at

Article Text

Click to Expand

References

Click to Expand
Issue

Vol. 6, Iss. 2 — April - June 2024

Subject Areas
Reuse & Permissions
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review Research

Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

×

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×