Topic
Local unitary equivalence
3 records: 2 unsolved, 1 solved. Filter the catalog by this topic →
-
Polynomial-time local-unitary equivalence of graph states
Does a deterministic classical algorithm running in \(n^{O(1)}\) time decide local-unitary equivalence of arbitrary graph states on \(n\) labelled qubits?
Unsolved -
Minimum LU–LC counterexample for graph states
What is the least number of qubits for which two graph states can be locally unitary equivalent without being locally Clifford equivalent?
Solved -
Finite nontrivial LU moduli of AME states
Do there exist integers \(N,d\geq 2\) for which the absolutely maximally entangled states of \(N\) qudits of local dimension \(d\) form finitely many, but more than one, local-unitary equivalence classes?
Unsolved