Efficient witnesses and testing algorithms based on stabilizer Rényi entropy certify and quantify magic in mixed states, with experimental demonstration on IonQ hardware showing robustness under strong noise.
A survey of quantum property testing
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
abstract
The area of property testing tries to design algorithms that can efficiently handle very large amounts of data: given a large object that either has a certain property or is somehow "far" from having that property, a tester should efficiently distinguish between these two cases. In this survey we describe recent results obtained for quantum property testing. This area naturally falls into three parts. First, we may consider quantum testers for properties of classical objects. We survey the main examples known where quantum testers can be much (sometimes exponentially) more efficient than classical testers. Second, we may consider classical testers of quantum objects. This is the situation that arises for instance when one is trying to determine if quantum states or operations do what they are supposed to do, based only on classical input-output behavior. Finally, we may also consider quantum testers for properties of quantum objects, such as states or operations. We survey known bounds on testing various natural properties, such as whether two states are equal, whether a state is separable, whether two operations commute, etc. We also highlight connections to other areas of quantum information theory and mention a number of open questions.
fields
quant-ph 3verdicts
UNVERDICTED 3representative citing papers
Proposes a context-aware unit testing framework for quantum subroutines modeled as parametrized quantum channels, using probabilistic assertions and demonstrated on GHZ preparation and Shor's algorithm subroutines.
Z-only measurements classify small IQP, Clifford, and Clifford+T circuits with up to 0.91 accuracy and outperform classical shadows, but all four strategies drop to chance level above 12 qubits with quadratic shots.
citing papers explorer
-
Efficient witnessing and testing of magic in mixed quantum states
Efficient witnesses and testing algorithms based on stabilizer Rényi entropy certify and quantify magic in mixed states, with experimental demonstration on IonQ hardware showing robustness under strong noise.
-
Context-Aware Unit Testing for Quantum Subroutines
Proposes a context-aware unit testing framework for quantum subroutines modeled as parametrized quantum channels, using probabilistic assertions and demonstrated on GHZ preparation and Shor's algorithm subroutines.
-
Polynomial Resource Classification of Quantum Circuit Familes via Classical Shadows
Z-only measurements classify small IQP, Clifford, and Clifford+T circuits with up to 0.91 accuracy and outperform classical shadows, but all four strategies drop to chance level above 12 qubits with quadratic shots.