Pasar al contenido principal

Investigadora postdoctoral en tecnologías cuánticas

RYC2023-042699-I

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal para Desarrollar, Atraer y Retener Talento
Subprograma Subprograma Estatal de Incorporación
Convocatoria Ramón y Cajal
Año convocatoria 2023
Plan Estatal 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario AGENCIA ESTATAL CONSEJO SUPERIOR DE INVESTIGACIONES CIENTIFICAS (CSIC)

Resultados relacionados

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

DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Algorithm-oriented qubit mapping for variational quantum algorithms

  • Ji, Yanjun
  • Chen, Xi
  • Polian, Ilia
  • Ban, Yue
Quantum algorithms implemented on near-term devices require qubit mapping due to noise and limited qubit connectivity. In this paper we propose a strategy called algorithm-oriented qubit mapping (AOQMAP) that aims to bridge the gap between exact and scalable mapping methods by utilizing the inherent structure of algorithms. While exact methods provide optimal solutions, they become intractable for large circuits. Scalable methods, like swap networks, offer fast solutions but lack optimality. AOQMAP bridges this gap by leveraging algorithmic features and their association with specific device substructures to achieve depth-optimal and scalable solutions. The proposed strategy follows a two-stage approach. First, it maps circuits to subtopologies to meet connectivity constraints. Second, it identifies the optimal qubits for execution using a cost function and performs postselection among execution results across subtopologies. Notably, AOQMAP provides both scalable and optimal solutions for variational quantum algorithms with fully connected two-qubit interactions on common subtopologies including linear, T-, and H-shaped, minimizing circuit depth. Benchmarking experiments conducted on IBM quantum devices demonstrate significant reductions in gate count and circuit depth compared to Qiskit, Tket, and swap network. Specifically, AOQMAP achieves up to an 82% reduction in circuit depth and an average 138% increase in success probability. This scalable and algorithm-specific approach holds the potential to optimize a wider range of quantum algorithms., The authors acknowledge the financial support of the project QORA by Ministerium für Wirtschaft, Arbeit und Tourismus Baden-Württemberg in the frame of the Competence Center Quantum Computing Baden-Württemberg, the Basque Government through Grant No. IT1470-22, the Project Grant No. PID2021-126273NB-I00 funded by MCIN/AEI/10.13039/501100011033 and by “ERDF A way of making Europe” and “ERDF Invest in your Future,” Nanoscale NMR and complex systems (Grant No. PID2021- 126694NB-C21), EU FET Open Grant EPIQUS (No. 899368), the ELKARTEK Program by the Basque Government under Grant KK-2022/00041, BRTA QUANTUM Hacia una especialización armonizada en tecnologías cuánticas en BRTA. X.C. acknowledges ayudas para contratos Ramón y Cajal–2015-2020 (Grant No. RYC-2017-22482) and open access funding provided by UPV/EHU. Y.B. acknowledges the Ramón y Cajal (RYC2023-042699-I) research fellowship., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Demonstration of hardware efficient photonic variational quantum algorithm

  • Agresti, Iris
  • Paul, K.
  • Schiansky, Peter
  • Steiner, Simon
  • Yin, Zhenghao
  • Pentangelo, Ciro
  • Piacentini, Simone
  • Crespi, Andrea
  • Ban, Yue
  • Ceccarelli, Francesco
  • Osellame, Roberto
  • Chen, Xi
  • Walther, Philip
Quantum computing has changed the paradigm of computer science, where quantum technologies have promised to outperform classical ones. Such an advantage was only demonstrated for tasks with no application or out of reach for the state-of-the-art quantum technologies. In this context, a promising strategy to find practical use of quantum computers exploits hybrid models, where a quantum device estimates a hard-to-compute quantity, while a classical optimizer trains the parameters. In this work, we demonstrate that single photons and linear optical networks are sufficient for implementing variational quantum algorithms, when the problem specification (ansatz) is tailored to this specific platform. We show this by a proof-of-principle demonstration to tackle an instance of a factorization task, whose solution is encoded in the ground state of a suitable Hamiltonian. This work, which combines Variational Quantum Algorithms with hardware efficient ansätze for linear optics, showcases a promising pathway toward practical applications for photonic quantum platforms., This research was cofunded by the European Union (HORIZON Europe Research and Innovation Programme, EPIQUE, No. 101135288). This project has received funding from the European Union’s Horizon 2020 research and innovation programme under Grant Agreement No. 899368 (EPIQUS), under the Marie Skłodowska-Curie Grant Agreement No. 956071 (AppQInfo), and under Grant Agreement No. 101017733 (QuantERA II). This research was funded in whole or in part by the Austrian Science Fund (FWF) [10.55776/ESP205 (PREQUrSOR), 10.55776/I6002 and 10.55776/F71 (BeyondC)]. The financial support by the Austrian Federal Ministry of Labour and Economy, the National Foundation for Research, Technology and Development, and the Christian Doppler Research Association is gratefully acknowledged. Y.B. acknowledges the Ayudas para contratos Ramón y Cajal (RYC2023-042699-I). X.C. and Y.B. acknowledge the Severo Ochoa Centres of Excellence program through Grant No. CEX2024-001445-S. K.P. and X.C. also appreciate the funding from the Basque Government through Grant No. IT1470-22, the project Grant No. PID2021-126273NB-I00 funded by MCIN/AEI/10.13039/501100011033 and by “ERDF A way of making Europe” and “ERDF Invest in your Future,” and the Spanish Ministry of Economic Affairs and Digital Transformation through the QUANTUM ENIA project call-Quantum Spain project., With funding form the Spanish government through the "Severa Ochoa Centre of Excellence" accreditation (CEX2024-001445-S)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Digitized counterdiabatic quantum optimization for bin packing problem

  • Xu, Ruoqian
  • Romero, Sebastián V.
  • Tang, Jialiang
  • Ban, Yue
  • Chen, Xi
