pith. machine review for the scientific record. sign in

arxiv: 2603.08847 · v2 · submitted 2026-03-09 · 🪐 quant-ph · math-ph· math.MP

Recognition: 2 theorem links

· Lean Theorem

The Structure of Circle Graph States

Frederik Hahn , Rose McCarty , Hendrik Poulsen Nautrup , Nathan Claudet
Authors on Pith no claims yet

Pith reviewed 2026-05-15 14:13 UTC · model grok-4.3

classification 🪐 quant-ph math-phmath.MP
keywords circle graph statesr-local complementationLU equivalenceplanar code statesmeasurement-based quantum computationclassical simulability#P-hardness
0
0 comments X

The pith

Circle graphs are closed under r-local complementation, so only circle graph states are LU-equivalent to them.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proves that circle graph states form a closed family under local unitary equivalence. Applying r-local complementations to any circle graph always produces another circle graph, isolating this family from other graph states. It further shows that the bipartite members of this family match planar code states exactly. This match yields simple proofs that measurement-based quantum computation on all circle graph states is efficiently classically simulable and that any LU equivalence between a planar code state and a stabilizer state is in fact local Clifford equivalence. Finally the paper establishes that counting the size of an LU equivalence class is #P-hard.

Core claim

Circle graphs are closed under r-local complementation. Therefore the only graph states that are LU-equivalent to circle graph states are circle graph states themselves. Bipartite circle graph states stand in one-to-one correspondence with planar code states. This correspondence supplies direct proofs that MBQC on circle graph states is efficiently classically simulable and that LU equivalence to a stabilizer state implies LC equivalence. Counting the number of graph states LU-equivalent to a given graph state is #P-hard.

What carries the argument

r-local complementation, the graph operation that encodes local unitary equivalence on graph states and is shown to map the circle-graph family to itself.

If this is right

  • MBQC performed on any circle graph state remains efficiently classically simulable.
  • Any planar code state that is LU-equivalent to a stabilizer state must actually be LC-equivalent to it.
  • The LU equivalence class of any given graph state cannot be counted in polynomial time unless P equals #P.
  • The family of circle graphs is isolated inside the broader space of graph states under local operations.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The closure result may reduce the search space when classifying other families of graph states under local equivalence.
  • The #P-hardness of counting equivalence classes indicates that determining full local equivalence structure for arbitrary graphs is intractable.
  • The explicit bijection with planar codes suggests that known simulation techniques for surface-code MBQC can be imported directly to circle graphs.

Load-bearing premise

The chosen definition of r-local complementation exactly matches the local unitary operations that act on graph states and leaves the circle property invariant.

What would settle it

Exhibit any non-circle graph reachable from a circle graph by a finite sequence of r-local complementations.

Figures

Figures reproduced from arXiv: 2603.08847 by Frederik Hahn, Hendrik Poulsen Nautrup, Nathan Claudet, Rose McCarty.

