Enhancing Quantum Optimization with Parity Network Synthesis

2024/02/16 by Colin Campbell, Campbell, Colin, Edward D Dahl +1
Computer Science · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Physics (quant-ph)

paper · pdf · doi:10.48550/arxiv.2402.11099

openalex publication_date 2024/02/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper examines QAOA in the context of parity network synthesis. We propose a pair of algorithms for parity network synthesis and linear circuit inversion. Together, these algorithms can build the diagonal component of the QAOA circuit, generally the most expensive in terms of two qubit gates. We compare the CNOT count of our strategy to off-the-shelf compiler tools for random, full, and graph-based optimization problems and find that ours outperforms the alternatives.

Related

• Performance of Parity QAOA for the Signed Max-Cut Problem
• Connectivity-aware Synthesis of Quantum Algorithms
• Low-depth Circuit Implementation of Parity Constraints for Quantum Optimization
• Optimizing QAOA circuit transpilation with parity twine and SWAP network encodings
• A Structured Method for Compilation of QAOA Circuits in Quantum Computing