Skip to main content

Resultados relacionados

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

UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

Reinforcement learning based quantum circuit optimization via ZX-Calculus

  • Riu Vicente, Jordi
  • Nogué Gómez, Jan
  • Vilaplana, Gerard
  • García Sáez, Artur
  • Pascual Estarellas, Marta
We propose a novel Reinforcement Learning (RL) method for optimizing quantum circuits using graph-theoretic simplification rules of ZX-diagrams. The agent, trained using the Proximal Policy Optimization (PPO) algorithm, employs Graph Neural Networks to approximate the policy and value functions. We demonstrate the capacity of our approach by comparing it against the best performing ZX-Calculus-based algorithm for the problem in hand. After training on small Clifford+T circuits of 5-qubits and few tenths of gates, the agent consistently improves the state-of-the-art for this type of circuits, for at least up to 80-qubit and 2100 gates, whilst remaining competitive in terms of computational performance. Additionally, we illustrate the versatility of the agent by incorporating additional optimization routines on the workflow during training, improving the two-qubit gate count state-of-the-art on multiple structured quantum circuits for relevant applications of much larger dimension and different gate distributions than the circuits the agent trains on. This conveys the potential of tailoring the reward function to the specific characteristics of each application and hardware backend. Our approach is a valuable tool for the implementation of quantum algorithms in the near-term intermediate-scale range (NISQ)., A.G-S received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 951911 (AI4Media). This work was supported by the Agència de Gestió d’Ajuts Universitaris i de Recerca through the DI grant (No. 2020-DI00063) and by MICIU/AEI/10.13039/501100011033/ FEDER, UE., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publication Artículo científico (JournalArticle)

One qubit as a universal approximant

  • Pérez Salinas, Adrián
  • López Nuñez, David
  • García Sáez, Artur
  • Forn Diaz, Pol|||0000-0003-4365-5157
  • Latorre, José I.
A single-qubit circuit can approximate any bounded complex function stored in the degrees of freedom defining its quantum gates. The single-qubit approximant presented in this work is operated through a series of gates that take as their parametrization the independent variable of the target function and an additional set of adjustable parameters. The independent variable is re-uploaded in every gate while the parameters are optimized for each target function. The output state of this quantum circuit becomes more accurate as the number of re-uploadings of the independent variable increases, i.e., as more layers of gates parameterized with the independent variable are applied. In this work, we provide two proofs of this claim related to both the Fourier series and the universal approximation theorem for neural networks, and we benchmark both methods against their classical counterparts. We further implement a single-qubit approximant in a real superconducting qubit device, demonstrating how the ability to describe a set of functions improves with the depth of the quantum circuit. This work shows the robustness of the re-uploading technique on quantum machine learning., We acknowledge financial support from Secretaria d’Universitatsi Recerca del Departament d’Empresa i Coneixement de la Generalitat de Catalunya, co-funded by the European Union Regional Development Fund within the ERDF Operational Program of Catalunya (project QuantumCat, ref. 001-P-001644). A.G-S received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 951911 (AI4Media). P. F.-D. acknowledges support from ”la Caixa” Foundation - Junior leader fellowship (ID100010434-CF/BQ/PR19/11700009), Ministry of Economy and Competitiveness and Agencia Estatal de Investigación (FIS2017-89860-P; SEV-2016-0588; PCI2019-111838-2), and European Commission (FET-Open AVaQus GA 899561; QuantERA). IFAE is partially funded by the CERCA program of the Generalitat de Catalunya., Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

Reinforcement learning based quantum circuit optimization via ZX-Calculus

  • Riu Vicente, Jordi
  • Nogué Gómez, Jan
  • Vilaplana, Gerard
  • García Sáez, Artur
  • Pascual Estarellas, Marta
