Polynomial-time local-unitary equivalence of graph states
quant-ph, cond-mat.mtrl-sci, cs.CC
Submitted: 2026-09-30
Updated: 2026-10-04
Terminology
Sources
- Deciding Local Unitary Equivalence of Graph States in Quasi-Polynomial Time
- The LU-LC conjecture is false
- An efficient algorithm to recognize local Clifford equivalence of graph states
- The LU-LC conjecture, diagonal local operations and quadratic forms over GF(2)
- Graph states and local unitary transformations beyond local Clifford operations
- The 27-qubit Counterexample to the LU-LC Conjecture is Minimal
- Algorithm to Verify Local Equivalence of Stabilizer States
- Local equivalence of stabilizer states: a graphical characterisation
- Local Equivalences of Graph States
- Covering a Graph with Minimal Local Sets
- An Efficient Algorithm to Recognize Locally Equivalent Graphs in Non-Binary Case
- Counting single-qubit Clifford equivalent graph states is #P-Complete
- The Structure of Circle Graph States
- Compilation of algorithm-specific graph states for quantum circuits
- Towards Efficient Synthesis of Quantum Graph States by Fusing Graph Motifs
Related papers
- Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
- Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
- Polynomial-time classical and quantum simulation of quantum impurity models
- Theory of quantum-enhanced interferometry with general Markovian light sources
- A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
- Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity