Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum Information Processing

Considering nearest neighbor constraints of quantum circuits at the reversible circuit level

Robert Wille, Aaron Lye, Rolf Drechsler

Published Sep 23, 2013• 20 citations
Publisher
DOI
10.1007/s11128-013-0642-5

Related papers

Towards a Cost Metric for Nearest Neighbor Constraints in Reversible Circuits

Abhoy Kole, Kamalika Datta, Indranil Sengupta +1 more

Lecture notes in computer science•Jan 1, 2015•7 citations

Design of Efficient Quantum Circuits Using Nearest Neighbor Constraint in 2D Architecture

Leniency Marbaniang, Abhoy Kole, Kamalika Datta +1 more

Lecture notes in computer science•Jan 1, 2017•8 citations

Linear nearest neighbor optimization in quantum circuits: a multiobjective perspective

Daniel Ruffinelli, Benjamı́n Barán

Quantum Information Processing•Jul 26, 2017•17 citations

A nearest neighbor quantum cost metric for the reversible circuit level

Abhoy Kole, Kamalika Datta, Robert Wille +1 more

Motivated by the prospects of quantum computation, the design of quantum circuits received significant attention in the recent past. Due to the complex representation of the underlying quantum mechanical phenomena, a two-stage design flow was established in which the desired functionality is first realized in terms of a reversible circuit and, afterwards, mapped into an equivalent quantum circuit. This paper proposes a new metric for estimating nearest neighbor cost at the reversible circuit level. Research works are mostly carried out considering nearest neighbor constraints at the quantum circuit level. Various quantum gate libraries and mapping schemes have been reported in the literature to realize the circuit operation at quantum level. One such mapping scheme exploiting a well established quantum gate library (NCV) is explored in defining the cost metric. Experimental evaluations confirmed both the accuracy as well as the applicability of the proposed metric.

IEEE Region 10 Conference (TENCON)•Nov 1, 2017•2 citations

Synthesis of Reversible Functions Beyond Gate Count and Quantum Cost

Robert Wille, Mehdi Saeedi, Rolf Drechsler

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.

arXiv:1004.4609•Apr 26, 2010•38 citations

An Efficient Nearest Neighbor Design for 2D Quantum Circuits

Anirban Bhattacharjee, Chandan Bandyopadhyay, Bappaditya Mondal +3 more

Lecture notes in electrical engineering•Jul 28, 2019•1 citation
Motivated by the prospects of quantum computation, the design of quantum circuits received significant attention in the recent past. Due to the complex representation of the underlying quantum mechanical phenomena, a two-stage design flow was established in which the desired functionality is first realized in terms of a reversible circuit and, afterwards, mapped into an equivalent quantum circuit. This paper proposes a new metric for estimating nearest neighbor cost at the reversible circuit level. Research works are mostly carried out considering nearest neighbor constraints at the quantum circuit level. Various quantum gate libraries and mapping schemes have been reported in the literature to realize the circuit operation at quantum level. One such mapping scheme exploiting a well established quantum gate library (NCV) is explored in defining the cost metric. Experimental evaluations confirmed both the accuracy as well as the applicability of the proposed metric.
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.