REVIEW 9 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
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 9 Pith papers
-
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.
-
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.
-
Leveraging Phase Polynomials for Quantum Circuit Optimization
A quantum circuit optimizer, PhasePoly, co-optimizes phase and output parity matrices and merges phase-polynomial blocks across gate barriers, reducing total gates by 34.9% and CNOT gates by 28.5% on average.
-
Assessing Quantum Layout Synthesis Tools via Known Optimal-SWAP Cost Benchmarks
QUBIKOS is the first benchmark set with provably optimal non-zero SWAP counts, showing current quantum layout synthesis tools are far from optimal.
-
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%.
-
A High-Performance Multilevel Framework for Quantum Layout Synthesis
ML-SABRE, a multilevel layout synthesis framework built on the LightSABRE heuristic, cuts SWAP count by 45-65% and improves compilation speed by 2.5-3x on quantum benchmarks.
Discussion (0). Continue with ORCID to comment.