Evaluating the Flexibility of A* for Mapping Quantum Circuits

DOI10.1007/978-3-030-21500-2_11OpenAlexW2952465648MaRDI QIDQ5237223

Robert Wille, Hartwig Bauer, Alwin Zulehner

Publication date: 17 October 2019

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

Full work available at URL: https://doi.org/10.1007/978-3-030-21500-2_11

Mathematics Subject Classification ID

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

Related Items (1)

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

Uses Software

• RevLib
• GitHub
• QISKit

Cites Work

• Unnamed Item
• Unnamed Item
• Synthesis of quantum circuits for linear nearest neighbor architectures
• Quantum circuit optimization by changing the gate order for 2D nearest neighbor architectures
• QMDD-based one-pass design of reversible logic: exploring the available degree of freedom (work-in-progress report)
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• A universal two-bit gate for quantum computation

This page was built for publication: Evaluating the Flexibility of A* for Mapping Quantum Circuits