BURY heuristic partitions graph states across QPUs by minimizing maximum matching sizes between partitions, requiring fewer Bell pairs than standard k-partition methods and lowering cut-rank.
Cuomo, et al., ACM Transactions on Quantum Computing 4, 1--25 (2023)
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3years
2026 3representative citing papers
A time-aware beam search partitions quantum circuits across QPUs with quadratic scaling in qubits and lower communication overhead than static baselines.
Emulation of ring, star, and line topologies for quantum data centers on a quantum computer shows the star layout yields the best cost-fidelity trade-off under transduction and fiber noise.
citing papers explorer
-
Quantum Hamlets: Distributed Compilation of Large Algorithmic Graph States
BURY heuristic partitions graph states across QPUs by minimizing maximum matching sizes between partitions, requiring fewer Bell pairs than standard k-partition methods and lowering cut-rank.
-
Efficient Time-Aware Partitioning of Quantum Circuits for Distributed Quantum Computing
A time-aware beam search partitions quantum circuits across QPUs with quadratic scaling in qubits and lower communication overhead than static baselines.
-
Emulation of Optically Interconnected Quantum Data Centers Topologies for Cost-Fidelity Benchmarking
Emulation of ring, star, and line topologies for quantum data centers on a quantum computer shows the star layout yields the best cost-fidelity trade-off under transduction and fiber noise.