Pasar al contenido principal

ERROR CORRECTION FOR QUANTUM INFORMATION PROCESSING

PCI2022-133004

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal para Afrontar las Prioridades de Nuestro Entorno
Subprograma Subprograma Estatal de Internacionalización
Convocatoria Proyectos Programación Conjunta Internacional
Año convocatoria 2022
Plan Estatal 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSITAT POLITÈCNICA DE VALÈNCIA

Resultados relacionados

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

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

An accurate and efficient analytical model of fidelity under depolarizing noise oriented to large scale quantum system design

  • Escofet, Pau
  • Rodrigo, Santiago
  • García-Sáez, Artur
  • Alarcón, Eduard
  • Abadal, Sergi
  • GARCIA ALMUDEVER, CARMEN|||0000-0002-3800-2357
[EN] Fidelity is one of the most valuable and commonly used metrics for assessing the performance of quantum circuits on error-prone quantum processors. Several approaches have been proposed to estimate circuit fidelity without executing it on quantum hardware, but they often face limitations in scalability or accuracy. In this work, we present a comprehensive theoretical framework to predict the fidelity of quantum circuits under depolarizing noise. Building on theoretical results, we propose an efficient fidelity estimation algorithm based on device calibration data. The method is thoroughly validated through simulation and execution on real hardware, demonstrating improved accuracy compared to state-of-the-art alternatives, with enhancements in prediction R2 ranging from 4.96% to 213.54%. The proposed approach provides a scalable and practical tool for benchmarking quantum hardware, comparing quantum software techniques such as compilation methods, obtaining computation bounds for quantum systems, and guiding hardware design decisions, making it a critical resource for developing and evaluating quantum computing technologies., This work was supported by the European Commission (QUADRATURE: 101099697, WINC: 101042080), MCIN and NextGenerationEU (QCOMM-CAT), Project PCI2022-133004 funded by MCIN/AEI/10.13039/501100011033, by 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, and by the European Union NextGenerationEU/PRTR, and the ICREA Academia Award 2024. P.E. acknowledges support from an FPI-UPC grant funded by UPC and Banco Santander.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Synthesizing an optimal spin-qubit shuttling-bus architecture for the surface code

  • Escofet, Pau
  • Alarcon, Eduard
  • Abadal, S
  • Semenov, Andrii
  • Murphy, Niall
  • Blokhina, Elena
  • GARCIA ALMUDEVER, CARMEN|||0000-0002-3800-2357
[EN] As quantum computers scale toward millions of physical qubits, it becomes essential to robustly encode individual logical qubits to ensure fault tolerance under realistic noise. A high-quality foundational encoding allows future compilation techniques and heuristics to build on optimal or near-optimal layouts, improving scalability and error resilience. In this work, we synthesize a one-dimensional shuttling-bus architecture for the rotated surface code, leveraging coherent spin-qubit shuttling, following a methodology we name quantum reverse mapping. We formulate a mixed-integer optimization model that yields optimal solutions with relatively low execution time for small code distances, and propose a scalable heuristic that matches optimal results while maintaining linear computational complexity. We evaluate the synthesized architecture using architectural metrics, such as shuttling distance and cycle time, and full quantum simulations under realistic noise models, showing that the proposed design can sustain logical error rates as low as 2 & times; 10-10 per round at code distance 21, showcasing its feasibility for scalable quantum error correction in spin-based quantum processors., Authors acknowledge funding from the EC through Grant No. HORIZON-EIC-2022-PATHFINDEROPEN-01-101099697 (QUADRATURE) . E.A. acknowledges funding from the Spanish Ministry of Science, Innovation, and Universities and European ERDF (QCOMM-CAT-Planes Complementarios) , Generalitat de Catalunya, and ICREA Academia Grant 2024. S.A. acknowledges funding from the EC through Grant No. HORIZON-ERC-2021-101042080 (WINC) . E.B. acknowledges funding from Science Foundation Ireland under Grant No. 21/RP-2TF/10019. C.G.A. acknowledges funding from QuantERA EQUIP Grant No.PCI2022-133004, funded by Agencia Estatal de Investigacion, Ministerio de Ciencia e Innovacion, Gobierno de Espana, Project No. MCIN/AEI/10.13039/501100011033, from the European Union NextGenerationEU/PRTR, and from the Spanish Ministry of Science, Innovation, and Universities and European ERDF under Grants No. PID2021-123627OB-C51 and No. PID2024-158682OB-C31. P.E. acknowledges funding from the predoctoral FPI-UPC grant supported by UPC and Banco Santander.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Population annealing with topological defect driven nonlocal updates for spin systems with quenched disorder

  • Cirauqui, David
  • Saavedra, J.R.M.
  • Lewenstein, Maciej
  • Grzybowski, Przemyslaw R.
  • Garcia March, Miguel Angel|||0000-0001-7092-838X
