Quotient-Augmented Strong Split Tree (QASST)

• QASST is a graph-theoretic structure that augments the strong split tree with explicit split-node correspondences to enable exact reconstruction and efficient graph state preparation.
• It leverages split decomposition and local complement invariance to replace exhaustive LC-orbit search with a divide-and-conquer strategy, achieving linear-time performance for distance-hereditary graphs.
• The framework provides practical insights into optimizing gate count and circuit depth in graph state synthesis, integrating exact methods for structured components with heuristics for prime blocks.

The Quotient-Augmented Strong Split Tree (QASST) is a graph-theoretic data structure introduced for the efficient preparation of graph states by exploiting split decomposition and the behavior of local-complement (LC) equivalence classes. In the formulation of "Efficient Preparation of Graph States using the Quotient-Augmented Strong Split Tree" (Connolly et al., 25 Mar 2026), QASST augments the strong split tree of a connected simple graph with explicit split-node correspondences between quotient graphs, enabling both reconstruction of the original graph and a divide-and-conquer strategy for graph-state preparation. Its principal role is to replace exhaustive optimization over an LC orbit with a structural method that is exact for several distance-hereditary families and extensible, via heuristics, to more general graphs (Connolly et al., 25 Mar 2026).

1. Split decomposition and the strong split tree

Let $G=(V,E)$ be a connected simple graph. A split of $G$ is a bipartition $V=U_1 \sqcup U_2$ such that every edge between $U_1$ and $U_2$ induces a complete bipartite subgraph. In the notation given for the framework,

$$V(G)=U_1 \sqcup U_2,\qquad E(G)\cap (U_1\times U_2)=U_1\times U_2.$$

A split is trivial if $\min(|U_1|,|U_2|)=1$.

Two splits $(U_1,U_2)$ and $(U'_1,U'_2)$ are said to cross if each side of one intersects both sides of the other. A nontrivial split is strong if it crosses no other nontrivial split; trivial splits are declared strong by convention. A graph with no nontrivial split is called prime (Connolly et al., 25 Mar 2026).

Cunningham’s split decomposition, as summarized in the paper, states that every connected graph admits a unique decomposition into quotient graphs obtained by repeatedly collapsing strong splits. The result is organized as a tree $T$, called the strong split tree, whose vertices correspond to quotient graphs $G$0 and whose edges correspond to the set of strong splits of $G$1 (Connolly et al., 25 Mar 2026).

For a strong split $G$2, the construction introduces two split-nodes $G$3 and $G$4 and forms

$G$5

with

$G$6

Collapsing the split replaces the bipartite subgraph between $G$7 and $G$8 by the single edge $G$9, after which the procedure recurses on the quotient graphs until all nontrivial splits have been collapsed (Connolly et al., 25 Mar 2026).

This decomposition is structurally significant because it converts a graph into a tree-indexed collection of smaller graphs. A plausible implication is that the combinatorial burden of LC-orbit analysis can be shifted from the original graph to its quotient blocks.

2. Definition and reconstruction of the quotient-augmented strong split tree

The quotient-augmented strong split tree of $V=U_1 \sqcup U_2$0 is defined as the data

• a tree $V=U_1 \sqcup U_2$1 whose nodes are labeled by the quotient graphs $V=U_1 \sqcup U_2$2, and
• for each edge $V=U_1 \sqcup U_2$3 in $V=U_1 \sqcup U_2$4, the distinguished pair of split-nodes $V=U_1 \sqcup U_2$5.

Accordingly,

$V=U_1 \sqcup U_2$6

The augmentation consists precisely in retaining, for each tree-edge, the correspondence between the split-nodes on its two incident quotient graphs (Connolly et al., 25 Mar 2026).

From QASST one can reconstruct $V=U_1 \sqcup U_2$7 by replacing each tree-edge with all-to-all edges between the neighbors of the associated split-nodes and then deleting the split-nodes. In other words, the tree stores the decomposition topology, while the augmentation stores the information needed to reconstitute the original bipartite interfaces (Connolly et al., 25 Mar 2026).

This reconstruction perspective is central to the later split–fuse procedure for graph states: the same structural information that permits graph reconstruction also prescribes how separately prepared quotient states can be reassembled. This suggests that QASST is not merely a canonical decomposition, but also an execution plan for state preparation.

3. Construction algorithm and computational complexity

