Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Bulletin of the American Physical Society

Benchmarking NISQ-era quantum processors

Jay Gambetta

Published Mar 8, 2019• 1 citation
OpenAlex

Related papers

Quantum Computing Software in the NISQ Era: Architectural Evolution, Framework Benchmarking, and Software-Hardware Co-design

Rujia Qiu, Teng Tian, Wangchao Dong +3 more

International Symposium on Advances in Electrical, Electronics and Computer Engineering (ISAEECE)•Jun 1, 2026•0 citations

Benchmarking Quantum Processor Performance through Quantum Distance Metrics Over An Algorithm Suite

Samuel Stein, Nathan Wiebe, James Ang +1 more

Quantum computing is poised to solve computational paradigms that classical computing could never feasibly reach. Tasks such as prime factorization to Quantum Chemistry are examples of classically difficult problems that have analogous algorithms that are sped up on quantum computers. To attain this computational advantage, we must first traverse the noisy intermediate scale quantum (NISQ) era, in which quantum processors suffer from compounding noise factors that can lead to unreliable algorithm induction producing noisy results. We describe QASMBench, a suite of QASM-level (Quantum assembly language) benchmarks that challenge all realisable angles of quantum processor noise. We evaluate a large portion of these algorithms by performing density matrix tomography on 14 IBMQ Quantum devices.

IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum•May 1, 2022•0 citations

Benchmarking quantum processors with a single qubit

Oktay Göktaş, W. K. Tham, Kent Bonsma-Fisher +1 more

arXiv:1905.05775•Quantum Information Processing•Mar 18, 2020•5 citations

Quantum Computing: NISQ and Beyond.

Richard A. Muller

•Oct 1, 2021•0 citations

Benchmarking Quantum Annealers with Linear System Solving

Stéphane Louise

While we are still far from Fault Tolerant Quantum Computers (FTQCs) which are required to obtain a significant advantage in some algorithms, for benchmarking purposes, it can be interesting to try and solve problems with Noisy Intermediate Scale Quantum (NISQ) era Quantum Computers (QCs) on some of the future applications of FTQC. In this paper, our aim is to assess the performance of D-Wave Quantum Processing Units (QPUs) in solving systems of linear equations. This can also be used as a first reference point to compare NISQ era QPUs between them. To that end, we illustrate the transformation of these systems into Quadratic Unconstrained Binary Optimization (QUBO) problems, which can be tackled by these QPUs. We evaluate their performance in their default configurations and demonstrate some usual way to enhance their performance. Finally, we introduce a novel approach to solving these problems that does not result in an exponential growth of their coefficients. Data-points from these experiments are meant to be integrated in the BACQ benchmark [2].

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•0 citations

Quantum Computing: NISQ and Beyond.

Richard A. Muller

•Dec 1, 2021•1 citation
Quantum computing is poised to solve computational paradigms that classical computing could never feasibly reach. Tasks such as prime factorization to Quantum Chemistry are examples of classically difficult problems that have analogous algorithms that are sped up on quantum computers. To attain this computational advantage, we must first traverse the noisy intermediate scale quantum (NISQ) era, in which quantum processors suffer from compounding noise factors that can lead to unreliable algorithm induction producing noisy results. We describe QASMBench, a suite of QASM-level (Quantum assembly language) benchmarks that challenge all realisable angles of quantum processor noise. We evaluate a large portion of these algorithms by performing density matrix tomography on 14 IBMQ Quantum devices.
While we are still far from Fault Tolerant Quantum Computers (FTQCs) which are required to obtain a significant advantage in some algorithms, for benchmarking purposes, it can be interesting to try and solve problems with Noisy Intermediate Scale Quantum (NISQ) era Quantum Computers (QCs) on some of the future applications of FTQC. In this paper, our aim is to assess the performance of D-Wave Quantum Processing Units (QPUs) in solving systems of linear equations. This can also be used as a first reference point to compare NISQ era QPUs between them. To that end, we illustrate the transformation of these systems into Quadratic Unconstrained Binary Optimization (QUBO) problems, which can be tackled by these QPUs. We evaluate their performance in their default configurations and demonstrate some usual way to enhance their performance. Finally, we introduce a novel approach to solving these problems that does not result in an exponential growth of their coefficients. Data-points from these experiments are meant to be integrated in the BACQ benchmark [2].