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.
arXiv comment9 pages, 6 figures
References in corpus (39)
- Quantum Computing in the NISQ era and beyond
- Many-Body Physics with Ultracold Gases
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Elementary gates for quantum computation
- Circuit Quantum Electrodynamics: Coherent Coupling of a Single Photon to a Cooper Pair Box
- Charge insensitive qubit design derived from the Cooper pair box
- Surface codes: Towards practical large-scale quantum computation
- Quantum information with Rydberg atoms
- Probing many-body dynamics on a 51-atom quantum simulator
- Measurement-based quantum computation with cluster states
- Adiabatic Quantum Computing
- Fast quantum gates for neutral atoms
- Strong quantum computational advantage using a superconducting quantum processor
- Fault-tolerant quantum computation with high threshold in two dimensions
- Quantum Networks for Elementary Arithmetic Operations
- Coherent Josephson qubit suitable for scalable quantum integrated circuits
- Controlling the spontaneous emission of a superconducting transmon qubit
- Quantum computing with neutral atoms
- Quantum error-correcting codes associated with graphs
- Blueprint for a microwave trapped-ion quantum computer
- Exponential suppression of bit-flips in a qubit encoded in an oscillator
- Complete 3-Qubit Grover Search on a Programmable Quantum Computer
- Bias-preserving gates with stabilized cat qubits
- Quantum arithmetic with the Quantum Fourier Transform
- Fault-Tolerant Computing With Biased-Noise Superconducting Qubits
- Toward fault-tolerant quantum computation without concatenation
- Surface code compilation via edge-disjoint paths
- Quantum codes for quantum simulation of Fermions on a square lattice of qubits
- Depth optimization of quantum search algorithms beyond Grover's algorithm
- Impact of qubit connectivity on quantum algorithm performance
- Benchmarking a high-fidelity mixed-species entangling gate
- Stabilisers as a design tool for new forms of Lechner-Hauke-Zoller Annealer
- Long-range connectivity in a superconducting quantum processor using a ring resonator
- Error correction for encoded quantum annealing
- Universal Parity Quantum Computing
- Programmable Superpositions of Ising Configurations
- Modular Parity Quantum Approximate Optimization
- Designing ground states of Hopfield networks for quantum state preparation