Intelligent Systems.
Theory and Applications

(Intellektual'nye Sistemy. Teoriya i Prilozheniya)

On solving binary optimization problems using QAOA

Abstract

We consider solving QUBO problems using QAOA with fixed parameters and a circuit number of layers that grows linearly with problem size. Numerical results show that, contrary to expectations, the median number of circuit runs required to obtain a solution with a prescribed approximation ratio does not increase with problem size. The analysis of entanglement reveals an unexpected decrease of its peak value with the number of layers. Guided by this observation, we constructed a fully classical quantum-inspired algorithm without entanglement. On GSet MaxCut benchmarks with up to 20,000 variables, the ratio of the found cut to the best known value exceeds 0.95 in the vast majority of cases.

Keywords: QAOA, QUBO, MaxCut, fixed parameters, entanglement.

BibTeX
@article{IS-Chernyavskiy-Bantysh-Kulikov-Kiktenko2026,
  author  = {Chernyavskiy, Andrey Yurievich and Bantysh, Boris Igorevich and Kulikov, Denis Alexandrovich and Kiktenko, Evgeniy Olegovich},
  title   = {{On solving binary optimization problems using QAOA}},
  journal = {Intelligent Systems. Theory and Applications},
  year    = {2026},
  volume  = {30},
  number  = {4},
  pages   = {298--301},
}
AMSBIB
\Bibitem{IS-Chernyavskiy-Bantysh-Kulikov-Kiktenko2026}
\by A.\,Y.~Chernyavskiy, B.\,I.~Bantysh, D.\,A.~Kulikov, E.\,O.~Kiktenko
\paper On solving binary optimization problems using QAOA
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 298--301
\lang In Russian
Published under Creative Commons Attribution 4.0 International (CC BY 4.0)

← Back to issue

× Issue cover