Towards a Cost Metric for Nearest Neighbor Constraints in Reversible Circuits

DOI10.1007/978-3-319-20860-2_18zbMath1464.81021OpenAlexW2153677915WikidataQ62513082 ScholiaQ62513082MaRDI QIDQ2822521

Robert Wille, Abhoy Kole, Kamalika Datta, Indranil Sen Gupta

Publication date: 30 September 2016

Published in: Reversible Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-20860-2_18

zbMATH Keywords

quantum circuitquantum costreversible circuitnearest neighbor cost

Mathematics Subject Classification ID

Quantum computation (81P68) Networks and circuits as models of computation; circuit complexity (68Q06) Quantum gates (81P65)

Related Items (1)

Mathematical formulation of quantum circuit design problems in networks of quantum computers

Cites Work

• Unnamed Item
• Synthesis of quantum circuits for linear nearest neighbor architectures
• Considering nearest neighbor constraints of quantum circuits at the reversible circuit level

This page was built for publication: Towards a Cost Metric for Nearest Neighbor Constraints in Reversible Circuits