Symmetry-Preserving Hierarchical Quantum Approximate Optimization Algorithm with Subproblems Beyond the Qubit Limit

@misc{song2026symmetrypreserving,
  title = {{Symmetry-Preserving Hierarchical Quantum Approximate Optimization Algorithm with Subproblems Beyond the Qubit Limit}},
  author = {Zhaoyang Song and Wei Zhang and Ji Cao and Xuexi Yi and Hong-Fu Wang},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.38344},
  eprint = {2610.38344},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.38344},
}

TY  - UNPB
TI  - Symmetry-Preserving Hierarchical Quantum Approximate Optimization Algorithm with Subproblems Beyond the Qubit Limit
AU  - Zhaoyang Song
AU  - Wei Zhang
AU  - Ji Cao
AU  - Xuexi Yi
AU  - Hong-Fu Wang
PY  - 2026
DA  - 2026/10/28
PB  - arXiv
DO  - 10.48550/arxiv.2610.38344
UR  - https://arxiv.org/abs/2610.38344
AB  - The quantum approximate optimization algorithm (QAOA) is a paradigmatic variational quantum algorithm for combinatorial optimization problems, yet on current quantum devices the available qubit count and achievable circuit depth remain the main bottlenecks to its practical application. Divide-and-merge reduces the number of variables encoded in a single quantum circuit, while contraction based on coarse graining extends the effective range of shallow circuits, but existing work has not addressed both challenges simultaneously. We propose symmetry-preserving hierarchical QAOA (SP-HQAOA), in which parity sector contraction preserves the zero-field Ising structure of the effective objective at every contraction step, thereby addressing both within a single algorithm. We further prove that this reduction is the unique one with this property. Successive contractions further decouple the maximum leaf block size B from the qubit limit Q per quantum call, so every quantum circuit uses at most Q qubits even when B>Q. We also establish a deterministic repair-risk bound on the possible loss in optimal value caused by each sector restriction, and the resulting bounds can be summed across contraction steps and levels of the recursive hierarchy. With depth p=1, SP-HQAOA attains 99.4% to 99.7% of the exact optimum on N=40 random regular MaxCut leaf blocks and, with at most $10$ qubits per circuit, 96% of the classical reference for N=500. SP-HQAOA demonstrates the capacity to use shallow quantum circuits to address combinatorial optimization problems whose variable count far exceeds the qubit limit of a single quantum call, and may enable practical quantum optimization advantages in the near term.
ER  -