Shallow IQP circuits and graph generation

We introduce shallow instantaneous quantum polynomial-time (IQP) circuits as generative graph models, using an edge-qubit encoding to map graphs onto quantum states. Focusing on bipartite and Erdős-Rényi distributions, we study their expressivity and robustness through simulations and large-scale experiments. Noiseless simulations of 28 qubits (8-node graphs) reveal that shallow IQP models can learn key structural features, such as the edge density and bipartite partitioning. On IBM's Aachen QPU, we scale experiments from 28 to 153 qubits (8-18 nodes) in order to characterize performance on real quantum hardware. Local statistics, such as the degree distributions, remain accurate across scales with total variation distances ranging from 0.04 to 0.20, while global properties like strict bipartiteness degrade at the largest system sizes (91 and 153 qubits). Notably, spectral bipartivity, a relaxation of strict bipartiteness, remains comparatively robust at higher qubit counts. These results establish practical baselines for the performance of shallow IQP circuits on current quantum hardware and demonstrate that, even without error mitigation, such circuits can learn and reproduce meaningful structural patterns in graph data, guiding future developments in quantum generative modeling for the NISQ era and beyond.