Benchmarking Quantum Annealing Against “Hard” Instances of the Bipartite Matching Problem

This paper experimentally investigates the behavior of analog quantum computers as commercialized by D-Wave when confronted to instances of the maximum cardinality matching problem which is specifically designed to be hard to solve by means of simulated annealing. We benchmark a D-Wave “Washington”...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	SN computer science 2021-04, Vol.2 (2), p.106, Article 106
Hauptverfasser:	Vert, Daniel, Sirdey, Renaud, Louise, Stéphane
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Analog computers Commercialization Computer Imaging Computer Science Computer Systems Organization and Communication Networks Computers Data Structures and Information Theory Information Systems and Communication Service Matching Optimization Original Research Other Pattern Recognition and Graphics Polynomials Quantum computers Quantum computing Quantum Computing: Circuits Systems Automation and Applications Qubits (quantum computing) Simulated annealing Software Engineering/Programming and Operating Systems Topology Vision
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!