PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
March 26, 2026Russian Microelectronics

Solving the Traveling Salesman Problem Using Quantum Devices: QUBO and HOBO Formulations

View Full Paper
Ask AI
Bookmark
Share

Authors

GSG. V. ShuvalovEKE. N. KrivtsovaMRM. A. Remnev

Discussion

Loading...

Member takes

Overview

Research reveals practical methods to solve the traveling salesman problem using QUBO and HOBO formulations, suggesting improved computational efficiency.

Key Points

  • This research aims to explore and compare QUBO and HOBO formulations for solving the traveling salesman problem (TSP) using quantum devices.
  • Investigated the quadratic unconstrained binary optimization (QUBO) formulation.
  • Examined the higher-order binary optimization (HOBO) formulation.
  • Utilized variational quantum eigensolver (VQE) and quantum approximate optimization algorithm (QAOA) methods.
  • Found that QUBO formulation requires a quadratic number of qubits.
  • Determined that HOBO formulation needs significantly fewer qubits but includes higher-order terms.
  • Provided a detailed comparison of QUBO and HOBO formulations, outlining their practical applications.

Cite This Study

Shuvalov et al. (2025) studied this question.

synapsesocial.com/papers/69c4cc37fdc3bde4489177f1https://doi.org/10.1134/s1063739725601882
View Full Paper
Ask AI
Bookmark
Share