REVIEW 21 cited by
LightSABRE: A Lightweight and Enhanced SABRE Algorithm
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
LightSABRE: A Lightweight and Enhanced SABRE Algorithm
read the original abstract
We introduce LightSABRE, a significant enhancement of the SABRE algorithm that advances both runtime efficiency and circuit quality. LightSABRE addresses the increasing demands of modern quantum hardware, which can now accommodate complex scenarios, and circuits with millions of gates. Through iterative development within Qiskit, primarily using the Rust programming language, we have achieved a version of the algorithm in Qiskit 1.2.0 that is approximately 200 times faster than the implementation in Qiskit 0.20.1, which already introduced key improvements like the release valve mechanism. Additionally, when compared to the SABRE algorithm presented in Li et al., LightSABRE delivers an average decrease of 18.9\% in SWAP gate count across the same benchmark circuits. Unlike SABRE, which struggles with scalability and convergence on large circuits, LightSABRE delivers consistently high-quality routing solutions, enabling the efficient execution of large quantum circuits on near-term and future quantum devices. LightSABRE's improvements in speed, scalability, and quality position it as a critical tool for optimizing quantum circuits in the context of evolving quantum hardware and error correction techniques.
Forward citations
Cited by 21 Pith papers
-
Comparing and learning figures of merit for quantum circuit compilation
A weighted probability of successful trials (wPST) figure of merit, predicted quickly by an XGBoost model, correlates over 50% better with true execution quality than standard circuit metrics.
-
A Neutral-Atom Quantum Compiler with Application-Specific Layout and Hub-Assisted Shuttling
A compiler for neutral-atom NISQ devices introduces hub traps and shuttling rules to compile circuits that SWAP-only methods cannot handle in practical time, eliminating SWAP gates and improving a fidelity proxy on ro...
-
QAP-Router: Tackling Qubit Routing as Dynamic Quadratic Assignment with Reinforcement Learning
QAP-Router models qubit routing as dynamic QAP and applies RL with a solution-aware Transformer to cut CNOT counts by 12-30% versus industry compilers on real circuit benchmarks.
-
Comparing and learning figures of merit for quantum circuit compilation
ML models that fuse circuit structure with device coherence data predict weighted PST far more accurately than classical gate-count FoMs, enabling better circuit selection inside compilers.
-
Harvest: Resource-Aware Quantum Compilation for Magic State Protocols
Harvest co-optimizes placement, routing, scheduling, and magic-state supply for lattice-surgery quantum programs, reporting up to 17.8x speedup over sequential execution and reclaiming up to 72% of unused magic-state patches.
-
Quantum Approximate Optimization via Noise-Directed Adaptive Warm-Starting
Bitflip-gauge warm-start QAOA that aligns the ansatz with amplitude-damping noise improves 100-qubit Ising approximation ratios over non-gauge iterative warm-start at no extra circuit cost.
-
MLIR for Quantum Beyond Gate Cancellation: Quantum Circuit Mapping Reimagined
An MLIR-native A* qubit-routing pass outperforms QMAP and TKET on SWAP count and runtime and integrates into an open MLIR quantum compiler.
-
dSABRE: A SABRE-Style Router for Multi-Core Distributed Quantum Computers
dSABRE cuts geometric-mean EPR consumption by 41-44% versus TeleSABRE on 18 benchmark circuits through intra-core priority, a five-term teleportation scorer with capacity penalty, proactive congestion relief, and BFS-...
-
Fidelity-Aware Frequency Allocation and Transpilation Co-Design for Tunable Coupler Quantum Systems
A co-design method for frequency allocation and noise-aware transpilation in tunable-coupler quantum systems yields 8.9% lower log-infidelity cost and 6.8% shorter circuits than SABRE on SNAIL architectures.
-
CO-MAP: A Reinforcement Learning Approach to the Qubit Allocation Problem
Reinforcement learning policy for qubit mapping reduces SWAP overhead by 65-85% versus standard quantum compilers on MQTBench and Queko benchmark circuits.
-
Digital Annealer-Assisted Accuracy-First Quantum Circuit Transpilation with Integrated QUBO Mapping and Routing
Digital Annealer-assisted transpilation reduces CNOT counts by 13.7% on average (up to 57.4%) versus Qiskit on structured circuits, with a full-DA variant outperforming ISAAQ by 23.1%.
-
Scaling Qubit Mapping and Routing With Position Graph Abstraction and Memoization
Position graph abstraction with memoized SABRE heuristics scales qubit mapping and routing for TI-QCCD architectures by caching repeated evaluations without altering decisions.
-
Noise-aware selection of circuit cutting strategies under hardware noise non-uniformity
Noise-aware selection of circuit cutting strategies reduces execution overhead by 5-54x for 20-qubit circuits and makes 50-qubit circuit cutting feasible on non-uniformly noisy hardware.
-
Evaluation-driven Scaling for Scientific Discovery
SimpleTES scales test-time evaluation in LLMs to discover state-of-the-art solutions on 21 scientific problems across six domains, outperforming frontier models and optimization pipelines with examples like 2x faster ...
-
AlphaCNOT: Learning CNOT Minimization with Model-Based Planning
AlphaCNOT combines reinforcement learning with Monte Carlo Tree Search planning to reduce CNOT gate counts by up to 32% versus heuristics in quantum circuit synthesis.
-
Quantum Circuit Pruning: Improving Fidelity via Compilation-Aware Circuit Approximation
A routing-aware pruning rule removes two-qubit gates whose routing cost exceeds their rotation's worst-case fidelity impact, improving NISQ circuit fidelity in simulation.
-
Unifying Qubit Routing Across Diverse Quantum ISAs via Canonical Representation
Canopus unifies qubit mapping and routing across quantum ISAs by modeling synthesis costs via canonical two-qubit gate forms, achieving 15-35% lower routing overhead than prior methods on varied backends and topologies.
-
TeleSABRE: Layout Synthesis in Multi-Core Quantum Systems with Teleport Interconnect
TeleSABRE extends SABRE to combine intra-core SWAPs with inter-core teleportation, reporting a 28% reduction in inter-core operations on benchmarks for multi-core quantum architectures.
-
Efficient Circuit Transpilation of Commuting Gates on 2D Grids
Greedy, problem-dependent SWAP-layer sequences on 2D grids roughly halve QAOA circuit depth and CZ count for sparse MaxCut and MIS graphs, improving hardware approximation ratios by up to ~6–9%.
-
Beyond Logical Circuits: Hardware-Aware Analysis of Expressibility and Trainability in Variational Quantum Algorithms
Hardware transpilation of parameterized quantum circuits produces ansatz-dependent shifts in expressibility (up to 125%) and trainability (up to 25%), altering the expected trade-off between them.
-
Profiling the Effective Limits of Error Mitigation via Circuit Replication
Circuit replication reduces result variability in QAOA but also lowers inference strength, with effects differing between small and large graphs under real-world noise.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.