A fidelity-driven approach to quantum circuit partitioning via weighted hypergraphs for noise-resilient computation

• URL: http://arxiv.org/abs/2506.06867v2
• Date: Tue, 10 Jun 2025 16:17:11 GMT
• Title: A fidelity-driven approach to quantum circuit partitioning via weighted hypergraphs for noise-resilient computation
• Abstract summary: This paper introduces Fidelipart, a novel framework that transforms quantum circuits into a fidelity-aware hypergraph.<n>We evaluate Fidelipart against BQSKit's QuickPartitioner on 6-qubit/22-gate, 10-qubit/55-gate, and 24-qubit/88-gate benchmarks.<n>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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Hardware-aware Low-latency Quantum Compilation with Data-driven Lightweight Error Detection for Early Fault-Tolerant Systems [0.0]
  We present an integrated hardware-aware compilation and data-driven quantum error-detection framework.<n>We show that joint co-design raises algorithmic success probability by up to 68 percent (95 percent CI: 60 percent to 76 percent) over SABRE on an 8-qubit VQE instance with post-selection.
  arXiv  Detail & Related papers  (2026-06-04T04:30:28Z)
• Fidelity-Aware Frequency Allocation and Transpilation Co-Design for Tunable Coupler Quantum Systems [1.8770722854730313]
  We show how frequency crowding impacts gate fidelity as module size and connectivity scale.<n>We develop a noise-aware transpilation approach called FINESSE, which minimizes error by selecting high-fidelity paths that satisfy connectivity via SWAP insertion.<n>On SNAIL architectures, FINESSE achieves an average 8.9% reduction in log-infidelity cost and 6.8% reduction in circuit depth vs. SABRE.
  arXiv  Detail & Related papers  (2026-05-20T19:13:50Z)
• High-fidelity entangling gates and nonlocal circuits with neutral atoms [29.44867320543274]
  Two-qubit entangling gates constitute a dominant error source, limiting circuit depths and performance in fault-tolerant architectures.<n>We realize entangling CZ gates with a high Rabi frequency smooth-amplitude pulse, employing state-selective readout and qubit reuse for fast calibration.<n>We then use these low-error gates in quantum circuits with coherent atom rearrangement.
  arXiv  Detail & Related papers  (2026-04-28T18:00:00Z)
• Scalable Multi-Task Low-Rank Model Adaptation [43.22544779625565]
  Scaling multi-task low-rank adaptation (LoRA) to a large number of tasks induces catastrophic performance degradation.<n>We find that existing solutions, like regularization and dynamic routing, fail at scale because they are constrained by a fundamental trade-off.<n>We propose mtLoRA, a scalable solution with three novel designs.
  arXiv  Detail & Related papers  (2026-03-02T06:57:11Z)
• BPDQ: Bit-Plane Decomposition Quantization on a Variable Grid for Large Language Models [56.504879072674015]
  We propose Bit-Plane Decomposition Quantization (BPDQ), which constructs a variable quantization grid via bit-planes and scalar coefficients.<n>BPDQ enables serving Qwen2.5-72B on a single GTX 3090 with 83.85% GSM8K accuracy (vs. 90.83% at 16-bit)
  arXiv  Detail & Related papers  (2026-02-04T02:54:37Z)
• Echo Cross Resonance gate error budgeting on a superconducting quantum processor [0.0]
  We present an error budgeting procedure for the native two-qubit operation on a 32-qubit superconducting-qubit-based quantum computer.<n>An average reduction of 3.7x in error rate for two qubit operations is shown across a chain of 16 qubits.<n>The largest improvements are seen on previously under-performing qubit pairs.
  arXiv  Detail & Related papers  (2026-01-28T10:31:35Z)
• Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation [1.7023697455258093]
  This work presents a routing-aware pruning strategy for quantum circuits executed on Noisy Intermediate-Scale Quantum (NISQ) devices.<n>We propose a method to remove parametric controlled rotations whose small rotation angles do not justify the routing overhead required for their implementation.<n>By selectively pruning such gates, the method mitigates fidelity loss arising from additional SWAP operations introduced during compilation.
  arXiv  Detail & Related papers  (2026-01-19T19:02:56Z)
• Noise-Adaptive Quantum Circuit Mapping for Multi-Chip NISQ Systems via Deep Reinforcement Learning [0.0]
  We present DeepQMap, a deep reinforcement learning framework that integrates a bidirectional Long Short-Term Memory based Dynamic Noise Adaptation network.<n>Our method continuously adapts to hardware dynamics through learned temporal representations of quantum system behavior.<n>DeepQMap achieves mean circuit fidelity of $0.920 pm 0.023$, representing a statistically significant 49.3% improvement over state-of-the-art QUBO methods.
  arXiv  Detail & Related papers  (2025-11-22T14:27:55Z)
• Practical Fidelity Limits of Toffoli Gates in Superconducting Quantum Processors [0.0]
  High-fidelity multi-qubit gates are a critical resource for near-term quantum computing.<n>We present a hardware-aware characterization of the Toffoli gate on IBM's 127-qubit superconducting quantum processors.
  arXiv  Detail & Related papers  (2025-09-05T12:58:13Z)
