Universal Parity Quantum Computing

Abstract

We propose a universal gate set for quantum computing with all-to-all connectivity and intrinsic robustness to bit-flip errors based on parity encoding. We show that logical controlled phase gate and $R_z$ rotations can be implemented in parity encoding with single-qubit operations. Together with logical $R_x$ rotations, implemented via nearest-neighbor controlled-NOT gates and an $R_x$ rotation, these form a universal gate set. As the controlled phase gate requires only single-qubit rotations, the proposed scheme has advantages for several cornerstone quantum algorithms, e.g., the quantum Fourier transform. We present a method to switch between different encoding variants via partial on-the-fly encoding and decoding.

9 pages, 6 figures

References in corpus (11)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Charge insensitive qubit design derived from the Cooper pair box
• Quantum algorithm for solving linear systems of equations
• Surface codes: Towards practical large-scale quantum computation
• Quantum computing with trapped ions
• Strong quantum computational advantage using a superconducting quantum processor
• Controlling the spontaneous emission of a superconducting transmon qubit
• Quantum computing with neutral atoms
• Fault-Tolerant Computing With Biased-Noise Superconducting Qubits
• Modular Parity Quantum Approximate Optimization
• Applications of Universal Parity Quantum Computation

Cited by in corpus (1)

• Applications of Universal Parity Quantum Computation