End-to-End Fidelity Analysis of Quantum Circuit Optimization: From Gate-Level Transformations to Pulse-Level Control

• URL: http://arxiv.org/abs/2601.20871v1
• Date: Sat, 17 Jan 2026 18:15:20 GMT
• Title: End-to-End Fidelity Analysis of Quantum Circuit Optimization: From Gate-Level Transformations to Pulse-Level Control
• Authors: Rylan Malarchick,
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a comprehensive analysis of quantum circuit fidelity across the full compilation stack, from high-level gate optimization through pulse-level control. Using a modular integration framework connecting a C++ circuit optimizer with Lindblad-based pulse simulation, we systematically evaluate the fidelity impact of four optimization passes: gate cancellation, commutation, rotation merging, and identity elimination, on IQM Garnet hardware parameters. Our simulation campaign spanning 371 circuit runs reveals that gate cancellation provides the most significant improvement (68\% of circuits improved, 14,024 gates eliminated), while pulse duration exhibits the strongest negative correlation with process fidelity ($r = -0.74$, $R^2 = 0.55$). We validate these findings through hardware execution on the IQM Resonance Garnet 20-qubit processor, demonstrating 70\% gate reduction on QFT circuits with 100\% job success rate (8 executions). Our open-source framework enables reproducible benchmarking of quantum compilation pipelines.

Related papers

• QASMTrans: An End-to-End QASM Compilation Framework with Pulse Generation for Near-Term Quantum Devices [14.084463309646113]
  QASMTrans is a lightweight, high-performance, C++-based quantum compiler.<n>It is designed for just-in-time (JIT) deployment on QPU testbeds with tightly integrated FPGAs or CPUs.
  arXiv  Detail & Related papers  (2026-02-05T00:16: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)
• ConQuER: Modular Architectures for Control and Bias Mitigation in IQP Quantum Generative Models [40.972673943861075]
  Quantum generative models based on instantaneous quantum (IQP) circuits show great promise in learning complex distributions.<n>Current implementations suffer from lack of controllability over generated outputs and severe generation bias towards certain expected patterns.<n>We present a Controllable Quantum Generative Framework, ConQuER, which addresses both challenges through a modular circuit architecture.
  arXiv  Detail & Related papers  (2025-09-26T16:32:41Z)
• Evolutionary-Based Circuit Optimization for Distributed Quantum Computing [3.5852827516109564]
  We evaluate an evolutionary algorithm (EA) to optimize a given circuit in such a way that it reduces the required communication.<n>We show that it is able to reduce the required global gates by more than 89% while still achieving high fidelity.
  arXiv  Detail & Related papers  (2025-09-09T18:23:26Z)
• 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)
• Optimization and Synthesis of Quantum Circuits with Global Gates [41.99844472131922]
  We use global interactions, such as the Global Molmer-Sorensen gate present in ion trap hardware, to optimize and synthesize quantum circuits.<n>The algorithm is based on the ZX-calculus and uses a specialized circuit extraction routine that groups entangling gates into Global MolmerSorensen gates.<n>We benchmark the algorithm in a variety of circuits, and show how it improves their performance under state-of-the-art hardware considerations.
  arXiv  Detail & Related papers  (2025-07-28T10:25:31Z)
• 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)
• Design and execution of quantum circuits using tens of superconducting qubits and thousands of gates for dense Ising optimization problems [12.220619768140903]
  We develop a hardware-efficient ansatz for variational optimization, derived from existing ansatze in the literature, that parametrizes subsets of all interactions in the Cost Hamiltonian in each layer. We report performance significantly better than using a random guess oracle for circuits involving up to approx 5000 two-qubit and approx 5000 one-qubit native gates.
  arXiv  Detail & Related papers  (2023-08-18T02:36:38Z)
• Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits [36.30869856057226]
  We demonstrate any arbitrary qubit and qutrit gate can be realized with high-fidelity, which can significantly reduce the length of a gate sequence. We show that optimal control gates are robust to drift for at least three hours and that the same calibration parameters can be used for all implemented gates.
  arXiv  Detail & Related papers  (2023-03-07T22:15:43Z)
• 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)
• Machine Learning Optimization of Quantum Circuit Layouts [63.55764634492974]
  We introduce a quantum circuit mapping, QXX, and its machine learning version, QXX-MLP. The latter infers automatically the optimal QXX parameter values such that the layed out circuit has a reduced depth. We present empiric evidence for the feasibility of learning the layout method using approximation.
  arXiv  Detail & Related papers  (2020-07-29T05:26:19Z)
• 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.