Quantum WalkScore: Benchmarking Quantum Computers on the Graph Nodefinding Problem

arXiv:2609.19931 · quant-ph · Submitted 2026-09-17 · Read on arXiv

quant-ph

Submitted: 2026-09-17

Updated: 2026-09-17

Terminology

• Benchmark — 52× in this paper · explained in 2 episodes
• Benchmarking — 19× in this paper · explained in 4 episodes
• Fidelity — 4× in this paper · explained in 2 episodes
• Abstraction — 2× in this paper · explained in 1 episode
• Core — 2× in this paper · explained in 2 episodes
• Robustness — 2× in this paper · explained in 5 episodes
• Generalization — 1× in this paper · explained in 13 episodes
• Hilbert Space — 1× in this paper · explained in 2 episodes
• Post-Selection — 1× in this paper · explained in 2 episodes
• Quantum Circuits — 1× in this paper · explained in 2 episodes
• Theoretical Guarantees — 1× in this paper · explained in 2 episodes
• Verifiability — 1× in this paper · explained in 2 episodes

Sources

• Many-body Quantum Score: a scalable benchmark for digital and analog quantum processors and first test on a commercial neutral atom device
• QPack Scores: Quantitative performance metrics for application-oriented quantum computer benchmarking
• QUARK: A Framework for Quantum Computing Application Benchmarking
• Quantum computing with Qiskit
• Quantum Amplitude Amplification and Estimation
• Quantum Algorithm Exploration using Application-Oriented Performance Benchmarks

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity