Papers › A fidelity-driven approach to quantum circuit partitioning via weighted hypergraphs...
A fidelity-driven approach to quantum circuit partitioning via weighted hypergraphs for noise-resilient computation
Awad Wehbe, Safiya Al Khatib, AbdelMehsen Ahmad
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
Effective circuit partitioning is critical for Noisy Intermediate-Scale Quantum (NISQ) devices, which are hampered by high error rates and limited qubit connectivity. Standard partitioning heuristics often neglect gate-specific error impacts, leading to suboptimal divisions with significant communication overhead and reduced fidelity. This paper introduces Fidelipart, a novel framework that transforms quantum circuits into a fidelity-aware hypergraph. In this model, gate error rates and structural dependencies inform the weights of nodes (gates) and hyperedges (representing multi-qubit interactions and qubit timelines), guiding an Mt-KaHyPar partitioner to minimize cuts through error-prone operations. We evaluated Fidelipart against BQSKit's QuickPartitioner on 6-qubit/22-gate, 10-qubit/55-gate, and 24-qubit/88-gate benchmarks under a linear topology with a consistent local contiguous re-mapping strategy. Results demonstrate Fidelipart's superior performance. It achieved SWAP gate reductions ranging from 77.3% to 100% and up to a 52.2% decrease in cut qubits. These physical improvements directly translated to estimated fidelity gains ranging from 27.3% to over 250%. While Fidelipart showed a modest runtime increase of 8-13% and variable effects on maximum partition depth, its substantial enhancement of circuit fidelity highlights the significant benefits of integrating detailed error-awareness into the partitioning process for more reliable NISQ computations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections