Benchmarking advantage and D-wave 2000Q quantum annealers with exact cover problems
From MaRDI portal
Publication:2107098
DOI10.1007/S11128-022-03476-YOpenAlexW3158081750MaRDI QIDQ2107098FDOQ2107098
Authors: Dennis Willsch, Madita Willsch, Carlos D. Gonzalez Calaza, Fengping Jin, Hans De Raedt, Marika Svensson, 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
Recommendations
- Quantum annealing versus digital computing. An experimental comparison
- Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling
- Garden optimization problems for benchmarking quantum annealers
- Benchmarking the quantum approximate optimization algorithm
- Quantum Annealing with Anneal Path Control: Application to 2-SAT Problems with Known Energy Landscapes
Cites Work
- Reducibility among combinatorial problems
- A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
- Branch-and-price: Column generation for solving huge integer programs
- Title not available (Why is that?)
- Quantum computation and quantum information. 10th anniversary edition
- Title not available (Why is that?)
- A Primer in Column Generation
- Staff scheduling and rostering: a review of applications, methods and models.
- Quantum stochastic optimization
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Garden optimization problems for benchmarking quantum annealers
- Benchmarking the quantum approximate optimization algorithm
- Support vector machines on the D-wave quantum annealer
Cited In (12)
- Statistical quality assessment of Ising-based annealer outputs
- Performance of two different quantum annealing correction codes
- String Model Building on Quantum Annealers
- Inter-generational comparison of quantum annealers in solving hard scheduling problems
- Garden optimization problems for benchmarking quantum annealers
- Implementation and analysis of quantum-classical hybrid interactive image segmentation algorithm based on quantum annealer
- Quantum Annealing with Anneal Path Control: Application to 2-SAT Problems with Known Energy Landscapes
- Quantum annealing versus digital computing. An experimental comparison
- A case study in programming a quantum annealer for hard operational planning problems
- Quantum annealing to solve the unrelated parallel machine scheduling problem
- A quantum annealing-sequential quadratic programming assisted finite element simulation for non-linear and history-dependent mechanical problems
- Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling
Uses Software
This page was built for publication: Benchmarking advantage and D-wave 2000Q quantum annealers with exact cover problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107098)
