REVIEW 6 cited by
Graph States Under the Action of Local Clifford Group in Non-Binary Case
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original 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.
Forward citations
Cited by 6 Pith papers
-
Local Equivalences of Graph States
Graph states are LU-equivalent if and only if they are linked by r-local complementations for some integer r; LU-equivalence is decidable in quasi-polynomial time, and LU=LC holds on at most 19 qubits.
-
Symmetry-guided constructions of absolutely maximally entangled states in five open cases
New explicit Hermitian self-dual MDS codes yield AME(12,5), AME(18,11), AME(18,13), and their 17-party projections.
-
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.
-
Foliated Quantum Error Correction for Qudits
Any prime-dimensional qudit Pauli code can be foliated into a graph state for fault-tolerant measurement-based quantum computing.
-
Calibrated hypergraph states: II calibrated hypergraph state construction and applications
Calibrated hypergraph states over Galois rings generalize weighted hypergraph states, are stabilizer and locally maximally entangleable, and reduce to the weighted class in the qubit case only.
-
Calibrated hypergraph states: I calibrated hypergraph and multi qudit state monads
Calibrated hypergraphs and multi-qudit states are shown to form graded Ω monads, providing a categorical foundation for a broad generalization of hypergraph states.
Discussion (0). Continue with ORCID to comment.