[EN] Population annealing, one of the currently state-of-the-art algorithms for solving spin -glass systems, sometimes finds hard disorder instances for which its equilibration quality at each temperature step is severely damaged. In such cases, therefore, one cannot be sure about having reached the true ground state without vastly increasing the computational resources. In this work, we seek to overcome this problem by proposing a quantum -inspired modification of population annealing. Here we focus on the three-dimensional random plaquette gauge model, whose ground -state energy problem seems to be much harder to solve than that of the standard spin -glass Edwards -Anderson model. In analogy to the toric code, by allowing single bond flips we let the system explore nonphysical states, effectively expanding the configurational space by introducing topological defects that are then annealed through an additional field parameter. The dynamics of these defects allow for the effective realization of nonlocal cluster moves, potentially easing the equilibration process. We study the performance of this method in three-dimensional random plaquette gauge model lattices of various sizes, and we compare it against population annealing. With that we conclude that the newly introduced nonlocal moves are able to improve the equilibration of the lattices, in some cases being superior to a normal population annealing algorithm with a computational resource investment that is 16 times higher., D.C. and P.R.G. would like to thank H. Katzgraber and J. Machta for illuminating discussion and comments that helped to improve the manuscript. D.C. acknowledges funding from Generalitat de Catalunya (AGAUR Doctorats Industrials 2019, 2n termini) . ICFO group acknowledges support from ERC AdG NOQIA; Ministerio de Ciencia y Innovation Agencia Estatal de Investigaciones (PGC2018-097027-B-I00/10.13039/501100011033, CEX2019-000910-S/10.13039/501100011033, Plan National FIDEUA PID2019-106901GB-I00, FPI, QUANTERA MAQS PCI2019-111828-2, QUANTERA DYNAMITE PCI2022-132919, Proyectos de I + D + I "Retos Colabo-racion" QUSPIN RTC2019-007196-7) ; MICIIN with funding from European Union NextGenerationEU (PRTR-C17.I1) and by Generalitat de Catalunya; Fundacio Cellex; Fundacio Mir-Puig; Generalitat de Catalunya (European Social Fund FEDER and CERCA program, AGAUR Grant No. 2021 SGR 01452, QuantumCAT U16-011424, cofunded by ERDF Operational Program of Catalonia 2014-2020) ; Barcelona Supercomputing Center MareNostrum (FI-2023-1-0013) ; EU (PASQuanS2.1, 101113690) ; EU Horizon 2020 FET-OPEN OPTOlogic (Grant No. 899794) ; EU Horizon Europe Program (Grant Agreement No. 101080086-NeQST) , National Science Centre, Poland (Symfonia Grant No. 2016/20/W/ST4/00314) ; ICFO Internal "QuantumGaudi" project; European Union's Horizon 2020 research and innovation program under the Marie-Sklodowska-Curie Grant Agreement No. 101029393 (STREDCH) and No. 847648 ("La Caixa" Junior Leaders fellowships ID 100010434: LCF/BQ/PI19/11690013, LCF/BQ/PI20/11760031, LCF/BQ/PR20/11770012, LCF/BQ/PR21/11840013) . Views and opinions expressed are, however, those of the author (s) only and do not necessarily reflect those of the European Union, European Commission, European Climate, Infrastructure and Environment Executive Agency (CINEA) , nor any other granting authority. Neither the European Union nor any granting authority can be held responsible for them. M.& Aacute;.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 NextGenerationEU (PRTR-C17.I1) and by Generalitat Valenciana, with Ref. 20220883 (PerovsQuTe) and COMCUANTICA/007 (QuanTwin) , and Red Tematica RED2022-134391-T.
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)

