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 (27)

• Quantum Computing in the NISQ era and beyond
• Many-Body Physics with Ultracold Gases
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• A variational eigenvalue solver on a quantum processor
• Quantum information with Rydberg atoms
• Ising formulations of many NP problems
• Quantum Annealing in the Transverse Ising Model
• Noisy intermediate-scale quantum (NISQ) algorithms
• Adiabatic Quantum Computing
• Fermionic quantum computation
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
• The Bravyi-Kitaev transformation for quantum computation of electronic structure
• Quantum computing with neutral atoms
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• Quantum Annealing Applied to De-Conflicting Optimal Trajectories for Air Traffic Management
• Benchmarking the Quantum Approximate Optimization Algorithm
• Parameter Concentration in Quantum Approximate Optimization
• MAXCUT QAOA performance guarantees for p >1
• Phase Gadget Synthesis for Shallow Circuits
• Forecasting financial crashes with quantum computing
• Characterizing local noise in QAOA circuits
• Quantum optimization via four-body Rydberg gates
• Modular Parity Quantum Approximate Optimization
• Architecture-Aware Synthesis of Phase Polynomials for NISQ Devices
• Towards Prediction of Financial Crashes with a D-Wave Quantum Computer

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