Predicting Magic from Very Few Measurements
J. M. Varela, L. L. Keller, A. de Oliveira Junior, D. A. Moreira, R. Chaves, R. A. Mac\^edo

TL;DR
This paper introduces a method to estimate the nonstabilizerness (magic) of quantum states using a small set of Pauli measurements, making the quantification more practical despite inherent computational complexity.
Contribution
It presents a framework for witnessing and quantifying quantum magic with limited measurements and analyzes the computational hardness of related problems.
Findings
Magic can be estimated from any set of Pauli measurements containing anti-commuting pairs.
Deciding membership in the reduced stabilizer polytope is NP-hard.
The method effectively computes nonstabilizerness in complex quantum states beyond previous techniques.
Abstract
The nonstabilizerness of quantum states is a necessary resource for universal quantum computation, yet its characterization is notoriously demanding. Quantifying nonstabilizerness typically requires an exponential number of measurements and a doubly exponential classical post-processing cost to evaluate its standard monotones. In this work, we show that nonstabilizerness is, to a large extent, in the eyes of the beholder: it can be witnessed and quantified using any set of -qubit Pauli measurements, provided the set contains anti-commuting pairs. We introduce a general framework that projects the stabilizer polytope onto the subspace defined by these observables and provide an algorithm that estimates magic from Pauli expectation values with runtime exponential in the number of measurements and polynomial in the number of qubits . By relating the problem to a…
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
