arXiv:2610.04393
Structural Conditions for Distributed Quantum Advantage
Sabina Drăgoi, María Gragera Garcés, Lirandë Pira
Abstract
Circuit cutting runs a quantum computation on processors smaller than the circuit, at the price of classical knitting whose cost grows exponentially with the number of cut gates. Keeping this cost affordable is necessary but not sufficient for an advantage, since knitting classically easy subcircuits is itself classically easy. We formulate three requirements for distributed quantum advantage under a stated budget: affordable knitting, classical difficulty that survives the cut, and, for variational circuits, resolvable gradients. We prove that under stated assumptions knitting stays affordable when subcircuits grow behind a bounded interface and becomes exponentially expensive when fixed-width subcircuits multiply. We turn the requirements into screening criteria and apply them to eighteen circuit families. We identify finite local-depth circuits with bounded interfaces as a setting in which the requirements can coexist, with hardness established only in the worst case. As a classically verifiable proof of principle, we knit one gate joining two field-perturbed toric-code patches on an IBM Nighthawk processor for up to 142 spins, and confirm that the reconstruction can at least resolve the contact correlation beyond independent execution for up to 98 qubits.
AI Summary
The paper asks when circuit cutting could support distributed quantum advantage, rather than merely extend executable circuit width. It organizes assessment around affordable quasiprobability reconstruction, classical difficulty of the resulting branch tasks, and—for variational circuits—resolvable gradients, and screens eighteen circuit families. For cuts severing $O(\log n)$ gates with bounded-size decompositions, it proves that uniformly efficient classical simulation of all branch tasks implies efficient simulation of bounded-support output observables. Standard cutting constructions have constant or polynomial overhead behind bounded or logarithmic interfaces; connected networks of fixed-width processors instead incur exponential overhead under stated gate-angle assumptions. Using pure-state entanglement robustness, it obtains the exact state-level coefficient norm $\Gamma_{\rm sep}=2\,2^{S_{1/2}}-1$, a lower bound for exact local reconstruction. Finite-local-depth circuits with bounded interfaces can combine affordable cutting, initialization-dependent gradient guarantees, and worst-case-hard branch tasks, but natural hard instances remain unidentified. A hardware benchmark reconstructs one entangling gate between field-perturbed toric-code patches. Its knitting norm is $1+2|\sin\phi|\le3$, independent of patch size. IBM measurements reach 142 spins; connected contact correlations remain distinguishable from zero through 98 spins, recovering about 87% of the target at eight spins and 20% at 80–98 spins. The experiment demonstrates neither quantum advantage nor scalable ground-state optimization. Larger hardware instances use analytically known zero-field angles with Clifford cutting branches. Gradient evidence for the benchmark is numerical at small sizes; its classical hardness remains open. Entanglement-based exclusions concern exact state reconstruction, not arbitrary estimators of individual observables, and device noise progressively suppresses the reconstructed signals.
Error found: The hardware section's maximum of 142 total spins is incompatible with its stated maximum of 6×6 plaquettes per patch and 85 qubits per subcircuit: those dimensions imply 168 total spins, whereas 142 spins corresponds to 5×6 patches and 72-qubit subcircuits including ancillas.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 14 pages of main text + 25 pages of appendices; 18 figures, 7 tables