An algebraic interpretation of Pauli flow, leading to faster flow-finding algorithms

The one-way model of quantum computation is an alternative to the circuit model. A one-way computation is driven entirely by successive adaptive measurements of a pre-prepared entangled resource state. For each measurement, only one outcome is desired; hence a fundamental question is whether some intended measurement scheme can be performed in a robustly deterministic way. So-called flow structures witness robust determinism by providing instructions for correcting undesired outcomes. Pauli flow is one of the broadest of these structures and has been studied extensively. It is known how to find flow structures in polynomial time when they exist; nevertheless, their lengthy and complex definitions often hinder working with them. We simplify these definitions by providing a new algebraic interpretation of Pauli flow. This involves defining two matrices arising from the adjacency matrix of the underlying graph: the flow-demand matrix $M$ and the order-demand matrix $N$. We show that Pauli flow exists if and only if there is a right inverse $C$ of $M$ such that the product $NC$ forms the adjacency matrix of a directed acyclic graph. From the newly defined algebraic interpretation, we obtain $\mathcal{O}(n^3)$ algorithms for finding Pauli flow, improving on the previous $\mathcal{O}(n^4)$ bound for finding generalised flow, a weaker variant of flow, and $\mathcal{O}(n^5)$ bound for finding Pauli flow. We also introduce a first lower bound for the Pauli flow-finding problem, by linking it to the matrix invertibility and multiplication problems over $\mathbb{F}_2$.

💡 Research Summary

The paper presents a new algebraic framework for Pauli flow, a central structure that guarantees robust determinism in measurement‑based quantum computing (the one‑way model). In the traditional setting, Pauli flow is defined by a cumbersome set of nine logical conditions (P1‑P9) that relate correction sets, measurement bases, and a partial order on the non‑output qubits. These definitions, while mathematically sound, are difficult to manipulate algorithmically.

The authors introduce two matrices derived directly from the adjacency matrix of the underlying graph: the flow‑demand matrix M and the order‑demand matrix N. M encodes, for each non‑output vertex u, the required correction set c(u) together with the measurement label λ(u) in a binary (ℱ₂) format. N captures the ordering constraints that a Pauli flow must satisfy, also as a binary matrix.

The central theorem states that a labelled open graph admits a Pauli flow if and only if M has a right inverse C (i.e., M·C = I over ℱ₂) and the product NC is the adjacency matrix of a directed acyclic graph (DAG). In this formulation, C directly yields the X‑correction mapping, while the DAG defined by NC provides a valid measurement order. When the number of inputs equals the number of outputs (|I| = |O|), M becomes square, making C unique; consequently, a focused Pauli flow (where correction sets are minimal) is also unique, a fact now proved algebraically rather than combinatorially.

Based on this characterization, the authors devise a three‑step algorithm:

1. Construct M and N from the graph in O(n²) time.
2. Compute a right inverse C of M using Gaussian elimination over ℱ₂, which costs O(n³) time (or reports failure if M is not full‑rank).
3. Form NC and test acyclicity by a depth‑first search, also O(n²).

If all steps succeed, the algorithm outputs a Pauli flow; otherwise it certifies that none exists. The overall complexity is O(n³), improving on the previously best known O(n⁵) algorithm for Pauli flow and O(n⁴) for the weaker generalized flow (g‑flow).

To complement the upper bound, the paper establishes a lower bound by reduction from the ℱ₂‑matrix invertibility problem, which is known to require Ω(n²) operations. Hence the new algorithm is asymptotically close to optimal.

The work also treats the case |I| < |O|, where M is rectangular and may have many right inverses. By applying a basis change, the algorithm efficiently searches for a C that yields an acyclic NC, or proves none exists. The notion of focused sets—subsets of vertices whose collective correction is trivial—is revisited; the authors show how these sets can be used to transform one focused Pauli flow into another, and how they facilitate the reversibility property: swapping inputs and outputs preserves the existence of a focused flow, with the transposed correction matrix Cᵀ providing the reversed flow (a result previously known only for X‑Y measurements, now extended to general Pauli flow).

Beyond the theoretical contribution, the faster flow‑finding algorithm has practical implications. It removes a major bottleneck that previously limited the use of Pauli flow in circuit optimisation, blind quantum computing verification, and translation of measurement‑based programs into circuit form. Moreover, the algebraic viewpoint opens the door to further connections with graph theory, linear algebra, and quantum error‑correcting code design.

In conclusion, the paper delivers a clean, matrix‑based characterization of Pauli flow, proves its equivalence to the existence of a right inverse and a DAG condition, provides an O(n³) deterministic algorithm together with an Ω(n²) lower bound, and extends several structural results (uniqueness, reversibility, handling of |I| < |O|) to the full Pauli flow setting. Future work may explore similar algebraic treatments for causal flow, deeper links with stabiliser formalism, and implementation on near‑term quantum hardware.