Compiling Together: High-Throughput Distributed Quantum Computing via Multi-Compilation
This work forms the joint selection of compilations and allocation of shots under per-link Bell-pair capacities as Candidate-Constrained Max-Shot Allocation (CMA), proves it NP-hard, and solves it with a dynamic program and its approximate variant AppDP, a compact MILP, and a greedy heuristic Effi.