Improved cost-metric for nearest neighbor mapping of quantum circuits to 2-dimensional hexagonal architecture

DOI10.1007/978-3-031-38100-3_14MaRDI QIDQ6148124FDOQ6148124

Authors: K. Datta, Abhoy Kole, Indranil Gupta, Rolf Drechsler 

Publication date: 11 January 2024

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

Recommendations

• On the qubit routing problem
• Design of efficient quantum circuits using nearest neighbor constraint in 2D architecture
• Quantum circuit optimization by changing the gate order for 2D nearest neighbor architectures
• Mapping from multiple-control Toffoli circuits to linear nearest neighbor quantum circuits

zbMATH Keywords

quantum circuitsqubit mappingarchitecture-aware decompositionclean and dirty ancilla

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68) Other nonclassical models of computation (68Q09)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• A processor architecture design method for improving reusability of special-purpose superconducting quantum processor

This page was built for publication: Improved cost-metric for nearest neighbor mapping of quantum circuits to 2-dimensional hexagonal architecture

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