Handbook for Quantifying Robustness of Magic
Hiroki Hamaguchi, Kou Hamada, Nobuyuki Yoshioka

TL;DR
This paper introduces efficient algorithms for calculating the robustness of magic, a key quantum resource, enabling analysis of larger quantum states than previously possible with classical computers.
Contribution
The paper presents novel algorithms that significantly reduce computational complexity for measuring the robustness of magic, allowing calculations for larger quantum states.
Findings
Computed RoM for states up to 7 qubits on a laptop
Simulated stabilizer fidelity for up to 8 qubits
Achieved exponential reduction in computational resources
Abstract
The nonstabilizerness, or magic, is an essential quantum resource to perform universal quantum computation. Robustness of magic (RoM) in particular characterizes the degree of usefulness of a given quantum state for non-Clifford operation. While the mathematical formalism of RoM can be given in a concise manner, it is extremely challenging to determine the RoM in practice, since it involves superexponentially many pure stabilizer states. In this work, we present efficient novel algorithms to compute the RoM. The crucial technique is a subroutine that achieves the remarkable features in calculation of overlaps between pure stabilizer states: (i) the time complexity per each stabilizer is reduced exponentially, (ii) the space complexity is reduced superexponentially. Based on this subroutine, we present algorithms to compute the RoM for arbitrary states up to qubits on a laptop,…
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.
Code & Models
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
