Algorithm to Verify Local Equivalence of Stabilizer States
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:TJSB6OFUrecord.jsonopen to challenge →
classification
quant-ph
keywords
stateslocalstabilizeralgorithmequivalencegraphverifyapproach
read the original abstract
We present an algorithm for verifying the local unitary (LU) equivalence of graph and stabilizer states. Our approach reduces the problem to solving a system of linear equations in modular arithmetic. Furthermore, we demonstrate that any LU transformation between two graph states takes a specific form, naturally generalizing the class of local Clifford (LC) transformations. Lastly, using existing libraries, we verify that for up to $n=11$, the number of LU and LC orbits of stabilizer states is identical.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.