Benchmarking fault-tolerant quantum computing hardware via QLOPS

Abstract

It is widely recognized that quantum computing has profound impacts on multiple fields, including but not limited to cryptography, machine learning, materials science, etc. To run quantum algorithms, it is essential to develop scalable quantum hardware with low noise levels and to design efficient fault-tolerant quantum computing (FTQC) schemes. Currently, various FTQC schemes have been developed for different hardware platforms. However, a comprehensive framework for the analysis and evaluation of these schemes is still lacking. In this work, we propose Quantum Logical Operations Per Second (QLOPS) as a metric for assessing the performance of FTQC schemes on quantum hardware platforms. This benchmarking framework will integrate essential relevant factors, e.g., the code rates of quantum error-correcting codes, the accuracy, throughput, and latency of the decoder. Through a resource analysis of factoring RSA-2048, we demonstrate that QLOPS reflects the practical requirements of quantum algorithm execution. This framework will enable the identification of bottlenecks in quantum hardware, providing potential directions for their development. Moreover, our results will help establish a comparative framework for evaluating FTQC designs. As this benchmarking approach considers practical applications, it may assist in estimating the hardware resources needed to implement quantum algorithms and offers preliminary insights into potential timelines.

Published version. 14 pages, 2 figures

References in corpus (28)

• Quantum algorithm for solving linear systems of equations
• A Quantum Engineer's Guide to Superconducting Qubits
• Quantum Error Correction for Quantum Memories
• Trapped-Ion Quantum Computing: Progress and Challenges
• Logical quantum processor based on reconfigurable atom arrays
• Validating quantum computers using randomized model circuits
• Quantum error correction below the surface code threshold
• Toward the first quantum simulation with quantum speedup
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Superconducting Quantum Computing: A Review
• Magic State Distillation: Not as Costly as You Think
• Challenges and Opportunities of Near-Term Quantum Computing Systems
• Measuring the Capabilities of Quantum Computers
• Neutral Atom Quantum Computing Hardware: Performance and End-User Perspective
• Low-overhead fault-tolerant quantum computing using long-range connectivity
• A tweezer array with 6100 highly coherent atomic qubits
• A volumetric framework for quantum computer benchmarks
• Relaxing Hardware Requirements for Surface Code Circuits using Time-dynamics
• Parallel window decoding enables scalable fault tolerant quantum computation
• Supercharged two-dimensional tweezer array with more than 1000 atomic qubits
• Scalable multilayer architecture of assembled single-atom qubit arrays in a three-dimensional Talbot tweezer lattice
• Localized statistics decoding for quantum low-density parity-check codes
• Resource Analysis of Low-Overhead Transversal Architectures for Reconfigurable Atom Arrays
• Magic state cultivation: growing T states as cheap as CNOT gates
• How to factor 2048 bit RSA integers with less than a million noisy qubits
• Improved belief propagation is sufficient for real-time decoding of quantum memory
• Scalable decoding protocols for fast transversal logic in the surface code
• Fast correlated decoding of transversal logical algorithms