Benchmarking advantage and D-wave 2000Q quantum annealers with exact cover problems
type: Item
instance of: scholarly article
title: Benchmarking advantage and D-wave 2000Q quantum annealers with exact cover problems
author: Dennis Willsch
author: Madita Willsch
author: Carlos D. Gonzalez Calaza
author: Fengping Jin
author: Hans De Raedt
author: Marika Svensson
author: Kristel Michielsen
published in: Quantum Information Processing
publication date: 2022-11-29T00:00:00Z
full work available at URL: https://arxiv.org/abs/2105.02208
Mathematics Subject Classification ID: 81P68
zbMATH DE Number: 7625492
zbMATH Keywords: quantum computing
zbMATH Keywords: quantum annealing
zbMATH Keywords: optimization problems
zbMATH Keywords: benchmarking
MaRDI profile type: Publication
OpenAlex ID: W3158081750
cites work: Quantum stochastic optimization
cites work: Garden optimization problems for benchmarking quantum annealers
cites work: Support vector machines on the D-wave quantum annealer
cites work: Benchmarking the quantum approximate optimization algorithm
cites work: Reducibility among Combinatorial Problems
cites work: A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
cites work: Q3002797
cites work: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
cites work: Staff scheduling and rostering: a review of applications, methods and models.
cites work: Quantum Computation and Quantum Information
cites work: A Primer in Column Generation
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: Q3224554
DOI: 10.1007/S11128-022-03476-Y
describes a project that uses: GitHub
description: scientific article; zbMATH DE number 7625492