activity
20162021
most citedMoG-VQE: Multiobjective genetic variational quantum eigensolver

46 citations · 112 across the 6 of their papers we have counts for

collaborators

7 papers

cond-mat.mes-hall2021★ 24 cited

Machine learning of phase transitions in nonlinear polariton lattices

D. Zvyagintseva, H. Sigurdsson, V. K. Kozin +4

Polaritonic lattices offer a unique testbed for studying nonlinear driven-dissipative physics. They show qualitative changes of a steady state as a function of system parameters, w…

physics.optics2021★ 9 cited

Multipole optimization of light focusing by silicon nanosphere structures

Nikita A. Ustimenko, Kseniia V. Baryshnikova, Roman V. Melnikov +4

We investigate the applicability of the coupled multipole model and its modification in the framework of the zero-order Born approximation for modeling of light focusing by finite-…

quant-ph2020★ 46 cited

MoG-VQE: Multiobjective genetic variational quantum eigensolver

D. Chivilikhin, A. Samarin, V. Ulyantsev +3

Variational quantum eigensolver (VQE) emerged as a first practical algorithm for near-term quantum computers. Its success largely relies on the chosen variational ansatz, correspon…

cs.SE2019★ 5 cited

Smart Contract Design Meets State Machine Synthesis: Case Studies

Dmitrii Suvorov, Vladimir Ulyantsev

Modern blockchain systems support creation of smart contracts -- stateful programs hosted and executed on a blockchain. Smart contracts hold and transfer significant amounts of dig…

cs.DS2018

BFS Enumeration for Breaking Symmetries in Graphs

Vyacheslav Moklev, Vladimir Ulyantsev

There are numerous NP-hard combinatorial problems which involve searching for an undirected graph satisfying a certain property. One way to solve such problems is to translate a pr…

cs.FL2016★ 1 cited

Symmetry Breaking Predicates for SAT-based DFA Identification

Vladimir Ulyantsev, Ilya Zakirzyanov, Anatoly Shalyto

It was shown before that the NP-hard problem of deterministic finite automata (DFA) identification can be effectively translated to Boolean satisfiability (SAT). Modern SAT-solvers…

cs.SE2016★ 27 cited

Exact Finite-State Machine Identification from Scenarios and Temporal Properties

Vladimir Ulyantsev, Igor Buzhinsky, Anatoly Shalyto

Finite-state models, such as finite-state machines (FSMs), aid software engineering in many ways. They are often used in formal verification and also can serve as visual software m…