Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 8
Encontrada(s) 1 página(s)

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

ArtA: automating Design Space Exploration of spin-qubit architectures

  • Paraskevopoulos, Nikiforos
  • Hamel, David
  • Sarkar, Aritra
  • Feld, Sebastian
  • GARCIA ALMUDEVER, CARMEN|||0000-0002-3800-2357
[EN] In the fast-paced field of quantum computing, identifying the architectural characteristics that will enable quantum processors to achieve high performance across a diverse range of quantum algorithms continues to pose a significant challenge. Given the extensive and costly nature of experimentally testing different designs, this paper introduces the first Design Space Exploration (DSE) for quantum-dot spin-qubit architectures. Utilizing the upgraded SpinQ compilation framework, this study explores a substantial design space comprising 29,312 spin-qubit-based architectures and applies an innovative optimization tool, ArtA (Artificial Architect), to speed up the design space traversal. ArtA can leverage 17 optimization configurations, significantly reducing exploration times by up to 99.1% compared to a traditional brute force approach while maintaining the same result quality. After a comprehensive evaluation of best-matching optimization configurations per quantum circuit, ArtA suggests specific as well as universal architectural features that provide optimal performance across the examined circuits. Our work demonstrates that combining DSE methodologies with optimization algorithms can be effectively used to generate meaningful design insights for quantum processor development., This work is part of the research program OTP with project number 16278, which is (partly) financed by the Netherlands Organisation for Scientific Research (NWO). CGA acknowledges funding from the Spanish Ministry of Science, Innovation and Universities through the Beatriz Galindo program 2020 (BG20-00023) and from the European ERDF under grant PID2021-123627OB-C51.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

BeSnake: A Routing Algorithm for Scalable Spin-Qubit Architectures

  • Paraskevopoulos, Nikiforos
  • Feld, Sebastian
  • GARCIA ALMUDEVER, CARMEN|||0000-0002-3800-2357
[EN] As quantum computing devices increase in size with respect to the number of qubits, two-qubit interactions become more challenging, necessitating innovative and scalable qubit routing solutions. In this work, we introduce beSnake, a novel algorithm specifically designed to address the intricate qubit routing challenges in scalable spin-qubit architectures. Unlike traditional methods in superconducting architectures that solely rely on swap operations, beSnake also incorporates the shuttle operation to optimize the execution time and fidelity of quantum circuits and achieves fast computation times of the routing task itself. Employing a simple breadth-first search approach, beSnake effectively manages the restrictions created by diverse topologies and qubit positions acting as obstacles for up to 72% qubit density. It also has the option to adjust the level of optimization and to dynamically tackle parallelized routing tasks, all the while maintaining noise awareness. Our simulations demonstrate beSnake's advantage over an existing routing solution on random circuits and real quantum algorithms with up to 1000 qubits, showing an average improvement of up to 80% in gate overhead, 54% in depth overhead, and up to 8.33 times faster routing times., This work was supported in part by the Netherlands Organisation for Scientific Research through the Research Program OTP under Grant 16278. The work of Carmen G. Almudever was supported in part by the Spanish Ministry of Science, Innovation and Universities through the Beatriz Galindo Program 2020 under Grant BG20-00023 and in part by the European Regional Development Fund under Grant PID2021-123627OB-C51.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Contribución de congreso (ConferenceOutput)

Scaling and Assigning Resources on ION Trap QCCD Architectures

  • Ovide-González, Anabel
  • GARCIA ALMUDEVER, CARMEN|||0000-0002-3800-2357
  • Cuomo, Daniele
[EN] Ion trap technologies have earned significant attention as potential candidates for quantum information processing due to their long decoherence times and precise manipulation of individual qubits, distinguishing them from other candidates in the field of quantum technologies. However, scalability remains a challenge, as introducing additional qubits into a trap increases noise and heating effects, consequently decreasing operational fidelity. Trapped-ion Quantum Charge-Coupled Device (QCCD) architectures have addressed this limitation by interconnecting multiple traps and employing ion shuttling mechanisms to transfer ions among traps. This new architectural design requires the development of novel compilation techniques for quantum algorithms, which efficiently allocate and route qubits, and schedule operations. The aim of a compiler is to minimize ion movements and, therefore, reduce the execution time of the circuit to achieve a higher fidelity. In this paper, we propose a novel approach for initial qubit placement, demonstrating enhancements of up to 50% compared to prior methods. Furthermore, we conduct a scalability analysis on two distinct QCCD topologies: a 1D-linear array and a ring structure. Additionally, we evaluate the impact of the excess capacity ¿ i.e. the number of free spaces within a trap ¿ on the algorithm performance., The authors acknowledge financial support from the European Union s Horizon Europe research and innovation program through the project Quantum Internet Alliance under grant agreement No. 101102140. CGA also acknowledges support from the Spanish Ministry of Science, Innovation and Universities through the Beatriz Galindo program 2020 (BG20-00023) and the European ERDF under grant PID2021- 123627OB-C51.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Predicting the Temporal Variability of Error Rates in Superconducting Quantum Processors: Mitigating Error Accuracy Loss in Queue-Based Quantum Computing Platforms [Focus: Quantum Software and its Engineering]

  • Rodríguez-Soriano, Laura|||0000-0002-2074-0466
  • García-Herrero, Francisco
  • GARCIA ALMUDEVER, CARMEN|||0000-0002-3800-2357
