Pauli Flow on Open Graphs with Unknown Measurement Labels

• URL: http://arxiv.org/abs/2408.06059v1
• Date: Mon, 12 Aug 2024 11:19:27 GMT
• Title: Pauli Flow on Open Graphs with Unknown Measurement Labels
• Authors: Piotr Mitosek,
• Abstract summary: 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.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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 unknown. We show that this problem is in RP by providing a random polynomial time algorithm. To do it, we extend previous algebraic interpretations of Pauli flow, by showing 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. We also use this interpretation to show that the number of output qubits can always be reduced to match the number of input qubits while preserving the existence of flow.

Related papers

• An algebraic interpretation of Pauli flow, leading to faster flow-finding algorithms [1.4732811715354455]
  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. We obtain $mathcalO(n3)$ algorithms for finding Pauli flow, improving on the previous $mathcalO(n4)$ bound for finding generalised flow.
  arXiv  Detail & Related papers  (2024-10-30T20:30:01Z)
• A quantum implementation of high-order power method for estimating geometric entanglement of pure states [39.58317527488534]
  This work presents a quantum adaptation of the iterative higher-order power method for estimating the geometric measure of entanglement of multi-qubit pure states. It is executable on current (hybrid) quantum hardware and does not depend on quantum memory. We study the effect of noise on the algorithm using a simple theoretical model based on the standard depolarising channel.
  arXiv  Detail & Related papers  (2024-05-29T14:40:24Z)
• 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)
• Compilation of algorithm-specific graph states for quantum circuits [55.90903601048249]
  We present a quantum circuit compiler that prepares an algorithm-specific graph state from quantum circuits described in high level languages. The computation can then be implemented using a series of non-Pauli measurements on this graph state.
  arXiv  Detail & Related papers  (2022-09-15T14:52:31Z)
• Characterising Determinism in MBQCs involving Pauli Measurements [1.433758865948252]
  We introduce a new characterisation of determinism in measurement-based quantum computing. The one-way model of computation consists in performing local measurements over a large entangled state represented by a graph. The ability to perform an overall deterministic computation requires a correction strategy because of the non-determinism of each measurement.
  arXiv  Detail & Related papers  (2022-07-19T16:12:29Z)
• Near-term quantum algorithm for computing molecular and materials properties based on recursive variational series methods [44.99833362998488]
  We propose a quantum algorithm to estimate the properties of molecules using near-term quantum devices. We test our method by computing the one-particle Green's function in the energy domain and the autocorrelation function in the time domain.
  arXiv  Detail & Related papers  (2022-06-20T16:33:23Z)
• Complete Flow-Preserving Rewrite Rules for MBQC Patterns with Pauli Measurements [0.0]
  We show that introducing new Z-measured qubits, connected to any subset of the existing qubits, preserves the existence of Pauli flow. We prove that any MBQC-like stabilizer ZX-diagram with Pauli flow can be rewritten into this canonical form.
  arXiv  Detail & Related papers  (2022-05-04T11:42:20Z)
• Resource Optimisation of Coherently Controlled Quantum Computations with the PBS-calculus [55.2480439325792]
  Coherent control of quantum computations can be used to improve some quantum protocols and algorithms. We refine the PBS-calculus, a graphical language for coherent control inspired by quantum optics.
  arXiv  Detail & Related papers  (2022-02-10T18:59:52Z)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)
• Relating Measurement Patterns to Circuits via Pauli Flow [0.0]
  We show that Pauli flow can be efficiently identified and transformed into a gate-based quantum circuit. We then use this relationship to derive simulation results for the effects of graph-theoretic rewrites in the ZX-calculus.
  arXiv  Detail & Related papers  (2021-09-13T00:48:24Z)
• Q-Match: Iterative Shape Matching via Quantum Annealing [64.74942589569596]
  Finding shape correspondences can be formulated as an NP-hard quadratic assignment problem (QAP) This paper proposes Q-Match, a new iterative quantum method for QAPs inspired by the alpha-expansion algorithm. Q-Match can be applied for shape matching problems iteratively, on a subset of well-chosen correspondences, allowing us to scale to real-world problems.
  arXiv  Detail & Related papers  (2021-05-06T17:59:38Z)

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.