A weak-coupling approximation reduces classical overhead in quantum circuit knitting to polynomial cost when one qubit couples weakly to others, shown on QAOA-style layered circuits.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
An algorithm is presented for estimating distribution complexity of electronic structure Hamiltonians, with O(N^3) entanglement estimation per fragment and quadratic/exponential reductions in distribution cost for quantum and classical interconnects.
Applies partitioned iterative quantum scheduling and distributed quantum methods to satellite tasking for wildfire response on real datasets, validating the framework but finding no significant advantage due to small problem sizes.
citing papers explorer
-
Scalable quantum circuit knitting using a weak-coupling approximation
A weak-coupling approximation reduces classical overhead in quantum circuit knitting to polynomial cost when one qubit couples weakly to others, shown on QAOA-style layered circuits.
-
Distribution Complexity of Electronic Structure Simulations on Quantum Supercomputers
An algorithm is presented for estimating distribution complexity of electronic structure Hamiltonians, with O(N^3) entanglement estimation per fragment and quadratic/exponential reductions in distribution cost for quantum and classical interconnects.
-
Partitioned Iterative Quantum Scheduling of Satellites for Urgent Disaster Response: Case study of Wildfire
Applies partitioned iterative quantum scheduling and distributed quantum methods to satellite tasking for wildfire response on real datasets, validating the framework but finding no significant advantage due to small problem sizes.