Skip to main content

Resultados relacionados

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

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

Compilation Techniques for Spin Qubits in a Shuttling Bus Architecture

  • Escofet, Pau
  • Semenov, Andrii
  • Murphy, Niall
  • Blokhina, Elena
  • Abadal, Sergi
  • Alarcon, Eduard
  • GARCIA ALMUDEVER, CARMEN|||0000-0002-3800-2357
[EN] In this work, we explore and propose several quantum circuit mapping strategies to optimize qubit shuttling in scalable quantum computing architectures based on silicon spin qubits. Our goal is to minimize phase errors introduced during shuttling operations while reducing the overall execution time of quantum circuits. We propose and evaluate five mapping algorithms using benchmarks from quantum algorithms. The Swap Return strategy emerged as the most robust solution, offering a superior balance between execution time and error minimization by considering future qubit interactions. Additionally, we assess the importance of initial qubit placement, demonstrating that an informed placement strategy can significantly enhance the performance of dynamic mapping approaches., This work was supported by the European Commission (QUADRATURE: HORIZON-EIC-2022-PATHFINDEROPEN-01-101099697, WINC: HORIZON-ERC-2021-101042080), the Spanish Ministry of Science, Innovation and Universities (Beatriz Galindo program 2020, BG20-00023) and European ERDF (PID2021-123627OB-C5, QCOMM-CAT-Planes Complementarios), funding from MICIN and NextGenerationEU (PRTR-C17.I1), Generalitat de Catalunya, the ICREA Academia Award 2024, Science Foundation Ireland under Grant 21/RP-2TF/10019, and the predoctoral FPI-UPC grant supported by UPC and Banco Santander.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

Route-Forcing: Scalable Quantum Circuit Mapping for Scalable Quantum Computing Architectures

  • Escofet, Pau
  • Gonzalvo, Alejandro
  • Alarcon, Eduard
  • Abadal, Sergi
  • GARCIA ALMUDEVER, CARMEN|||0000-0002-3800-2357
