QAOA with $N\cdot p\ge 200$

Abstract

One of the central goals of the DARPA Optimization with Noisy Intermediate-Scale Quantum (ONISQ) program is to implement a hybrid quantum/classical optimization algorithm with high $N\cdot p$, where $N$ is the number of qubits and $p$ is the number of alternating applications of parameterized quantum operators in the protocol. In this note, we demonstrate the execution of the Quantum Approximate Optimization Algorithm (QAOA) applied to the MaxCut problem on non-planar 3-regular graphs with $N\cdot p$ of up to $320$ on the Quantinuum H1-1 and H2 trapped-ion quantum processors. To the best of our knowledge, this is the highest $N\cdot p$ demonstrated on hardware to date. Our demonstration highlights the rapid progress of quantum hardware.

arXiv commentExperiments on H2 processor with $N\cdot p=320$ added in v2

References in corpus (8)

• A Quantum Approximate Optimization Algorithm
• Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• Constrained Quantum Optimization for Extractive Summarization on a Trapped-ion Quantum Computer
• Benchmarking quantum co-processors in an application-centric, hardware-agnostic and scalable way
• QAOAKit: A Toolkit for Reproducible Study, Application, and Verification of the QAOA
• Mixer-Phaser Ansätze for Quantum Optimization with Hard Constraints

Cited by in corpus (6)

• Scaling Whole-Chip QAOA for Higher-Order Ising Spin Glass Models on Heavy-Hex Graphs
• Performance of Quantum Approximate Optimization with Quantum Error Detection
• Parameter Setting Heuristics Make the Quantum Approximate Optimization Algorithm Suitable for the Early Fault-Tolerant Era
• Exponential Qubit Reduction in Optimization for Financial Transaction Settlement
• Optimization via Quantum Preconditioning
• Classical optimization with imaginary time block encoding on quantum computers: The MaxCut problem