Skip to main content

Resultados relacionados

Resultados totales (Incluyendo duplicados): 4
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)

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
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)

On the use of calibration data in error-aware compilation techniques for NISQ devices

  • Kurniawan, Handy
  • Cuomo, Daniele
  • Garcia Herrero, Francisco
  • Rodríguez-Soriano, Laura|||0000-0002-2074-0466
  • GARCIA ALMUDEVER, CARMEN|||0000-0002-3800-2357
[EN] Reliably executing quantum algorithms on noisy intermediate-scale quantum (NISQ) devices is challenging, as they are severely constrained and prone to errors. Efficient quantum circuit compilation techniques are therefore crucial for overcoming their limitations and dealing with their high error rates. These techniques consider the quantum hardware restrictions, such as the limited qubit connectivity, and perform some transformations to the original circuit that can be executed on a given quantum processor. Certain compilation methods use error information based on calibration data to further improve the success probability or the fidelity of the circuit to be run. However, it is uncertain to what extent incorporating calibration information in the compilation process can enhance the circuit performance. For instance, considering the most recent error data provided by vendors after calibrating the processor might not be functional enough as quantum systems are subject to drift, making the latest calibration data obsolete within minutes. In this paper, we explore how different usage of calibration data impacts the circuit fidelity, by using several compilation techniques and quantum processors (IBM Perth and Brisbane). To this aim, we implemented a framework that incorporates some of the state-of-the-art noise-aware and non-noise-aware compilation techniques and allows the user to perform fair comparisons under similar processor conditions. Our experiments yield valuable insights into the effects of noise-aware methodologies and the employment of calibration data. The main finding is that pre-processing historical calibration data can improve fidelity when real-time calibration data is not available due to factors such as cloud service latency and waiting queues between compilation and execution on the quantum backend., This work is supported by the QuantERA grant EQUIP with the grant numbers PCI2022-133004 and PCI2022- 132922, funded by Agencia Estatal de Investigacion, Ministerio de Ciencia e Innovacion, Gobierno de España, MCIN/AEI/10.13039/501100011033, and by the European Union NextGenerationEU/PRTR . 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. 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.