A SWAP-free Framework for QAOA
Thiago Assis, Pedro Baptista, Laila Lopes, Diego Ferreira, Gabriel Coutinho

TL;DR
This paper introduces a SWAP-free QAOA framework that modifies the cost Hamiltonian to be hardware-compatible, reducing noise and circuit depth on sparse NISQ devices, with theoretical guarantees and heuristic solutions.
Contribution
It proposes a novel hardware-aware QAOA approach using MISDP formulation, with theoretical analysis and heuristics for practical implementation.
Findings
Competitive performance on index tracking optimization.
Hardware-aware approximation can outperform transpiled Hamiltonians.
The MISDP decision problem is NP-complete, with theoretical bounds.
Abstract
The performance of the Quantum Approximate Optimization Algorithm (QAOA) on noisy intermediate-scale quantum (NISQ) devices is strongly limited by sparse qubit connectivity. When interactions required by QAOA Hamiltonians are not aligned to the hardware topology, transpilation introduces SWAP gates, increasing circuit depth and noise. We propose a SWAP-free QAOA framework based on modifying the cost Hamiltonian so that it can be implemented natively on the hardware. We formulate this as a mixed-integer semidefinite program (MISDP) that selects a hardware-compatible approximation of the original cost matrix and optimizes the allocation of logical variables to physical qubits. We prove that the associated decision problem is NP-complete and derive theoretical guarantees relating the MISDP objective to the loss in the original optimization problem through the Lov\'asz number of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