We propose a novel Reinforcement Learning (RL) method for optimizing quantum circuits using graph-theoretic simplification rules of ZX-diagrams. The agent, trained using the Proximal Policy Optimization (PPO) algorithm, employs Graph Neural Networks to approximate the policy and value functions. We demonstrate the capacity of our approach by comparing it against the best performing ZX-Calculus-based algorithm for the problem in hand. After training on small Clifford+T circuits of 5-qubits and few tenths of gates, the agent consistently improves the state-of-the-art for this type of circuits, for at least up to 80-qubit and 2100 gates, whilst remaining competitive in terms of computational performance. Additionally, we illustrate the versatility of the agent by incorporating additional optimization routines on the workflow during training, improving the two-qubit gate count state-of-the-art on multiple structured quantum circuits for relevant applications of much larger dimension and different gate distributions than the circuits the agent trains on. This conveys the potential of tailoring the reward function to the specific characteristics of each application and hardware backend. Our approach is a valuable tool for the implementation of quantum algorithms in the near-term intermediate-scale range (NISQ)., A.G-S received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 951911 (AI4Media). This work was supported by the Agència de Gestió d’Ajuts Universitaris i de Recerca through the DI grant (No. 2020-DI00063) and by MICIU/AEI/10.13039/501100011033/ FEDER, UE., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publication Artículo científico (JournalArticle)

One qubit as a universal approximant

  • Pérez Salinas, Adrián
  • López Nuñez, David
  • García Sáez, Artur
  • Forn Diaz, Pol
  • Latorre, José I.
A single-qubit circuit can approximate any bounded complex function stored in the degrees of freedom defining its quantum gates. The single-qubit approximant presented in this work is operated through a series of gates that take as their parametrization the independent variable of the target function and an additional set of adjustable parameters. The independent variable is re-uploaded in every gate while the parameters are optimized for each target function. The output state of this quantum circuit becomes more accurate as the number of re-uploadings of the independent variable increases, i.e., as more layers of gates parameterized with the independent variable are applied. In this work, we provide two proofs of this claim related to both the Fourier series and the universal approximation theorem for neural networks, and we benchmark both methods against their classical counterparts. We further implement a single-qubit approximant in a real superconducting qubit device, demonstrating how the ability to describe a set of functions improves with the depth of the quantum circuit. This work shows the robustness of the re-uploading technique on quantum machine learning., We acknowledge financial support from Secretaria d’Universitatsi Recerca del Departament d’Empresa i Coneixement de la Generalitat de Catalunya, co-funded by the European Union Regional Development Fund within the ERDF Operational Program of Catalunya (project QuantumCat, ref. 001-P-001644). A.G-S received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 951911 (AI4Media). P. F.-D. acknowledges support from ”la Caixa” Foundation - Junior leader fellowship (ID100010434-CF/BQ/PR19/11700009), Ministry of Economy and Competitiveness and Agencia Estatal de Investigación (FIS2017-89860-P; SEV-2016-0588; PCI2019-111838-2), and European Commission (FET-Open AVaQus GA 899561; QuantERA). IFAE is partially funded by the CERCA program of the Generalitat de Catalunya., Peer Reviewed, Postprint (author's final draft)
RUO. Repositorio Institucional de la Universidad de Oviedo
Publication Artículo científico (JournalArticle)

Binary quantification and dataset shift: an experimental investigation

  • González González, Pablo|||0000-0002-9250-0920
  • Moreo, Alejandro
  • Sebastiani, Fabrizio
MINECO (Ministerio de Economía y Competitividad) and FEDER (Fondo Europeo de Desarrollo Regional), grant PID2019-110742RB-I00 (MINECO/FEDER), and by Campus de Excelencia Internacional in collaboration with Santander Bank in the framework of the fnancial aid for mobility of excellence for teachers and researchers at the University of Oviedo. The work by the 2nd and 3rd authors has been supported by the SoBigData++ project, funded by the European Commission (Grant 871042) under the H2020 Programme INFRAIA-2019-1, by the AI4Media project, funded by the European Commission (Grant 951911) under the H2020 Programme ICT-48-2020, and by the SoBigData.it, FAIR, and QuaDaSh (P2022TB5JF) projects funded by the Italian Ministry of University and Research under the NextGenerationEU program.