Variational quantum algorithms for permutation-based combinatorial problems: Optimal ansatz generation with applications to quadratic assignment problems and beyond

Documenti analoghi

• A rounding and clustering-based exact algorithm for the p-center problem
  di: Ales, Zacharie, et al.
  Pubblicazione: (2024)
• Sampled-Based Guided Quantum Walk: Non-variational quantum algorithm for combinatorial optimization
  di: Nzongani, Ugo, et al.
  Pubblicazione: (2025)
• An introduction to variational quantum algorithms for combinatorial optimization problems
  di: Grange, Camille, et al.
  Pubblicazione: (2022)
• Qudit-based scalable quantum algorithm for solving the integer programming problem
  di: Goswami, Kapil, et al.
  Pubblicazione: (2025)
• A quadratic Grassmann manifold optimization problem arising from quantum embedding methods
  di: Ayral, Thomas, et al.
  Pubblicazione: (2026)