Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation

DOI10.4204/EPTCS.384.12arXiv2304.08166OpenAlexW4386096047MaRDI QIDQ6200534FDOQ6200534

Authors: Miriam Backens 

Publication date: 22 March 2024

Published in: Electronic Proceedings in Theoretical Computer Science (Search for Journal in Brave)

Abstract: In the one-way model of measurement-based quantum computation (MBQC), computation proceeds via measurements on a resource state. So-called flow conditions ensure that the overall computation is deterministic in a suitable sense, with Pauli flow being the most general of these. Computations, represented as measurement patterns, may be rewritten to optimise resource use and for other purposes. Such rewrites need to preserve the existence of flow to ensure the new pattern can still be implemented deterministically. The majority of existing work in this area has focused on rewrites that reduce the number of qubits, yet it can be beneficial to increase the number of qubits for certain kinds of optimisation, as well as for obfuscation. In this work, we introduce several ZX-calculus rewrite rules that increase the number of qubits and preserve the existence of Pauli flow. These rules can be used to transform any measurement pattern into a pattern containing only (general or Pauli) measurements within the XY-plane. We also give the first flow-preserving rewrite rule that allows measurement angles to be changed arbitrarily, and use this to prove that the `neighbour unfusion' rule of Staudacher et al. preserves the existence of Pauli flow. This implies it may be possible to reduce the runtime of their two-qubit-gate optimisation procedure by removing the need to regularly run the costly gflow-finding algorithm.

Full work available at URL: https://arxiv.org/abs/2304.08166

Recommendations

• Rewriting measurement-based quantum computations with generalised flow
• Optimization of one-way quantum computation measurement patterns
• Extended measurement calculus
• The measurement calculus
• Finding Optimal Flows Efficiently

Mathematics Subject Classification ID

Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx)

Cites Work

• The ZX-calculus is complete for stabilizer quantum mechanics
• Graph states and the necessity of Euler decomposition
• Which Graph States are Useful for Quantum Information Processing?
• Parallelizing quantum circuits
• A Complete Axiomatisation of the ZX-Calculus for Clifford+T Quantum Mechanics
• Picturing quantum processes. A first course in quantum theory and diagrammatic reasoning
• Two complete axiomatisations of pure-state qubit quantum computing
• Making the stabilizer ZX-calculus complete for scalars
• Diagrammatic reasoning beyond Clifford+T quantum mechanics
• Title not available (Why is that?)

Cited In (1)

• Multi-agent blind quantum computation without universal cluster states

This page was built for publication: Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6200534)