Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation

• URL: http://arxiv.org/abs/2601.13322v1
• Date: Mon, 19 Jan 2026 19:02:56 GMT
• Title: Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation
• Authors: Pau Escofet, Santiago Rodrigo, Rohit Sarma Sarkar, Carmen G. Almudéver, Eduard Alarcón, Sergi Abadal,
• Abstract summary: 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.
• Score: 1.7023697455258093
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This work presents a routing-aware pruning strategy for quantum circuits executed on Noisy Intermediate-Scale Quantum (NISQ) devices. We propose a method to remove parametric controlled rotations whose small rotation angles do not justify the routing overhead required for their implementation. By selectively pruning such gates, the method mitigates fidelity loss arising from additional SWAP operations introduced during compilation. Our approach evaluates whether executing a gate leads to greater fidelity loss than omitting it. Simulations on benchmark circuits with realistic noise models show that the method reduces two-qubit gate counts (up to 48.6%) while improving final state fidelity (up to 47.7%), especially for larger circuits where routing costs dominate.

Related papers

• End-to-End Fidelity Analysis of Quantum Circuit Optimization: From Gate-Level Transformations to Pulse-Level Control [0.0]
  We present a comprehensive analysis of quantum circuit fidelity across the full compilation stack.<n>We evaluate the fidelity impact of four optimization passes: gate cancellation, commutation, rotation, and identity elimination.<n>We validate these findings through hardware execution on the IQM Garnet 20-qubit processor.
  arXiv  Detail & Related papers  (2026-01-17T18:15:20Z)
• Accelerating Transpilation in Quantum Machine Learning with Haiqu's Rivet-transpiler [45.88028371034407]
  We develop the Rivet transpiler, which accelerates transpilation by reusing previously transpiled circuits.<n>We demonstrate up to 600% improvement in transpilation time for quantum layerwise learning.
  arXiv  Detail & Related papers  (2025-08-29T06:00:29Z)
• Quantum Circuit Optimization Based on Dynamic Grouping and ZX-Calculus for Reducing 2-Qubit Gate Count [9.400669963756508]
  Two-qubit gates in quantum circuits are more susceptible to noise than single-qubit gates.<n>This paper proposes a quantum circuit optimization approach based on dynamic grouping and ZX-calculus.
  arXiv  Detail & Related papers  (2025-07-19T02:05:32Z)
• Optimizing QAOA circuit transpilation with parity twine and SWAP network encodings [0.3495246564946556]
  This work introduces a method that reduces the two-qubit gate count and depth needed to represent fully connected circuits.<n>For a 120-qubit QAOA instance with 25% connectivity, our method achieves an 85% reduction in depth and a 28% reduction in two-qubit gates.
  arXiv  Detail & Related papers  (2025-05-23T14:20:40Z)
• Optimizing Quantum Circuits via ZX Diagrams using Reinforcement Learning and Graph Neural Networks [38.499527873574436]
  We introduce a framework based on ZX calculus, graph-neural networks and reinforcement learning for quantum circuit optimization.<n>By combining reinforcement learning and tree search, our method addresses the challenge of selecting optimal sequences of ZX calculus rewrite rules.<n>We demonstrate our method's competetiveness with state-of-the-art circuit generalizations and capabilities on large sets of diverse random circuits.
  arXiv  Detail & Related papers  (2025-04-04T13:19:08Z)
• Realizing a Continuous Set of Two-Qubit Gates Parameterized by an Idle Time [34.99747682571461]
  Continuous gate sets are a key ingredient for near-term quantum algorithms.<n>We demonstrate a hardware-efficient, continuous set of controlled arbitrary-phase gates acting on transmon qubits.<n>This native gate set has the potential to reduce the depth and improve the performance of near-term quantum algorithms.
  arXiv  Detail & Related papers  (2025-03-14T08:49:47Z)
• Improving and benchmarking NISQ qubit routers [0.0]
  We benchmark various routing techniques considering random quantum circuits on one-dimensional and square lattice connectivities.<n>We introduce circuit fidelity as a comprehensive metric that captures the effects of SWAP and circuit depth overheads.
  arXiv  Detail & Related papers  (2025-02-06T09:31:51Z)
• A multiple-circuit approach to quantum resource reduction with application to the quantum lattice Boltzmann method [39.671915199737846]
  We introduce a multiple-circuit algorithm for a quantum lattice Boltzmann method (QLBM) solve of the incompressible Navier--Stokes equations.<n>The presented method is validated and demonstrated for 2D lid-driven cavity flow.
  arXiv  Detail & Related papers  (2024-01-20T15:32:01Z)
• 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 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)
• Optimized fermionic SWAP networks with equivalent circuit averaging for QAOA [2.3362993651992863]
  We optimize the execution of fermionic SWAP networks for Quantum Approximate Optimization Algorithm (QAOA) We introduce Equivalent Circuit Averaging, which randomizes over degrees of freedom in the quantum circuit compilation. We observe a 60% average reduction in error (total variation distance) for QAOA of depth p = 1 on four transmon qubits on a superconducting quantum processor.
  arXiv  Detail & Related papers  (2021-11-08T15:32:05Z)
• Accurate methods for the analysis of strong-drive effects in parametric gates [94.70553167084388]
  We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach. We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
  arXiv  Detail & Related papers  (2021-07-06T02:02:54Z)
• Using Reinforcement Learning to Perform Qubit Routing in Quantum Compilers [0.0]
  We propose a qubit routing procedure that uses a modified version of the deep Q-learning paradigm. The system is able to outperform the qubit routing procedures from two of the most advanced quantum compilers currently available.
  arXiv  Detail & Related papers  (2020-07-31T10:57:24Z)
• 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.