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.
Constructing a virtual two-qubit gate by sampling single-qubit operations
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
method 1
citation-polarity summary
years
2026 3verdicts
UNVERDICTED 3roles
method 1polarities
use method 1representative citing papers
Digital Annealer-assisted transpilation reduces CNOT counts by 13.7% on average (up to 57.4%) versus Qiskit on structured circuits, with a full-DA variant outperforming ISAAQ by 23.1%.
DQR enables efficient scheduling and failover for cut quantum circuit fragments across local QPUs and remote simulators on real HPC hardware with low coordination overhead.
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.
-
Digital Annealer-Assisted Accuracy-First Quantum Circuit Transpilation with Integrated QUBO Mapping and Routing
Digital Annealer-assisted transpilation reduces CNOT counts by 13.7% on average (up to 57.4%) versus Qiskit on structured circuits, with a full-DA variant outperforming ISAAQ by 23.1%.
-
Wave-Based Dispatch for Circuit Cutting in Hybrid HPC--Quantum Systems
DQR enables efficient scheduling and failover for cut quantum circuit fragments across local QPUs and remote simulators on real HPC hardware with low coordination overhead.