21 citations · 52 across the 4 of their papers we have counts for
4 papers
NISQ-compatible approximate quantum algorithm for unconstrained and constrained discrete optimization
M. R. Perelshtein, A. I. Pakhomchik, Ar. A. Melnikov +7
Quantum algorithms are getting extremely popular due to their potential to significantly outperform classical algorithms. Yet, applying quantum algorithms to optimization problems…
Practical application-specific advantage through hybrid quantum computing
Michael Perelshtein, Asel Sagingalieva, Karan Pinto +7
Quantum computing promises to tackle technological and industrial problems insurmountable for classical computers. However, today's quantum computers still have limited demonstrabl…
Solving workflow scheduling problems with QUBO modeling
A. I. Pakhomchik, S. Yudin, M. R. Perelshtein +2
In this paper we investigate the workflow scheduling problem, a known NP-hard class of scheduling problems. We derive problem instances from an industrial use case and compare agai…
Large-scale quantum hybrid solution for linear systems of equations
M. R. Perelshtein, A. I. Pakhomchik, A. A. Melnikov +5
State-of-the-art noisy intermediate-scale quantum devices (NISQ), although imperfect, enable computational tasks that are manifestly beyond the capabilities of modern classical sup…