Pith. sign in

REVIEW 2 cited by

Universal resources for measurement-based quantum computation

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 quant-ph/0604010 v2 pith:VXJ3PVZX submitted 2006-04-03 quant-ph

Universal resources for measurement-based quantum computation

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

We investigate which entanglement resources allow universal measurement-based quantum computation via single-qubit operations. We find that any entanglement feature exhibited by the 2D cluster state must also be present in any other universal resource. We obtain a powerful criterion to assess universality of graph states, by introducing an entanglement measure which necessarily grows unboundedly with the system size for all universal resource states. Furthermore, we prove that graph states associated with 2D lattices such as the hexagonal and triangular lattice are universal, and obtain the first example of a universal non-graph state.

discussion (0)

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

Forward citations

Cited by 2 Pith papers

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

  1. The Delayed Stabilizer ZX-Calculus

    quant-ph 2026-07 accept novelty 7.0

    A complete delayed stabilizer ZX-calculus with delay generator, generating-tableau semantics, and unique normal forms via generalized local complementation captures infinite translation-invariant stabilizer processes.

  2. The Structure of Circle Graph States

    quant-ph 2026-03 unverdicted novelty 7.0

    Circle graphs are closed under r-local complementation and bipartite circle graph states correspond one-to-one with planar code states whose MBQC is classically simulable.