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.
Graph States, Pivot Minor, and Universality of (X,Z)-measurements
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
The graph state formalism offers strong connections between quantum information processing and graph theory. Exploring these connections, first we show that any graph is a pivot-minor of a planar graph, and even a pivot minor of a triangular grid. Then, we prove that the application of measurements in the (X,Z)-plane over graph states represented by triangular grids is a universal measurement-based model of quantum computation. These two results are in fact two sides of the same coin, the proof of which is a combination of graph theoretical and quantum information techniques.
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
The Structure of Circle Graph States
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.