Scalable and Verifiable Quantum Benchmarking with Spectrally Flat Hidden Shifts

Abstract Scalable quantum benchmarks often lack exact reference answers that can be verified without classically simulating the device. We introduce a hidden-shift benchmark in which a secret string is planted by construction, recovered by a quantum circuit, and exactly verified at any system size. The benchmark uses spectrally flat Boolean oracles, whose Fourier structure fixes the ideal output weight of the planted answer and enables majority-vote recovery even when its single-shot probability is extremely small. Register size, circuit depth, and non-Clifford content are independently controlled through the oracle degree. On IBM superconducting processors, degree-2 instances are recovered on up to 24 qubits despite single-shot fidelities near $10^{-3}$, while higher-degree oracles provide a tunable non-Clifford stress test that distinguishes processor performance. Although classically tractable, these benchmarks provide a scalable and exactly verifiable measure of how far a noisy quantum processor can reliably execute a structured computation.

Authors

Institutions

Publication Details

Journal
Research Square
Published
2026-11-12
DOI
https://doi.org/10.21203/rs.3.rs-11433479/v1
Primary Topic
Quantum Computing Algorithms and Architecture
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Scalable and Verifiable Quantum Benchmarking with Spectrally Flat Hidden Shifts

Vasileios Kalantzis, Lior Horesh C, Shashanka Ubaru
Research Square
Quantum Computing Algorithms and Architecture
preprint

Scalable and Verifiable Quantum Benchmarking with Spectrally Flat Hidden Shifts

Vasileios Kalantzis, Lior Horesh C, Shashanka Ubaru
preprint en

Abstract

Abstract Scalable quantum benchmarks often lack exact reference answers that can be verified without classically simulating the device. We introduce a hidden-shift benchmark in which a secret string is planted by construction, recovered by a quantum circuit, and exactly verified at any system size. The benchmark uses spectrally flat Boolean oracles, whose Fourier structure fixes the ideal output weight of the planted answer and enables majority-vote recovery even when its single-shot probability is extremely small. Register size, circuit depth, and non-Clifford content are independently controlled through the oracle degree. On IBM superconducting processors, degree-2 instances are recovered on up to 24 qubits despite single-shot fidelities near $10^{-3}$, while higher-degree oracles provide a tunable non-Clifford stress test that distinguishes processor performance. Although classically tractable, these benchmarks provide a scalable and exactly verifiable measure of how far a noisy quantum processor can reliably execute a structured computation.

Research Square
IBM Research - Thomas J. Watson Research Center (US)
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon