Skip to content
aiqbench takeQuantum Computing

aiqbench analysis

This paper introduces ZX-flow, a novel criterion within the ZX-calculus framework that enables the efficient extraction of deterministic computations from quantum diagrams without requiring specific graph-state forms. By utilizing Pauli semiwebs, the authors demonstrate that this approach is preserved under Clifford rewrites and allows for the direct conversion of measurement-based patterns into standard quantum circuits. This advancement simplifies reasoning about fault-tolerant protocols and expands the class of ZX-diagrams amenable to efficient circuit extraction.
Source coveringarXiv

ZX-Flow: A Flexible Criterion for Deterministic Computation with ZX-Diagrams

arXiv2 min read

arXiv:2603.09580v2 Announce Type: replace Abstract: Flow criteria are used to efficiently extract computations, either in the form of measurement patterns or quantum circuits, from ZX-diagrams. Existing criteria such as causal flow, generalised flow, and Pauli flow, were all originally formulated for graph states, so they require ZX-diagrams to be in a very particular graph-state-like form. This form is easily broken by applying basic ZX rules and makes establishing some desirable properties very complicated. Here, we introduce a new "ZX-native" flow criterion called ZX-flow, formulated using a new type of decoration of a ZX-diagram we call Pauli semiwebs. These are a generalisation of Pauli webs, which have recently been used extensively in reasoning about fault-tolerant computations in the ZX-calculus. We show that ZX-flow is straightforwardly preserved by all Clifford rewrites and furthermore that a ZX-diagram has ZX-flow if and only if it is Clifford-equivalent to a graph-like ZX-diagram with Pauli flow. Finally, we show that any diagram with ZX-flow can be readily interpreted either as a deterministic measurement-based computation or as a Clifford isometry followed by a sequence of Pauli exponentials. The latter can then be efficiently extracted to a quantum circuit.

Abstract:Flow criteria are used to efficiently extract computations, either in the form of measurement patterns or quantum circuits, from ZX-diagrams. Existing criteria such as causal flow, generalised flow, and Pauli flow, were all originally formulated for graph states, so they require ZX-diagrams to be in a very particular graph-state-like form. This form is easily broken by applying basic ZX rules and makes establishing some desirable properties very complicated. Here, we introduce a new "ZX-native" flow criterion called ZX-flow, formulated using a new type of decoration of a ZX-diagram we call Pauli semiwebs. These are a generalisation of Pauli webs, which have recently been used extensively in reasoning about fault-tolerant computations in the ZX-calculus. We show that ZX-flow is straightforwardly preserved by all Clifford rewrites and furthermore that a ZX-diagram has ZX-flow if and only if it is Clifford-equivalent to a graph-like ZX-diagram with Pauli flow. Finally, we show that any diagram with ZX-flow can be readily interpreted either as a deterministic measurement-based computation or as a Clifford isometry followed by a sequence of Pauli exponentials. The latter can then be efficiently extracted to a quantum circuit.

In Proceedings QPL 2026, arXiv:2611.04069

arXiv:2603.09580 [quant-ph]

(or arXiv:2603.09580v2 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2603.09580 Focus to learn more arXiv-issued DOI via DataCite

EPTCS 456, 2026, pp. 188-206

https://doi.org/10.4204/EPTCS.456.7 Focus to learn more DOI(s) linking to related resources

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 295 words

Related coverage