Universal MBQC with generalised parity-phase interactions and Pauli measurements

Abstract

We introduce a new family of models for measurement-based quantum computation which are deterministic and approximately universal. The resource states which play the role of graph states are prepared via 2-qubit gates of the form $\exp (-i\frac{\pi }{2^n}Z\otimes Z)$. When $n=2$, these are equivalent, up to local Clifford unitaries, to graph states. However, when $n>2$, their behaviour diverges in two important ways. First, multiple applications of the entangling gate to a single pair of qubits produces non-trivial entanglement, and hence multiple parallel edges between nodes play an important role in these generalised graph states. Second, such a state can be used to realise deterministic, approximately universal computation using only Pauli $Z$ and $X$ measurements and feed-forward. Even though, for $n>2$, the relevant resource states are no longer stabiliser states, they admit a straightforward, graphical representation using the ZX-calculus. Using this representation, we are able to provide a simple, graphical proof of universality. We furthermore show that for every $n>2$ this family is capable of producing all Clifford gates and all diagonal gates in the $n$-th level of the Clifford hierarchy.

19 pages, accepted for publication in Quantum (quantum-journal.org). A previous version of this article had the title: "Universal MBQC with Mølmer-Sørensen interactions and two measurement bases"

References in corpus (13)

• Measurement-based quantum computation beyond the one-way model
• Unsupervised Machine Learning on a Hybrid Quantum Computer
• From three-photon GHZ states to ballistic universal quantum computation
• Scalable quantum circuit and control for a superconducting surface code
• Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
• Generalized Flow and Determinism in Measurement-based Quantum Computation
• Both Toffoli and Controlled-NOT need little help to do universal quantum computation
• Diagonal gates in the Clifford hierarchy
• ZH: A Complete Graphical Calculus for Quantum Computations Involving Classical Non-linearity
• A universal completion of the ZX-calculus
• Changing the circuit-depth complexity of measurement-based quantum computation with hypergraph states
• Physical-depth architectural requirements for generating universal photonic cluster states
• Quantum computational universality of hypergraph states with Pauli-X and Z basis measurements

Cited by in corpus (21)

• Reducing T-count with the ZX-calculus
• PyZX: Large Scale Automated Diagrammatic Reasoning
• There and back again: A circuit extraction tale
• Constructing quantum circuits with global gates
• ZX-calculus for the working quantum computer scientist
• Verifying commuting quantum computations via fidelity estimation of weighted graph states
• Quantum Picturalism: Learning Quantum Theory in High School
• Completeness for arbitrary finite dimensions of ZXW-calculus, a unifying calculus
• Quantum Hypergraph States in Continuous Variables
• AKLT-states as ZX-diagrams: diagrammatic reasoning for quantum states
• Completeness of the ZH-calculus
• Picturing Counting Reductions with the ZH-Calculus
• Differentiating and Integrating ZX Diagrams with Applications to Quantum Machine Learning
• Catalytic Transformation from Computationally Universal to Strictly Universal Measurement-Based Quantum Computation
• Addition and Differentiation of ZX-diagrams
• Multi-agent blind quantum computation without universal cluster states
• Kindergarden quantum mechanics graduates (...or how I learned to stop gluing LEGO together and love the ZX-calculus)
• Optimization Framework for Reducing Mid-circuit Measurements and Resets
• ZX Graphical Calculus for Continuous-Variable Quantum Processes
• Quantum Theory from Principles, Quantum Software from Diagrams
• Efficient classical simulation of cluster state quantum circuits with alternative inputs