Pith. sign in

REVIEW 3 cited by

Improving and benchmarking NISQ qubit routers

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2502.03908 v1 pith:U6SKDQ3U submitted 2025-02-06 quant-ph

classification quant-ph
keywords circuitqubitroutingdepthfidelitygatemethodsnisq
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Quantum computers with a limited qubit connectivity require inserting SWAP gates for qubit routing, which increases gate execution errors and the impact of environmental noise due to an overhead in circuit depth. In this work, we benchmark various routing techniques considering random quantum circuits on one-dimensional and square lattice connectivities, employing both analytical and numerical methods. We introduce circuit fidelity as a comprehensive metric that captures the effects of SWAP and circuit depth overheads. Leveraging a novel approach based on the SABRE algorithm, we achieve up to $84\%$ higher average circuit fidelity for large devices within the NISQ range, compared to previously existing methods. Additionally, our results highlight that the optimal routing choice critically depends on the qubit count and the hardware characteristics, including gate fidelities and coherence times.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Graph Reinforcement Learning for Calibration-Aware Quantum Circuit Routing

    quant-ph 2026-06 conditional novelty 6.0 of 10

    A calibration-aware graph RL router achieves pooled mean fidelity of 0.727 on nine MQT Bench circuits across three IBM calibration snapshots, outperforming SABRE-best20 (0.440) and target-aware SABRE (0.481).

  2. Position: Quantum Program Generation Must Prioritize Validity Over Probabilistic Scaling

    cs.LG 2026-07 conditional novelty 5.0 of 10

    The paper argues that probabilistic scaling alone cannot fix the validity gap in quantum circuit generation, so quantum code assistants must build verification into generation rather than filter outputs after the fact.

  3. A Cost-Effective Quantum Boolean-Phase SWAP Gate with Only Two CNOT Gates

    quant-ph 2025-07 reject novelty 3.0 of 10

    A two-CNOT swap-like gate is introduced whose transpiled version has lower gate count and depth than the standard three-CNOT SWAP, at the cost of user-selected phase distortions.

Pith tools