analiza aiqbench
This study uses a wedding seating chart as a real-world benchmark to compare classical Monte Carlo solvers against quantum annealing on the D-Wave Advantage 2 system. The results indicate that for this specific constraint satisfaction problem, classical methods outperformed the quantum hardware in finding optimal arrangements. Researchers have released an open-source plugin and dataset to facilitate further testing of optimization algorithms across diverse real-world scenarios.
Entangled happily ever after: Wedding reception seating mapped to classical and quantum optimizers
arXiv:2604.10497v3 Announce Type: replace-cross Abstract: Although optimization is one of the most promising applications of quantum computers, the development of effective optimization strategies requires real-world test cases. When planning our recent wedding reception, we realized that the problem of optimally seating our guests, given constraints related to guests' relatedness, shared interests, and physical needs, could be mapped to a cost function network (CFN) form solvable with classical or quantum optimization algorithms. We compared the seating optimization performance of classical Monte Carlo CFN solvers in the Masala software suite to that of quantum annealing-based CFN optimization algorithms using one-hot, domain-wall, and approximate binary mappings, which we had developed for protein design problems. Surprisingly, the D-Wave Advantage 2 system, which performs well on similarly-structured CFN problems for protein design, struggled to return optimal seating arrangements that were easily found by classical Monte Carlo methods. We provide our seating optimization benchmark set, and code to convert seating optimization problems to CFN problems, as a plugin library for Masala, permitting this class of real-world problems to be used to benchmark performance of current and future classical CFN solvers, quantum optimization algorithms, and quantum computing hardware.
Abstract:Although optimization is one of the most promising applications of quantum computers, the development of effective optimization strategies requires real-world test cases. When planning our recent wedding reception, we realized that the problem of optimally seating our guests, given constraints related to guests' relatedness, shared interests, and physical needs, could be mapped to a cost function network (CFN) form solvable with classical or quantum optimization algorithms. We compared the seating optimization performance of classical Monte Carlo CFN solvers in the Masala software suite to that of quantum annealing-based CFN optimization algorithms using one-hot, domain-wall, and approximate binary mappings, which we had developed for protein design problems. Surprisingly, the D-Wave Advantage 2 system, which performs well on similarly-structured CFN problems for protein design, struggled to return optimal seating arrangements that were easily found by classical Monte Carlo methods. We provide our seating optimization benchmark set, and code to convert seating optimization problems to CFN problems, as a plugin library for Masala, permitting this class of real-world problems to be used to benchmark performance of current and future classical CFN solvers, quantum optimization algorithms, and quantum computing hardware.
Emerging Technologies (cs.ET); Quantum Physics (quant-ph)
arXiv:2604.10497 [cs.ET]
(or arXiv:2604.10497v3 [cs.ET] for this version)
Text integral sub licența deschisă a publicației · 200 cuvinte
Subiecte conexe
Podcast with Johannes Pollanen, Co-founder of EeroQ and a Professor of Physics at Michigan State University
Quantum Computing Report · 17 oct. 2026
Why I Left Google DeepMind
LessWrong · 15 iul. 2026
News
Quantum Computing Report · 7 iun. 2026
Dharma vs Adharma - The Perplexity of Being Alive
hillpost.in · 25 aug. 2026