Efficient benchmarking of logical magic state
Su-un Lee, Ming Yuan, Senrui Chen, Kento Tsubouchi, Liang Jiang

TL;DR
This paper introduces efficient methods for benchmarking high-fidelity logical magic states in quantum computing, reducing sample complexity from quadratic to linear in the inverse of infidelity, and validates their robustness through simulations.
Contribution
It proposes two novel benchmarking schemes that achieve optimal linear sample complexity for magic states, overcoming previous quadratic limitations.
Findings
Proves that single-copy benchmarking requires at least O(1/ε^2) samples.
Introduces two schemes achieving O(1/ε) sample complexity, proven to be optimal.
Demonstrates robustness of protocols via numerical simulations under realistic noise.
Abstract
High-fidelity logical magic states are a critical resource for fault-tolerant quantum computation, enabling non-Clifford logical operations through state injection. However, benchmarking these states presents significant challenges: one must estimate the infidelity with multiplicative precision, while many quantum error-correcting codes only permit Clifford operations to be implemented fault-tolerantly. Consequently, conventional state tomography requires samples, making benchmarking impractical for high-fidelity states. In this work, we show that any benchmarking scheme measuring one copy of the magic state per round necessarily requires samples for single-qubit magic states. We then propose two approaches to overcome this limitation: (i) Bell measurements on two copies of the twirled state and (ii) single-copy schemes leveraging…
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.
