Acampora Giovanni, Schiattarella Roberto, Troiano Alfredo
Department of Physics "Ettore Pancini", University of Naples Federico II, Complesso di Monte Sant'Angelo, Via Cintia 21, Napoli 80126, Italy.
Istituto Nazionale di Fisica Nucleare, Sezione di Napoli, Napoli 80126, Italy.
Data Brief. 2021 Oct 29;39:107526. doi: 10.1016/j.dib.2021.107526. eCollection 2021 Dec.
Quantum computing is rapidly establishing itself as a new computing paradigm capable of obtaining advantages over its classical counterpart. However, a major limitation in the design of a quantum algorithm is related to the proper mapping of the corresponding circuit to a specific quantum processor so that the underlying physical constraints are satisfied. Moreover, current deterministic mapping algorithms suffer from high run times as the number of qubits to map increases. To bridge the gap in view of the next generation of quantum computers composed of thousands of qubits, this data paper proposes the first datasets that help address the quantum circuit mapping problem as a classification task. Each dataset is composed of random quantum circuits mapped onto a specific IBM quantum processor. In detail, each dataset instance contains some features related to the calibration data of the physical device and others related to the generated quantum circuit. Finally, the instance is labeled with a vector encoding the best mapping among those provided by deterministic mapping algorithms. Considering this, the proposed datasets allow the development of machine learning models capable of achieving mapping similar to those achieved with deterministic algorithms, but in a significantly shorter time.
量子计算正迅速确立自身作为一种新的计算范式,能够比其经典对应物获得优势。然而,量子算法设计中的一个主要限制与将相应电路正确映射到特定量子处理器有关,以便满足潜在的物理约束。此外,随着要映射的量子比特数增加,当前的确定性映射算法运行时间很长。为了弥合由数千个量子比特组成的下一代量子计算机方面的差距,本文提出了首个数据集,将量子电路映射问题作为分类任务来帮助解决。每个数据集由映射到特定IBM量子处理器上的随机量子电路组成。详细地说,每个数据集实例包含一些与物理设备校准数据相关的特征以及其他与生成的量子电路相关的特征。最后,该实例用一个向量标记,该向量编码确定性映射算法提供的最佳映射。考虑到这一点,所提出的数据集允许开发机器学习模型,这些模型能够实现与确定性算法相似的映射,但时间要短得多。