Minimally Universal Parity Quantum Computing
arXiv:2504.03556 · doi:10.1103/9q8k-5378
Abstract
In parity quantum computing, multi-qubit logical gates are implemented by single-qubit rotations on a suitably encoded state involving auxiliary qubits. Consequently, there is a correspondence between qubit count and the size of the native gate set. One might then wonder: what is the smallest number of auxiliary qubits that still allows for universal parity computing? Here, we demonstrate that the answer is one, if the number of logical qubits is even, and two otherwise. Furthermore, we present a sufficient condition for a given parity gate set to be universal. This leads to a variety of different universal parity gate sets corresponding to different numbers of auxiliary qubits, and more generally contributes to the understanding of which entangling gates are required to augment the set of single-qubit unitaries to perform universal quantum computing. As a consequence, we obtain (i) minimal implementations of the parity framework on e.g., a triangular lattice, (ii) hardware specific implementations of the parity flow framework on e.g., a heavy-hex lattice, and (iii) novel universal resources for measurement-based quantum computation (MBQC).
13+12 pages, 4+1 figures; v2: close to published version
References in corpus (26)
- Measurement-based quantum computation with cluster states
- Improved Simulation of Stabilizer Circuits
- Measurement-based quantum computation
- Procedure for systematically tuning up crosstalk in the cross resonance gate
- Universal resources for measurement-based quantum computation
- Multiparticle entanglement purification for graph states
- Fast simulation of stabilizer circuits using a graph state representation
- Experimental demonstration of a resonator-induced phase gate in a multi-qubit circuit QED system
- Fabrication and Characterization of Aluminum Airbridges for Superconducting Microwave Circuits
- Multiparticle entanglement purification for two-colorable graph states
- Generalized Flow and Determinism in Measurement-based Quantum Computation
- Phase Gadget Synthesis for Shallow Circuits
- A measurement-based variational quantum eigensolver
- Low Loss Multi-Layer Wiring for Superconducting Microwave Devices
- Rydberg blockade based parity quantum optimization
- Parity Quantum Optimization: Compiler
- Flow Ambiguity: A Path Towards Classically Driven Blind Quantum Computation
- Measurement-Based Long-Range Entangling Gates in Constant Depth
- A native measurement-based QAOA algorithm, applied to the MAX K-CUT problem
- Parity Quantum Optimization: Benchmarks
- Parity Quantum Optimization: Encoding Constraints
- Parity Quantum Computing as YZ-Plane Measurement-Based Quantum Computing
- Computational model underlying the one-way quantum computer
- Measurement-based quantum computation from Clifford quantum cellular automata
- Optimally generating using Pauli strings
- The Min-Entropy of Classical-Quantum Combs for Measurement-Based Applications