Pith. sign in

REVIEW

SSR: A Swapping-Sweeping-and-Rewriting Optimizer for Quantum Circuit Transformation

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 2503.03227 v4 pith:MY4D22YJ submitted 2025-03-05 quant-ph

SSR: A Swapping-Sweeping-and-Rewriting Optimizer for Quantum Circuit Transformation

classification quant-ph
keywords circuitcircuitsoptimizerdepthquantumalgorithmgatesswapping-sweeping-and-rewriting
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Quantum circuit transformation (QCT), necessary for adapting any quantum circuit to the qubit connectivity constraints of the NISQ device, often introduces numerous additional SWAP gates into the original circuit, increasing the circuit depth and thus reducing the success rate of computation. To minimize the depth of QCT circuits, we propose a Swapping-Sweeping-and-Rewriting optimizer. This optimizer rearranges the circuit based on generalized gate commutation rules via a genetic algorithm, extracts subcircuits consisting of CNOT gates using a circuit sweeping technique, and rewrites each subcircuit with a functionally equivalent and depth-optimal circuit generated by an SAT solver. The devised optimizer effectively captures the intrinsic patterns of the QCT circuits, and the experimental results demonstrate that our algorithm can significantly reduce the depth of QCT circuits, 26.68\% at most and 12.18\% on average, across all benchmark circuits.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.