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