4 citations · 5 across the 2 of their papers we have counts for
2 papers
quant-ph2025★ 1 cited
Experimental factoring integers using fixed-point-QAOA with a trapped-ion quantum processor
Ilia V. Zalivako, Andrey Yu. Chernyavskiy, Anastasiia S. Nikolaeva +10
Factoring integers is considered as a computationally-hard problem for classical methods, whereas there exists polynomial-time Shor's quantum algorithm for solving this task. Howev…
quant-ph2023★ 4 cited
Pitfalls of the sublinear QAOA-based factorization algorithm
Sergey V. Grebnev, Maxim A. Gavreev, Evgeniy O. Kiktenko +3
Quantum computing devices are believed to be powerful in solving the prime factorization problem, which is at the heart of widely deployed public-key cryptographic tools. However,…