Pith. sign in

REVIEW 1 cited by

Optimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ Qubits

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 2403.11598 v2 pith:BCYKYO4R submitted 2024-03-18 quant-ph cs.AI

classification quant-phcs.AI
keywords circuitsapproachesdeepexactlargelayoutnear-optimalquantum
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Layout synthesis is mapping a quantum circuit to a quantum processor. SWAP gate insertions are needed for scheduling 2-qubit gates only on connected physical qubits. With the ever-increasing number of qubits in NISQ processors, scalable layout synthesis is of utmost importance. With large optimality gaps observed in heuristic approaches, scalable exact methods are needed. While recent exact and near-optimal approaches scale to moderate circuits, large deep circuits are still out of scope. In this work, we propose a SAT encoding based on parallel plans that apply 1 SWAP and a group of CNOTs at each time step. Using domain-specific information, we maintain optimality in parallel plans while scaling to large and deep circuits. From our results, we show the scalability of our approach which significantly outperforms leading exact and near-optimal approaches (up to 100x). For the first time, we can optimally map several 8, 14, and 16 qubit circuits onto 54, 80, and 127 qubit platforms with up to 17 SWAPs. While adding optimal SWAPs, we also report near-optimal depth in our mapped circuits.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Optimized Qubit Routing for Commuting Gates via Integer Programming

    math.OC 2025-07 conditional novelty 7.0 of 10

    A new exact integer-programming formulation, the Token Meeting Problem, provably minimizes swap gates when routing commuting-gate quantum circuits, with NP-hardness and asymptotic bounds.

Pith tools