EUVIMEDEUVIMED entdecken
Crossref

Penalty-enhanced quantum approximate optimization algorithm framework for maximization and minimization problems

Hao Zhong, Qi Zhang

Theoretical Computer Science · 2026-01 · 1061 · 115649

DOI: 10.1016/j.tcs.2025.115649 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Theoretical Computer Science, 2026-01. Verfasst von Hao Zhong und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 40 Literaturangaben. Gefördert von: National Key Research and Development Program of China.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Kein Abstract verfügbar.

Förderung

  • National Key Research and Development Program of China

Zitieren

APA

Zhong, H., & Zhang, Q. (2026). Penalty-enhanced quantum approximate optimization algorithm framework for maximization and minimization problems. Theoretical Computer Science, 1061, 115649. https://doi.org/10.1016/j.tcs.2025.115649

Vancouver

Zhong H, Zhang Q. Penalty-enhanced quantum approximate optimization algorithm framework for maximization and minimization problems. Theoretical Computer Science. 2026;1061:115649. doi:10.1016/j.tcs.2025.115649

BibTeX
@article{Zhong2026,
  author = {Zhong, Hao and Zhang, Qi},
  title = {Penalty-enhanced quantum approximate optimization algorithm framework for maximization and minimization problems},
  journal = {Theoretical Computer Science},
  year = {2026},
  volume = {1061},
  pages = {115649},
  doi = {10.1016/j.tcs.2025.115649}
}
Kostenlos starten →