Figure 1
Figure 1. Figure 1: Circle graphs L5 and L5 ⋆ c and their chord representations. the graph G ⋆ u = G∆KNG(u) , where ∆ denotes the symmetric difference and KNG(u) is the com￾plete graph on the neighborhood of u. (Given two sets A, B, the symmetric difference of A and B is A∆B := (A ∪ B) \ (A ∩ B).) See [PITH_FULL_IMAGE:figures/full_fig_p006_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Circle graphs and bipartite circle graphs can both be characterized by excluded minors: [PITH_FULL_IMAGE:figures/full_fig_p009_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: For an exemplary 9-vertex circle graph C with a choice of independent set K = {1, 2, 3, 4}, we show how to construct the corresponding tree T and multigraph H. Violet arrow: From the chord representation of C, we remove all chords not corresponding to K = {1, 2, 3, 4}. This yields a simpler diagram of four nonintersecting chords that divide the circle into five regions. In each of the five circle regions, … view at source ↗
Figure 4
Figure 4. Figure 4: Illustration of Theorem 2. The gray box shows an example of a planar code state |ψ⟩, where the corre￾sponding planar multigraph P is the (4 × 4)-grid graph without any multideges. The green box then shows how an arbitrary selection of a spanning tree T of P allows for the construction of a corresponding bipartite circle graph by applying a Hadamard gate to each qubit outside of the spanning tree. by applyi… view at source ↗
Figure 5
Figure 5. Figure 5: Every circle graph C is a vertex-minor of some bipartite circle graph B. We construct such a B for the example where C is a 5-cycle: 1. From a chord diagram of C, we read off a double occurrence word (aebacbdced) and draw a 4-regular multigraph with vertices a, b, c, d, e and edges for all adjacent letters in this word, i.e., we contract the chords. 2. This 4-regular multigraph may have nonzero crossing nu… view at source ↗
Figure 6
Figure 6. Figure 6: The 3×3 comparability grid (left) and a corre￾sponding chord diagram (right). In the chord diagram, each comparability grid vertex ij = (i, j) is represented by a chord between a point labeled i in the left half and by a point labeled j in the right half. Note that chords are considered to include their endpoints and thus chords with a shared endpoint intersect. with O(n 2 ) vertices and rank-width at leas… view at source ↗
Figure 7
Figure 7. Figure 7: The comparability grid vertices in X are shown in a darker shade of gray compared to the remaining vertices. The square submatrix of the adjacency matrix whose rows are the left-holes vj and whose columns are the corresponding vertices (i, j) ∈ X is shown on the right. vj and whose columns are the corresponding ver￾tices (i, j) ∈ X (see [PITH_FULL_IMAGE:figures/full_fig_p020_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Finding a balanced partition. The degree-3 vertex [PITH_FULL_IMAGE:figures/full_fig_p021_8.png] view at source ↗
read the original abstract

Circle graph states are a structurally important family of graph states. The family's entanglement is a priori high enough to allow for universal measurement-based quantum computation (MBQC); however, MBQC on circle graph states is actually efficiently classically simulable. In this work, we paint a detailed picture of the local equivalence of circle graph states. First, we consider the class of all graph states that are local unitary (LU)-equivalent to circle graph states. In graph-theoretical terms, this LU-equivalence class is the set of all graphs reachable from the family of circle graphs by applying $r$-local complementations. We prove that the only graph states that are LU-equivalent to circle graph states are circle graph states themselves: circle graphs are closed under $r$-local complementation. Second, we show that bipartite circle graph states, i.e., 2-colorable circle graph states, are in one-to-one correspondence with planar code states, on which MBQC is known to be efficiently classically simulable. Leveraging this correspondence, we present alternative, simple proofs that (1) if a planar code state is LU-equivalent to a stabilizer state, they are in fact local Clifford (LC)-equivalent to it and that (2) MBQC on all circle graph states is efficiently classically simulable. Third and finally, we demonstrate that the problem of counting the number of graph states LU-equivalent to a given graph state is $\#\mathsf{P}$-hard.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The paper claims that circle graphs are closed under r-local complementation, so that the LU-equivalence class of circle graph states consists exactly of circle graph states. It establishes a bijection between bipartite (2-colorable) circle graph states and planar code states, yielding alternative proofs that planar-code stabilizer states are LC-equivalent when LU-equivalent and that MBQC on all circle graph states is efficiently classically simulable. Finally, it shows that counting the number of graph states LU-equivalent to a given graph state is #P-hard.

Significance. If the central closure result holds, the work supplies a clean graph-theoretic characterization of the local equivalence class of an important family of graph states whose entanglement structure is rich enough for universal MBQC yet remains classically simulable. The planar-code correspondence furnishes independent, elementary proofs of known facts about LC equivalence and simulability, while the #P-hardness result quantifies the computational difficulty of determining LU classes in general. The proofs rely on standard graph-theoretic arguments rather than ad-hoc parameters, and the manuscript ships explicit statements of the closure and correspondence claims.

minor comments (2)
  1. [§3] §3 (or the section defining r-local complementation): an explicit small example (e.g., the 4-cycle) showing how an r-local complementation acts on both the graph and its circle representation would clarify the preservation argument for readers unfamiliar with the operation.
  2. [final section] The #P-hardness reduction in the final section is stated at a high level; adding a one-sentence pointer to the precise known #P-complete problem (e.g., counting perfect matchings in a certain class) would make the reduction self-contained.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript and for recommending minor revision. The report accurately captures the central claims regarding closure under r-local complementation, the bijection with planar code states, and the #P-hardness result.

read point-by-point responses

  1. Referee: REFEREE SUMMARY: The paper claims that circle graphs are closed under r-local complementation, so that the LU-equivalence class of circle graph states consists exactly of circle graph states. It establishes a bijection between bipartite (2-colorable) circle graph states and planar code states, yielding alternative proofs that planar-code stabilizer states are LC-equivalent when LU-equivalent and that MBQC on all circle graph states is efficiently classically simulable. Finally, it shows that counting the number of graph states LU-equivalent to a given graph state is #P-hard.

    Authors: We appreciate the referee's concise and accurate summary of the paper's contributions. No specific technical concerns, corrections, or requests for additional material were raised. revision: no

Circularity Check

0 steps flagged

No significant circularity in derivation chain

full rationale

The paper's central claim that circle graphs are closed under r-local complementation is established via direct graph-theoretic arguments drawing on external results about local complementation and planar codes, without reducing to self-definitional loops, fitted parameters renamed as predictions, or load-bearing self-citations whose validity depends on the present work. Downstream results on planar-code correspondence and #P-hardness counting follow independently from the closure property and do not feed back into it. The derivation remains self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The work rests on standard definitions from graph theory and stabilizer formalism; no free parameters or invented entities are introduced. The central claims are proved from these background structures.

axioms (2)
  • standard math Graph states are defined via the stabilizer formalism with edges encoding CZ gates.
    Invoked in the reformulation of LU equivalence as r-local complementations.
  • domain assumption r-local complementation is the graph operation corresponding to local unitary equivalence for graph states.
    Used to translate the quantum LU equivalence into a purely graph-theoretic statement.

pith-pipeline@v0.9.0 · 5565 in / 1248 out tokens · 43741 ms · 2026-05-15T14:13:11.562356+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

73 extracted references · 73 canonical work pages · 31 internal anchors

  1. [1]

    The Heisenberg Representation of Quantum Computers

    Daniel Gottesman. “The Heisenberg repre- sentation of quantum computers”. Proceed- ings of the XXII International Colloquium on Group Theoretical Methods in Physics (Group22) (1999). arXiv:quant-ph/9807006

    work page internal anchor Pith review Pith/arXiv arXiv 1999

  2. [2]

    On the role of entanglement in quantum- computational speed-up

    Richard Jozsa and Noah Linden. “On the role of entanglement in quantum- computational speed-up”. Proceedings of the Royal Society of London. Series A: Math- ematical, Physical and Engineering Sci- ences459, 2011–2032 (2003). arXiv:quant- ph/0201143

    work page arXiv 2011

  3. [3]

    Quantum computation and quantum in- formation

    Michael A Nielsen and Isaac L Chuang. “Quantum computation and quantum in- formation”. Cambridge university press. (2010)

    work page 2010

  4. [4]

    A one-way quantum computer

    Robert Raussendorf and Hans J. Briegel. “A one-way quantum computer”. Phys. Rev. Lett.86, 5188–5191 (2001). arXiv:quant- ph/0010033

    work page arXiv 2001

  5. [5]

    Measurement-based quan- tum computation on cluster states

    Robert Raussendorf, Daniel E. Browne, and Hans J. Briegel. “Measurement-based quan- tum computation on cluster states”. Phys. Rev. A68, 022312 (2003). arXiv:quant- ph/0301052

    work page arXiv 2003

  6. [6]

    Measurement-based quantum com- putation from clifford quantum cellular au- tomata

    Hendrik Poulsen Nautrup and Hans J. Briegel. “Measurement-based quantum com- putation from clifford quantum cellular au- tomata”. Phys. Rev. A110, 062617 (2024). arXiv:2312.13185

    work page arXiv 2024

  7. [7]

    Fundamentals of universality in one-way quantum computation

    M Van den Nest, W Dür, A Miyake, and H J Briegel. “Fundamentals of universality in one-way quantum computation”. New Jour- nal of Physics9, 204 (2007). arXiv:quant- ph/0702116

    work page arXiv 2007

  8. [8]

    A computationally universal phase of quantum matter

    Robert Raussendorf, Cihan Okay, Dong- Sheng Wang, David T. Stephen, and Hen- drik Poulsen Nautrup. “Computation- ally universal phase of quantum matter”. Phys. Rev. Lett.122, 090501 (2019). arXiv:1803.00095

    work page internal anchor Pith review Pith/arXiv arXiv 2019

  9. [9]

    Subsystem symmetries, quantum cellular automata, and computational phases of quantum matter

    David T. Stephen, Hendrik Poulsen Nautrup, Juani Bermejo-Vega, Jens Eisert, and Robert Raussendorf. “Subsystem sym- metries, quantum cellular automata, and computational phases of quantum matter”. Quantum3, 142 (2019). arXiv:1806.08780

    work page internal anchor Pith review Pith/arXiv arXiv 2019

  10. [10]

    Multi-party entanglement in graph states

    Marc Hein, Jens Eisert, and Hans J Briegel. “Multiparty entanglement in graph states”. Physical Review A—Atomic, Molecular, and Optical Physics69, 062311 (2004). arXiv:quant-ph/0307130

    work page internal anchor Pith review Pith/arXiv arXiv 2004

  11. [11]

    Graph States, Pivot Minor, and Universality of (X,Z)-measurements

    Mehdi Mhalla and Simon Perdrix. “Graph states, pivot minor, and universality of (X,Z)-measurements”. International Jour- nal of Unconventional Computing9, 153– 171 (2013). arXiv:1202.6551

    work page internal anchor Pith review Pith/arXiv arXiv 2013

  12. [12]

    Persistent entanglement in arrays of interacting particles

    Hans J. Briegel and Robert Raussendorf. “Persistent entanglement in arrays of inter- 15 acting particles”. Phys. Rev. Lett.86, 910– 913 (2001). arXiv:quant-ph/0004051

    work page internal anchor Pith review Pith/arXiv arXiv 2001

  13. [13]

    Quantum error-correcting codes associated with graphs

    D. Schlingemann and R. F. Werner. “Quan- tum error-correcting codes associated with graphs”. Phys. Rev. A65, 012308 (2001). arXiv:quant-ph/0012111

    work page internal anchor Pith review Pith/arXiv arXiv 2001

  14. [14]

    Universal resources for measurement-based quantum computation

    Maarten Van den Nest, Akimasa Miyake, Wolfgang Dür, and Hans J Briegel. “Univer- sal resources for measurement-based quan- tum computation”. Physical review letters 97, 150504 (2006). arXiv:quant-ph/0604010

    work page internal anchor Pith review Pith/arXiv arXiv 2006

  15. [15]

    Classical simulation of quantum many-body systems with a tree tensor network

    Y-Y Shi, L-M Duan, and Guifre Vidal. “Classical simulation of quantum many- body systems with a tree tensor net- work”. Physical Review A—Atomic, Molec- ular, and Optical Physics74, 022320 (2006). arXiv:quant-ph/0511070

    work page internal anchor Pith review Pith/arXiv arXiv 2006

  16. [16]

    Rank-width: Algorithmic and structural results

    Sang-il Oum. “Rank-width: algorithmic and structural results”. Discrete Appl. Math. 231, 15–24 (2017). arXiv:1601.03800

    work page internal anchor Pith review Pith/arXiv arXiv 2017

  17. [17]

    Classical simulation versus universality in measurement based quantum computation

    M. Van Den Nest, W. Dür, G. Vidal, and H. J. Briegel. “Classical simulation ver- sus universality in measurement-based quan- tum computation”. Physical Review A75, 012337 (2007). arXiv:quant-ph/0608060

    work page internal anchor Pith review Pith/arXiv arXiv 2007

  18. [18]

    The rank-width of the square grid

    Vít Jelínek. “The rank-width of the square grid”. Discrete Applied Mathematics158, 841–850 (2010)

    work page 2010

  19. [19]

    The Grid Theorem for vertex-minors

    Jim Geelen, O-joung Kwon, Rose McCarty, and Paul Wollan. “The Grid Theorem for vertex-minors”. Journal of Combinato- rial Theory, Series B158, 93–116 (2023). arXiv:1909.08113

    work page arXiv 2023

  20. [20]

    Transforming graph states using single-qubit operations

    A. Dahlberg and S. Wehner. “Transforming graph states using single-qubit operations”. Philosophical Transactions of the Royal So- ciety A: Mathematical, Physical and En- gineering Sciences376, 20170325 (2018). arXiv:1805.05305

    work page internal anchor Pith review Pith/arXiv arXiv 2018

  21. [21]

    Graphical description of the action of local Clifford transformations on graph states

    Maarten Van den Nest, Jeroen Dehaene, and Bart De Moor. “Graphical description of the action of local Clifford transformations on graph states”. Physical Review A69, 022316 (2004). arXiv:quant-ph/0308151

    work page internal anchor Pith review Pith/arXiv arXiv 2004

  22. [22]

    Entanglement in Graph States and its Applications

    Marc Hein, Wolfgang Dür, Jens Eisert, Robert Raussendorf, Maarten Van den Nest, and Hans J. Briegel. “Entanglement in graph states and its applications”. Quantum computers, algorithms and chaos162(2006). arXiv:quant-ph/0602096

    work page internal anchor Pith review Pith/arXiv arXiv 2006

  23. [23]

    Lo- cal equivalence of stabilizer states: a graph- ical characterisation

    Nathan Claudet and Simon Perdrix. “Lo- cal equivalence of stabilizer states: a graph- ical characterisation”. In Proceedings of the 42nd Symposium on Theoretical Aspects of Computer Science (STACS 2025). (2025). arXiv:2409.20183

    work page arXiv 2025

  24. [24]

    Fermionic insights into measurement- based quantum computation: Circle graph states are not universal resources

    Brent Harrison, Vishnu Iyer, Ojas Parekh, Kevin Thompson, and Andrew Zhao. “Fermionic insights into measurement- based quantum computation: Circle graph states are not universal resources” (2025). arXiv:2510.05557

    work page arXiv 2025

  25. [25]

    On Local Equivalence, Surface Code States and Matroids

    Pradeep Sarvepalli and Robert Raussendorf. “Local equivalence, surface-code states, and matroids”. Phys. Rev. A82, 022304 (2010). arXiv:0911.1571

    work page internal anchor Pith review Pith/arXiv arXiv 2010

  26. [26]

    On measurement-based quantum computation with the toric code states

    Sergey Bravyi and Robert Raussendorf. “Measurement-based quantum computation with the toric code states”. Phys. Rev. A76, 022304 (2007). arXiv:quant-ph/0610162

    work page internal anchor Pith review Pith/arXiv arXiv 2007

  27. [27]

    Counting single-qubit Clifford equivalent graph states is #P-complete

    Axel Dahlberg, Jonas Helsen, and Stephanie Wehner. “Counting single-qubit Clifford equivalent graph states is #P-complete”. Journal of Mathematical Physics61(2020). arXiv:1907.08024

    work page arXiv 2020

  28. [28]

    Quantum codes on a lattice with boundary

    S. B. Bravyi and A. Yu. Kitaev. “Quantum codes on a lattice with boundary” (1998). arXiv:quant-ph/9811052

    work page internal anchor Pith review Pith/arXiv arXiv 1998

  29. [29]

    Fault-tolerant quantum computation by anyons

    A.Yu. Kitaev. “Fault-tolerant quantum com- putation by anyons”. Annals of Physics303, 2–30 (2003). arXiv:quant-ph/9707021

    work page internal anchor Pith review Pith/arXiv arXiv 2003

  30. [30]

    Graph-state representation of the toric code

    Pengcheng Liao and David L. Feder. “Graph-state representation of the toric code”. Phys. Rev. A104, 012432 (2021). arXiv:2103.12268

    work page arXiv 2021

  31. [31]

    Classical simulation of measurement-based quantum computation on higher-genus surface-code states

    Leonard Goff and Robert Raussendorf. “Classical simulation of measurement-based quantum computation on higher-genus surface-code states”. Phys. Rev. A86, 042301 (2012). arXiv:1201.6319

    work page internal anchor Pith review Pith/arXiv arXiv 2012

  32. [32]

    Circle Graph Obstructions

    A. Bouchet. “Circle Graph Obstructions”. Journal of Combinatorial Theory, Series B 60, 107–144 (1994)

    work page 1994

  33. [33]

    The complexity of the vertex-minor problem

    Axel Dahlberg, Jonas Helsen, and Stephanie Wehner. “The complexity of the vertex- minorproblem”. InformationProcessingLet- ters175, 106222 (2022). arXiv:1906.05689

    work page internal anchor Pith review Pith/arXiv arXiv 2022

  34. [34]

    Quadratic tensors as a unification of Clifford, Gaus- sian, and free-fermion physics

    Andreas Bauer and Seth Lloyd. “Quadratic tensors as a unification of Clifford, Gaus- sian, and free-fermion physics” (2026). arXiv:2601.15396

    work page arXiv 2026

  35. [35]

    Most quantum states are too entangled to be useful as computational resources

    D. Gross, S. T. Flammia, and J. Eisert. 16 “Most quantum states are too entangled to be useful as computational resources”. Phys. Rev. Lett.102, 190501 (2009). arXiv:0810.4331

    work page internal anchor Pith review Pith/arXiv arXiv 2009

  36. [36]

    Random regular graph states are complex at almost any depth

    Soumik Ghosh, Dominik Hangleiter, and Jonas Helsen. “Random regular graph states are complex at almost any depth”. PRX Quantum6, 040344 (2025). arXiv:2412.07058

    work page arXiv 2025

  37. [37]

    Almost all graphs are vertex-minor universal

    Ruben Ascoli, Bryce Frederickson, Sarah Frederickson, Caleb McFarland, and Logan Post. “Almost all graphs are vertex-minor universal” (2026). arXiv:2602.09049

    work page arXiv 2026

  38. [38]

    Vertex-minor univer- sal graphs for generating entangled quantum subsystems

    Maxime Cautrès, Nathan Claudet, Mehdi Mhalla, Simon Perdrix, Valentin Savin, and Stéphan Thomassé. “Vertex-minor univer- sal graphs for generating entangled quantum subsystems”. In Proceedings of the 51st In- ternational Colloquium on Automata, Lan- guages, and Programming (ICALP 2024). (2024). arXiv:2402.06260

    work page arXiv 2024

  39. [39]

    Excluding a bipartite circle graph from line graphs

    Sang-il Oum. “Excluding a bipartite circle graph from line graphs”. Journal of Graph Theory60, 183–203 (2009)

    work page 2009

  40. [40]

    Vertex- minors of graphs: A survey

    Donggyu Kim and Sang-il Oum. “Vertex- minors of graphs: A survey”. Discrete Ap- plied Mathematics351, 54–73 (2024)

    work page 2024

  41. [41]

    Local structure for vertex-minors

    Rose McCarty. “Local structure for vertex-minors”. Phd thesis. Uni- versity of Waterloo. Waterloo, On- tario, Canada (2021). url:https: //uwspace.uwaterloo.ca/items/ 1cfbfc52-2e30-44a4-b3fb-28493c3d94f0

    work page 2021

  42. [43]

    Anonymous quantum confer- ence key agreement

    Frederik Hahn, Jarn de Jong, and Anna Pappa. “Anonymous quantum confer- ence key agreement”. PRX Quantum1, 020325 (2020). arXiv:2003.10186

    work page arXiv 2020

  43. [44]

    Se- cure anonymous conferencing in quantum networks

    Federico Grasselli, Gláucia Murta, Jarn de Jong, Frederik Hahn, Dagmar Bruß, Her- mann Kampermann, and Anna Pappa. “Se- cure anonymous conferencing in quantum networks”. PRX Quantum3, 040306 (2022). arXiv:2111.05363

    work page arXiv 2022

  44. [45]

    Anony- mous conference key agreement in lin- ear quantum networks

    Jarn de Jong, Frederik Hahn, Jens Eisert, Nathan Walk, and Anna Pappa. “Anony- mous conference key agreement in lin- ear quantum networks”. Quantum7, 1117 (2023). arXiv:2205.09169

    work page arXiv 2023

  45. [46]

    Optimization complexity and resource minimization of emitter-based photonic graph state genera- tion protocols

    Evangelia Takou, Edwin Barnes, and Sophia E Economou. “Optimization complexity and resource minimization of emitter-based photonic graph state genera- tion protocols”. npj Quantum Information 11, 108 (2025). arXiv:2407.15777

    work page arXiv 2025

  46. [47]

    All photonic quantum repeaters

    Koji Azuma, Kiyoshi Tamaki, and Hoi- Kwong Lo. “All-photonic quantum re- peaters”. Nature communications6, 6787 (2015). arXiv:1309.7207

    work page internal anchor Pith review Pith/arXiv arXiv 2015

  47. [48]

    Quantum secret sharing

    Mark Hillery, Vladimír Bužek, and An- dré Berthiaume. “Quantum secret shar- ing”. Physical Review A59, 1829 (1999). arXiv:quant-ph/9806063

    work page internal anchor Pith review Pith/arXiv arXiv 1999

  48. [49]

    Normal forms and entanglement measures for multipartite quantum states

    Frank Verstraete, Jeroen Dehaene, and Bart De Moor. “Normal forms and entanglement measures for multipartite quantum states”. Physical Review A68, 012103 (2003). arXiv:quant-ph/0105090

    work page internal anchor Pith review Pith/arXiv arXiv 2003

  49. [50]

    Local unitary versus local Clifford equivalence of stabilizer states

    Maarten Van den Nest, Jeroen Dehaene, and Bart De Moor. “Local unitary ver- sus local Clifford equivalence of stabilizer states”. Phys. Rev. A71, 062323 (2005). arXiv:quant-ph/0411115

    work page internal anchor Pith review Pith/arXiv arXiv 2005

  50. [51]

    The LU-LC conjecture is false

    Zhengfeng Ji, Jianxin Chen, Zhaohui Wei, and Mingsheng Ying. “The LU-LC con- jecture is false”. Quantum Informa- tion and Computation10, 97–108 (2010). arXiv:0709.1266

    work page internal anchor Pith review Pith/arXiv arXiv 2010

  51. [52]

    Graph states and local unitary transformations beyond local Clifford operations

    Nikoloz Tsimakuridze and Otfried Gühne. “Graph states and local unitary transforma- tionsbeyondlocalCliffordoperations”. Jour- nalofPhysicsA:MathematicalandTheoret- ical50, 195302 (2017). arXiv:1611.06938

    work page internal anchor Pith review Pith/arXiv arXiv 2017

  52. [53]

    De- ciding local unitary equivalence of graph statesinquasi-polynomialtime

    Nathan Claudet and Simon Perdrix. “De- ciding local unitary equivalence of graph statesinquasi-polynomialtime”. InProceed- ings of the 52nd International Colloquium on Automata, Languages, and Programming (ICALP 2025). (2025). arXiv:2502.06566

    work page arXiv 2025

  53. [54]

    Local equivalences of graph states

    Nathan Claudet. “Local equivalences of graph states”. PhD thesis. Univer- sité de Lorraine. Nancy, France (2025). arXiv:2511.22271

    work page arXiv 2025

  54. [55]

    Rank-width and vertex- minors

    Sang il Oum. “Rank-width and vertex- minors”. Journal of Combinatorial Theory, Series B95, 79–100 (2005)

    work page 2005

  55. [56]

    Solving rota’s conjecture

    Jim Geelen, Bert Gerards, and Geoff Whit- 17 tle. “Solving rota’s conjecture”. Notices of the AMS61, 736–743 (2014)

    work page 2014

  56. [57]

    Graph minors XXIII. Nash-Williams’ immersion conjecture

    NeilRobertsonandPaulDSeymour. “Graph minors XXIII. Nash-Williams’ immersion conjecture.”. J. Comb. Theory B100, 181– 205 (2010)

    work page 2010

  57. [58]

    Circle graph obstructions under pivoting

    Jim Geelen and Sang-il Oum. “Circle graph obstructions under pivoting”. Journal of Graph Theory61, 1–11 (2009)

    work page 2009

  58. [59]

    Local complemen- tation and interlacement graphs

    Hubert de Fraysseix. “Local complemen- tation and interlacement graphs”. Discrete Mathematics33, 29–35 (1981)

    work page 1981

  59. [60]

    Good quantum error-correcting codes exist

    A. R. Calderbank and Peter W. Shor. “Good quantum error-correcting codes exist”. Phys. Rev. A54, 1098–1105 (1996). arXiv:quant- ph/9512032

    work page arXiv 1996

  60. [61]

    Error correcting codes in quantum theory

    A. M. Steane. “Error correcting codes in quantum theory”. Phys. Rev. Lett.77, 793– 797 (1996)

    work page 1996

  61. [62]

    Multi- partite quantum cryptographic protocols with noisy GHZ states

    Kai Chen and Hoi-Kwong Lo. “Multi- partite quantum cryptographic protocols with noisy GHZ states”. Quantum Informa- tionandComputation7(2007). arXiv:quant- ph/0404133

    work page arXiv 2007

  62. [63]

    How to simulate quantum mea- surement without computing marginals

    Sergey Bravyi, David Gosset, and Yinchen Liu. “How to simulate quantum mea- surement without computing marginals”. Phys. Rev. Lett.128, 220503 (2022). arXiv:2112.08499

    work page arXiv 2022

  63. [64]

    Isotropic matroids II: Circle graphs

    Robert Brijder and Lorenzo Traldi. “Isotropic matroids II: Circle graphs” (2016) arXiv:1504.04299

    work page internal anchor Pith review Pith/arXiv arXiv 2016

  64. [65]

    How to transform graph states using single-qubit operations: computational complexity and algorithms

    Axel Dahlberg, Jonas Helsen, and Stephanie Wehner. “How to transform graph states us- ing single-qubit operations: computational complexity and algorithms”. Quantum Sci- ence and Technology5, 045016 (2020). arXiv:1805.05306

    work page internal anchor Pith review Pith/arXiv arXiv 2020

  65. [66]

    An efficient algorithm to recognize locally equivalent graphs

    André Bouchet. “An efficient algorithm to recognize locally equivalent graphs”. Combi- natorica11, 315–329 (1991)

    work page 1991

  66. [67]

    An efficient algorithm to recognize local Clifford equivalence of graph states

    Maarten Van den Nest, Jeroen Dehaene, and Bart De Moor. “Efficient algorithm to recognize the local Clifford equivalence of graph states”. Physical Review A70, 034302 (2004). arXiv:quant-ph/0405023

    work page internal anchor Pith review Pith/arXiv arXiv 2004

  67. [68]

    Graph minors. X. Obstructions to tree- decomposition

    Neil Robertson and P.D Seymour. “Graph minors. X. Obstructions to tree- decomposition”. Journal of Combinatorial Theory, Series B52, 153–190 (1991)

    work page 1991

  68. [69]

    The branchwidth of graphs and their cycle ma- troids

    Illya V. Hicks and Nolan B. McMurray. “The branchwidth of graphs and their cycle ma- troids”. Journal of Combinatorial Theory, Series B97, 681–692 (2007)

    work page 2007

  69. [70]

    Connectivity of isotropic sys- tems

    A. Bouchet. “Connectivity of isotropic sys- tems”. In Combinatorial Mathematics: Pro- ceedings of the Third International Con- ference (New York, 1985). Volume 555, pages 81–93. New York Acad. Sci., New York (1989)

    work page 1985

  70. [71]

    Rank-width of Random Graphs

    Choongbum Lee, Joonkyung Lee, and Sang-il Oum. “Rank-width of random graphs”. Journal of Graph Theory70, 339– 347 (2012). arXiv:1001.0461

    work page internal anchor Pith review Pith/arXiv arXiv 2012

  71. [72]

    On objects dual to tree-cut decompositions

    Łukasz Bożyk, Oscar Defrain, Karolina Okrasa, and Michał Pilipczuk. “On objects dual to tree-cut decompositions”. Journal of Combinatorial Theory, Series B157, 401– 428 (2022). arXiv:2103.14667

    work page arXiv 2022

  72. [73]

    Submodular parti- tion functions

    Omid Amini, Frédéric Mazoit, Nicolas Nisse, and Stéphan Thomassé. “Submodular parti- tion functions”. Discrete Mathematics309, 6000–6008 (2009)

    work page 2009

  73. [74]

    Cer- tifying large branch-width

    Sang-il Oum and Paul Seymour. “Cer- tifying large branch-width”. In Proceed- ings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm. Page 810–813. SODA ’06USA (2006). Society for Industrial and Applied Mathematics. A Rank-width of circle graphs We note that it is possible to prove that there ex- ist circle graphs withn2 vertices and rank-...

    work page 2006