The bin packing problem (BPP), a classical NP-hard combinatorial optimization challenge, has emerged as a promising application for quantum computing. In this work, we tackle the one-dimensional BPP (1dBPP) using a digitized counterdiabatic quantum approximate optimization algorithm (DC-QAOA) that incorporates counterdiabatic (CD) driving to achieve a 40% higher feasibility ratio than standard QAOA, while reducing quantum resource requirements. We investigate three ansatz schemes -DC-QAOA, CD-inspired ansatz, and CD-mixer ansatz - each integrating CD terms with distinct combinations of cost and mixer Hamiltonians, resulting in different DC-QAOA variants. Numerical simulations demonstrate that these DC-QAOA variants maintain solution accuracy with less than 5% variance across varying iteration numbers, circuit depths, and Hamiltonian step sizes. Moreover, they require approximately 7 to 8 times fewer measurements to achieve comparable precision under the same parameter variations. Experimental validation on a 10-item 1dBPP instance using IBM quantum computers shows the CD-mixer ansatz achieves five times more feasibility solutions and greater robustness against NISQ noise. Collectively, these results establish DC-QAOA as a resource-efficient framework for combinatorial optimization on near-term quantum devices., This work is partially supported by the Project Grant No. PID2021-126273NB-I00 funded by MCIN/AEI/10.13039/501100011033 and by “ERDF A way of making Europe” and “ERDF Invest in your Future”, the Basque Government through Grant No. IT1470- 22, the Spanish Ministry of Economic Affairs and Digital Transformation through the QUANTUM ENIA project call-Quantum Spain project, and CPS-MindSpore funding. Y.B. and X.C. acknowledge the Severo Ochoa Centres of Excellence program through Grant CEX2024-001445-S. R.Q.X. and J.L.T. appreciate the support from China Scholarship Council (CSC) under Grant Nos: 202206890001 and 202306890004. Y.B. acknowledges ayudas Ramón y Cajal (RYC2023-042699-I)., With funding form the Spanish government through the "Severa Ochoa Centre of Excellence" accreditation (CEX2024-001445-S)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Neural quantum kernels: training quantum kernels with quantum neural networks

  • Rodríguez-Grasa, P.
  • Ban, Yue
  • Sanz, M.
Quantum and classical machine learning have been naturally connected through kernel methods, which have also served as proof-of-concept for quantum advantage. Quantum embeddings encode classical data into quantum feature states, enabling the construction of embedding quantum kernels (EQKs) by measuring vector similarities and projected quantum kernels (PQKs) through projections of these states. However, in both approaches, the model is influenced by the choice of the embedding. In this work, we propose using the training of a quantum neural network (QNN) to construct neural quantum kernels, specifically neural EQKs and neural PQKs—problem-inspired kernel functions. Unlike previous approaches, our method requires the kernel matrix to be constructed only once, significantly reducing computational overhead. To achieve this, we introduce a scalable training method for an n-qubit data reuploading QNN. Furthermore, we demonstrate neural quantum kernels can alleviate exponential concentration and enhance generalization capabilities compared to problem-agnostic kernels, positioning them as a scalable and robust solution for quantum machine learning applications., The authors acknowledge financial support from OpenSuperQ + 100 (Grant No. 101113946) of the EU Flagship on Quantum Technologies, as well as from the EU FET-Open project EPIQUS (Grant No. 899368), also from Project Grant No. PID2021-125823NA-I00 595 and Spanish Ramón y Cajal Grant No. RYC-2020-030503-I funded by MCIN/AEI/10.13039/501100011033 and by “ERDF A way of making Europe” and “ERDF Invest in your Future,” this project has also received support from the Spanish Ministry for Digital Transformation and of Civil Service of the Spanish Government through the QUANTUM ENIA project call - Quantum Spain, EU through the Recovery, Transformation and Resilience Plan - NextGenerationEU within the framework of the Digital Spain 2026, and by the EU through the Recovery, Transformation and Resilience Plan - NextGenerationEU within the framework of the Digital Spain 2026 Agenda, we acknowledge funding from the Basque Government through Grant No. IT1470-22 and the IKUR Strategy under the collaboration agreement between Ikerbasque Foundation and BCAM on behalf of the Department of Education of the Basque Government. P.R. and Y.B. acknowledge financial support from the CDTI within the Misiones 2021 program and the Ministry of Science and Innovation under the Recovery, Transformation and Resilience Plan—Next Generation EU under the project “CUCO: Quantum Computing and its Application to Strategic Industries”. Y.B. acknowledges the Ramón y Cajal (RYC2023-042699-I) research fellowship., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Quantum active learning

  • Ding, Y.
  • Ban, Yue
  • Sanz, M.
  • Martín-Guerrero, José D.
  • Chen, Xi
