Synthesis of quantum circuits for linear nearest neighbor architectures

From MaRDI portal
Publication:544832

DOI10.1007/S11128-010-0201-2zbMATH Open1216.81052arXiv1110.6412OpenAlexW2023675295WikidataQ59242586 ScholiaQ59242586MaRDI QIDQ544832FDOQ544832


Authors: Mehdi Saeedi, Robert Wille, Rolf Drechsler Edit this on Wikidata


Publication date: 16 June 2011

Published in: Quantum Information Processing (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1110.6412




Recommendations




Cites Work


Cited In (34)

Uses Software





This page was built for publication: Synthesis of quantum circuits for linear nearest neighbor architectures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q544832)