Applications of Universal Parity Quantum Computation
arXiv:2205.09517 · doi:10.1103/PhysRevA.106.042442
Abstract
We demonstrate the applicability of a universal gate set in the parity encoding, which is a dual to the standard gate model, by exploring several quantum gate algorithms such as the quantum Fourier transform and quantum addition. Embedding these algorithms in the parity encoding reduces the circuit depth compared to conventional gate-based implementations while keeping the multiqubit gate counts comparable. We further propose simple implementations of multiqubit gates in tailored encodings and an efficient strategy to prepare graph states.
9 pages, 6 figures
References in corpus (12)
- Many-Body Physics with Ultracold Gases
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Charge insensitive qubit design derived from the Cooper pair box
- Surface codes: Towards practical large-scale quantum computation
- Probing many-body dynamics on a 51-atom quantum simulator
- Strong quantum computational advantage using a superconducting quantum processor
- Fault-tolerant quantum computation with high threshold in two dimensions
- Controlling the spontaneous emission of a superconducting transmon qubit
- Quantum computing with neutral atoms
- Fault-Tolerant Computing With Biased-Noise Superconducting Qubits
- Universal Parity Quantum Computing
- Modular Parity Quantum Approximate Optimization