Pith. sign in

REVIEW 1 cited by

On the local equivalence of complete bipartite and repeater graph states

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 1805.05968 v1 pith:TMLYATAB submitted 2018-05-15 quant-ph

On the local equivalence of complete bipartite and repeater graph states

classification quant-ph
keywords statesgraphequivalencelocalrepeaterbicliquebipartitecomplete
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Classifying locally equivalent graph states, and stabilizer states more broadly, is a significant problem in the theories of quantum information and multipartite entanglement. A special focus is given to those graph states for which equivalence through local unitaries implies equivalence through local Clifford unitaries (LU $\Leftrightarrow$ LC). Identification of locally equivalent states in this class is facilitated by a convenient transformation rule on the underlying graphs and an efficient algorithm. Here we investigate the question of local equivalence of the graph states behind the all-photonic quantum repeater. We show that complete bipartite graph (biclique) states, imperfect repeater graph states and small "crazy graph" states satisfy LU $\Leftrightarrow$ LC. We continue by discussing biclique states more generally and placing them in the context of counterexamples to the LU-LC Conjecture. To this end, we offer some alternative proofs and clarifications on existing results.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. Local Equivalences of Graph States

    quant-ph 2025-11 conditional novelty 8.0

    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.