Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Quantum coherent control of the lifetime of excited resonance states with laser pulses

Alberto Vela

Published Sep 9, 2012• 0 citations
OpenAlex

Abstract

This work was supporteded by CICyT, Ministerio de Ciencia e innovacion (MCINN), Spain, Grant No. FIS-2011-29596-C02-01, the Consolider program, MCINN, Spain, Grant No. CSD2007-00013, COST Action program, Grant No. CM1002, and the Centro de Supercomputacion de Galicia (CESGA).

Related papers

Quantum coherent control of ultrashort laser pulses

Jianying Zhou, Jianhua Zeng, Juntao Li

Chinese Science Bulletin•Mar 1, 2008•2 citations

An explanation of the Bernstein‐Vazirani and Deustch‐Josza algorithms with the quantum stabilizer formalism

Elías F. Combarro, Alejandro P. Nicolás, José Ranilla +1 more

This work was supported in part by the Ministry of Economy and Competitiveness (“Ministerio de Economia y Competitividad”) from Spain/FEDER under grant MINECO‐16‐TEC2015‐67387‐C4‐3‐R, by the Ministry of Economy, Industry and Competitiveness (“Ministerio de Economia, Industria y Competitividad”) from Spain/FEDER under grant MTM‐2017‐83506‐C2‐2‐P, by Ministry of Science and Innovation (“Ministerio de Ciencia e Innovacion”) from Spain/FEDER under grant RTI2018‐098085‐B‐C44, and by he Regional Ministry of the Principality of Asturias (“Consejeria de Empleo, Industria y Turismo del Principado de Asturias”) under grants FC‐GRUPIN‐IDI/2018/000193 and FC‐GRUPIN‐IDI/2018/000226.

Computational and Mathematical Methods•Jul 27, 2020•2 citations

Coherent quantum control of two-photon transitions by a femtosecond laser pulse

Doron Meshulach, Yaron R. Silberberg

Nature•Nov 1, 1998•726 citations

Quantum Simulation of the Agassi Model in Trapped Ions

Pedro Pérez Fernández, José Miguel Arias Carrasco, J. E. García Ramos +1 more

This work was partially supported by the Consejeria de Economia, Conocimiento, Empresas y Universidad de la Junta de Andalucia (Spain) under Groups FQM-160, FQM-177, and FQM-370, by the Spanish Ministerio de Ciencia e Innovacion, FIS2017-88410-P, PGC2018-095113-B-I00, PID2019-104002GB-C21 and PID2019-104002GB-C22, as well as by the European Commission, H2020-INFRAIA-2014-2015 (ENSAR2) and by European Regional Development Fund (ERDF), ref. SOMM17/6105/UGR. Resources supporting this work were provided by the CEAFMC and Universidad de Huelva High Performance Computer (HPC@UHU) funded by ERDF/MINECO project UNHU-15CE-2848

•May 6, 2021•0 citations

Luces Cuánticas por Navidad

Aitor Bergara

Financiado por la Fundacion Espanola para la Ciencia y la Tecnologia. Ministerio de Ciencia e Innovacion.

•Jan 1, 2011•0 citations

From Period Finding to Lattice Sampling: Experimental Insights into Shor's and Regev's Factoring Algorithms

Daniela Falcó, Arturo Rodríguez, Guillermo Rivas +1 more

