MQT QMAP: Efficient Quantum Circuit Mapping
Open accessAbstract
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.
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
When applied to larger circuits, QMAP suffers in lengthier program runtime and its mapping outcomes are not as effective.
“However, when applied to larger circuits, QMAP will suffer in lengthier program runtime and thus the mapping outcomes are not as effective.”
From Robust Qubit Mapping Algorithm via Double-Source Optimal Routing on Large Quantum Circuits (2024) · cites this paper as [27]
QMAP delivers high-quality results for relatively small quantum circuits (less than 50 qubits).
“Notably, [23] and [26] have been integrated into the QMAP framework [27], which delivered high-quality results for relatively small quantum circuits (less than 50 qubits).”
From Robust Qubit Mapping Algorithm via Double-Source Optimal Routing on Large Quantum Circuits (2024) · cites this paper as [27]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Hart, P., Nilsson, N., & Raphael, B. (1968) · IEEE Transactions on Systems Science and Cybernetics · doi:10.1109/tssc.1968.300136 · Cited by 12,738 · see citing works
Quantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436 · see citing works
Biamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779 · see citing works
O'Brien, J. L., Furusawa, A., & Vučković, J. (2009) · Nature Photonics · doi:10.1038/nphoton.2009.229 · Cited by 2,388 · see citing works
A quantum engineer's guide to superconducting qubits
Krantz, P., Kjærgaard, M., Yan, F., Orlando, T. P., Gustavsson, S., & Oliver, W. D. (2019) · Applied Physics Reviews · doi:10.1063/1.5089550 · Cited by 2,056 · see citing works
Quantum computation and quantum information
Paul, T. (2007) · Mathematical Structures in Computer Science · doi:10.1017/s0960129507006317 · Cited by 1,815 · see citing works
Quantum computing with trapped ions
HAFFNER, H., ROOS, C., & BLATT, R. (2008) · Physics Reports · doi:10.1016/j.physrep.2008.09.003 · Cited by 1,154 · see citing works
Machine learning & artificial intelligence in the quantum domain: a review of recent progress
Dunjko, V., & Briegel, H. J. (2018) · Reports on Progress in Physics · doi:10.1088/1361-6633/aab406 · Cited by 1,132 · see citing works
Quantum computing with neutral atoms
Henriet, L., Beguin, L., Signoles, A., Lahaye, T., Browaeys, A., Reymond, G.-O., & Jurczak, C. (2020) · Quantum · doi:10.22331/q-2020-09-21-327 · Cited by 550 · see citing works
t|ket⟩: a retargetable compiler for NISQ devices
Sivarajah, S., Dilkes, S., Cowtan, A., Simmons, W., Edgington, A., & Duncan, R. (2021) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8e92 · Cited by 475 · see citing works
Qiskit/qiskit-metapackage: Qiskit 0.43.0
Gambetta, J., Treinish, M., Kassebaum, P., Rodríguez, D. M., De La Puente González, S., Hu, S., Javadi-Abhari, A., Azaustre, C., Pistoia, M., Scholten, T. L., et al. (2019) · Zenodo (CERN European Organization for Nuclear Research) · doi:10.5281/zenodo.2573505 · Cited by 388 · see citing works
An Efficient Methodology for Mapping Quantum Circuits to the IBM QX Architectures
Zulehner, A., Paler, A., & Wille, R. (2018) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2018.2846658 · Cited by 382 · see citing works
Self-citationPotential of quantum computing for drug discovery
Cao, Y., Romero, J., & Aspuru-Guzik, A. (2018) · IBM Journal of Research and Development · doi:10.1147/jrd.2018.2888987 · Cited by 357 · cited 1× · see citing works
“The ability to perform specific tasks exponentially faster than traditional computers may also aid in drug discovery [6], materials science [7], and artificial intelligence [8].”
BackgroundUniversal quantum circuit for two-qubit transformations with three controlled-NOT gates
Vidal, G., & Dawson, C. M. (2004) · Physical Review A · doi:10.1103/physreva.69.010301 · Cited by 277 · see citing works
OpenQASM 3: A Broader and Deeper Quantum Assembly Language
Cross, A. W., Javadi-Abhari, A., Alexander, T., de Beaudrap, N., Bishop, L. S., Heidel, S., Ryan, C. A., Sivarajah, P., Smolin, J. A., Gambetta, J., et al. (2022) · ACM Transactions on Quantum Computing · doi:10.1145/3505636 · Cited by 266 · see citing works
Quantum Circuit Simplification and Level Compaction
Maslov, D. A., Dueck, G. W., Miller, D. M., & Negrevergne, C. (2008) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/tcad.2007.911334 · Cited by 248 · see citing works
MQT Bench: Benchmarking Software and Design Automation Tools for Quantum Computing
Quetschlich, N., Burgholzer, L., & Wille, R. (2023) · Quantum · doi:10.22331/q-2023-07-20-1062 · Cited by 214 · see citing works
Self-citationMapping Quantum Circuits to IBM QX Architectures Using the Minimal Number of SWAP and H Operations
Wille, R., Burgholzer, L., & Zulehner, A. (2019) · Proceedings of the 56th Annual Design Automation Conference 2019 · doi:10.1145/3316781.3317859 · Cited by 207 · see citing works
Self-citationMaslov, D. (2016) · Physical Review A · doi:10.1103/physreva.93.022311 · Cited by 193 · see citing works
Formulating and Solving Routing Problems on Quantum Computers
Harwood, S., Gambella, C., Trenev, D., Simonetto, A., Bernal Neira, D., & Greenberg, D. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3049230 · Cited by 145 · see citing works
Elementary Quantum Gate Realizations for Multiple-Control Toffoli Gates
Miller, D. M., Wille, R., & Sasanian, Z. (2011) · IEEE International Symposium on Multiple-Valued Logic (ISMVL) · doi:10.1109/ismvl.2011.54 · Cited by 141 · see citing works
Self-citationUsing Quantum Computers for Quantum Simulation
Brown, K. L., Munro, W. J., & Kendon, V. M. (2010) · Entropy · doi:10.3390/e12112268 · Cited by 129 · see citing works
Optimization of quantum circuit mapping using gate transformation and commutation
Itoko, T., Raymond, R., Imamichi, T., & Matsuo, A. (2019) · Integration · doi:10.1016/j.vlsi.2019.10.004 · Cited by 115 · see citing works
Compiling SU(4) Quantum Circuits to IBM QX Architectures
Zulehner, A., & Wille, R. (2018) · Asia and South Pacific Design Automation Conference · doi:10.1145/3287624.3287704 · Cited by 108 · see citing works
Self-citationTowards Optimal Topology Aware Quantum Circuit Synthesis
Davis, M. G., Smith, E., Tudor, A., Sen, K., Siddiqi, I. A., & Iancu, C. (2020) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce49297.2020.00036 · Cited by 89 · see citing works
On the Complexity of Quantum Circuit Compilation
Botea, A., Kishimoto, A., & Marinescu, R. (2021) · Proceedings of the International Symposium on Combinatorial Search · doi:10.1609/socs.v9i1.18463 · Cited by 85 · see citing works
Quantum Circuit Optimization by Changing the Gate Order for 2D Nearest Neighbor Architectures
Hattori, W., & Yamashita, S. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-99498-7_16 · Cited by 46 · see citing works
Quantum Circuit Optimization and Transpilation via Parameterized Circuit Instantiation
Younis, E., & Iancu, C. (2022) · IEEE International Conference on Quantum Computing and Engineering (QCE) · doi:10.1109/qce53715.2022.00068 · Cited by 46 · see citing works
On the Influence of Initial Qubit Placement During NISQ Circuit Compilation
Paler, A. (2019) · Lecture notes in computer science · doi:10.1007/978-3-030-14082-3_18 · Cited by 40 · see citing works
Thermodynamics of a Quantum AnnealerPreprint
Buffoni, L., & Campisi, M. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.02055 · Cited by 40 · see citing works
Simulating the Electronic Structure of Spin Defects on Quantum Computers
Huang, B., Govoni, M., & Galli, G. (2022) · PRX Quantum · doi:10.1103/prxquantum.3.010339 · Cited by 39 · see citing works
Exploiting Quantum Teleportation in Quantum Circuit Mapping
Hillmich, S., Zulehner, A., & Wille, R. (2021) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1145/3394885.3431604 · Cited by 35 · see citing works
Self-citationReversible and Quantum Circuit Optimization: A Functional Approach
Sasanian, Z., & Miller, D. M. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-36315-3_9 · Cited by 29 · see citing works
On Optimal Subarchitectures for Quantum Circuit Mapping
Peham, T., Burgholzer, L., & Wille, R. (2023) · ACM Transactions on Quantum Computing · doi:10.1145/3593594 · Cited by 28 · see citing works
Self-citationLimiting the Search Space in Optimal Quantum Circuit Mapping
Burgholzer, L., Schneider, S., & Wille, R. (2022) · Springer eBooks · doi:10.1007/978-3-032-06770-8_11 · Cited by 25 · see citing works
Self-citationA SAT Encoding for Optimal Clifford Circuit Synthesis
Schneider, S., Burgholzer, L., & Wille, R. (2023) · Asia and South Pacific Design Automation Conference (ASP-DAC) · doi:10.1145/3566097.3567929 · Cited by 17 · see citing works
Self-citation
Flagged first, then by citations
Research works printed but not linked: 2
- M. Cerezo et al., Variational quantum algorithms, 2020. arXiv: 2012.09265. · arXiv
- Leonardo de Moura and Nikolaj Bjørner, "Z3: An efficient SMT solver, " in Tools Algorithms Constr. Anal. Syst., Springer, 2008, pp. 337-340.
Cited by
Sorted by citations
Robust Qubit Mapping Algorithm via Double-Source Optimal Routing on Large Quantum Circuits
Cheng, C.-Y., Yang, C.-Y., Kuo, Y.-H., Wang, R.-C., Cheng, H.-C., & Huang, C.-Y. (. (2024) · ACM Transactions on Quantum Computing · doi:10.1145/3680291 · Cited by 19 · see citing works
- Authors
- Wille, R., & Burgholzer, L.
- Affiliations
- Technical University of Munich (DE)
- Johannes Kepler University of Linz (AT)
- Venue
- Proceedings of the 2023 International Symposium on Physical Design
- Publisher
- ACM
- Published
- 2023-03-26
- Pages
- 198-204
- OpenAlex
- W4318719623
- Cited by
- 41
- References
- 37
- Citations by year
- 2026: 13 · 2025: 15 · 2024: 8 · 2023: 5
- FWCI
- 7.26
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- International Symposium on Physical Design (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- European Union Horizon 2020 (101001318)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
- Keywords
- quantum circuit mapping, quantum circuit compilation, quantum computing architecture, open source software, quantum algorithms
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
