Correction to: npj Quantum Informationhttps://doi.org/10.1038/s41534-024-00909-7, published online 09 November 2024 The original version of this Article contained an error in the caption of Fig. 5, which has now been replaced with the correct caption. Additionally, Affiliation 3, originally listed as "Computer Engineering Department, Technical University of Valencia, Valencia, Spain," was incorrect and has been updated to "Departamento de Informática de Sistemas y Computadores, Universitat Politècnica de València, 46022 València, Spain”. This has been corrected in both the PDF and HTML versions of the Article.

This thesis presents a novel formulation to study the qubit-mapping problem (QMP). The presented for- mulation redefines the problem in terms of density matrices which represent the quantum algorithm and the underlying architecture—allowing the implementation of techniques from quantum information theory to es- tablish a bounded metric space for comparing these density matrices. The main contribution of this thesis is implementing this formulation in an algorithm to determine the minimal bound on the required number of SWAP operations for a pairing of a quantum algorithm to an underlying device where the initial mapping has been provided. Benchmarks have shown a clear dependence on the β-value. Emphasising the need for future investigations of this dependence to enhance the algorithm’s effectiveness for more extensive algorithms and architectures. While it is essential to acknowledge that the approach may not currently rival the state of the art.