Work

Scalable and Verifiable Quantum Benchmarking with Spectrally Flat Hidden Shifts

Year: 2026
Type: preprint
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.
Language: English
Open Access status: green
OpenAlex ID: W7225870258
Cites: 5
Cited by:
Related to: 10