REVIEW 2 cited by
ML-QLS: Multilevel Quantum Layout Synthesis
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
Quantum Layout Synthesis (QLS) plays a crucial role in optimizing quantum circuit execution on physical quantum devices. As we enter the era where quantum computers have hundreds of qubits, we are faced with scalability issues using optimal approaches and degrading heuristic methods' performance due to the lack of global optimization. To this end, we introduce a hybrid design that obtains the much improved solution for the heuristic method utilizing the multilevel framework, which is an effective methodology to solve large-scale problems in VLSI design. In this paper, we present ML-QLS, the first multilevel quantum layout tool with a scalable refinement operation integrated with novel cost functions and clustering strategies. Our clustering provides valuable insights into generating a proper problem approximation for quantum circuits and devices. Our experimental results demonstrate that ML-QLS can scale up to problems involving hundreds of qubits and achieve a remarkable 52% performance improvement over leading heuristic QLS tools for large circuits, which underscores the effectiveness of multilevel frameworks in quantum applications.
Forward citations
Cited by 2 Pith papers
-
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.
-
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.