[Data Availability] We utilized the quantum platform mindspore quantum [64] in our experiments. All codes, data sets, and results are provided in this repository [65] for reproducibility of this study. Credit for the tic-tac-toe data set generation code is attributed to pennylane on their web page [66]., Quantum machine learning (QML), as an extension of classical machine learning that harnesses quantum mechanics, facilitates efficient learning from data encoded in quantum states. Training a quantum neural network (QNN) typically demands a substantial labeled training set for supervised learning. Human annotators, often experts, provide labels for samples through additional experiments, adding to the training cost. To mitigate this expense, there is a quest for methods that maintain model performance over fully labeled data sets while requiring fewer labeled samples in practice, thereby extending few-shot learning to the quantum realm. Quantum active learning (QAL) estimates the uncertainty of quantum data to select the most informative samples from a pool for labeling. Consequently, a QML model is supposed to accumulate maximal knowledge as the training set comprises labeled samples selected via sampling strategies. Notably, the QML models trained within the QAL framework are not restricted to specific types, allowing performance enhancement from the model architecture's perspective towards few-shot learning. Recognizing symmetry as a fundamental concept in physics ubiquitous across various domains, we leverage the symmetry inherent in quantum states induced by the embedding of classical data for model design. We employ an equivariant QNN capable of generalizing from fewer data with geometric priors. We benchmark the performance of QAL on two classification problems, observing both positive and negative results. QAL effectively trains the model, achieving performance comparable to that on fully labeled data sets by labeling less than 7% of the samples in the pool with unbiased sampling behavior. Furthermore, we elucidate the negative result of QAL being overtaken by random sampling baseline through miscellaneous numerical experiments. Our work lays the groundwork for real-world applications of QML by addressing realistic experimental costs., This work is supported by NSFC (12075145 and 12211540002), STCSM (2019SHZDZX01-ZX04), the Innovation Program for Quantum Science and Technology (2021ZD0302302), EU FET Open Grant EPIQUS (899368), HORIZON-CL4-2022-QUANTUM-01-SGA Project No. 101113946 OpenSuperQPlus100 of the EU Flagship on Quantum Technologies, the Basque Government through Grant No. IT1470-22, the Project Grants No. PID2021-126273NB-I00 and No. PID2021-125823NA-I00 funded by MCIN/AEI/10.13039/501100011033, by “ERDFA way of making Europe,” “ERDF Invest in your Future,” Nanoscale NMR and complex systems (PID2021-126694NB-C21, PID2021-126694NA-C22), the Valencian Government Grant with Reference No. CIAICO/2021/184, the Spanish Ministry of Economic Affairs and Digital Transformation through the QUANTUM ENIA project call–Quantum Spain project, and the European Union through the Recovery, Transformation and Resilience Plan–NextGenerationEU within the framework of the Digital Spain 2026 Agenda. The authors also acknowledge the financial support received from the IKUR Strategy under the collaboration agreement between Ikerbasque Foundation and BCAM on behalf of the Department of Education of the Basque Government. M.S. acknowledges “Ayudas para contratos Ramón y Cajal” 2015-2020 (RYC-2020-030503-I). Y.B. acknowledges the Ramón y Cajal (RYC2023-042699-I) research fellowship. Y.D. thanks the European Commission for a Marie Curie PF Grant (No. 101204580 FELQO). Y.D. acknowledges “CPS-MindSpore funding for quantum machine learning” with the support from the technical team of MindSpore Quantum., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Quantum approximated cloning-assisted density matrix exponentiation

  • Rodríguez-Grasa, P.
  • Ibarrondo, Rubén
  • González-Conde, Javier
  • Ban, Yue
  • Rebentrost, Patrick
  • Sanz, M.
