- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: 10.1007/s11128-021-03226-6
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Universitätsbibliothek der RWTH Aachen
- (wann)
-
2021
- Urheber
- DOI
-
10.18154/RWTH-2021-09173
- URN
-
urn:nbn:de:101:1-2021100606514279390467
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:29 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Gonzalez Calaza, Carlos D.
- Willsch, Dennis
- Michielsen, Kristel Francine
- Universitätsbibliothek der RWTH Aachen
Entstanden
- 2021
Ähnliche Objekte (12)
Garden optimization problems for benchmarking quantum annealers
Benchmarking the quantum approximate optimization algorithm
A benchmarking study of quantum algorithms for combinatorial optimization
Benchmarking quantum annealing with maximum cardinality matching problems
Benchmarking of Optimization Algorithms
Benchmarking evolutionary multiobjective optimization algorithms
Benchmarking gate-based quantum computers
Benchmarking Quantum Annealing Against “Hard” Instances of the Bipartite Matching Problem
Methodische Probleme des Benchmarking: Der Bertelsmann-Benchmarking-Index
Quantum Metropolis Solver: a quantum walks approach to optimization problems
Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
Garden optimization problems for benchmarking quantum annealers
Benchmarking the quantum approximate optimization algorithm
A benchmarking study of quantum algorithms for combinatorial optimization
Benchmarking quantum annealing with maximum cardinality matching problems
Benchmarking of Optimization Algorithms
Benchmarking evolutionary multiobjective optimization algorithms
Benchmarking gate-based quantum computers
Benchmarking Quantum Annealing Against “Hard” Instances of the Bipartite Matching Problem
Methodische Probleme des Benchmarking: Der Bertelsmann-Benchmarking-Index
Quantum Metropolis Solver: a quantum walks approach to optimization problems
Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems
Garden optimization problems for benchmarking quantum annealers
Benchmarking the quantum approximate optimization algorithm
A benchmarking study of quantum algorithms for combinatorial optimization
Benchmarking quantum annealing with maximum cardinality matching problems
Benchmarking of Optimization Algorithms
Benchmarking evolutionary multiobjective optimization algorithms
Benchmarking gate-based quantum computers
Benchmarking Quantum Annealing Against “Hard” Instances of the Bipartite Matching Problem
Methodische Probleme des Benchmarking: Der Bertelsmann-Benchmarking-Index
Quantum Metropolis Solver: a quantum walks approach to optimization problems
Benchmarking Advantage and D-Wave 2000Q quantum annealers with exact cover problems