Modular Parity Quantum Approximate Optimization
arXiv:2203.04340 · doi:10.1103/PRXQuantum.3.030304
Abstract
The parity transformation encodes spin models in the low-energy subspace of a larger Hilbert-space with constraints on a planar lattice. Applying the Quantum Approximate Optimization Algorithm (QAOA), the constraints can either be enforced explicitly, by energy penalties, or implicitly, by restricting the dynamics to the low-energy subspace via the driver Hamiltonian. While the explicit approach allows for parallelization with a system-size-independent circuit depth, the implicit approach shows better QAOA performance. Here we combine the two approaches in order to improve the QAOA performance while keeping the circuit parallelizable. In particular, we introduce a modular parallelization method that partitions the circuit into clusters of subcircuits with fixed maximal circuit depth, relevant for scaling up to large system sizes.
11 pages, 9 figures
References in corpus (4)
Cited by in corpus (14)
- Constrained Optimization via Quantum Zeno Dynamics
- Rydberg blockade based parity quantum optimization
- Universal Parity Quantum Computing
- Encoding-Independent Optimization Problem Formulation for Quantum Computing
- Applications of Universal Parity Quantum Computation
- Characterization of variational quantum algorithms using free fermions
- Parity Quantum Computing as YZ-Plane Measurement-Based Quantum Computing
- Approaching Collateral Optimization for NISQ and Quantum-Inspired Computing
- Constructive plaquette compilation for the parity architecture
- Prog-QAOA: Framework for resource-efficient quantum optimization through classical programs
- Constant Depth Code Deformations in the Parity Architecture
- Comparing planar quantum computing platforms at the quantum speed limit
- Scalable Parity Architecture With a Shuttling-Based Spin Qubit Processor
- Four-body coupler for superconducting qubits based on Josephson parametric oscillators