Parity Quantum Optimization: Benchmarks

Abstract

We present benchmarks of the parity transformation for the Quantum Approximate Optimization Algorithm (QAOA). We analyse the gate resources required to implement a single QAOA cycle for real-world scenarios. In particular, we consider random spin models with higher order terms, as well as the problems of predicting financial crashes and finding the ground states of electronic structure Hamiltonians. For the spin models studied our findings imply a significant advantage of the parity mapping compared to the standard gate model. In combination with full parallelizability of gates this has the potential to boost the race for demonstrating quantum advantage.

References in corpus (9)

• Many-Body Physics with Ultracold Gases
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum computing with neutral atoms
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• Parameter Concentration in Quantum Approximate Optimization
• MAXCUT QAOA performance guarantees for p >1
• Quantum optimization via four-body Rydberg gates
• Modular Parity Quantum Approximate Optimization

Cited by in corpus (7)

• Encoding-Independent Optimization Problem Formulation for Quantum Computing
• Parity Quantum Computing as YZ-Plane Measurement-Based Quantum Computing
• Flexible constraint compilation in the parity architecture
• Constant Depth Code Deformations 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