Stacking the odds: full-stack quantum system design space exploration

  • Safi, Hila
  • Bandic, Medina
  • Niedermeier, Christoph
  • Feld, Sebastian
  • Mauerer, Wolfgang
  • GARCIA ALMUDEVER, CARMEN|||0000-0002-3800-2357
[EN] Design space exploration (DSE) plays an important role in optimising quantum circuit execution by systematically evaluating different configurations of compilation strategies and hardware settings. In this paper, we conduct a comprehensive investigation into the impact of various layout methods, qubit routing techniques, and optimisation levels, as well as device-specific properties such as different variants and strengths of noise and imperfections, the topological structure of qubits, connectivity densities, and back-end sizes. By spanning through these dimensions, we aim to understand the interplay between compilation choices and hardware characteristics. A key question driving our exploration is whether the optimal selection of device parameters, mapping techniques, comprising of initial layout strategies and routing heuristics can mitigate device induced errors beyond standard error mitigation approaches. Our results show that carefully selecting software strategies (e.g., mapping and routing algorithms) and tailoring hardware characteristics (such as minimising noise and leveraging topology and connectivity density) significantly improve the fidelity of circuit execution outcomes, and thus the expected correctness or success probability of the computational result. We provide estimates based on key metrics such as circuit depth, gate count and expected fidelity. Our results highlight the importance of hardware-software co-design, particularly as quantum systems scale to larger dimensions, and along the way towards fully error corrected quantum systems: Our study is based on computationally noisy simulations, but considers various implementations of quantum error correction (QEC) using the same approach as for other algorithms. The observed sensitivity of circuit fidelity to noise and connectivity suggests that co-design principles will be equally critical when integrating QEC in future systems. Our exploration provides practical guidelines for co-optimising physical mapping, qubit routing, and hardware configurations in realistic quantum computing scenarios., S.F. and M.B. would like to acknowledge funding from Intel Corporation. C.G.A. is thankful for support from the QuantERA grant EQUIP with the grant number 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. Also 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. This work was supported by the German Federal Ministry of Education and Research (BMBF), funding program 'quantum technologies-from basic research to market', grant numbers 13N16092 and 13N16093. - Authors' contributions: not applicable.Open Access funding enabled and organized by Projekt DEAL.
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 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.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A method for the dynamics of vortices in a Bose-Einstein condensate: Analytical equations of the trajectories of phase singularities

  • De María-García, Sergi
  • Ferrando, Albert
  • Conejero, J. Alberto|||0000-0003-3681-7533
  • Fernández de Córdoba, Pedro|||0000-0002-0347-7280
  • Garcia March, Miguel Angel|||0000-0001-7092-838X
