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

International Journal of Theoretical Physics

A Systematic Review of Quantum BenchMarking

Pranit Malhotra, Ajay Kumar, Sunita Garhwal

Published Oct 30, 2024• 1 citation
Publisher
DOI
10.1007/s10773-024-05811-8

Related papers

Models in quantum computing: a systematic review

Peter Nimbe, Benjamin Asubam Weyori, Adebayo Felix Adekoya

Quantum Information Processing•Feb 1, 2021•51 citations

THE CRYPTOGRAPHIC IMPACT OF QUANTUM COMPUTING - BENCHMARKING OF CLASSICAL AND POST-QUANTUM ALGORITHMS

A.G. Zhailin, Akbayan Bekarystankyzy, B.M. Aktanova

Quantum computing - is an advanced technology which has a great impact on the traditional methods of computation causing a major challenge for the cryptographic systems that form the basis of our digital security. This research thesis is on cryptographic resilience in the age of quantum when the public key algorithms such as RSA and elliptic curve cryptography get compromised with the use of Shor's algorithm, while symmetric primitives additionally lose half of their security against Grover's search. The aim of the research is to thoroughly understand the quantum threat model and through experiments, figure out what is the realistic "cost of quantum safety" for the classical and post-quantum cryptographic mechanisms. The methodology combines systematic literature review with an experiment which is carried out using a reproducible benchmarking framework that (QCCB) outputs statistical performance estimates (mean, dispersion, and confidence intervals) and machine-readable result artifacts. The experim

Вестник Академии гражданской авиации•Mar 1, 2026•0 citations

Benchmarking in Quantum Algorithms

Colleen Farrelly, Uchenna Chukwu

Digitale Welt•Mar 4, 2019•0 citations

Benchmarking Quantum Computers

Robson Giles

•Jan 1, 2024•0 citations

COMPARATIVE ANALYSIS OF CLASSICAL AND QUANTUM ALGORITHMS FOR SOLVING LINEAR SYSTEMS OF EQUATIONS: THEORETICAL INSIGHTS AND BENCHMARKING CHALLENGES

Journal of Theoretical and Applied Information Technology

Modern computers utilize a model based on a simple Turing machine concept. This study contains an extensive comparative review of classical and quantum algorithm approaches to solving a system of linear equations. The study details standard classical approaches like Gaussian Elimination or Conjugate Gradient Method and compares these with the algorithm of quantum theory algorithm HHL (Harrow-Hassidim-Lloyd). It considers the logic behind each of them, their benchmarks, scalability, implementation difficulties and practical use. Benchmarking results illustrate the fact that a classical approach continues to do especially good for small to moderate sized problems. However, quantum computation has the potential for an exponential speedup using algorithms like HHL in well-conditioned sparse matrices. The current limits of the hardware are discussed and future research directions needed to be able to utilize quantum computing for larger scale linear algebra problems are presented.

Journal of Theoretical and Applied Information Technology•Jun 30, 2025•0 citations

Benchmarking quantum computers

Timothy J Proctor, Kevin C Young, Andrew Baczewski +1 more

arXiv:2407.08828•Nature Reviews Physics•Jan 7, 2025•71 citations
Quantum computing - is an advanced technology which has a great impact on the traditional methods of computation causing a major challenge for the cryptographic systems that form the basis of our digital security. This research thesis is on cryptographic resilience in the age of quantum when the public key algorithms such as RSA and elliptic curve cryptography get compromised with the use of Shor's algorithm, while symmetric primitives additionally lose half of their security against Grover's search. The aim of the research is to thoroughly understand the quantum threat model and through experiments, figure out what is the realistic "cost of quantum safety" for the classical and post-quantum cryptographic mechanisms. The methodology combines systematic literature review with an experiment which is carried out using a reproducible benchmarking framework that (QCCB) outputs statistical performance estimates (mean, dispersion, and confidence intervals) and machine-readable result artifacts. The experim
Modern computers utilize a model based on a simple Turing machine concept. This study contains an extensive comparative review of classical and quantum algorithm approaches to solving a system of linear equations. The study details standard classical approaches like Gaussian Elimination or Conjugate Gradient Method and compares these with the algorithm of quantum theory algorithm HHL (Harrow-Hassidim-Lloyd). It considers the logic behind each of them, their benchmarks, scalability, implementation difficulties and practical use. Benchmarking results illustrate the fact that a classical approach continues to do especially good for small to moderate sized problems. However, quantum computation has the potential for an exponential speedup using algorithms like HHL in well-conditioned sparse matrices. The current limits of the hardware are discussed and future research directions needed to be able to utilize quantum computing for larger scale linear algebra problems are presented.