The Impact of Qubit Connectivity on Quantum Advantage in Noisy IQP Circuits
Leonardo Placidi, Enrico Rinaldi, Keisuke Fujii, and Chen-Yu Liu

TL;DR
This paper analyzes how qubit connectivity affects the ability of noisy IQP circuits to demonstrate quantum advantage, showing sparse architectures require lower noise levels to maintain quantum supremacy.
Contribution
It introduces a connectivity-aware analysis of IQP circuits, quantifies the impact of architecture on classical simulatability, and provides a framework for experimental assessment.
Findings
Sparse connectivity increases the compiled circuit depth.
Sparse architectures require lower noise levels to maintain quantum advantage.
Connectivity influences the transition point to classical simulability.
Abstract
Instantaneous Quantum Polynomial-time (IQP) circuits are a candidate for demonstrating near-term quantum advantage, as their sampling task is believed to be classically hard in the ideal theoretical setting under standard complexity-theoretic assumptions. In noisy implementations, however, this hardness can disappear once circuit depth exceeds a noise-dependent critical threshold. We show that qubit connectivity is a key parameter in this transition, since sparse architectures require additional routing to implement long-range interactions, thereby increasing compiled circuit depth. To make this explicit, we present a connectivity-aware analysis of compiled IQP circuits. For a fixed abstract IQP instance, different hardware connectivity graphs yield different compiled depths and thus different effective positions relative to the noisy-IQP simulatability boundary. We quantify this…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
