Every Benchmark All at Once
Ana Silva, Eliska Greplova

TL;DR
This paper reformulates five common randomized benchmarking techniques within the gate-set shadow tomography framework, enabling more efficient, comprehensive, and adaptable benchmarking of quantum devices with reduced sample sizes and enhanced noise characterization.
Contribution
It introduces a unified reformulation of randomized benchmarking methods using shadow tomography, improving efficiency and enabling detailed noise analysis with minimal experimental data.
Findings
Reduced gate-set size requirements for standard benchmarking
Lowered sample size via median-of-means estimators
Ability to reconstruct correlated noise and leakage errors
Abstract
As quantum technology matures, the efficient benchmarking of quantum devices remains a key challenge. Although sample-efficient, information-theoretic benchmarking techniques have recently been proposed, there is still a gap in adapting these techniques to contemporary experiments. In this work, we re-formulate five of the most common randomized benchmarking techniques in the modern language of the gate-set shadow tomography. This reformulation brings along several concrete advantages over conventional formulations of randomized benchmarking. For standard and interleaved randomized benchmarking, we can reduce the required gate-set size and, using median-of-means estimators, also reduce the required experimental sample size. For simultaneous and correlated randomized benchmarking, we can additionally reconstruct the Pauli-terms of correlated noise channels using additional…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum Mechanics and Applications
