Inter-generational comparison of quantum annealers in solving hard scheduling problems

DOI10.1007/s11128-023-04077-zarXiv2112.00727OpenAlexW3216438875MaRDI QIDQ6048743

A. Yu. Kondratiev, Elena Strbac, Eleanor G. Rieffel, Zoe Gonzalez Izquierdo, Krzysztof Osiewalski, Emmanuel Papathanasiou, Bibek Pokharel, Davide Venturelli, P. Aaron Lott

Publication date: 13 October 2023

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2112.00727

zbMATH Keywords

schedulinggraph coloringquantum annealing

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites Work

• Unnamed Item
• Unnamed Item
• Upper-bounding the \(k\)-colorability threshold by counting covers
• Minor-embedding in adiabatic quantum computation. I: The parameter setting problem
• A case study in programming a quantum annealer for hard operational planning problems
• Benchmarking advantage and D-wave 2000Q quantum annealers with exact cover problems
• Minimizing minor embedding energy: an application in quantum annealing

This page was built for publication: Inter-generational comparison of quantum annealers in solving hard scheduling problems