MQT QMAP: Efficient Quantum Circuit Mapping

TL;DR

This paper introduces QMAP, an open-source tool within the Munich Quantum Toolkit, designed to efficiently solve the quantum circuit mapping problem by automating the process of adapting circuits to hardware topologies, reducing costs and improving feasibility.

Contribution

The paper presents QMAP, a novel open-source tool that automates and optimizes quantum circuit mapping for various architectures, enhancing efficiency and accessibility.

Findings

QMAP effectively maps circuits with low additional gate costs

It improves fidelity by optimizing circuit-to-architecture matching

The tool is user-friendly and suitable for developers

Abstract

Quantum computing is an emerging technology that has the potential to revolutionize fields such as cryptography, machine learning, optimization, and quantum simulation. However, a major challenge in the realization of quantum algorithms on actual machines is ensuring that the gates in a quantum circuit (i.e., corresponding operations) match the topology of a targeted architecture so that the circuit can be executed while, at the same time, the resulting costs (e.g., in terms of the number of additionally introduced gates, fidelity, etc.) are kept low. This is known as the quantum circuit mapping problem. This summary paper provides an overview of QMAP, an open-source tool that is part of the Munich Quantum Toolkit (MQT) and offers efficient, automated, and accessible methods for tackling this problem. To this end, the paper first briefly reviews the problem. Afterwards, it shows how QMAP can be used to efficiently map quantum circuits to quantum computing architectures from both a user's and a developer's perspective. QMAP is publicly available as open-source at https://github.com/cda-tum/qmap.