Recursive QAOA outperforms the original QAOA for the MAX-CUT problem on complete graphs

Eunok Bae, Soojoon Lee. Recursive QAOA outperforms the original QAOA for the MAX-CUT problem on complete graphs. Quantum Information Processing, 23(3):78, March 2024. [doi]

@article{BaeL24,
  title = {Recursive QAOA outperforms the original QAOA for the MAX-CUT problem on complete graphs},
  author = {Eunok Bae and Soojoon Lee},
  year = {2024},
  month = {March},
  doi = {10.1007/s11128-024-04286-0},
  url = {https://doi.org/10.1007/s11128-024-04286-0},
  researchr = {https://researchr.org/publication/BaeL24},
  cites = {0},
  citedby = {0},
  journal = {Quantum Information Processing},
  volume = {23},
  number = {3},
  pages = {78},
}