Efficient Gate Reordering for Distributed Quantum Compiling in Data Centers
The method uses gate reordering and packet merging to reduce entanglement resources needed when distributing large quantum circuits across multiple quantum processors. A greedy algorithm is developed to minimize distribution cost by maximizing gate packet size while maintaining circuit equivalence. This strategy significantly lowers the number of EPR pairs consumed for random circuits, showing a crucial role for reordering in distributed compilation.