Benchmarking advantage and D-wave 2000Q quantum annealers with exact cover problems
From MaRDI portal
Publication:2107098
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
- A Primer in Column Generation
- A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
- Benchmarking the quantum approximate optimization algorithm
- Branch-and-price: Column generation for solving huge integer programs
- Garden optimization problems for benchmarking quantum annealers
- scientific article; zbMATH DE number 5899272 (Why is no real title available?)
- scientific article; zbMATH DE number 6020480 (Why is no real title available?)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Quantum computation and quantum information. 10th anniversary edition
- Quantum stochastic optimization
- Reducibility among combinatorial problems
- Staff scheduling and rostering: a review of applications, methods and models.
- Support vector machines on the D-wave quantum annealer
Cited in
(16)- A case study in programming a quantum annealer for hard operational planning problems
- Statistical quality assessment of Ising-based annealer outputs
- Performance of two different quantum annealing correction codes
- Garden optimization problems for benchmarking quantum annealers
- Quantum annealing versus digital computing. An experimental comparison
- Quantum Annealing with Anneal Path Control: Application to 2-SAT Problems with Known Energy Landscapes
- Inter-generational comparison of quantum annealers in solving hard scheduling problems
- Quantum annealing to solve the unrelated parallel machine scheduling problem
- String Model Building on Quantum Annealers
- A quantum annealing-sequential quadratic programming assisted finite element simulation for non-linear and history-dependent mechanical problems
- Implementation and analysis of quantum-classical hybrid interactive image segmentation algorithm based on quantum annealer
- Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling
- Quantum annealing with chaotic driver Hamiltonians
- Quantum circuit optimization via graph partitioning by quantum annealing
- Calculating Nash equilibrium on quantum annealers
- Steiner traveling salesman problem with time windows and pickup-delivery: integrating classical and quantum optimization
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)
