Pith. sign in

REVIEW 1 cited by

Mapping graph state orbits under local complementation

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

arxiv 1910.03969 v2 pith:Z4DR5OH3 submitted 2019-10-09 quant-ph math-phmath.MPphysics.comp-ph

classification quant-phmath-phmath.MPphysics.comp-ph
keywords graphentanglementorbitslocalstatescomplementationlinksmapping
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Graph states, and the entanglement they posses, are central to modern quantum computing and communications architectures. Local complementation---the graph operation that links all local-Clifford equivalent graph states---allows us to classify all stabiliser states by their entanglement. Here, we study the structure of the orbits generated by local complementation, mapping them up to 9 qubits and revealing a rich hidden structure. We provide programs to compute these orbits, along with our data for each of the 587 orbits up to 9 qubits and a means to visualise them. We find direct links between the connectivity of certain orbits with the entanglement properties of their component graph states. Furthermore, we observe the correlations between graph-theoretical orbit properties, such as diameter and colourability, with Schmidt measure and preparation complexity and suggest potential applications. It is well known that graph theory and quantum entanglement have strong interplay---our exploration deepens this relationship, providing new tools with which to probe the nature of entanglement.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Local Equivalences of Graph States

    quant-ph 2025-11 conditional novelty 8.0 of 10

    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.

Pith tools