Answers are grounded in this paper and cite their sources.
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 the 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 nongraph state.
No takes yet. Share an insight, caveat, or question.
Nest et al. (2006) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: