Compiling Single Round QCCP-X Quantum Circuits by Genetic Algorithm

  1. Lis Arufe
  2. Riccardo Rasconi
  3. Angelo Oddi
  4. Ramiro Varela 1
  5. Miguel Ángel González 1
  1. 1 Universidad de Oviedo
    info

    Universidad de Oviedo

    Oviedo, España

    ROR https://ror.org/006gksa02

Libro:
Bio-inspired Systems and Applications: from Robotics to Ambient Intelligence: 9th International Work-Conference on the Interplay Between Natural and Artificial Computation, IWINAC 2022, Puerto de la Cruz, Tenerife, Spain, May 31 – June 3, 2022, Proceedings, Part II
  1. José Manuel Ferrández Vicente (dir. congr.)
  2. José Ramón Alvarez Sánchez (dir. congr.)
  3. Félix de la Paz López (dir. congr.)
  4. Hojjat Adeli

Editorial: Springer Suiza

ISBN: 978-3-031-06527-9

Año de publicación: 2022

Páginas: 88-97

Tipo: Capítulo de Libro

DIALNET GOOGLE SCHOLAR

Resumen

The circuit model is one of the leading quantum computing architectures. In this model, a quantum algorithm is given by a set of quantum gates that must be distributed on the quantum computer over time, subject to a number of constraints. This process gives rise to the Quantum Circuit Compilation Problem (QCCP), which is in fact a hard scheduling problem. In this paper, we consider a compilation problem derived from the general Quantum Approximation Optimization Algorithm (QAOA) applied to the MaxCut problem and consider Noisy Intermediate Scale Quantum (NISQ) hardware architectures, which was already tackled in some previous studies. Specifically, we consider the problem denoted QCCP-X (QCCP with crosstalk constraints) and explore the use of genetic algorithms to solve it. We performed an experimental study across a conventional set of instances showing that the proposed genetic algorithm, termed GAx outperforms a previous approach.

Fuente de los datos: Dialnet