Time-Optimal Qubit Mapping and Gate Scheduling Adapted to Neutral Atom Quantum Computing

Citation Author(s):
Yongshang
Li
Submitted by:
ubgo lee
Last updated:
Thu, 06/30/2022 - 09:55
DOI:
10.21227/y7bp-6874
License:
Creative Commons Attribution
106 Views
Categories:
Other
0
0 ratings - Please login to submit your rating.
ACCESS DATASET CITE SHARE/EMBED

Abstract 

We collect 22 large benchmark circuits from RevLib and 34 small circuits from IBM Qiskit Lib and those used by SABRE. We generate the scheduling sequences and physical circuits of the circuits by our Heuristic greedy algorithm and Monte Carlo tree search algorithm. The DataSet consists of the input and output. The formal consists of the 56 circuits and their initial mappings. The latter consists of the scheduling sequences and physical circuits generated by our two algorithms.

Instructions: 

The logical circuits are download from RevLib, Qiskit Lib and those used in SABRE. The output physical circuits are ".qasm" format. Each logical circuit has a corresponding initial mapping file in the "im" directory. A scheduling sequence is a list of <start execution time, duration, qubits>

Dataset Files

LOGIN TO ACCESS DATASET FILES

 

QUESTIONS?