Comparative study on the variations of quantum approximate optimization algorithms to the Traveling Salesman Problem-Reference-Cited by-同舟云学术

Comparative study on the variations of quantum approximate optimization algorithms to the Traveling Salesman Problem

Published:2023-05 Issue: Volume: Page:
ISSN:
Container-title:2023 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)
language:
Short-container-title:

Author:

Qian Wenyang¹,Basili Robert²,Eshaghian-Wilner Mary³,Khokhar Ashfaq⁴,Luecke Glenn³,Vary James P.⁵

Affiliation:

1. Universidade de Santiago de Compostela,Instituto Galego de Fisica de Altas Enerxias (IGFAE),Galicia,Spain,E-15782

2. Iowa State University,Department of Mathematics Department of Physics and Astronomy,Ames,Iowa,USA

3. Iowa State University,Department of Mathematics,Ames,Iowa,USA

4. Iowa State University,Department of Electrical and Computer Engineering,Ames,Iowa,USA

5. Iowa State University,Department of Physics and Astronomy,Ames,Iowa,USA

Publisher

IEEE

Link

Reference46 articles.

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Quantum Computing Odyssey: Teleporting to the Realm of Unparalleled Possibilities;2024 International Conference on Advances in Data Engineering and Intelligent Computing Systems (ADICS);2024-04-18