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.
arXiv comment11 pages, 9 figures
References in corpus (24)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum information with Rydberg atoms
- Photonic quantum technologies
- Quantum computational advantage using photons
- Noisy intermediate-scale quantum (NISQ) algorithms
- Improved Simulation of Stabilizer Circuits
- Superconducting Qubits: Current State of Play
- Strong quantum computational advantage using a superconducting quantum processor
- Quantum Phases of Matter on a 256-Atom Programmable Quantum Simulator
- From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
- Programmable quantum simulation of 2D antiferromagnets with hundreds of Rydberg atoms
- Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
- Self-Verifying Variational Quantum Simulation of the Lattice Schwinger Model
- Perspectives of quantum annealing: Methods and implementations
- Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
- Quantum Optimization of Maximum Independent Set using Rydberg Atom Arrays
- Quantum Approximate Optimization of the Long-Range Ising Model with a Trapped-Ion Quantum Simulator
- Parameter Concentration in Quantum Approximate Optimization
- Phase Gadget Synthesis for Shallow Circuits
- Realizing distance-selective interactions in a Rydberg-dressed atom array
- Driver Hamiltonians for constrained optimization in quantum annealing
- Stabilisers as a design tool for new forms of Lechner-Hauke-Zoller Annealer
- Quantum optimization via four-body Rydberg gates
- Minimal Constraints in the Parity Formulation of Optimization Problems
Cited by in corpus (15)
- Constrained Optimization via Quantum Zeno Dynamics
- Rydberg blockade based parity quantum optimization
- Universal Parity Quantum Computing
- Encoding-Independent Optimization Problem Formulation for Quantum Computing
- Parity Quantum Optimization: Benchmarks
- Applications of Universal Parity Quantum Computation
- Characterization of variational quantum algorithms using free fermions
- Parity Quantum Computing as YZ-Plane Measurement-Based Quantum Computing
- Constructive plaquette compilation for the parity architecture
- Approaching Collateral Optimization for NISQ and Quantum-Inspired Computing
- 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