Conference paper
Quantum Relaxation for Solving Multiple Knapsack Problems
Monit Sharma, Yan Jin, et al.
QCE 2024
Quantum computing is advancing rapidly, and quantum optimization is a promising area of application. Quantum optimization algorithms — whether provably exact, provably approximate or heuristic — offer opportunities to demonstrate quantum advantage. Systematic benchmarking is crucial to guide research, track progress and further advance understanding of quantum optimization. Theoretical research and empirical research using real hardware can complement each other, in the move towards demonstrating quantum advantage.
Monit Sharma, Yan Jin, et al.
QCE 2024
Federico Balduini, Alan Molinari, et al.
CMD 2023
Sebastian Brandhofer, Ilia Polian, et al.
IEEE TQE
Iskandar Sitdikov, Jennifer Glick, et al.
APS March Meeting 2023