TL;DR
This paper introduces efficient algorithms leveraging the fast Hadamard transform to compute quantum magic measures like SRE and mana for large pure and mixed states, significantly reducing computational complexity.
Contribution
The authors develop numerically exact, GPU-accelerated algorithms for computing quantum magic measures with exponential efficiency improvements and implement them in an open-source Julia package.
Findings
Algorithms compute SRE and mana with exponential speedup.
The methods enable large-scale numerical studies of quantum many-body systems.
Open-source Julia package HadaMAG facilitates practical computation of quantum magic.
Abstract
Non-stabilizerness, also known as ``magic,'' quantifies how far a quantum state departs from the stabilizer set. It is a central resource behind quantum advantage and a useful probe of the complexity of quantum many-body states. Yet standard magic quantifiers, such as the stabilizer R\'enyi entropy (SRE) for qubits and the mana for qutrits, are costly to evaluate numerically, with the computational complexity growing rapidly with the number of qudits. Here we introduce efficient, numerically exact algorithms that exploit the fast Hadamard transform to compute the SRE for qubits () and the mana for qutrits () for pure states given as state vectors. Our methods compute SRE and mana at cost , providing an exponential improvement over the naive scaling, with substantial parallelism and straightforward GPU acceleration. We further show how to combine…
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.