Classical information loading is an essential task for many processing quantum algorithms, constituting a cornerstone in the field of quantum machine learning. In particular, the embedding techniques based on Hamiltonian simulation techniques enable the loading of matrices into quantum computers. A representative example of these methods is the Lloyd-Mohseni-Rebentrost (LMR) protocol, which efficiently implements matrix exponentiation when multiple copies of a quantum state are available. However, this is a quite ideal setup, and in a realistic scenario, the copies are limited and the noncloning theorem prevents one from producing more exact copies in order to increase the accuracy of the protocol. Here, we propose a method to circumvent this limitation by introducing imperfect quantum copies, which significantly improve the performance of the LMR when the eigenvectors are known., The authors acknowledge support from EU FET Open project EPIQUS (899368) and HORIZON-CL4- 2022-QUANTUM01-SGA Project No. 101113946 OpenSuperQPlus100 of the EU Flagship on Quantum Technologies, the Spanish Ramón y Cajal Grant No. RYC-2020-030503-I, project Grant No. PID2021-125823NA-I00 funded by MCIN/AEI/10.13039/501100011033 and by “ERDF A way of making Europe” and “ERDF Invest in your Future”, and from the IKUR Strategy under the collaboration agreement between Ikerbasque Foundation and BCAM on behalf of the Department of Education of the Basque Government. This project has also received support from the Spanish Ministry for Digital Transformation and of Civil Service of the Spanish Government through the QUANTUM ENIA project call - Quantum Spain, EU through the Recovery, Transformation and Resilience Plan - NextGenerationEU within the framework of the Digital Spain 2026. P.R-G. acknowledges the CDTI within the Misiones 2021 program and the Ministry of Science and Innovation under the Recovery, Transformation and Resilience Plan - Next Generation EU under the project “CUCO: Quantum Computing and its Application to Strategic Industries”. R.I. acknowledges the support of the Basque Government Ph.D. Grant No. PRE 2021-1-0102. J.G-C. acknowledges the support from the UPV/EHU Ph.D. Grant No. PIF20/276. P.R. is supported by the National Research Foundation, Singapore, and A*STAR under its CQT Bridging Grant. Y.B. acknowledges support from the Spanish Government via the project PID2021-126694NA- C22 (MCIU/AEI/FEDER, EU) and the Ramon y Cajal Grant No. RYC2023-042699-I. We acknowledge funding from Basque Government through Grant No. IT1470-22 and through the ELKARTEK program, project “KUBIT - Kuantikaren Berrikuntzarako Ikasketa Teknologikoa” (KK- 2024/00105)., Peer reviewed
DIGITAL.CSIC. Repositorio Institucional del CSIC
Publicación Artículo científico (JournalArticle)

Scrambling in the charging of quantum batteries

  • Romero, Sebastián V.
  • Ding, Yongcheng
  • Chen, Xi
  • Ban, Yue
Main text: 6 pages, 6 figures. Supplemental material: 3 pages, 2 figures, Exponentially fast scrambling of an initial state characterizes quantum chaotic systems. Given the importance of quickly populating higher energy levels from low-energy states in quantum battery charging protocols, this work investigates the role of quantum scrambling in quantum batteries and its effect on optimal power and charging times by means of the Sachdev-Ye-Kitaev model, a maximally-chaotic black hole physics model that has been recently proposed as a quantum battery. We adopt a bare representation with normalized bandwidths to suppress system energy dependence. To our knowledge, this is the first in-depth exploration of quantum scrambling in the context of quantum batteries. By analyzing the dynamics of out-of-time-order correlators, our findings indicate that quantum scrambling does not necessarily lead to faster charging, despite its potential for accelerating the process., We thank Dario Rosa, Juan José García-Ripoll and Juan Santos-Suárez for fruitful discussions. This work is supported by the Basque Government through Grant No. IT1470-22, the project grant PID2021-126273NB-I00 funded by MCIN/AEI/10.13039/501100011033 and by “ERDF A way of making Europe” and “ERDF Invest in your Future”, Nanoscale NMR and complex systems (Grant Nos. PID2021-126694NB-C21 and PID2021-126694NA-C22), the Spanish Ministry of Economic Affairs and Digital Transformation through the QUANTUM ENIA project call-Quantum Spain project, the project OpenSuperQ+100 (101113946) of the EU Flagship on Quantum Technologies. National Natural Science Foundation of China (Grants No. 12075145 and 12211540002), STCSM (Grant No. 2019SHZDZX01-ZX04) and the Innovation Program for Quantum Science and Technology (Grant No. 2021ZD0302302). Y.B. acknowledges the Ramón y Cajal (RYC2023-042699-I) research fellowship. Y.D. thanks the European Commission for a Marie Curie PF grant (No. 101204580 FELQO)., Peer reviewed