<p>Simulated Bifurcation (SB) algorithms, inspired by quantum annealing, can efficiently solve large-scale combinatorial optimization problems on classical hardware, often outperforming traditional approaches such as simulated annealing. However, their tendency to be trapped in local optima limits global solution quality. In this work, we introduce Tabu-Enhanced Simulated Bifurcation (TESB), an improved SB variant that incorporates a Tabu Search-inspired mechanism. By leveraging a dynamic penalty guided by early search history, TESB can naturally avoid revisiting suboptimal regions. On Max-Cut benchmarks, TESB achieves up to a three-order-of-magnitude reduction in Time-to-Solution compared to standard SB. When applied to particle track reconstruction in high-energy physics, TESB identifies lower-energy configurations on problems exceeding 100,000 spin variables, demonstrating enhanced scalability and performance across a wide range of combinatorial tasks.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Tabu-Enhanced Simulated Bifurcation for combinatorial optimization

  • Xian-Zhe Tao,
  • Qing-Guo Zeng,
  • Zu-Jia Huang,
  • Bo-Wei Zuo,
  • Yong-Qing Liu,
  • Jiapei Zhuang,
  • Hideki Okawa,
  • Man-Hong Yung

摘要

Simulated Bifurcation (SB) algorithms, inspired by quantum annealing, can efficiently solve large-scale combinatorial optimization problems on classical hardware, often outperforming traditional approaches such as simulated annealing. However, their tendency to be trapped in local optima limits global solution quality. In this work, we introduce Tabu-Enhanced Simulated Bifurcation (TESB), an improved SB variant that incorporates a Tabu Search-inspired mechanism. By leveraging a dynamic penalty guided by early search history, TESB can naturally avoid revisiting suboptimal regions. On Max-Cut benchmarks, TESB achieves up to a three-order-of-magnitude reduction in Time-to-Solution compared to standard SB. When applied to particle track reconstruction in high-energy physics, TESB identifies lower-energy configurations on problems exceeding 100,000 spin variables, demonstrating enhanced scalability and performance across a wide range of combinatorial tasks.