arXiv:2610.14580
Entanglement-Capability-Aware Finite-Bond Circuit Cutting for Distributed Quantum Computing
Weidong Liu, Qingqing Jiang, Yufu Liu, Ruiqing He, Jiandong Shang, Hengliang Guo, Qiang Chen
Abstract
Distributed quantum computing distributes workloads that exceed a single processor's capacity across resource-constrained components. Circuit cutting enables this decomposition, but its effectiveness depends on partition choice. We present SACE, a Simulation-Aware Circuit Partitioning framework with Entanglement-Capability-Aware Screening. EP-Cost screens partitions using a parameter-dependent entanglement-capability proxy and native implementation cost. Under reconstruction constraints, finite-bond refinement selects the candidate that minimizes the worst-subcircuit discrepancy between normalized MPS simulations at bond dimensions $χ$ and $2χ$. Across 14 exhaustively enumerated small-scale candidate spaces, EP-Cost-guided genetic algorithm selections attain co-optimal native quasiprobability decomposition (QPD) overhead, with a median within-circuit Spearman correlation of 0.9965 between EP-Cost and QPD overhead. At matched cut counts, EP-Cost reduces QPD overhead by $25.20\times$ and $16.89\times$ for 8- and 9-qubit QFT circuits, respectively, and improves sampled reconstruction. On 12-qubit approximate QFT, deterministic reconstruction reduces Pauli-observable mean absolute error in all six low-bond conditions and total-variation distance in five. With five cuts and 7,776 QPD terms, SACE is best on all four reconstruction metrics in four of six conditions. At 24 qubits, SACE improves exact-local QFT accuracy in all 30 instance-bond-dimension conditions against each EP-Cost-only, Kernighan-Lin, and spectral baseline. The 50-qubit QFT comparisons remain favorable as reference convergence improves. Weighted QAOA circuits provide complementary, more bond-sensitive evidence. Refinement benefits persist across three search methods; larger candidate panels improve the optimized proxy without guaranteeing lower exact-local error.
AI Summary
The paper studies circuit-cutting partition selection when both reconstruction overhead and finite-bond classical simulation accuracy matter. It introduces SACE, a two-stage heuristic for capacity-constrained bipartitions. EP-Cost screens boundaries using gate-parameter-dependent squared maximal product-input concurrence and native implementation cost. Among the top candidates (normally 32), SACE minimizes the worst-block infidelity between normalized isolated-subcircuit MPS simulations at bond dimensions $\chi$ and $2\chi$. Optional cut-count, QPD-term-count, and overhead budgets restrict feasibility. Across 14 exhaustively enumerated 8–9-qubit candidate spaces, EP-Cost-guided genetic searches select QPD-overhead-co-optimal partitions; median within-circuit Spearman correlation between EP-Cost and overhead is 0.9965. At matched cut counts, QFT-8 and QFT-9 overhead decreases by factors of 25.20 and 16.89 versus selected graph baselines, with lower sampled reconstruction errors. Complete deterministic QPD reconstruction on one 12-qubit approximate-QFT topology lowers Pauli-observable MAE in all six low-bond conditions and TVD in five. Among three five-cut partitions, each requiring 7,776 QPD terms, SACE is best on all four reconstruction metrics in four conditions. At 24 qubits, exact isolated-subcircuit validation favors SACE over EP-only, Kernighan–Lin, and spectral baselines in all 30 QFT instance–bond conditions; weighted-QAOA results are less uniform. Refinement benefits also occur with simulated annealing and particle-swarm searches. Larger-width results measure local accuracy, not global reconstruction fidelity. At 50 qubits, validation uses finite-resource MPS references, with particularly weak convergence for QAOA. Larger candidate panels do not guarantee lower exact-local error. Physical-QPU noise, communication, scheduling, and hardware-specific cutting costs remain outside scope.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.