[EN] We present a method to study the dynamics of a quasi-two dimensional Bose-Einstein condensate which initially contains several vortices at arbitrary locations. The method allows one to find the analytical solution for the dynamics of the Bose-Einstein condensate in a homogeneous medium and in a parabolic trap, for the ideal non-interacting case. Secondly, the method allows one to obtain algebraic equations for the trajectories of the position of phase singularities present in the initial condensate along with time (the vortex lines). With these equations, one can predict quantities of interest, such as the time at which a vortex and an antivortex contained in the initial condensate will merge. For the homogeneous case, this method was introduced in the context of photonics. Here, we adapt it to the context of Bose-Einstein condensates, and we extend it to the trapped case for the first time. Also, we offer numerical simulations in the non-linear case, for repulsive and attractive interactions. We use a numerical split-step simulation of the non-linear Gross-Pitaevskii equation to determine how these trajectories and quantities of interest are changed by the interactions. We illustrate the method with several simple cases of interest, both in the homogeneous and parabolically trapped systems., M.A.G.-M. acknowledges funding from the Spanish Ministry of Education and Professional Training (MEFP) through the Beatriz Galindo program 2018 (BEAGAL18/00203), Spanish Ministry MINECO (FIDEUA PID2019-106901GBI00/10.13039/501100011033), QuantERA II Cofund 2021 PCI2022-133004, Project of MCIN with funding from European Union NextGenerationEU (PRTR-C17.I1) and by Generalitat Valenciana, with Ref. 20220883 (PerovsQuTe). P.F.D.C. acknowledges the grant PID2021-128676OB-I00 funded by FEDER/MCIN. J.A.C. acknowledges funding from the Spanish Ministry of Science and Innovation (MICINN), grant PID2021-124618NB-C21. A.F. thanks the support of MCIN of Spain through the Project No. PID2020-120484RB-I00 and Generalitat Valenciana, Spain (Grant No. PROMETEO/2021/082).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Lightcone Bounds for Quantum Circuit Mapping via Uncomplexity

  • Steinberg, Matthew
  • Bandic, Medina
  • Szkudlarek, Sacha
  • Sarkar, Aritra
  • Feld, Sebastian
  • GARCIA ALMUDEVER, CARMEN|||0000-0002-3800-2357
[EN] Efficiently mapping quantum circuits onto hardware is integral for the quantum compilation process, wherein a circuit is modified in accordance with a quantum processor¿s connectivity. Many techniques currently exist for solving this problem, wherein SWAP-gate overhead is usually prioritized as a cost metric. We reconstitute quantum circuit mapping using tools from quantum information theory, showing that a lower bound, which we dub the lightcone bound, emerges for a circuit executed on hardware. We also develop an initial placement algorithm based on graph similarity search, aiding us in optimally placing circuit qubits onto a device. 600 realistic benchmarks using the IBM Qiskit compiler and a brute-force method are then tested against the lightcone bound, with results unambiguously verifying the veracity of the bound, while permitting trustworthy estimations of minimal overhead in near-term realizations of quantum algorithms. This work constitutes the first use of quantum circuit uncomplexity to practically-relevant quantum computing., Quantum circuit mapping; Quantum compilation; Lightcone bound; Graph similarity; Qubit placement; Quantum information theory
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Interaction graph-based profiling of quantum benchmarks for improving quantum circuit mapping techniques

  • Bandic, Medina
  • Feld, Sebastian
  • GARCIA ALMUDEVER, CARMEN|||0000-0002-3800-2357
[EN] To execute quantum circuits on a quantum processor, they must be modifed to meet the physical constraints of the quantum device. This process, called quantum circuit mapping, results in a gate/circuit depth overhead that depends on both the circuit properties and the hardware constraints, being the limited qubit connectivity a crucial restriction. In this paper, we propose to extend the characterization of quantum circuits by including qubit interaction graph properties using graph theorybased metrics in addition to previously used circuit-describing parameters. This approach allows for an in-depth analysis and clustering of quantum circuits and a comparison of performance when run on diferent quantum processors, aiding in developing better mapping techniques. Our study reveals a correlation between interaction graph-based parameters and mapping performance metrics for various existing confgurations of quantum devices. We also provide a comprehensive collection of quantum circuits and algorithms for benchmarking future compilation techniques and quantum devices., This work has been partially supported by the Spanish Ministerio de Ciencia e Innovación and European ERDF under grant PID2021-123627OB-C51 and by the QuantERA grant EQUIP, by the Ministerio de Ciencia e Innovación and Agencia Estatal de Investigación, MCIN/AEI/10.13039/501100011033, and by the European Union NextGenerationEU/PRTR (CGA).