Pasar al contenido principal

Shortcuts to Adiabaticity in Solid-State Physics

RYC-2017-22482

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de Promoción del Talento y su Empleabilidad en I+D+i
Subprograma Subprograma Estatal de Incorporación
Convocatoria Ramón y Cajal
Año convocatoria 2017
Plan Estatal 2017-2020 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDAD DEL PAIS VASCO EUSKAL HERRIKO UNIBERTSITATEA

Resultados relacionados

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