Generating one-way computations with flow: flow-preserving rewriting that ignores the interpretation

• URL: http://arxiv.org/abs/2607.03250v1
• Date: Fri, 03 Jul 2026 12:10:32 GMT
• Title: Generating one-way computations with flow: flow-preserving rewriting that ignores the interpretation
• Abstract summary: One-way quantum computation is made deterministic overall by modifying later measurements depending on the outcomes of earlier ones.<n>Existing approaches to flow-preserving rewriting are used for compilation or optimisation.<n>We show that a family of just three flow-preserving rewrite rules suffices to generate any diagram with flow from a trivial diagram with the desired number of inputs and outputs.
• Score: 2.8427946758947304
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The one-way model is a universal model of quantum computation, driven by successive adaptive single-qubit measurements on an entangled resource state. Measurements are non-deterministic, yet if the computation satisfies one of several related families of conditions known as 'flows', the computation can be made deterministic overall by modifying later measurements depending on the outcomes of earlier ones. Flow properties also enable efficient translation from one-way computations to circuits, motivating research into rewriting one-way computations while preserving the existence of flow. Existing approaches to flow-preserving rewriting are used for compilation or optimisation and preserve both the interpretation and the existence of flow. Here, we broaden our perspective to consider flow-preserving rewriting that does not necessarily preserve the interpretation, with applications to creating test instances for software that works with flow, as well as to generating ansätze for quantum machine learning. We show that a family of just three flow-preserving rewrite rules suffices to generate any diagram with flow from a trivial diagram with the desired number of inputs and outputs. This rule set is nearly the same as the complete set of flow- and interpretation-preserving rewrite rules for one-way computations in which all measurements are Pauli; and just a small subset of the flow- and interpretation-preserving rewrite rules for arbitrary measurements.

Related papers

• Completeness for flow-preserving rewrite rules [2.406359246841227]
  Recent applications of the ZX-calculus have made use of the close correspondence between ZX-diagrams and computations.<n>We extend the set of flow-preserving rules appearing in the literature with a few new rules and extensions of existing rules.<n>We show that the resulting rule set is complete for all flow-preserving translations between ZX-diagrams of appropriate form.
  arXiv  Detail & Related papers  (2026-08-13T10:03:31Z)
• Working with measurement-based computations on qudits [2.406359246841227]
  We give a simpler definition of qudit flow and consider various useful properties of this flow.<n>We show how to focus qudit flow and argue that focused flow is canonical.<n>We propose an algorithmic approach to generating large qudit computations with flow.
  arXiv  Detail & Related papers  (2026-06-29T16:29:54Z)
• Inserting Planar-Measured Qubits into MBQC Patterns while Preserving Flow [1.4732811715354455]
  Flow conditions are required for efficient translation into quantum circuits.<n>Most previous work has focused on rewrites that reduce the number of qubits in the computation.<n>We extend the definition of causal flow to permit YZ-measurements and derive the conditions under which a YZ-insertion preserves causal flow.
  arXiv  Detail & Related papers  (2025-08-20T12:43:56Z)
• Unsupervised Representation Learning from Sparse Transformation Analysis [79.94858534887801]
  We propose to learn representations from sequence data by factorizing the transformations of the latent variables into sparse components. Input data are first encoded as distributions of latent activations and subsequently transformed using a probability flow model.
  arXiv  Detail & Related papers  (2024-10-07T23:53:25Z)
• Pauli Flow on Open Graphs with Unknown Measurement Labels [0.0]
  One-way quantum computation, or measurement-based quantum computation, is a universal model of quantum computation alternative to the circuit model. It is known how to efficiently determine the existence of Pauli flow given an open graph together with a measurement labelling. We show that, in the case of X and Z measurements only, flow existence corresponds to the right-invertibility of a matrix derived from the adjacency matrix.
  arXiv  Detail & Related papers  (2024-08-12T11:19:27Z)
• Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation [0.0]
  We introduce several ZX-calculus rewrite rules that increase the number of qubits and preserve the existence of Pauli flow. We also give the first flow-preserving rewrite rule that allows measurement angles to be changed arbitrarily.
  arXiv  Detail & Related papers  (2023-04-17T11:28:47Z)
• GMFlow: Learning Optical Flow via Global Matching [124.57850500778277]
  We propose a GMFlow framework for learning optical flow estimation. It consists of three main components: a customized Transformer for feature enhancement, a correlation and softmax layer for global feature matching, and a self-attention layer for flow propagation. Our new framework outperforms 32-iteration RAFT's performance on the challenging Sintel benchmark.
  arXiv  Detail & Related papers  (2021-11-26T18:59:56Z)
• Flow Network based Generative Models for Non-Iterative Diverse Candidate Generation [110.09855163856326]
  This paper is about the problem of learning a policy for generating an object from a sequence of actions. We propose GFlowNet, based on a view of the generative process as a flow network. We prove that any global minimum of the proposed objectives yields a policy which samples from the desired distribution.
  arXiv  Detail & Related papers  (2021-06-08T14:21:10Z)
• Self Normalizing Flows [65.73510214694987]
  We propose a flexible framework for training normalizing flows by replacing expensive terms in the gradient by learned approximate inverses at each layer. This reduces the computational complexity of each layer's exact update from $mathcalO(D3)$ to $mathcalO(D2)$. We show experimentally that such models are remarkably stable and optimize to similar data likelihood values as their exact gradient counterparts.
  arXiv  Detail & Related papers  (2020-11-14T09:51:51Z)
• Activation Relaxation: A Local Dynamical Approximation to Backpropagation in the Brain [62.997667081978825]
  Activation Relaxation (AR) is motivated by constructing the backpropagation gradient as the equilibrium point of a dynamical system. Our algorithm converges rapidly and robustly to the correct backpropagation gradients, requires only a single type of computational unit, and can operate on arbitrary computation graphs.
  arXiv  Detail & Related papers  (2020-09-11T11:56:34Z)
• LiteFlowNet3: Resolving Correspondence Ambiguity for More Accurate Optical Flow Estimation [99.19322851246972]
  We introduce LiteFlowNet3, a deep network consisting of two specialized modules to address the problem of optical flow estimation. LiteFlowNet3 not only achieves promising results on public benchmarks but also has a small model size and a fast runtime.
  arXiv  Detail & Related papers  (2020-07-18T03:30:39Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.