Parity Quantum Optimization: Encoding Constraints
arXiv:2105.06235 · doi:10.22331/q-2023-03-17-951
Abstract
Constraints make hard optimization problems even harder to solve on quantum devices because they are implemented with large energy penalties and additional qubit overhead. The parity mapping, which has been introduced as an alternative to the spin encoding, translates the problem to a representation using only parity variables that encodes products of spin variables. In combining exchange interaction and single spin flip terms in the parity representation, constraints on sums and products of arbitrary k-body terms can be implemented without additional overhead in two-dimensional quantum systems.
References in corpus (15)
- 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
- Probing many-body dynamics on a 51-atom quantum simulator
- QuTiP 2: A Python framework for the dynamics of open quantum systems
- Demonstration of multi-qubit entanglement and algorithms on a programmable neutral atom quantum computer
- Quantum computing with neutral atoms
- Quantum Optimization of Maximum Independent Set using Rydberg Atom Arrays
- A four-qubit germanium quantum processor
- Quantum walks on a programmable two-dimensional 62-qubit superconducting processor
- Divide and concur: A general approach to constraint satisfaction
- Two-Dimensional Arrays of RF Ion Traps with Addressable Interactions
- Single-electron spin resonance in a nanoelectronic device using a global field
- Quantum optimization via four-body Rydberg gates
- Demonstration of tunable three-body interactions between superconducting qubits
Cited by in corpus (11)
- Quantum Annealing for Industry Applications: Introduction and Review
- Quantum computing for finance
- Encoding-Independent Optimization Problem Formulation for Quantum Computing
- Optimal, hardware native decomposition of parameterized multi-qubit Pauli gates
- Parity Quantum Computing as YZ-Plane Measurement-Based Quantum Computing
- Constructive plaquette compilation for the parity architecture
- Quantum optimization with linear Ising penalty functions for customer data science
- Flexible constraint compilation in the parity architecture
- Minimally Universal Parity Quantum Computing
- Four-body coupler for superconducting qubits based on Josephson parametric oscillators
- Spin Model for Quantum Annealing with Kerr Parametric Oscillators