On the limitations of the chimera graph topology in using analog quantum computers - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2019

On the limitations of the chimera graph topology in using analog quantum computers

Résumé

This paper investigates the possibility of using an analog quantum computer as commercialized by D-Wave to solve large QUBO problems by means of a single invocation of the quantum annealer. Indeed this machine solves a spin glass problem with programmable coefficients but subject to quite strong topology restrictions on the set of non-zero coefficients. Rather than mapping problem variables onto multiple qbits, an approach which requires many invocations of the annealer to solve small size problems, it is tempting to investigate the existence of sparse relaxations compliant with the qbits interconnection topology of the machine, hence solvable in one invocation of the annealing oracle, but still providing good-quality solutions to the original problem. This paper provides an experimental setup which aims to determine whether or not such convenient relaxations do exist or, rather, are easy to find.
Fichier non déposé

Dates et versions

hal-02273072 , version 1 (28-08-2019)

Identifiants

Citer

Daniel Vert, Renaud Sirdey, Stéphane Louise. On the limitations of the chimera graph topology in using analog quantum computers. the 16th ACM International Conference, Apr 2019, Alghero, Italy. pp.226-229, ⟨10.1145/3310273.3322830⟩. ⟨hal-02273072⟩
52 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More