Parity Quantum Computing as YZ-Plane Measurement-Based Quantum Computing

Abstract

We show that universal parity quantum computing employing a recently introduced constant depth decoding procedure is equivalent to measurement-based quantum computation (MBQC) on a bipartite graph using only YZ-plane measurements. We further show that any unitary MBQC using only YZ-plane measurements must occur on a bipartite graph.

4+2 pages, 1 figure; v2: close to published version, published open access in PRL

References in corpus (21)

• Quantum Computing in the NISQ era and beyond
• Measurement-based quantum computation with cluster states
• Experimental One-Way Quantum Computing
• Measurement-based quantum computation
• Multi-party entanglement in graph states
• Fault-tolerant quantum computation with high threshold in two dimensions
• Quantum error-correcting codes associated with graphs
• A fault-tolerant one-way quantum computer
• Graphical description of the action of local Clifford transformations on graph states
• Multiparticle entanglement purification for graph states
• Multiparticle entanglement purification for two-colorable graph states
• Generalized Flow and Determinism in Measurement-based Quantum Computation
• Foliated Quantum Codes
• Universal and optimal error thresholds for measurement-based entanglement purification
• Quantum optimization via four-body Rydberg gates
• Rydberg blockade based parity quantum optimization
• Parity Quantum Optimization: Compiler
• Modular Parity Quantum Approximate Optimization
• Parity Quantum Optimization: Benchmarks
• Parity Quantum Optimization: Encoding Constraints
• Constant Depth Code Deformations in the Parity Architecture

Cited by in corpus (4)

• SWAP-less Implementation of Quantum Algorithms
• Optimally generating $\mathfrak{su}(2^N)$ using Pauli strings
• Minimally Universal Parity Quantum Computing
• Improving success probability in the LHZ parity embedding by computing with quantum walks