• Above 99.9% Fidelity Single-Qubit Gates, Two-Qubit Gates, and Readout in a Single Superconducting Quantum Device [58.154405222706146]
  tuning of qubit-coupler coupling strengths in a superconducting circuit with two transmon qubits coupled via a tunable coupler enables high-fidelity single- and two-qubit gates.<n>We achieve a 40h-averaged CZ gate fidelity of 99.93%, simultaneous single-qubit gate fidelities of 99.98%, and readout fidelities over 99.94% in a single device.
  arXiv  Detail & Related papers  (2025-08-22T14:49:47Z)
• Calibrating quantum gates up to 52 qubits in a superconducting processor [16.83020919407806]
  We benchmark gate fidelities up to 52 qubits using character-average benchmarking protocol.<n>We enhance the fidelity of a 6-qubit parallel CZ gate from 87.65% to 92.04% and decrease the gate correlation from 3.53% to 3.22%.
  arXiv  Detail & Related papers  (2025-05-28T14:17:00Z)
• Spatial and temporal circuit cutting with hypergraphic partitioning [0.0]
  This paper presents a hypergraph-based circuit cutting methodology suitable for both spatial and temporal scenarios.<n>By modeling quantum circuits as high-level hypergraphs, we apply partitionings such as Stoer-Wagner, Fiduccia-Mattheyses, and Kernighan-Lin.
  arXiv  Detail & Related papers  (2025-04-12T20:31:07Z)
• SPARQ: Efficient Entanglement Distribution and Routing in Space-Air-Ground Quantum Networks [50.91365514137301]
  Space-air-ground quantum (SPARQ) network is developed as a means for providing a seamless on-demand entanglement distribution. Deep reinforcement learning framework is proposed and trained using deep Q-network (DQN) on multiple graphs of SPARQ. Third-party entanglement distribution policy is proposed to establish entanglement between communication parties.
  arXiv  Detail & Related papers  (2024-09-19T16:31:37Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• High-fidelity transmon coupler activated CCZ gate on fluxonium qubits [0.0]
  We propose a novel way to perform a high-fidelity CCZ gate on fluxoniums capacitively connected via a transmon qubit, activated by a microwave pulse on the coupler. We provide numerical simulation of 95-ns long gate of higher than 99.99% fidelity with realistic circuit parameters in the noiseless model and estimate an error of about 0.25% under the conventional decoherence rates.
  arXiv  Detail & Related papers  (2023-08-29T11:36:19Z)
• High-fidelity parallel entangling gates on a neutral atom quantum computer [41.74498230885008]
  We report the realization of two-qubit entangling gates with 99.5% fidelity on up to 60 atoms in parallel. These advances lay the groundwork for large-scale implementation of quantum algorithms, error-corrected circuits, and digital simulations.
  arXiv  Detail & Related papers  (2023-04-11T18:00:04Z)
• Witnessing entanglement in trapped-ion quantum error correction under realistic noise [41.94295877935867]
  Quantum Error Correction (QEC) exploits redundancy by encoding logical information into multiple physical qubits. We present a detailed microscopic error model to estimate the average gate infidelity of two-qubit light-shift gates used in trapped-ion platforms. We then apply this realistic error model to quantify the multipartite entanglement generated by circuits that act as QEC building blocks.
  arXiv  Detail & Related papers  (2022-12-14T20:00:36Z)
• Software mitigation of coherent two-qubit gate errors [55.878249096379804]
  Two-qubit gates are important components of quantum computing. But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications. We present two software methods to mitigate parasitic two-qubit gate errors.
  arXiv  Detail & Related papers  (2021-11-08T17:37:27Z)
• Quantum Circuit Engineering for Correcting Coherent Noise [1.0965065178451106]
  Crosstalk and several sources of operational interference are invisible when qubit or a gate is calibrated or benchmarked in isolation. Unwanted Z-Z coupling on superconducting cross-resonance CNOT gates, is a commonly occurring unitary crosstalk noise. Experiments aggressively deploy forced commutation of CNOT gates to obtain low noise state-preparation circuits.
  arXiv  Detail & Related papers  (2021-09-08T10:33:18Z)
• Improving qubit coherence using closed-loop feedback [42.60602838972598]
  We experimentally employ closed-loop feedback to stabilize the frequency fluctuations of a superconducting transmon qubit. The resulting high-fidelity operation remains effective even away from the qubit flux-noise insensitive point.
  arXiv  Detail & Related papers  (2021-05-03T18:28:06Z)
• High-fidelity, high-scalability two-qubit gate scheme for superconducting qubits [16.01171409402694]
  We experimentally demonstrate a new two-qubit gate scheme that exploits fixed-frequency qubits and a tunable coupler in a superconducting quantum circuit. The scheme requires less control lines, reduces crosstalk effect, simplifies calibration procedures, yet produces a controlled-Z gate in 30ns with a high fidelity of 99.5%. Our demonstration paves the way for large-scale implementation of high-fidelity quantum operations.
  arXiv  Detail & Related papers  (2020-06-21T17:55:28Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.