[EN] Quantum computers are expected to scale in size to close the gap that currently exists between quantum algorithms and quantum hardware. To this end, quantum compilation techniques must scale along with the hardware constraints, shifting the current paradigm of obtaining an optimal compilation to relying on heuristics that allow for a fast solution, even though the quality of such a solution may not be optimal. Significant concerns arise as the execution time of current mapping techniques experiences a notable increase when applied to quantum computers with a high number of qubits. In this work, we present Route-Forcing, a quantum circuit mapping algorithm that shows a compilation time average speedup of 3.7× compared to the state-of-the-art scalable techniques, reducing the depth of the mapped circuit by 4.7× at the expense of adding 1.3× more SWAP gates. Moreover, the proposed mapping algorithm is adapted and tuned for what is expected to be the next generation of quantum computers, in which different processors are interconnected to increase the total number of qubits, allowing for more complex computations., Authors gratefully acknowledge funding from the European Commission through HORIZON-EIC-2022- PATHFINDEROPEN-01-101099697 (QUADRATURE) and grant HORIZON-ERC-2021-101042080 (WINC). This work has been partially supported by the Spanish Ministry of Science, Innovation and Universities through the Beatriz Galindo program 2020 (BG20-00023), by the European ERDF under grant PID2021-123627OB-C51, and by QCOMMCAT-Planes Complementarios: Comunicacion Cuantica ¿ supported by MICIN with funding from the European Union, NextGenerationEU (PRTR-C17.I1) and Generalitat de Catalunya. The first author gratefully acknowledges the Universitat Politecnica de Catalunya and Banco Santander for ` the financial support of his predoctoral FPI-UPC grant.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publication Contribución de congreso (ConferenceOutput)

Mapping quantum algorithms to multi-core quantum computing architectures

  • Ovide-González, Anabel
  • GARCIA ALMUDEVER, CARMEN|||0000-0002-3800-2357
  • Rodrigo, Santiago
  • Bandic, Medina
  • Van Someren, Hans
  • Feld, Sebastian
  • Abadal, Sergi
  • Alarcón, Eduard
[EN] Current monolithic quantum computer architectures have limited scalability. One promising approach for scaling them up is to use a modular or multi-core architecture, in which different quantum processors (cores) are connected via quantum and classical links. This new architectural design poses new challenges such as the expensive inter-core communication. To reduce these movements when executing a quantum algorithm, an efficient mapping technique is required. In this paper, a detailed critical discussion of the quantum circuit mapping problem for multi-core quantum computing architectures is provided. In addition, we further explore the performance of a mapping method, which is formulated as a partitioning over time graph problem, by performing an architectural scalability analysis., We acknowledge support from EU, grant HORIZONERC-101042080 (S.A.) and grant HORIZON-EIC-2022- PATHFINDEROPEN-01-101099697 (S.A., E.A and C.G.A.), from project PRG 946 funded by the Estonian Research Council (A.O.), from MICIIN and European ERDF under grant PID2021-123627OB-C51 (C.G.A.) and from MICIIN with funding from European Union NextGenerationEU(PRTRC17.I1) and by Generalitat de Catalunya (E.A.)
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

A data-driven approach to dataflow-aware online scheduling for graph neural network inference

  • Puigdemont Plana, Pol
  • Russo, Enrico
  • Wassington, Axel
  • Das, Abhijit
  • Abadal Cavallé, Sergi|||0000-0003-0941-0260
  • Palesi, Maurizio
Graph Neural Networks (GNNs) have shown significant promise in various domains, such as recommendation systems, bioinformatics, and network analysis. However, the irregularity of graph data poses unique challenges for efficient computation, leading to the development of specialized GNN accelerator architectures that surpass traditional CPU and GPU performance. Despite this, the structural diversity of input graphs results in varying performance across different GNN accelerators, depending on their dataflows. This variability in performance due to differing dataflows and graph properties remains largely unexplored, limiting the adaptability of GNN accelerators. To address this, we propose a data-driven framework for dataflow-aware latency prediction in GNN inference. Our approach involves training regressors to predict the latency of executing specific graphs on particular dataflows, using simulations on synthetic graphs. Experimental results indicate that our regressors can predict the optimal dataflow for a given graph with up to 91.28% accuracy and a Mean Absolute Percentage Error (MAPE) of 3.78%. Additionally, we introduce an online scheduling algorithm that uses these regressors to enhance scheduling decisions. Our experiments demonstrate that this algorithm achieves up to 3.17× speedup in mean completion time and 6.26× speedup in mean execution time compared to the best feasible baseline across all datasets., Thiswork has been (partially) supported by the Spoke 1 "FutureHPC & BigData" of the Italian Research Center on High-Performance Computing, Big Data and Quantum Computing (ICSC), as well as by the EU through the European Research Council (ERC), grant ERC-StG-2021-WINC-101042080., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

RIS-based over-the-air channel equalization in resource-constrained wireless networks

  • Prod'homme, Hugo
  • Imani, Mohammadreza
  • Abadal Cavallé, Sergi|||0000-0003-0941-0260
  • Del Hougne, Philipp
Rich scattering yields long channel impulse responses (CIRs) with many taps that thwart communications in resource-constrained wireless networks limited to simple on-off-keying: the modulation rate must be throttled to avoid inter-symbol interference. Relevant examples include Internet-of-Things (IoT) networks and wireless networks-on-chips (WNoCs). If the radio environment is parametrized by a reconfigurable intelligent surface (RIS), the RIS configuration can be optimized to tailor the CIR between selected antenna pairs and make it (almost) pulse-like despite rich scattering by judiciously engineering the interferences of the multi-bounce paths. Thereby, the channel is equalized “over the air” in the physical domain, unlike conventional pre- and/or post-coding strategies. Here, using a physics-compliant model of a RIS-parametrized rich-scattering environment, we explore how the optimal choice of the time delay at which the CIR is shaped to have its most significant tap depends on the amount of reverberation in the environment and the latter's specific geometry., S. A. acknowledges support from the EU’s Horizon Europe program through the European Research Council (ERC) under grant agreement 101042080 (WINC)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Communication characterization of AI workloads for large-scale multi-chiplet accelerators

  • Musavi, Mariam
  • Irabor, Emmanuel Onyekachukw
  • Das, Abhijit
  • Alarcón Cot, Eduardo José|||0000-0001-7663-7153
  • Abadal Cavallé, Sergi|||0000-0003-0941-0260
Next-generation artificial intelligence (AI) workloads are posing challenges of scalability and robustness in terms of execution time due to their intrinsic evolving data-intensive characteristics. In this paper, we aim to analyse the potential bottlenecks caused due to data movement characteristics of AI workloads on scale-out accelerator architectures composed of multiple chiplets. Our methodology captures the unicast and multicast communication traffic of a set of AI workloads and assesses aspects such as the time spent in such communications and the amount of multicast messages as a function of the number of employed chiplets. Our studies reveal that some AI workloads are potentially vulnerable to the dominant effects of communication, especially multicast traffic, which can become a performance bottleneck and limit their scalability. Workload profiling insights suggest to architect a flexible interconnect solution at chiplet level in order to improve the performance, efficiency and scalability of next-generation AI accelerators., Authors gratefully acknowledge funding from the European Commission through projects with GA 101042080 (WINC) and 101189474 (EWiC) and from Generalitat de Catalunya through the ICREA Academia Award 2024., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Compilation techniques for spin qubits in a shuttling bus architecture

  • Escofet i Majoral, Pau|||0000-0003-3372-1931
  • Semenov, Andrii
  • Murphy, Niall
  • Blokhina, Elena
  • Abadal Cavallé, Sergi|||0000-0003-0941-0260
  • Alarcón Cot, Eduardo José|||0000-0001-7663-7153
  • García Almudever, Carmen
In this work, we explore and propose several quantum circuit mapping strategies to optimize qubit shuttling in scalable quantum computing architectures based on silicon spin qubits. Our goal is to minimize phase errors introduced during shuttling operations while reducing the overall execution time of quantum circuits. We propose and evaluate five mapping algorithms using benchmarks from quantum algorithms. The Swap Return strategy emerged as the most robust solution, offering a superior balance between execution time and error minimization by considering future qubit interactions. Additionally, we assess the importance of initial qubit placement, demonstrating that an informed placement strategy can significantly enhance the performance of dynamic mapping approaches., This work was supported by the European Commission (QUADRATURE: HORIZON-EIC-2022-PATHFINDEROPEN-01-101099697, WINC: HORIZON-ERC-2021-101042080), the Spanish Ministry of Science, Innovation and Universities (Beatriz Galindo program 2020, BG20-00023) and European ERDF (PID2021-123627OB-C5, QCOMM-CAT-Planes Complementarios), funding from MICIN and NextGenerationEU (PRTR-C17.I1), Generalitat de Catalunya, the ICREA Academia Award 2024, Science Foundation Ireland under Grant 21/RP-2TF/10019, and the predoctoral FPI-UPC grant supported by UPC and Banco Santander., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Exploring the potential of wireless-enabled multi-chip AI accelerators

  • Irabor, Emmanuel Onyekachukw
  • Musavi, Mariam
  • Das, Abhijit
  • Abadal Cavallé, Sergi|||0000-0003-0941-0260
The insatiable appetite of Artificial Intelligence (AI) workloads for computing power is pushing the industry to develop faster and more efficient accelerators. The rigidity of custom hardware, however, conflicts with the need for scalable and versatile architectures capable of catering to the needs of the evolving and heterogeneous pool of Machine Learning (ML) models in the literature. In this context, multi-chiplet architectures assembling multiple (perhaps heterogeneous) accelerators are an appealing option that is unfortunately hindered by the still rigid and inefficient chip-to-chip interconnects. In this paper, we explore the potential of wireless technology as a complement to existing wired interconnects in this multi-chiplet approach. Using an evaluation framework from the state-of-the-art, we show that wireless interconnects can lead to speedups of 10% on average and 20% maximum. We also highlight the importance of load balancing between the wired and wireless interconnects, which will be further explored in future work., Authors gratefully acknowledge funding from the European Commission through projects with GA 101042080 (WINC) and 101189474 (EWiC)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Spatio-temporal characterization of qubit routing in connectivity-constrained quantum processors

  • Ben Rached, Sahar
  • García Almudever, Carmen
  • Alarcón Cot, Eduardo José|||0000-0001-7663-7153
  • Abadal Cavallé, Sergi|||0000-0003-0941-0260
Designing efficient quantum processor topologies is pivotal for advancing scalable quantum computing architectures. The communication overhead, a critical factor affecting the execution fidelity of quantum circuits, arises from inevitable qubit routing that brings interacting qubits into physical proximity by the means of serial SWAP gates to enable the direct two-qubit gate application. Characterizing the qubit movement across the processor is crucial for tailoring techniques for minimizing the SWAP gates. This work presents a comparative analysis of the resulting communication overhead among three processor topologies: star, heavy-hexagon lattice, and square lattice topologies, according to performance metrics of communication-to-computation ratio, mean qubit hotspotness, and temporal burstiness, showcasing that the square lattice layout is favourable for quantum computer architectures at a scale., Authors gratefully acknowledge funding from the European Commission through HORIZON-EIC-2022-PATHFINDEROPEN-01-101099697 (QUADRATURE) and grant HORIZON-ERC-2021-101042080 (WINC)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Accurate and scalable simulation of cavity-based networks in modular quantum architectures

  • Ben Rached, Sahar
  • Sun, Zezhou
  • Long, Guilu
  • Rodrigo Muñoz, Santiago
  • García Almudever, Carmen
  • Alarcón Cot, Eduardo José|||0000-0001-7663-7153
  • Abadal Cavallé, Sergi|||0000-0003-0941-0260
Cavity-mediated interconnects are a promising platform for scaling modular quantum computers by enabling highfidelity inter-chip quantum state transmission and entanglement generation. In this work, we first model the dynamics of deterministic inter-chip quantum state transfer using the Stimulated Raman Adiabatic Passage (STIRAP) protocol, analyzing fidelity loss mechanisms under experimentally achievable qubitcavity coupling and decoherence parameters. We then extend the NetSquid simulator, typically used for simulating longrange quantum communication networks, to support cavity-based communication channels for mediating inter-chip state transfer and entanglement generation. We model cavities as amplitude damping channels parameterized by physical system characteristics; cavity decay rate ¿ and qubit-cavity coupling strength g, and analyze the impact of intrinsic qubit decoherence factors dictated by T1 and T2 times. Our simulations accurately represent the system's dynamics in both strong and weak coupling regimes, and identify critical trade-offs between fidelity, latency, and noise factors. The proposed framework supports faithful modeling and scalable simulation of modular architectures, and provides insights into design optimization for practical quantum network implementations., We gratefully acknowledge funding from the European Commission through HORIZON-EIC-2022-PATHFINDEROPEN01-101099697 (QUADRATURE) and grant HORIZON-ERC-2021- 101042080 (WINC). Authors acknowledge support from the QCOMMCAT-Planes Complementarios: Comunicación Cuántica - supported by MICIN with funding from the European Union, NextGenerationEU (PRTRC17.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)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Collective communication patterns using time-reversal terahertz links at the chip scale

  • Rodríguez Galán, Fátima Yolanda
  • Ama Bandara, Paveena
  • de Santana, Elana Pereira
  • Bolívar, Peter Haring
  • Alarcón Cot, Eduardo José|||0000-0001-7663-7153
  • Abadal Cavallé, Sergi|||0000-0003-0941-0260
Wireless communications in the terahertz band have been recently proposed as complement to conventional wired interconnects within computing packages. Such environments are typically highly reverberant, hence showing long channel impulse responses and severely limiting the achievable rates. Fortunately, this communications scenario is static and can be pre-characterized, which opens the door to techniques such as time reversal. Time reversal acts a spatial matched filter and has a spatiotemporal focusing effect, which allows not only to increase the achievable symbol rates, but also to create multiple spatial channels. In this paper, the multi-user capability of time reversal is explored in the context of wireless communications in the terahertz band within a computing package. Full-wave simulations are carried out to validate the approach, whereas modulation streams are simulated to evaluate the error rate as a function of the transmitted power, symbol rate, and number of simultaneous transmissions., Authors acknowledge support from the European Union’s Horizon 2020 research and innovation program, grant agreement 863337 (WiPLASH), the European Research Council (ERC) under grant agreement 101042080 (WINC) as well as the European Innovation Council (EIC) PATHFINDER scheme, grant agreement No 101099697 (QUADRATURE)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Multi-channel medium access control protocols for wireless networks within computing packages

  • Ollé Ferrayuoli, Bernat
  • Talarn Bell-lloch, Pau
  • Cabellos Aparicio, Alberto|||0000-0001-9329-7584
  • Lemic, Filip
  • Alarcón Cot, Eduardo José|||0000-0001-7663-7153
  • Abadal Cavallé, Sergi|||0000-0003-0941-0260
Wireless communications at the chip scale emerge as a interesting complement to traditional wire-based approaches thanks to their low latency, inherent broadcast nature, and capacity to bypass pin constraints. However, as current trends push towards massive and bandwidth-hungry processor architectures, there is a need for wireless chip-scale networks that exploit and share as many channels as possible. In this context, this work addresses the issue of channel sharing by exploring the design space of multi-channel Medium Access Control (MAC) protocols for chip-scale networks. Distinct channel assignment strategies for both random access and token passing are presented and evaluated under realistic traffic patterns. It is shown that, even with the improvements enabled by the multiple channels, both protocols maintain their intrinsic advantages and disadvantages., This work is supported by the European Commission under H2020 grant WiPLASH (GA 863337) and HE grant WINC (GA 101042080)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Frequency-dependent power consumption modeling of CMOS transmitters for WNoC architectures

  • Shahmoradi, Mohammad|||0000-0002-5990-1992
  • Tokgöz, Korkut Kaan
  • Alarcón Cot, Eduardo José|||0000-0001-7663-7153
  • Abadal Cavallé, Sergi|||0000-0003-0941-0260
Wireless Network-on-Chip (WNoC) systems, which wirelessly interconnect the chips of a computing system, have been proposed as a complement to existing chip-to-chip wired links. However, their feasibility depends on the availability of custom-designed high-speed, tiny, ultra-efficient transceivers. This represents a challenge due to the tradeoffs between bandwidth, area, and energy efficiency that are found as frequency increases, which suggests that there is an optimal frequency region. To aid in the search for such an optimal design point, this paper presents a behavioral model that quantifies the expected power consumption of oscillators, mixers, and power amplifiers as a function of frequency. The model is built on extensive surveys of the respective sub-blocks, all based on experimental data. By putting together the models of the three sub-blocks, a comprehensive power model is obtained, which will aid in selecting optimal operating frequency for WNoC systems., The authors acknowledge support from the European Commission through grants HORIZON EIC 2022 PATHFINDEROPEN 01-101099697 (QUADRATURE), HORIZON ERC 2021-101042080 (WINC), and HORIZON MSCA 2022-PF-101062272 (ENSPEC6G), and from TUBITAK through grant 121C073., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Benchmarking emerging cavity-mediated quantum interconnect technologies for modular quantum computers

  • Ben Rached, Sahar
  • Navarro Reyes, Sergio
  • Khan, Junaid
  • García Almudever, Carmen
  • Alarcón Cot, Eduardo José|||0000-0001-7663-7153
  • Abadal Cavallé, Sergi|||0000-0003-0941-0260
Modularity is a promising approach for scaling up quantum computers and, therefore, integrating higher qubit counts. The essence of such architectures lies in their reliance on high-¿delity and fast quantum state transfers enabled by generating entanglement between chips. In addressing the challenge of implementing quantum coherent communication channels to interconnect quantum processors, various techniques have been proposed to account for qubit technology specifications and the implemented communication protocol. By employing DesignSpace Exploration (DSE) methodologies, this work presents a comparative analysis of cavity-mediated interconnect technologies according to a defined figure of merit. We identify the configurations related to the cavity and atomic decay rates, as well as the qubit-cavity coupling strength, that meet the efficiency thresholds. We therefore contribute to benchmarking contemporary cavity-mediated quantum interconnects and guide the development of reliable and scalable chip-to-chip links for modular quantum computers., We 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: Comunicación Cuántica - 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)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Interconnect fabrics for multi-core quantum processors: a context analysis

  • Escofet i Majoral, Pau|||0000-0003-3372-1931
  • Ben Rached, Sahar
  • Rodrigo Muñoz, Santiago
  • García Almudever, Carmen
  • Alarcón Cot, Eduardo José|||0000-0001-7663-7153
  • Abadal Cavallé, Sergi|||0000-0003-0941-0260
Quantum computing has revolutionized the field of computer science with its extraordinary ability to handle classically intractable problems. To realize its potential, however, quantum computers need to scale to millions of qubits, a feat that will require addressing fascinating yet extremely challenging interconnection problems. In this paper, we provide a context analysis of the nascent quantum computing field from the perspective of communications, with the aim of encouraging the on-chip networks community to contribute and pave the way for truly scalable quantum computers in the decades to come., Authors acknowledge support from the European Research Council (ERC) under GA 101042080 (WINC) and the European Innovation Council (EIC) Pathfinder scheme, GA 101099697 (QUADRATURE)., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Scalable multi-chip quantum architectures enabled by cryogenic hybrid wireless/quantum-coherent network-in-package

  • Alarcón Cot, Eduardo José|||0000-0001-7663-7153
  • Abadal Cavallé, Sergi|||0000-0003-0941-0260
  • Sebastiano, Fabio
  • Babaie, Masoud
  • Charbon, Edoardo
  • Bolívar, Peter Haring
  • Palesi, Maurizio
  • Blokhina, Elena
  • Leipold, Dirk
  • Staszewski, Bogdan
  • García Sáez, Artur
  • García Almudever, Carmen
The grand challenge of scaling up quantum computers requires a full-stack architectural standpoint. In this position paper, we will present the vision of a new generation of scalable quantum computing architectures featuring distributed quantum cores (Qcores) interconnected via quantum-coherent qubit state transfer links and orchestrated via an integrated wireless interconnect., All authors acknowledge support from the EU, grant HORIZON-ERC-101042080 and grant HORIZON-EIC-2022-PATHFINDEROPEN-01-101099697, QUADRATURE., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Contribución de congreso (ConferenceOutput)

Mapping quantum circuits to modular architectures with QUBO

  • Bandic, Medina
  • Prielinger, Luise
  • Nüßlein, Jonas
  • Ovide González, Anabel
  • Rodrigo Muñoz, Santiago
  • Abadal Cavallé, Sergi|||0000-0003-0941-0260
  • van Someren, Hans
  • Vardoyan, Gayane
  • Alarcón Cot, Eduardo José|||0000-0001-7663-7153
  • García Almudever, Carmen
  • Feld, Sebastian
Modular quantum computing architectures are a promising alternative to monolithic QPU (Quantum Processing Unit) designs for scaling up quantum devices. They refer to a set of interconnected QPUs or cores consisting of tightly coupled quantum bits that can communicate via quantum-coherent and classical links. In multi-core architectures, it is crucial to minimize the amount of communication between cores when executing an algorithm. Therefore, mapping a quantum circuit onto a modular architecture involves finding an optimal assignment of logical qubits (qubits in the quantum circuit) to different cores with the aim to minimize the number of expensive inter-core operations while adhering to given hardware constraints. In this paper, we propose for the first time a Quadratic Unconstrained Binary Optimization (QUBO) technique to encode the problem and the solution for both qubit allocation and inter-core communication costs in binary decision variables. To this end, the quantum circuit is split into slices, and qubit assignment is formulated as a graph partitioning problem for each circuit slice. The costly inter-core communication is reduced by penalizing inter-core qubit communications. The final solution is obtained by minimizing the overall cost across all circuit slices. To evaluate the effectiveness of our approach, we conduct a detailed analysis using a representative set of benchmarks having a high number of qubits on two different multi-core architectures. Our method showed promising results and performed exceptionally well with very dense and highly-parallelized circuits that require on average 0.78 inter-core communications per two-qubit gate., MB and SF would like to acknowledge funding from Intel Corporation. EA and CGA acknowledge support from the EU, grant HORIZON-EIC-2022-PATHFINDEROPEN-01-101099697 (QUADRATURE). SA acknowledges support from the EU, grant HORIZON-ERC-2021-101042080 (WINC) and GV acknoledges support from NWO QSC grant BGR2 17.269, Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

RIS-based over-the-air channel equalization in resource-constrained wireless networks

  • Prod'homme, Hugo
  • Imani, Mohammadreza
  • Abadal Cavallé, Sergi
  • Del Hougne, Philipp
Rich scattering yields long channel impulse responses (CIRs) with many taps that thwart communications in resource-constrained wireless networks limited to simple on-off-keying: the modulation rate must be throttled to avoid inter-symbol interference. Relevant examples include Internet-of-Things (IoT) networks and wireless networks-on-chips (WNoCs). If the radio environment is parametrized by a reconfigurable intelligent surface (RIS), the RIS configuration can be optimized to tailor the CIR between selected antenna pairs and make it (almost) pulse-like despite rich scattering by judiciously engineering the interferences of the multi-bounce paths. Thereby, the channel is equalized “over the air” in the physical domain, unlike conventional pre- and/or post-coding strategies. Here, using a physics-compliant model of a RIS-parametrized rich-scattering environment, we explore how the optimal choice of the time delay at which the CIR is shaped to have its most significant tap depends on the amount of reverberation in the environment and the latter's specific geometry., S. A. acknowledges support from the EU’s Horizon Europe program through the European Research Council (ERC) under grant agreement 101042080 (WINC)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

A data-driven approach to dataflow-aware online scheduling for graph neural network inference

  • Puigdemont Plana, Pol
  • Russo, Enrico
  • Wassington, Axel
  • Das, Abhijit
  • Abadal Cavallé, Sergi
  • Palesi, Maurizio
Graph Neural Networks (GNNs) have shown significant promise in various domains, such as recommendation systems, bioinformatics, and network analysis. However, the irregularity of graph data poses unique challenges for efficient computation, leading to the development of specialized GNN accelerator architectures that surpass traditional CPU and GPU performance. Despite this, the structural diversity of input graphs results in varying performance across different GNN accelerators, depending on their dataflows. This variability in performance due to differing dataflows and graph properties remains largely unexplored, limiting the adaptability of GNN accelerators. To address this, we propose a data-driven framework for dataflow-aware latency prediction in GNN inference. Our approach involves training regressors to predict the latency of executing specific graphs on particular dataflows, using simulations on synthetic graphs. Experimental results indicate that our regressors can predict the optimal dataflow for a given graph with up to 91.28% accuracy and a Mean Absolute Percentage Error (MAPE) of 3.78%. Additionally, we introduce an online scheduling algorithm that uses these regressors to enhance scheduling decisions. Our experiments demonstrate that this algorithm achieves up to 3.17× speedup in mean completion time and 6.26× speedup in mean execution time compared to the best feasible baseline across all datasets., Thiswork has been (partially) supported by the Spoke 1 "FutureHPC & BigData" of the Italian Research Center on High-Performance Computing, Big Data and Quantum Computing (ICSC), as well as by the EU through the European Research Council (ERC), grant ERC-StG-2021-WINC-101042080., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Communication characterization of AI workloads for large-scale multi-chiplet accelerators

  • Musavi, Mariam
  • Irabor, Emmanuel Onyekachukw
  • Das, Abhijit
  • Alarcón Cot, Eduardo José
  • Abadal Cavallé, Sergi
Next-generation artificial intelligence (AI) workloads are posing challenges of scalability and robustness in terms of execution time due to their intrinsic evolving data-intensive characteristics. In this paper, we aim to analyse the potential bottlenecks caused due to data movement characteristics of AI workloads on scale-out accelerator architectures composed of multiple chiplets. Our methodology captures the unicast and multicast communication traffic of a set of AI workloads and assesses aspects such as the time spent in such communications and the amount of multicast messages as a function of the number of employed chiplets. Our studies reveal that some AI workloads are potentially vulnerable to the dominant effects of communication, especially multicast traffic, which can become a performance bottleneck and limit their scalability. Workload profiling insights suggest to architect a flexible interconnect solution at chiplet level in order to improve the performance, efficiency and scalability of next-generation AI accelerators., Authors gratefully acknowledge funding from the European Commission through projects with GA 101042080 (WINC) and 101189474 (EWiC) and from Generalitat de Catalunya through the ICREA Academia Award 2024., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Accurate and scalable simulation of cavity-based networks in modular quantum architectures

  • Ben Rached, Sahar
  • Sun, Zezhou
  • Long, Guilu
  • Rodrigo Muñoz, Santiago
  • García Almudever, Carmen
  • Alarcón Cot, Eduardo José
  • Abadal Cavallé, Sergi
Cavity-mediated interconnects are a promising platform for scaling modular quantum computers by enabling highfidelity inter-chip quantum state transmission and entanglement generation. In this work, we first model the dynamics of deterministic inter-chip quantum state transfer using the Stimulated Raman Adiabatic Passage (STIRAP) protocol, analyzing fidelity loss mechanisms under experimentally achievable qubitcavity coupling and decoherence parameters. We then extend the NetSquid simulator, typically used for simulating longrange quantum communication networks, to support cavity-based communication channels for mediating inter-chip state transfer and entanglement generation. We model cavities as amplitude damping channels parameterized by physical system characteristics; cavity decay rate ¿ and qubit-cavity coupling strength g, and analyze the impact of intrinsic qubit decoherence factors dictated by T1 and T2 times. Our simulations accurately represent the system's dynamics in both strong and weak coupling regimes, and identify critical trade-offs between fidelity, latency, and noise factors. The proposed framework supports faithful modeling and scalable simulation of modular architectures, and provides insights into design optimization for practical quantum network implementations., We gratefully acknowledge funding from the European Commission through HORIZON-EIC-2022-PATHFINDEROPEN01-101099697 (QUADRATURE) and grant HORIZON-ERC-2021- 101042080 (WINC). Authors acknowledge support from the QCOMMCAT-Planes Complementarios: Comunicación Cuántica - supported by MICIN with funding from the European Union, NextGenerationEU (PRTRC17.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)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Collective communication patterns using time-reversal terahertz links at the chip scale

  • Rodríguez Galán, Fátima Yolanda
  • Ama Bandara, Paveena
  • de Santana, Elana Pereira
  • Bolívar, Peter Haring
  • Alarcón Cot, Eduardo José
  • Abadal Cavallé, Sergi
Wireless communications in the terahertz band have been recently proposed as complement to conventional wired interconnects within computing packages. Such environments are typically highly reverberant, hence showing long channel impulse responses and severely limiting the achievable rates. Fortunately, this communications scenario is static and can be pre-characterized, which opens the door to techniques such as time reversal. Time reversal acts a spatial matched filter and has a spatiotemporal focusing effect, which allows not only to increase the achievable symbol rates, but also to create multiple spatial channels. In this paper, the multi-user capability of time reversal is explored in the context of wireless communications in the terahertz band within a computing package. Full-wave simulations are carried out to validate the approach, whereas modulation streams are simulated to evaluate the error rate as a function of the transmitted power, symbol rate, and number of simultaneous transmissions., Authors acknowledge support from the European Union’s Horizon 2020 research and innovation program, grant agreement 863337 (WiPLASH), the European Research Council (ERC) under grant agreement 101042080 (WINC) as well as the European Innovation Council (EIC) PATHFINDER scheme, grant agreement No 101099697 (QUADRATURE)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Multi-channel medium access control protocols for wireless networks within computing packages

  • Ollé Ferrayuoli, Bernat
  • Talarn Bell-lloch, Pau
  • Cabellos Aparicio, Alberto
  • Lemic, Filip
  • Alarcón Cot, Eduardo José
  • Abadal Cavallé, Sergi
Wireless communications at the chip scale emerge as a interesting complement to traditional wire-based approaches thanks to their low latency, inherent broadcast nature, and capacity to bypass pin constraints. However, as current trends push towards massive and bandwidth-hungry processor architectures, there is a need for wireless chip-scale networks that exploit and share as many channels as possible. In this context, this work addresses the issue of channel sharing by exploring the design space of multi-channel Medium Access Control (MAC) protocols for chip-scale networks. Distinct channel assignment strategies for both random access and token passing are presented and evaluated under realistic traffic patterns. It is shown that, even with the improvements enabled by the multiple channels, both protocols maintain their intrinsic advantages and disadvantages., This work is supported by the European Commission under H2020 grant WiPLASH (GA 863337) and HE grant WINC (GA 101042080)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Spatio-temporal characterization of qubit routing in connectivity-constrained quantum processors

  • Ben Rached, Sahar
  • García Almudever, Carmen
  • Alarcón Cot, Eduardo José
  • Abadal Cavallé, Sergi
Designing efficient quantum processor topologies is pivotal for advancing scalable quantum computing architectures. The communication overhead, a critical factor affecting the execution fidelity of quantum circuits, arises from inevitable qubit routing that brings interacting qubits into physical proximity by the means of serial SWAP gates to enable the direct two-qubit gate application. Characterizing the qubit movement across the processor is crucial for tailoring techniques for minimizing the SWAP gates. This work presents a comparative analysis of the resulting communication overhead among three processor topologies: star, heavy-hexagon lattice, and square lattice topologies, according to performance metrics of communication-to-computation ratio, mean qubit hotspotness, and temporal burstiness, showcasing that the square lattice layout is favourable for quantum computer architectures at a scale., Authors gratefully acknowledge funding from the European Commission through HORIZON-EIC-2022-PATHFINDEROPEN-01-101099697 (QUADRATURE) and grant HORIZON-ERC-2021-101042080 (WINC)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Exploring the potential of wireless-enabled multi-chip AI accelerators

  • Irabor, Emmanuel Onyekachukw
  • Musavi, Mariam
  • Das, Abhijit
  • Abadal Cavallé, Sergi
The insatiable appetite of Artificial Intelligence (AI) workloads for computing power is pushing the industry to develop faster and more efficient accelerators. The rigidity of custom hardware, however, conflicts with the need for scalable and versatile architectures capable of catering to the needs of the evolving and heterogeneous pool of Machine Learning (ML) models in the literature. In this context, multi-chiplet architectures assembling multiple (perhaps heterogeneous) accelerators are an appealing option that is unfortunately hindered by the still rigid and inefficient chip-to-chip interconnects. In this paper, we explore the potential of wireless technology as a complement to existing wired interconnects in this multi-chiplet approach. Using an evaluation framework from the state-of-the-art, we show that wireless interconnects can lead to speedups of 10% on average and 20% maximum. We also highlight the importance of load balancing between the wired and wireless interconnects, which will be further explored in future work., Authors gratefully acknowledge funding from the European Commission through projects with GA 101042080 (WINC) and 101189474 (EWiC)., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Frequency-dependent power consumption modeling of CMOS transmitters for WNoC architectures

  • Shahmoradi, Mohammad
  • Tokgöz, Korkut Kaan
  • Alarcón Cot, Eduardo José
  • Abadal Cavallé, Sergi
Wireless Network-on-Chip (WNoC) systems, which wirelessly interconnect the chips of a computing system, have been proposed as a complement to existing chip-to-chip wired links. However, their feasibility depends on the availability of custom-designed high-speed, tiny, ultra-efficient transceivers. This represents a challenge due to the tradeoffs between bandwidth, area, and energy efficiency that are found as frequency increases, which suggests that there is an optimal frequency region. To aid in the search for such an optimal design point, this paper presents a behavioral model that quantifies the expected power consumption of oscillators, mixers, and power amplifiers as a function of frequency. The model is built on extensive surveys of the respective sub-blocks, all based on experimental data. By putting together the models of the three sub-blocks, a comprehensive power model is obtained, which will aid in selecting optimal operating frequency for WNoC systems., The authors acknowledge support from the European Commission through grants HORIZON EIC 2022 PATHFINDEROPEN 01-101099697 (QUADRATURE), HORIZON ERC 2021-101042080 (WINC), and HORIZON MSCA 2022-PF-101062272 (ENSPEC6G), and from TUBITAK through grant 121C073., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Mapping quantum circuits to modular architectures with QUBO

  • Bandic, Medina
  • Prielinger, Luise
  • Nüßlein, Jonas
  • Ovide González, Anabel
  • Rodrigo Muñoz, Santiago
  • Abadal Cavallé, Sergi
  • van Someren, Hans
  • Vardoyan, Gayane
  • Alarcón Cot, Eduardo José
  • García Almudever, Carmen
  • Feld, Sebastian
Modular quantum computing architectures are a promising alternative to monolithic QPU (Quantum Processing Unit) designs for scaling up quantum devices. They refer to a set of interconnected QPUs or cores consisting of tightly coupled quantum bits that can communicate via quantum-coherent and classical links. In multi-core architectures, it is crucial to minimize the amount of communication between cores when executing an algorithm. Therefore, mapping a quantum circuit onto a modular architecture involves finding an optimal assignment of logical qubits (qubits in the quantum circuit) to different cores with the aim to minimize the number of expensive inter-core operations while adhering to given hardware constraints. In this paper, we propose for the first time a Quadratic Unconstrained Binary Optimization (QUBO) technique to encode the problem and the solution for both qubit allocation and inter-core communication costs in binary decision variables. To this end, the quantum circuit is split into slices, and qubit assignment is formulated as a graph partitioning problem for each circuit slice. The costly inter-core communication is reduced by penalizing inter-core qubit communications. The final solution is obtained by minimizing the overall cost across all circuit slices. To evaluate the effectiveness of our approach, we conduct a detailed analysis using a representative set of benchmarks having a high number of qubits on two different multi-core architectures. Our method showed promising results and performed exceptionally well with very dense and highly-parallelized circuits that require on average 0.78 inter-core communications per two-qubit gate., MB and SF would like to acknowledge funding from Intel Corporation. EA and CGA acknowledge support from the EU, grant HORIZON-EIC-2022-PATHFINDEROPEN-01-101099697 (QUADRATURE). SA acknowledges support from the EU, grant HORIZON-ERC-2021-101042080 (WINC) and GV acknoledges support from NWO QSC grant BGR2 17.269, Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Interconnect fabrics for multi-core quantum processors: a context analysis

  • Escofet i Majoral, Pau
  • Ben Rached, Sahar
  • Rodrigo Muñoz, Santiago
  • García Almudever, Carmen
  • Alarcón Cot, Eduardo José
  • Abadal Cavallé, Sergi
Quantum computing has revolutionized the field of computer science with its extraordinary ability to handle classically intractable problems. To realize its potential, however, quantum computers need to scale to millions of qubits, a feat that will require addressing fascinating yet extremely challenging interconnection problems. In this paper, we provide a context analysis of the nascent quantum computing field from the perspective of communications, with the aim of encouraging the on-chip networks community to contribute and pave the way for truly scalable quantum computers in the decades to come., Authors acknowledge support from the European Research Council (ERC) under GA 101042080 (WINC) and the European Innovation Council (EIC) Pathfinder scheme, GA 101099697 (QUADRATURE)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Compilation techniques for spin qubits in a shuttling bus architecture

  • Escofet i Majoral, Pau
  • Semenov, Andrii
  • Murphy, Niall
  • Blokhina, Elena
  • Abadal Cavallé, Sergi
  • Alarcón Cot, Eduardo José
  • García Almudever, Carmen
In this work, we explore and propose several quantum circuit mapping strategies to optimize qubit shuttling in scalable quantum computing architectures based on silicon spin qubits. Our goal is to minimize phase errors introduced during shuttling operations while reducing the overall execution time of quantum circuits. We propose and evaluate five mapping algorithms using benchmarks from quantum algorithms. The Swap Return strategy emerged as the most robust solution, offering a superior balance between execution time and error minimization by considering future qubit interactions. Additionally, we assess the importance of initial qubit placement, demonstrating that an informed placement strategy can significantly enhance the performance of dynamic mapping approaches., This work was supported by the European Commission (QUADRATURE: HORIZON-EIC-2022-PATHFINDEROPEN-01-101099697, WINC: HORIZON-ERC-2021-101042080), the Spanish Ministry of Science, Innovation and Universities (Beatriz Galindo program 2020, BG20-00023) and European ERDF (PID2021-123627OB-C5, QCOMM-CAT-Planes Complementarios), funding from MICIN and NextGenerationEU (PRTR-C17.I1), Generalitat de Catalunya, the ICREA Academia Award 2024, Science Foundation Ireland under Grant 21/RP-2TF/10019, and the predoctoral FPI-UPC grant supported by UPC and Banco Santander., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Benchmarking emerging cavity-mediated quantum interconnect technologies for modular quantum computers

  • Ben Rached, Sahar
  • Navarro Reyes, Sergio
  • Khan, Junaid
  • García Almudever, Carmen
  • Alarcón Cot, Eduardo José
  • Abadal Cavallé, Sergi
Modularity is a promising approach for scaling up quantum computers and, therefore, integrating higher qubit counts. The essence of such architectures lies in their reliance on high-¿delity and fast quantum state transfers enabled by generating entanglement between chips. In addressing the challenge of implementing quantum coherent communication channels to interconnect quantum processors, various techniques have been proposed to account for qubit technology specifications and the implemented communication protocol. By employing DesignSpace Exploration (DSE) methodologies, this work presents a comparative analysis of cavity-mediated interconnect technologies according to a defined figure of merit. We identify the configurations related to the cavity and atomic decay rates, as well as the qubit-cavity coupling strength, that meet the efficiency thresholds. We therefore contribute to benchmarking contemporary cavity-mediated quantum interconnects and guide the development of reliable and scalable chip-to-chip links for modular quantum computers., We 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: Comunicación Cuántica - 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)., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publication Contribución de congreso (ConferenceOutput)

Scalable multi-chip quantum architectures enabled by cryogenic hybrid wireless/quantum-coherent network-in-package

  • Alarcón Cot, Eduardo José
  • Abadal Cavallé, Sergi
  • Sebastiano, Fabio
  • Babaie, Masoud
  • Charbon, Edoardo
  • Bolívar, Peter Haring
  • Palesi, Maurizio
  • Blokhina, Elena
  • Leipold, Dirk
  • Staszewski, Bogdan
  • García Sáez, Artur
  • García Almudever, Carmen
The grand challenge of scaling up quantum computers requires a full-stack architectural standpoint. In this position paper, we will present the vision of a new generation of scalable quantum computing architectures featuring distributed quantum cores (Qcores) interconnected via quantum-coherent qubit state transfer links and orchestrated via an integrated wireless interconnect., All authors acknowledge support from the EU, grant HORIZON-ERC-101042080 and grant HORIZON-EIC-2022-PATHFINDEROPEN-01-101099697, QUADRATURE., Peer Reviewed, Postprint (author's final draft)