Benchmarking advantage and D-wave 2000Q quantum annealers with exact cover problems

DOI10.1007/s11128-022-03476-yOpenAlexW3158081750MaRDI QIDQ2107098

Dennis Willsch, Marika Svensson, Carlos D. Gonzalez Calaza, Fengping Jin, Madita Willsch, Hans De Raedt, Kristel Michielsen

Publication date: 29 November 2022

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

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

zbMATH Keywords

optimization problemsquantum computingbenchmarkingquantum annealing

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (4)

Inter-generational comparison of quantum annealers in solving hard scheduling problems ⋮ Quantum annealing to solve the unrelated parallel machine scheduling problem ⋮ Garden optimization problems for benchmarking quantum annealers ⋮ Statistical quality assessment of Ising-based annealer outputs

Uses Software

• GitHub

Cites Work

• Unnamed Item
• Unnamed Item
• Staff scheduling and rostering: a review of applications, methods and models.
• Quantum stochastic optimization
• Benchmarking the quantum approximate optimization algorithm
• Garden optimization problems for benchmarking quantum annealers
• Support vector machines on the D-wave quantum annealer
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Quantum Computation and Quantum Information
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Reducibility among Combinatorial Problems
• A Primer in Column Generation
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

This page was built for publication: Benchmarking advantage and D-wave 2000Q quantum annealers with exact cover problems