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

arXiv:2304.04894 · Quantum Information Processing

Majorization-based benchmark of the complexity of quantum processors

Alexandre B. Tacla, Nina Machado O'Neill, Gabriel G. Carlo, Fernando de Melo, Raúl O. Vallejos

Published Jun 17, 2024• 8 citations
arXivHTMLPDF
DOI
10.1007/s11128-024-04457-z

Related papers

Benchmarking quantum processors with a single qubit

Oktay Göktaş, W. K. Tham, Kent Bonsma-Fisher +1 more

arXiv:1905.05775•Quantum Information Processing•Mar 18, 2020•7 citations

Benchmarking the quantum processing power of large-scale quantum processors to execute specific programs

Joseph Emerson, Joel J. Wallman

Bulletin of the American Physical Society•Mar 6, 2019•0 citations

Benchmarking NISQ-era quantum processors

Jay Gambetta

Bulletin of the American Physical Society•Mar 8, 2019•3 citations

Benchmarking neutral atom-based quantum processors at scale

Andrea Rava, Jhon Alejandro Montanez-Barrera, Kristel F. L. Michielsen

•Jan 1, 2025•0 citations

Benchmarking error mitigation techniques on noisy quantum processors

Corentin Bisot, Emmanuel Lilette, Thomas Ayral

Bulletin of the American Physical Society•Mar 4, 2019•0 citations

Scalable and Verifiable Quantum Benchmarking with Spectrally Flat Hidden Shifts

Lior Horesh C, Vasileios Kalantzis, Shashanka Ubaru

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.

•Nov 12, 2026•0 citations
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−310^{-3}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.