We present a routing-aware pruning strategy for quantum circuits that selectively removes parametric two-qubit gates whose computational contribution is outweighed by the fidelity cost of their execution, and assess it across both Noisy Intermediate-Scale Quantum (NISQ) and fault-tolerant quantum computing (FTQC) architectures. Each two-qubit gate of a circuit is evaluated by comparing an architecture-independent lower bound on the fidelity cost of omitting the gate against a hardware-specific model for the routing execution cost in each setting. We additionally provide an analytical characterization of the pruning boundary as a function of rotation angle, qubit distance, and hardware noise. Simulations on benchmark circuits demonstrate gate count reductions of up to 48.6% and fidelity improvements of up to 47.7% in the NISQ regime, while a feasibility analysis on FT hardware indicates that pruning is expected to remain relevant across a range of code distances and physical error rates. These results establish routing-aware pruning as a practical and unified compilation strategy across the quantum computing stack.
AI Summary
The paper asks when omitting a small-angle two-qubit gate is preferable to executing it with noisy routing overhead. It extends an existing NISQ routing-aware pruning method to fault-tolerant lattice-surgery architectures. The decision rule compares the omission-fidelity bound $F\geq\cos^2(\theta/2)$ with a hardware-dependent execution-fidelity estimate, pruning when the latter is smaller.
For NISQ devices, execution cost is estimated from depolarizing noise accumulated through SWAP routing, using current qubit positions during compilation. Analytical threshold curves relate pruning to rotation angle, routing distance, and gate noise. Density-matrix simulations of 4–14-qubit benchmark circuits on grid topologies report two-qubit gate-count reductions up to 48.6% and fidelity improvements up to 47.7%. QFT and amplitude-estimation benchmarks improve across tested sizes, whereas a 10-qubit QAOA instance loses fidelity; this is attributed to the fixed $1.25\times$ routing-overhead approximation.
For fault tolerance, execution fidelity is approximated as $1-\mathrm{LER}$ for two lattice-surgery CNOTs. Stim/PyMatching simulations use code distances $3,5,7,9,11$, physical error rates $10^{-3},5\times10^{-4},10^{-4}$, and up to $10^9$ shots per point. Threshold crossings identify potential pruning regimes, which narrow as noise decreases or code distance increases.
The NISQ noise parameters are chosen to produce representative baseline fidelities rather than model a specific device. The fault-tolerant study is a feasibility analysis, not an end-to-end circuit demonstration; it omits single-qubit rotation synthesis and magic-state costs, so the two-CNOT error estimate understates total execution cost.
Little sign of AI-generated textIncrementalStrong assumptionsMissing comparisonOverclaims
Central claim may not hold: The omission theorem lower-bounds retained fidelity and therefore upper-bounds omission infidelity, contrary to the paper's description of a lower bound on omission cost.
The NISQ routing-cost expression squares the standard two-qubit depolarizing pure-state fidelity without deriving an applicable multi-channel interpretation, making its quantitative pruning thresholds insufficiently justified.
The stated per-qubit SWAP count assigns routing overhead even to adjacent qubits under ordinary graph distance.
Comparing a local omission-fidelity bound with routing-cost proxies does not establish improved final circuit fidelity, and the reported QAOA degradation demonstrates that the heuristic can fail.
The FT evidence establishes only proxy-based pruning thresholds, not a validated fidelity improvement for full FT circuits, because logical failure probability is not generally state infidelity and no end-to-end application is demonstrated.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
We present a routing-aware pruning strategy for quantum circuits that selectively removes parametric two-qubit gates whose computational contribution is outweighed by the fidelity cost of their execution, and assess it across both Noisy Intermediate-Scale Quantum (NISQ) and fault-tolerant quantum computing (FTQC) architectures. Each two-qubit gate of a circuit is evaluated by comparing an architecture-independent lower bound on the fidelity cost of omitting the gate against a hardware-specific model for the routing execution cost in each setting. We additionally provide an analytical characterization of the pruning boundary as a function of rotation angle, qubit distance, and hardware noise. Simulations on benchmark circuits demonstrate gate count reductions of up to 48.6% and fidelity improvements of up to 47.7% in the NISQ regime, while a feasibility analysis on FT hardware indicates that pruning is expected to remain relevant across a range of code distances and physical error rates. These results establish routing-aware pruning as a practical and unified compilation strategy across the quantum computing stack.
The paper asks when omitting a small-angle two-qubit gate is preferable to executing it with noisy routing overhead. It extends an existing NISQ routing-aware pruning method to fault-tolerant lattice-surgery architectures. The decision rule compares the omission-fidelity bound F≥cos2(θ/2) with a hardware-dependent execution-fidelity estimate, pruning when the latter is smaller.
For NISQ devices, execution cost is estimated from depolarizing noise accumulated through SWAP routing, using current qubit positions during compilation. Analytical threshold curves relate pruning to rotation angle, routing distance, and gate noise. Density-matrix simulations of 4–14-qubit benchmark circuits on grid topologies report two-qubit gate-count reductions up to 48.6% and fidelity improvements up to 47.7%. QFT and amplitude-estimation benchmarks improve across tested sizes, whereas a 10-qubit QAOA instance loses fidelity; this is attributed to the fixed 1.25× routing-overhead approximation.
For fault tolerance, execution fidelity is approximated as 1−LER for two lattice-surgery CNOTs. Stim/PyMatching simulations use code distances 3,5,7,9,11, physical error rates 10−3,5×10−4,10−4, and up to 109 shots per point. Threshold crossings identify potential pruning regimes, which narrow as noise decreases or code distance increases.
The NISQ noise parameters are chosen to produce representative baseline fidelities rather than model a specific device. The fault-tolerant study is a feasibility analysis, not an end-to-end circuit demonstration; it omits single-qubit rotation synthesis and magic-state costs, so the two-CNOT error estimate understates total execution cost.
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.
Noisy Intermediate-Scale Quantum (NISQ) machines are not fault-tolerant, operate few qubits (currently, less than hundred), but are capable of executing interesting computations. Above the quantum supremacy threshold (approx. 60 qubits), NISQ machines are expected to be more powerful than existing classical computers. One of the most stringent problems is that computations (expressed as quantum circuits) have to be adapted (compiled) to the NISQ hardware, because the hardware does not support arbitrary interactions between the qubits. This procedure introduces additional gates (e.g. SWAP gates) into the circuits while leaving the implemented computations unchanged. Each additional gate increases the failure rate of the adapted (compiled) circuits, because the hardware and the circuits are not fault-tolerant. It is reasonable to expect that the placement influences the number of additionally introduced gates. Therefore, a combinatorial problem arises: how are circuit qubits allocated (placed) initially to the hardware qubits? The novelty of this work relies on the methodology used to investigate the influence of the initial placement. To this end, we introduce a novel heuristic and cost model to estimate the number of gates necessary to adapt a circuit to a given NISQ architecture. We implement the heuristic (source code available on github) and benchmark it using a standard compiler (e.g. from IBM Qiskit) treated as a black box. Preliminary results indicate that cost reductions of up to 10\% can be achieved for practical circuit instances on realistic NISQ architectures only by placing qubits differently than default (trivial placement).
Quantum computing is entering a transitional regime between noisy intermediate-scale quantum (NISQ) processing and early fault-tolerant quantum computation (FTQC), in which increasingly capable hardware is beginning to support repeated syndrome measurements, partial error correction, and logical-qubit operations, while residual physical and logical errors remain non-negligible. In this regime, error suppression, error mitigation, and quantum error correction are increasingly better viewed as complementary layers of a unified error-reduction strategy rather than as separate approaches, with each acting at a different stage of the quantum computation to improve simulation reliability. Thus, in this review, we provide a practical and forward-looking overview of the principal hardware error sources and the corresponding error suppression and mitigation methods for reducing their impact across the current NISQ-FTQC transition. We discuss hardware-aware circuit design, coherent-error suppression, readout mitigation, noise extrapolation, classical inference, and software-supported workflows, with particular emphasis on their implementation on actual quantum processors. We further examine how error mitigation techniques can be adapted to encoded and logical-qubit settings so that they can operate alongside quantum error correction to suppress residual logical errors and improve the accuracy of computation in the early fault-tolerant regime.
The rapid advancement of Noisy Intermediate-Scale Quantum (NISQ) devices has driven the need for efficient design automation tools that can translate complex engineering models into executable quantum circuits. This study explores the development of automated quantum circuit design frameworks focused on gate optimization and noise-aware compilation, enabling practical quantum computation for engineering applications such as optimization, simulation, and control systems. Traditional circuit design methods often fail to account for hardware constraints, decoherence, and gate infidelity, which significantly affect computational accuracy on NISQ devices. To address these challenges, this research introduces a hybrid automation approach combining quantum transpilation, variational circuit pruning, and error-aware synthesis algorithms to enhance circuit reliability and scalability. The framework integrates quantum-classical co-design principles to optimize both logical and physical circuit layers, leveraging hardware-specific calibration data to adapt compilation strategies dynamically. Through simulations and benchmark analysis, the proposed system demonstrates significant improvements in quantum resource utilization, error mitigation, and gate depth reduction compared to conventional compilation methods. This work underscores the growing importance of design automation in quantum engineering, where algorithmic efficiency must be harmonized with physical constraints to realize functional and scalable quantum workflows. By establishing a methodology for gate-level optimization and noise-adaptive design, the study contributes to bridging the gap between theoretical quantum algorithms and real-world engineering implementations within the NISQ computing era.
Noisy Intermediate-Scale Quantum (NISQ) devices are promising platforms for practical quantum computing, but their performance is significantly affected by limited qubit availability, gate errors, decoherence, circuit depth, and hardware-dependent noise. Conventional quantum circuits are generally designed and optimized before execution and may not respond effectively to changing hardware conditions during computation. This research proposes a Self-Adaptive Quantum Circuit framework that dynamically modifies quantum circuits according to the current computational resources and noise characteristics of NISQ devices. The proposed framework monitors parameters such as qubit fidelity, gate error rates, circuit depth, execution time, and resource availability, and automatically selects suitable circuit configurations to improve computational performance. Adaptive mechanisms can be employed to reduce unnecessary gates, optimize qubit utilization, and mitigate the impact of hardware noise while maintaining the required computational accuracy. The framework will be evaluated using simulation platforms and available NISQ quantum hardware, comparing adaptive circuits with conventional static circuits using metrics such as accuracy, fidelity, circuit depth, gate count, execution time, and error rate. The expected outcome is a resource-efficient and noise-aware quantum circuit optimization approach capable of improving the reliability and performance of quantum applications on near-term quantum hardware. The proposed research aims to contribute toward more practical, flexible, and hardware-aware quantum computing systems for NISQ-era applications. Keywords: NISQ Computing, Self-Adaptive Quantum Circuits, Quantum Circuit Optimization, Quantum Error Mitigation, Quantum Noise, Quantum Computing.
Noisy Intermediate-Scale Quantum (NISQ) computers impose severe architectural constraints that prevent direct execution of logical quantum circuits. As a result, quantum circuit mapping—transforming ideal circuits into hardware-compatible forms—has become a critical task in quantum software toolchains. This paper presents a comparative study of key mapping techniques, focusing on circuit depth, SWAP gate overhead, and fidelity awareness. Through a case analysis on a 5-qubit Quantum Fourier Transform (QFT) circuit, we demonstrate the performance trade-offs of several prominent mapping strategies, including naive greedy routing, Qiskit’s SABRE, and CQC’s t|ket>. Our findings reveal that mapping technique selection has a profound impact on circuit quality and feasibility on real NISQ hardware.