13 citations · 49 across the 15 of their papers we have counts for
3 papers · 1 filter
Evidence for effectively constant shot complexity in the quantum approximate optimization algorithm without per-instance optimization
Andrey Yu. Chernyavskiy, Denis A. Kulikov, Boris I. Bantysh +3
We study a modified fixed-point version of the Quantum Approximate Optimization Algorithm (fpQAOA), where parameters are trained classically on small instances and then transferred…
Progress in the development of quantum algorithms and software
Anastasiia S. Nikolaeva, Daria O. Konina, Anatolii V. Antipov +10
A quantum processor, like any computing device, requires the development of both hardware and the necessary set of software solutions, starting with quantum algorithms and ending w…
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…