[EN] Multiple layers of the quantum system full-stack require data on temporal variations in error rates of physical elements. This article proposes using five machine learning and time-series models to predict error rate variability for two-qubit gates based on calibration data., This work is supported by the QuantERA grant EQUIP with Grants PCI2022-133004 and PCI2022-132922, funded by Agencia Estatal de Investigacion, Ministerio de Ciencia e Innovacion, Gobierno de Espana, MCIN/AEI /10.13039/501100011033, and by the European Union "NextGenerationEU/PRTR." CGA acknowledges funding from the Spanish Ministry of Science, In-novation, and Universities through the Beatriz Galindo program 2020 (BG20-00023), from the European ERDF under Grant PID2021-123627OB-C51, and from the Ministry for Digital Transformation and of Civil Service of the Spanish Government through the QUANTUM ENIA project call-Quantum Spain project, and by the European Union through the Recovery, Transformation and Resilience Plan - NextGenerationEU within the framework of the Digital Spain 2026 Agenda. We acknowledge the use of IBM Quantum services for this work. The views expressed are those of the authors and do not reflect the official policy or position of IBM or the IBM Quantum team.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Reducing the number of qubits in quantum simulations of one dimensional many-body Hamiltonians

  • Mehrabankar, Somayeh
  • Pérez, Armando
  • Garcia March, Miguel Angel|||0000-0001-7092-838X
  • GARCIA ALMUDEVER, CARMEN|||0000-0002-3800-2357
[EN] We investigate the Ising and Heisenberg models using the block renormalization group method (BRGM), focusing on its behavior across different system sizes. The BRGM reduces the number of spins by a factor of 1/2 (1/3) for the Ising (Heisenberg) model, effectively preserving essential physical features of the model while using only a fraction of the spins. Through a comparative analysis, we demonstrate that as the system size increases, there is an exponential convergence between results obtained from the original and renormalized Ising Hamiltonians, provided the coupling constants are redefined accordingly. Remarkably, for a spin chain with 24 spins, all physical features, including magnetization, correlation function, and entanglement entropy, exhibit an exact correspondence with the results from the original Hamiltonian. The study of the Heisenberg model also shows this tendency, although complete convergence may appear for a size much larger than 24 spins, and is therefore beyond our computational capabilities. The success of BRGM in accurately characterizing the Ising model, even with a relatively small number of spins, underscores its robustness and utility in studying complex physical systems, and facilitates its simulation on current NISQ computers, where the available number of qubits is largely constrained., The authors would like to acknowledge the enlightening discussions with German Sierra and express their gratitude to Ali Najafi (www.linkedin.com/in/ali-najafi-84345546) for his collaboration in numerical calculations. These calculations were performed using the Luis Vives machine at the University of Valencia, Spain. The authors gratefully acknowledge the computer resources at Artemisa, funded by the European Union ERDF and Comunitat Valenciana, as well as the technical support provided by the Instituto de Fisica Corpuscular, IFIC (CSIC-UV). This work has been funded by the Spanish MCIN/AEI/10.13039/501100011033 Grant PID2020-113334GB-I00, Generalitat Valenciana Grant CIPROM/2022/66, the Ministry of Economic Affairs and Digital Transformation of the Spanish Government through the QUANTUM ENIA project call-QUANTUM SPAIN project, and by the European Union through the Recovery, Transformation, and Resilience Plan: NextGenerationEU within the framework of the Digital Spain 2026 Agenda, and by the CSIC Interdisciplinary Thematic Platform (PTI+) on Quantum Technologies (PTI-QTEP+). This project has also received funding from the European Union's Horizon 2020 research and innovation program under Grant Agreement 101086123-CaLIGOLA. M A G-M acknowledges funding from the Spanish Ministry of Education and Professional Training (MEFP) through the Beatriz Galindo program 2018 (BEAGAL18/00203), QuantERA II Cofund 2021 PCI2022-133004, Projects of MCIN with funding from European Union Next GenerationEU (PRTR-C17.I1) and by Generalitat Valenciana, with reference 20220883 (PerovsQuTe) and COMCUANTICA/007 (QuanTwin), and Red Tematica RED2022-134391-T. CGA acknowledges support from the Spanish Ministry of Science, Innovation and Universities through the Beatriz Galindo program 2020 (BG20-00023) and the European ERDF under Grant PID2021-123627OB-C51 and from the QuantERA Grant EQUIP with the Grant Numbers PCI2022-133004, funded by Agencia Estatal de Investigacion, Ministerio de Ciencia e Innovacion, Gobierno de Espana, MCIN/AEI/10.13039/501100011033, and by the European Union 'NextGenerationEU/PRTR'
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Implementing Quantum Polar Codes in a Superconducting Processor: From State Preparation to Decoding [Focus: Quantum Software and Its Engineering]

  • Kurniawan, Handy
  • Savin, Valentin
  • Garcia Herrero, Francisco
  • GARCIA ALMUDEVER, CARMEN|||0000-0002-3800-2357
