APA (7th ed.) Citation

Bae, E., & Lee, S. (2024). Recursive QAOA outperforms the original QAOA for the MAX-CUT problem on complete graphs. Quantum information processing, 23(3), . https://doi.org/10.1007/s11128-024-04286-0

Chicago Style (17th ed.) Citation

Bae, Eunok, and Soojoon Lee. "Recursive QAOA Outperforms the Original QAOA for the MAX-CUT Problem on Complete Graphs." Quantum Information Processing 23, no. 3 (2024). https://doi.org/10.1007/s11128-024-04286-0.

MLA (9th ed.) Citation

Bae, Eunok, and Soojoon Lee. "Recursive QAOA Outperforms the Original QAOA for the MAX-CUT Problem on Complete Graphs." Quantum Information Processing, vol. 23, no. 3, 2024, https://doi.org/10.1007/s11128-024-04286-0.