Curator's Take
This article sharpens the theoretical toolkit for measurement‑based quantum computing by delivering a streamlined definition of “qudit flow” and an O(n³) algorithm to find it—matching the efficiency long enjoyed for qubits and beating the prior O(n⁴) bound for higher‑dimensional systems. By extending flow‑preserving transformations such as pivoting and vertex insertion to prime‑dimensional graph states, the work opens a practical route to optimise large‑scale qudit circuits, which are increasingly attractive for error‑resilient hardware and richer algorithmic encodings. The result bridges a gap between the well‑studied qubit MBQC framework and emerging qudit platforms, suggesting that near‑term experiments can now benchmark and compile more complex, deterministic measurement‑based programs without prohibitive classical overhead.
— Mark Eatherly
Summary
Measurement-based quantum computing is a universal model of quantum computation in which successive product measurements of an entangled resource state drive the computation. The non-deterministic nature of measurements necessitates adaptivity to ensure an overall deterministic computation. Flow structures characterise cases in which such an adaptive correction procedure is possible. Recently, flow has been defined in a setting where the resource states are prime-dimensional qudit graph states rather than the usual qubit graph states. Yet, this qudit flow definition is more burdensome to work with than analogous definitions for qubits. Here, we give a simpler definition of qudit flow and consider various useful properties of this flow, drawing on results for the qubit case. In particular, we show how to focus qudit flow and argue that focused flow is canonical. We improve the previous algebraic formulation to capture focused flow and use it to obtain an $O(n^3)$ flow-finding algorithm (where $n$ is the number of qudits), matching the best known complexity for qubit flows and improving on the previous $O(n^4)$ result for qudits. Furthermore, we explore multiple flow-preserving transformations, thus opening a pathway to using flow for optimisation. These transformations include pivoting, removal and insertion of certain types of vertices, and reversibility of flow. Lastly, we propose an algorithmic approach to generating large qudit computations with flow, for testing or machine learning.