Synthesis of Reversible Functions Beyond Gate Count and Quantum Cost

Physics – Quantum Physics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

16 pages, 6 figures, 4 tables, International Workshop on Logic and Synthesis

Scientific paper

Many synthesis approaches for reversible and quantum logic have been proposed so far. However, most of them generate circuits with respect to simple metrics, i.e. gate count or quantum cost. On the other hand, to physically realize reversible and quantum hardware, additional constraints exist. In this paper, we describe cost metrics beyond gate count and quantum cost that should be considered while synthesizing reversible and quantum logic for the respective target technologies. We show that the evaluation of a synthesis approach may differ if additional costs are applied. In addition, a new cost metric, namely Nearest Neighbor Cost (NNC) which is imposed by realistic physical quantum architectures, is considered in detail. We discuss how existing synthesis flows can be extended to generate optimal circuits with respect to NNC while still keeping the quantum cost small.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Synthesis of Reversible Functions Beyond Gate Count and Quantum Cost does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Synthesis of Reversible Functions Beyond Gate Count and Quantum Cost, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Synthesis of Reversible Functions Beyond Gate Count and Quantum Cost will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-32945

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.