An edge-based and subspace reduction encoding scheme to solve the traveling salesman problem in quantum computers

Documenti analoghi

• A note on Majorana representation of quantum states
  di: Li, Chi-Kwong, et al.
  Pubblicazione: (2023)
• A scalable quantum-enhanced greedy algorithm for maximum independent set problems
  di: Wybo, Elisabeth, et al.
  Pubblicazione: (2026)
• Resource-efficient variational quantum solver for the travelling salesman problem and its silicon photonics implementation
  di: Baldazzi, Alessio, et al.
  Pubblicazione: (2025)
• Comparison of encoding schemes for quantum computing of $S > 1/2$ spin chains
  di: Lötstedt, Erik, et al.
  Pubblicazione: (2025)
• On the generalized eigenvalue problem in subspace-based excited state methods for quantum computers
  di: Kwao, Prince Frederick, et al.
  Pubblicazione: (2025)