[EN] A full-stack software framework for implementing quantum polar codes is presented, integrating a noise-aware compilation approach that optimizes resource usage by combining quantum and classical software. Experimental results demonstrate significant improvements in logical state preparation rates, resulting in reduced comsumption of both quantum and classical resources., This work was supported by the QuantERA project EQUIP (Grants PCI2022-133004 and PCI2022-132922, funded by the AEI, Ministerio de Ciencia e Innovacion, Gobierno de Espana, MCIN/AEI/10. 13039/501100011033, and ANR-22-QUA2-0005-01, funded by the Agence Nationale de la Recherche, France), and by the European Union "Next Generation EU/PRTR". This research is part of the project PID2023-147059OB-I00 funded by MCIU/AEI/10 .13 039/50110 0011033/FEDER, UE. Handy Kurniawan acknowledges support from the Comunidad de Madrid under Grant PIPF-2023/COM-30051. Carmen G. Almudever acknowledges support from the Spanish Ministry of Science, Innovation, and Universities through the Beatriz Galindo program 2020 (BG20-00023) and the European ERDF PID2021-123627OB-C51. We acknowledge the use of IBM Quantum services for this work. The views expressed are those of the authors and do not reflect the official policy or position of IBM or the IBM Quantum team. This article has supplementary downloadable material available at https://doi.org/10.1109/MS.2025.3569447, provided by the authors.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Profiling quantum circuits for their efficient execution on single- and multi-core architectures

  • Bandic, Medina
  • le Henaff, Pablo
  • Escofet, Pau
  • Ben Rached, Sahar
  • Rodrigo, Santiago
  • Van Someren, Hans
  • Abadal, Sergi
  • Alarcón, Eduard
  • Almudéver, Carmen G.
  • Feld, Sebastian
  • Ovide-González, Anabel
[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., S F and M B acknowledge funding of Intel Corporation. CGA acknowledges funding from the Spanish Ministry of Science, Innovation and Universities through the Beatriz Galindo program 2020 (BG20-00023), from project PCI2022-133004 funded by MCIN/AEI/10.13039/501100011033 and by the European Union NextGenerationEU/PRTR, and from the Ministry for Digital Transformation and of Civil Service of the Spanish Government through the QUANTUM ENIA project call-Quantum Spain project, and by the European Union through the Recovery, Transformation and Resilience Plan-NextGenerationEU within the framework of the Digital Spain 2026 Agenda. C G A, E A and S A also acknowledge support from the E U, grant HORIZON-EIC-2022-PATHFINDEROPEN-01-101099697. Finally, S A acknowledges support from the E U, Grant ERC-StG-2021-WINC-101042080.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Characterizing the Inter-Core Qubit Traffic in Large-Scale Quantum Modular Architectures

  • Ben Rached, Sahar
  • Lopez Agudo,Isaac
  • Rodrigo, Santiago
  • Bandic, Medina
  • Garcia-Saez, Artur
  • Feld, S.
  • Van Someren, Hans
  • Alarcón, E
  • Abadal, Sergi
  • GARCIA ALMUDEVER, CARMEN|||0000-0002-3800-2357
[EN] Modular quantum processor architectures are envisioned as a promising solution for the scalability of quantum computing systems beyond the Noisy Intermediate Scale Quantum (NISQ) era. Based upon interconnecting tens to hundreds of quantum processors (i.e cores) via quantum coherent and classical links, this approach unravels the pressing limitations of densely qubit-packed monolithic processors, mainly by mitigating the requirements of qubit control and enhancing qubit isolation. Therefore, this new architectural design enables executing large-scale algorithms in a distributed manner. In order to assess the performance and optimize such architectures, it is crucial to analyze the quantum state transfers occurring via inter-core communication networks, referred to as inter-core qubit traffic. This would provide insights to improve the software and hardware stack for multi-core quantum computers. To this aim, we present a characterization of the spatio-temporal inter-core qubit traffic for different large-scale quantum algorithms. The programs are compiled on an all-to-all connected multi-core architecture that applies the teleportation protocol for inter-core state transfer and supports up to around 1000 qubits. We characterize the qubit traffic based on multiple performance metrics to assess the computational process and the communication overhead. Based on the showcased results, we conclude on the parallelization and scalability of presented algorithms, qualitatively evaluate the resource requirements as we scale circuit sizes, and lay the foundations of application-oriented benchmarking of large-scale multi-core architectures., Authors gratefully acknowledge funding from the European Commission through HORIZON-EIC-2022-PATHFINDEROPEN-01-101099697 (QUADRATURE) and grant HORIZON-ERC-2021-101042080 (WINC). Authors acknowledge support from the QCOMM-CAT-Planes Complementarios: Comunicacion Cuantica-supported by MICIN with funding from the European Union, NextGenerationEU (PRTR-C17.I1) and by Generalitat de Catalunya, and by ICREA Academia Award 2024. CGA also acknowledges funding from the Spanish Ministry of Science, Innovation and Universities through the Beatriz Galindo program 2020 (BG20-00023).