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

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.