Bandic, Medinale Henaff, PabloOvide-González, AnabelEscofet, PauBen Rached, SaharRodrigo, SantiagoVan Someren, HansAbadal, SergiAlarcón, EduardAlmudéver, Carmen G.Feld, Sebastian2025-04-012025-04-012025-01https://riunet.upv.es/handle/10251/220069[EN] Application-specific quantum computers offer the most efficient means to tackle problems intractable by classical computers. Realizing these architectures necessitates a deep understanding of quantum circuit properties and their relationship to execution outcomes on quantum devices. Our study aims to perform for the first time a rigorous examination of quantum circuits by introducing graph theory-based metrics extracted from their qubit interaction graph and gate dependency graph (GDG) alongside conventional parameters describing the circuit itself. This methodology facilitates a comprehensive analysis and clustering of quantum circuits. Furthermore, it uncovers a connection between parameters rooted in both qubit interaction and GDGs, and the performance metrics for quantum circuit mapping, across a range of established quantum device and mapping configurations. Among the various device configurations, we particularly emphasize modular (i.e. multi-core) quantum computing architectures due to their high potential as a viable solution for quantum device scalability. This thorough analysis will help us to: i) identify key attributes of quantum circuits that affect the quantum circuit mapping performance metrics; ii) predict the performance on a specific chip for similar circuit structures; iii) determine preferable combinations of mapping techniques and hardware setups for specific circuits; and iv) define representative benchmark sets by clustering similarly structured circuits.Reconocimiento (by)Quantum circuit mappingMulti-core quantum computersModular architecturesQuantum communicationInteraction graphsQuantum benchmarksGate-dependency graphsArtículo10.1088/2058-9565/ada180Abierto2058-9565