Quantum algorithms for integer factorization represent one of the most prominent applications of quantum computation, with far-reaching implications for modern cryptography. While Shor's algorithm provides a polynomial-time solution in the ideal quantum model, its practical implementation is severely constrained by the limitations of current noisy intermediate-scale quantum (NISQ) hardware. These constraints have motivated the exploration of alternative factoring algorithms with different structural and resource trade-offs. In this work, we present an experimental study of Regev's quantum factoring algorithm, implemented on real quantum hardware, and compare its behavior with that of Shor's algorithm under analogous conditions. Focusing on the case N = 15, we execute both algorithms on the QMIO quantum computer at the Centro de Supercomputacion de Galicia (CESGA) and contrast the results with one of IBM's open-access quantum computers and ideal simulations. This parallel execution enables a low-level comparison of the two algorithms, highlighting how their respective quantum implementations interact with hardware noise, limited circuit depth, and finite sampling. Our analysis emphasizes the different ways in which Shor's and Regev's algorithms encode arithmetic structure into quantum states through Fourier sampling in one and higher dimensions, respectively, and how these differences manifest in experimental outcomes. Although neither algorithm demonstrates a practical advantage in the small N regime, the results provide insight into their relative robustness and failure modes on contemporary quantum devices. This study illustrates the value of experimental benchmarking of alternative quantum factoring algorithms as a means of understanding the practical implications of algorithmic design choices in the NISQ era.

quant-pharXiv:2606.17647•Jun 17, 2026•0 citations
This work was supported in part by the Ministry of Economy and Competitiveness (“Ministerio de Economia y Competitividad”) from Spain/FEDER under grant MINECO‐16‐TEC2015‐67387‐C4‐3‐R, by the Ministry of Economy, Industry and Competitiveness (“Ministerio de Economia, Industria y Competitividad”) from Spain/FEDER under grant MTM‐2017‐83506‐C2‐2‐P, by Ministry of Science and Innovation (“Ministerio de Ciencia e Innovacion”) from Spain/FEDER under grant RTI2018‐098085‐B‐C44, and by he Regional Ministry of the Principality of Asturias (“Consejeria de Empleo, Industria y Turismo del Principado de Asturias”) under grants FC‐GRUPIN‐IDI/2018/000193 and FC‐GRUPIN‐IDI/2018/000226.
This work was partially supported by the Consejeria de Economia, Conocimiento, Empresas y Universidad de la Junta de Andalucia (Spain) under Groups FQM-160, FQM-177, and FQM-370, by the Spanish Ministerio de Ciencia e Innovacion, FIS2017-88410-P, PGC2018-095113-B-I00, PID2019-104002GB-C21 and PID2019-104002GB-C22, as well as by the European Commission, H2020-INFRAIA-2014-2015 (ENSAR2) and by European Regional Development Fund (ERDF), ref. SOMM17/6105/UGR. Resources supporting this work were provided by the CEAFMC and Universidad de Huelva High Performance Computer (HPC@UHU) funded by ERDF/MINECO project UNHU-15CE-2848
Quantum algorithms for integer factorization represent one of the most prominent applications of quantum computation, with far-reaching implications for modern cryptography. While Shor's algorithm provides a polynomial-time solution in the ideal quantum model, its practical implementation is severely constrained by the limitations of current noisy intermediate-scale quantum (NISQ) hardware. These constraints have motivated the exploration of alternative factoring algorithms with different structural and resource trade-offs. In this work, we present an experimental study of Regev's quantum factoring algorithm, implemented on real quantum hardware, and compare its behavior with that of Shor's algorithm under analogous conditions. Focusing on the case N = 15, we execute both algorithms on the QMIO quantum computer at the Centro de Supercomputacion de Galicia (CESGA) and contrast the results with one of IBM's open-access quantum computers and ideal simulations. This parallel execution enables a low-level comparison of the two algorithms, highlighting how their respective quantum implementations interact with hardware noise, limited circuit depth, and finite sampling. Our analysis emphasizes the different ways in which Shor's and Regev's algorithms encode arithmetic structure into quantum states through Fourier sampling in one and higher dimensions, respectively, and how these differences manifest in experimental outcomes. Although neither algorithm demonstrates a practical advantage in the small N regime, the results provide insight into their relative robustness and failure modes on contemporary quantum devices. This study illustrates the value of experimental benchmarking of alternative quantum factoring algorithms as a means of understanding the practical implications of algorithmic design choices in the NISQ era.