Parity Quantum Optimization: Compiler

Abstract

We introduce parity quantum optimization with the aim of solving optimization problems consisting of arbitrary $k$-body interactions and side conditions using planar quantum chip architectures. The method introduces a decomposition of the problem graph with arbitrary $k$-body terms using generalized closed cycles of a hypergraph. Side conditions of the optimization problem in form of hard constraints can be included as open cycles containing the terms involved in the side conditions. The generalized parity mapping thus circumvents the need to translate optimization problems to a quadratic unconstrained binary optimization problem (QUBO) and allows for the direct encoding of higher-order constrained binary optimization problems (HCBO) on a square lattice and full parallelizability of gates.

References in corpus (20)

• Quantum Computing in the NISQ era and beyond
• Many-Body Physics with Ultracold Gases
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Circuit Quantum Electrodynamics: Coherent Coupling of a Single Photon to a Cooper Pair Box
• Charge insensitive qubit design derived from the Cooper pair box
• Quantum information with Rydberg atoms
• Probing many-body dynamics on a 51-atom quantum simulator
• Ising formulations of many NP problems
• Photonic quantum technologies
• Quantum Annealing in the Transverse Ising Model
• Noisy intermediate-scale quantum (NISQ) algorithms
• Adiabatic Quantum Computing
• Fast quantum gates for neutral atoms
• Quantum optimization using variational algorithms on near-term quantum devices
• Large-scale silicon quantum photonics implementing arbitrary two-qubit processing
• Perspectives of quantum annealing: Methods and implementations
• Quantum computing with neutral atoms
• QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
• Forecasting financial crashes with quantum computing
• Error correction for encoded quantum annealing

Cited by in corpus (14)

• Rydberg blockade based parity quantum optimization
• Encoding-Independent Optimization Problem Formulation for Quantum Computing
• Parity Quantum Computing as YZ-Plane Measurement-Based Quantum Computing
• Constructive plaquette compilation for the parity architecture
• Constant Depth Code Deformations in the Parity Architecture
• Quantum Optimization on Rydberg Atom Arrays with Arbitrary Connectivity: Gadgets Limitations and a Heuristic Approach
• Flexible constraint compilation in the parity architecture
• SWAP-less Implementation of Quantum Algorithms
• Comparing planar quantum computing platforms at the quantum speed limit
• Scalable Parity Architecture With a Shuttling-Based Spin Qubit Processor
• Minimally Universal Parity Quantum Computing
• Electron cloud design for Rydberg multi-qubit gates
• Four-body coupler for superconducting qubits based on Josephson parametric oscillators
• Spin Model for Quantum Annealing with Kerr Parametric Oscillators