Synthesis of Quantum Circuits for Linear Nearest Neighbor Architectures
Mehdi Saeedi, Robert Wille, Rolf Drechsler

TL;DR
This paper presents an integrated synthesis flow with optimization, exact synthesis, and reordering strategies to improve quantum circuit realization on linear nearest neighbor architectures, reducing quantum cost significantly.
Contribution
It introduces new methods and an integrated flow specifically designed for LNN quantum architectures, enhancing circuit efficiency.
Findings
Quantum cost reduced by over 50% on average.
New synthesis methods tailored for LNN architectures.
Effective reordering strategies improve circuit performance.
Abstract
While a couple of impressive quantum technologies have been proposed, they have several intrinsic limitations which must be considered by circuit designers to produce realizable circuits. Limited interaction distance between gate qubits is one of the most common limitations. In this paper, we suggest extensions of the existing synthesis flow aimed to realize circuits for quantum architectures with linear nearest neighbor (LNN) interaction. To this end, a template matching optimization, an exact synthesis approach, and two reordering strategies are introduced. The proposed methods are combined as an integrated synthesis flow. Experiments show that by using the suggested flow, quantum cost can be improved by more than 50% on average.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