The paper gives a recursive procedure BUILD-QASST(G). If $V=U_1 \sqcup U_2$8 has no nontrivial strong split, the output is a tree with a single node $V=U_1 \sqcup U_2$9 and no edges. Otherwise, one finds a strong split $U_1$0, forms quotient graphs $U_1$1 with split-nodes $U_1$2, recursively processes the reduced quotient sides, and then connects the root nodes of the two recursive trees by an edge labeled $U_1$3 (Connolly et al., 25 Mar 2026).

The procedure depends on the availability of a strong-split decomposition routine. Using Dahlhaus–Charbit et al.’s linear-time split-decomposition algorithm, the paper states that BUILD-QASST runs in

$U_1$4

The complexity claim is therefore linear in the size of the input graph (Connolly et al., 25 Mar 2026).

Within the paper’s scope, this complexity is important for two reasons. First, it makes the structural preprocessing scalable even when direct enumeration of LC orbits is not. Second, it means that the decomposition overhead does not dominate the cost of subsequent graph-state optimization, especially in the distance-hereditary regime where the quotient structure is particularly simple.

4. Invariance under local complement and consequences for LC orbits

For a vertex $U_1$5, the local complement at $U_1$6 is defined by

$U_1$7

Two graphs are LC-equivalent if one can be reached from the other by a sequence of local complements; the resulting equivalence classes are the LC orbits (Connolly et al., 25 Mar 2026).

The paper records the theorem attributed to Bouchet ’87 / Connolly et al. ’26:

• strong splits of $U_1$8 are invariant under local complement;
• hence the strong split tree $U_1$9 is an invariant of the LC orbit of $U_2$0;
• each quotient graph $U_2$1 transforms under LC to some $U_2$2.

As a consequence,

$U_2$3

This gives a factorized over-approximation of the orbit of $U_2$4 in terms of the orbits of its quotient graphs (Connolly et al., 25 Mar 2026).

A particularly important specialization occurs for distance-hereditary (DH) graphs. The paper states that if $U_2$5 is DH, then every quotient graph $U_2$6 is either a star or a complete graph, citing Cunningham ’82 as equivalent to the DH characterization. In that case,

$U_2$7

which yields the bound

$U_2$8

This replaces a potentially intractable global orbit search with a product bound over simple components (Connolly et al., 25 Mar 2026).

The significance of this result lies in its reduction of LC optimization to local choices on quotient blocks. For DH graphs, those blocks are sufficiently structured that one can characterize orbits analytically rather than by brute force.

5. Graph-state preparation and the split–fuse construction

A graph state $U_2$9 is prepared as

$$V(G)=U_1 \sqcup U_2,\qquad E(G)\cap (U_1\times U_2)=U_1\times U_2.$$0

The paper identifies the standard resource measures as:

• CZ-gate count: $$V(G)=U_1 \sqcup U_2,\qquad E(G)\cap (U_1\times U_2)=U_1\times U_2.$$1,
• circuit depth: $$V(G)=U_1 \sqcup U_2,\qquad E(G)\cap (U_1\times U_2)=U_1\times U_2.$$2, the edge-chromatic index, with $$V(G)=U_1 \sqcup U_2,\qquad E(G)\cap (U_1\times U_2)=U_1\times U_2.$$3 (Connolly et al., 25 Mar 2026).

QASST motivates a split–fuse strategy:

1. prepare, in parallel, intermediate graph states $$V(G)=U_1 \sqcup U_2,\qquad E(G)\cap (U_1\times U_2)=U_1\times U_2.$$4 each LC-optimized within its orbit $$V(G)=U_1 \sqcup U_2,\qquad E(G)\cap (U_1\times U_2)=U_1\times U_2.$$5;
2. convert each $$V(G)=U_1 \sqcup U_2,\qquad E(G)\cap (U_1\times U_2)=U_1\times U_2.$$6 to the exact quotient state $$V(G)=U_1 \sqcup U_2,\qquad E(G)\cap (U_1\times U_2)=U_1\times U_2.$$7 via local Cliffords;
3. perform Type-II fusions on all pairs of split-nodes $$V(G)=U_1 \sqcup U_2,\qquad E(G)\cap (U_1\times U_2)=U_1\times U_2.$$8 to reassemble $$V(G)=U_1 \sqcup U_2,\qquad E(G)\cap (U_1\times U_2)=U_1\times U_2.$$9 (Connolly et al., 25 Mar 2026).

The reconstruction proposition stated in the paper is that applying exactly one Type-II fusion per edge of $\min(|U_1|,|U_2|)=1$0 on the split-node pairs in $\min(|U_1|,|U_2|)=1$1 reconstructs $\min(|U_1|,|U_2|)=1$2 (Connolly et al., 25 Mar 2026).

