Linear Nearest Neighbor Synthesis of Reversible Circuits by Graph Partitioning

Details Linear Nearest Neighbor Synthesis of Reversible Circuits by Graph Partitioning Linear Nearest Neighbor Synthesis of Reversible Circuits by Graph Partitioning

2011-12-02

arxiv.org/abs/1112.0564v1

Computer Science

Emerging Technologies

Submitted to IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Scientific paper

Linear Nearest Neighbor (LNN) synthesis in reversible circuits has emerged as an important issue in terms of technological implementation for quantum computation. The objective is to obtain a LNN architecture with minimum gate cost. As achieving optimal synthesis is a hard problem, heuristic methods have been proposed in recent literature. In this work we present a graph partitioning based approach for LNN synthesis with reduction in circuit cost. In particular, the number of SWAP gates required to convert a given gate-level quantum circuit to its equivalent LNN configuration is minimized. Our algorithm determines the reordering of indices of the qubit line(s) for both single control and multiple controlled gates. Experimental results for placing the target qubits of Multiple Controlled Toffoli (MCT) library of benchmark circuits show a significant reduction in gate count and quantum gate cost compared to those of related research works.

Affiliated with

Also associated with

No associations

Rating

Linear Nearest Neighbor Synthesis of Reversible Circuits by Graph Partitioning 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 Linear Nearest Neighbor Synthesis of Reversible Circuits by Graph Partitioning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear Nearest Neighbor Synthesis of Reversible Circuits by Graph Partitioning will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-141255