Pauli Flow on Open Graphs with Unknown Measurement Labels
Piotr Mitosek (University of Birmingham)

TL;DR
This paper introduces a randomized polynomial-time algorithm to determine the existence of Pauli flow in open graphs with unknown measurement labels, extending algebraic methods and optimizing qubit configurations for measurement-based quantum computation.
Contribution
It provides the first efficient method to decide Pauli flow existence without known measurement labels, using algebraic interpretations and matrix invertibility.
Findings
Decides Pauli flow existence in RP for unknown measurement labels.
Shows flow existence relates to matrix right-invertibility.
Reduces output qubits to match input qubits while preserving flow.
Abstract
One-way quantum computation, or measurement-based quantum computation, is a universal model of quantum computation alternative to the circuit model. The computation progresses by measurements of a pre-prepared resource state together with corrections of undesired outcomes via applications of Pauli gates to yet unmeasured qubits. The fundamental question of this model is determining whether computation can be implemented deterministically. Pauli flow is one of the most general structures guaranteeing determinism. It is also essential for polynomial time ancilla-free circuit extraction. It is known how to efficiently determine the existence of Pauli flow given an open graph together with a measurement labelling (a choice of measurements to be performed). In this work, we focus on the problem of deciding the existence of Pauli flow for a given open graph when the measurement labelling is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
