Simpler qudit flow definition yields O(n^3) flow-finding algorithm and flow-preserving operations for measurement-based quantum computing on prime-dimensional qudits.
Graph States Under the Action of Local Clifford Group in Non-Binary Case
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Graph states are well-entangled quantum states that are defined based on a graph. Of course, if two graphs are isomorphic their associated states are the same. Also, we know local operations do not change the entanglement of quantum states. Therefore, graph states that are either isomorphic or equivalent under the local Clifford group have the same properties. In this paper, we first establish a bound on the number of graph states which are neither isomorphic nor equivalent under the action of local Clifford group. Also, we study graph states in non-binary case. We translate the action of local Clifford group, as well as measurement of Pauli operators, into transformations on their associated graphs. Finally, we present an efficient algorithm to verify whether two graph states, in non-binary case, are locally equivalent or not.
fields
quant-ph 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Working with measurement-based computations on qudits
Simpler qudit flow definition yields O(n^3) flow-finding algorithm and flow-preserving operations for measurement-based quantum computing on prime-dimensional qudits.