Exact global reordering for nearest neighbor quantum circuits using \({\mathrm {A}}^{*}\)

DOI10.1007/978-3-319-59936-6_15zbMath1487.81053OpenAlexW2619125836MaRDI QIDQ1705607

Stefan Gasser, Robert Wille, Alwin Zulehner

Publication date: 16 March 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-59936-6_15

Mathematics Subject Classification ID

Quantum computation (81P68) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Networks and circuits as models of computation; circuit complexity (68Q06) Quantum gates (81P65)

Related Items (1)

The complexity of quantum circuit mapping with fixed parameters

This page was built for publication: Exact global reordering for nearest neighbor quantum circuits using \({\mathrm {A}}^{*}\)