REVIEW 3 cited by
QUARK: A Framework for Quantum Computing Application Benchmarking
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Quantum computing (QC) is anticipated to provide a speedup over classical HPC approaches for specific problems in optimization, simulation, and machine learning. With the advances in quantum computing toward practical applications, the need to analyze and compare different quantum solutions increases. While different low-level benchmarks for QC exist, these benchmarks do not provide sufficient insights into real-world application-level performance. We propose an application-centric benchmark method and the QUantum computing Application benchmaRK (QUARK) framework to foster the investigation and creation of application benchmarks for QC. This paper establishes three significant contributions: (1) it makes a case for application-level benchmarks and provides an in-depth "pen and paper" benchmark formulation of two reference problems: robot path and vehicle option optimization from the industrial domain; (2) it proposes the open-source QUARK framework for designing, implementing, executing, and analyzing benchmarks; (3) it provides multiple reference implementations for these two reference problems based on different known, and where needed, extended, classical and quantum algorithmic approaches and analyzes their performance on different types of infrastructures.
Forward citations
Cited by 3 Pith papers
-
Featuremetric benchmarking: Quantum computer benchmarks based on circuit features
A benchmarking framework that maps quantum computer error rates against arbitrary circuit features and uses Gaussian process regression to build predictive performance models from sparse data.
-
Quantum Fidelity-per-Cost: A Metric for Evaluation of Quantum Computing Systems
Cost-aware ranking of cloud QPUs via QFC disagrees with fidelity-only ranking; billing model, not hardware, fixes how the score scales with shot count.
-
Solving graph problems using permutation-invariant quantum machine learning
Permutation-invariant quantum circuits vastly outperform generic quantum machine learning ansatzes on 8-qubit graph classification tasks in simulation.
Discussion (0). Continue with ORCID to comment.