For a distance-hereditary graph with quotient graphs $\min(|U_1|,|U_2|)=1$3, the notation is:

• $\min(|U_1|,|U_2|)=1$4 = number of original vertices in $\min(|U_1|,|U_2|)=1$5,
• $\min(|U_1|,|U_2|)=1$6 = degree of $\min(|U_1|,|U_2|)=1$7 in $\min(|U_1|,|U_2|)=1$8,
• $\min(|U_1|,|U_2|)=1$9 = number of fusions.

Preparing each $(U_1,U_2)$0 as a star uses $(U_1,U_2)$1 CZ gates and depth $(U_1,U_2)$2, with LC conversion adding at most one layer of depth. Then the $(U_1,U_2)$3 fusions add $(U_1,U_2)$4 entangling operations, all in one step. The resulting totals are (Connolly et al., 25 Mar 2026):

Resource	Total
CZ gates	$(U_1,U_2)$5
Depth	$(U_1,U_2)$6
Qubits	$(U_1,U_2)$7

Since $(U_1,U_2)$8, the paper concludes that all three quantities scale linearly in $(U_1,U_2)$9, in contrast to direct preparation of $(U'_1,U'_2)$0, which has $(U'_1,U'_2)$1 gates and $(U'_1,U'_2)$2 depth (Connolly et al., 25 Mar 2026).

This construction is the operational core of QASST. It converts a structural decomposition into a preparation schedule whose asymptotic behavior is explicit.

6. Distance-hereditary families and extensions to general graphs

For several DH families, the paper states that QASST can be used to characterize LC orbits and identify representatives with reduced controlled-$(U'_1,U'_2)$3 count or preparation circuit depth. The explicitly listed families are complete bipartite graphs $(U'_1,U'_2)$4, clique-stars, and complete multipartites. In these cases one can classify $(U'_1,U'_2)$5 via QASST and pick the LC-optimal representative analytically, without brute-force search; the paper refers to closed-form formulas for $(U'_1,U'_2)$6 and $(U'_1,U'_2)$7 in Connolly et al. ’26 (Connolly et al., 25 Mar 2026).

For DH components, split–fuse always uses star qubits and fusions, achieving linear scaling in gates and depth. The paper further notes that for sufficiently large $(U'_1,U'_2)$8—for example, $(U'_1,U'_2)$9 in $T$0 families—split–fuse already outperforms direct LC-optimal circuits (Connolly et al., 25 Mar 2026).

Beyond the DH setting, QASST may contain prime quotient graphs. The paper proposes a generalized divide-and-conquer split–fuse strategy in which stars and complete graphs are handled as before, while prime blocks are treated either by known small-$T$1 LC-optimal circuits or by a triangle-enumeration heuristic:

• enumerate all triangles in $T$2;
• if local complement at $T$3 reduces $T$4, perform it and repeat (Connolly et al., 25 Mar 2026).

The paper reports that this hybrid method—split–fuse combined with the heuristic—shows empirical improvement on dense Erdős–Rényi graphs (Connolly et al., 25 Mar 2026).

A plausible implication is that QASST functions as a framework rather than a single closed-form algorithm: exact structural simplification where the quotient blocks are controlled, and heuristic reduction where prime blocks remain.

7. Theoretical scaling, empirical behavior, and scope

The paper states a Linear Scaling for DH theorem: for any distance-hereditary graph on $T$5 vertices with $T$6 quotient blocks, the split–fuse algorithm prepares its graph state with $T$7 CZ gates and $T$8 depth, using $T$9 temporary qubits (Connolly et al., 25 Mar 2026). This gives a formal asymptotic guarantee for the DH class.

The empirical observations reported are:

• in random DH samples up to $G$00, split–fuse depth grows $G$01, often nearly constant;
• in complete-multipartite LC orbits, split–fuse outperforms direct LC-optimal from $G$02 onward;
• on dense random graphs, generalized split–fuse plus the triangle heuristic reduces gates by approximately $G$03–$G$04 over naive or heuristic-only methods (Connolly et al., 25 Mar 2026).

The stated complexity profile is:

• QASST construction in $G$05,
• fusion scheduling in one additional step,
• LC conversions and heuristic in $G$06 worst-case for prime blocks (Connolly et al., 25 Mar 2026).

The paper positions these gains against the difficulty of brute-force LC-orbit enumeration and states that the framework avoids the $G$07-hard enumeration of full LC orbits (Connolly et al., 25 Mar 2026). Within that framing, QASST is best understood as a structural invariant and synthesis tool that leverages the preservation of strong splits under local complement, turning graph decomposition into a preparation methodology for graph states.