Cargando…
Revisiting Old Combinatorial Beasts in the Quantum Age: Quantum Annealing Versus Maximal Matching
This paper experimentally investigates the behavior of analog quantum computers such as commercialized by D-Wave when confronted to instances of the maximum cardinality matching problem specifically designed to be hard to solve by means of simulated annealing. We benchmark a D-Wave “Washington” (2X)...
Autores principales: | Vert, Daniel, Sirdey, Renaud, Louise, Stéphane |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
2020
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7304699/ http://dx.doi.org/10.1007/978-3-030-50433-5_37 |
Ejemplares similares
-
Efficient combinatorial optimization by quantum-inspired parallel annealing in analogue memristor crossbar
por: Jiang, Mingrui, et al.
Publicado: (2023) -
Quantum Annealing Boosts Prediction of Multimolecular
Adsorption on Solid Surfaces Avoiding Combinatorial Explosion
por: Sampei, Hiroshi, et al.
Publicado: (2023) -
Parallel quantum annealing
por: Pelofske, Elijah, et al.
Publicado: (2022) -
Superconducting quantum circuit of NOR in quantum annealing
por: Saida, Daisuke, et al.
Publicado: (2022) -
Beauty versus the beast
por: Caldwell, Clare Elizabeth
Publicado: (2013)