Margarita Veshchezerova

Dr. Margarita Veshchezerova

orcid

Research Focus & Metrics

Academic Career Length

1Year (2026-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 March 2026 in Advanced Quantum Technologies
Verified
Journal Article
Open access
PDF file
MPMikhail Podobrii
Mikhail Podobrii
VKViacheslav Kuzmin
Viacheslav Kuzmin
VVVladimir Voloshinov
Vladimir Voloshinov
MVMargarita Veshchezerova
Margarita Veshchezerova
MPMichael Perelshtein
Michael Perelshtein
An essential component of many sophisticated metaheuristics for solving combinatorial optimization problems is some variation of a local search routine that iteratively searches for a better solution within a chosen set of immediate neighbors. The size l $l$ of this set is limited due to the computational costs required to run the method on classical processing units. We present a qubit-efficient variational quantum algorithm that implements a quantum version of local search with only ⌈ log 2 l ⌉ $\lceil \log _2 l \rceil$ qubits and, therefore, can potentially work with classically intractable neighborhood sizes. Increasing the amount of quantum resources employed in the algorithm allows for a larger neighborhood size, improving the quality of obtained solutions. This trade-off is crucial for present and near-term quantum devices characterized by a limited number of logical qubits. Numerically simulating our algorithm, we successfully solved the largest graph coloring instance that was tackled by a quantum method. This achievement highlights the algorithm's potential for solving large-scale combinatorial optimization problems on near-term quantum devices.

24 September 2026 in Algorithms
Verified
Journal Article
Open access
PDF file
SISergei Iudin
Sergei Iudin
MVMargarita Veshchezerova
Margarita Veshchezerova
KTKatsiaryna Tsarova
Katsiaryna Tsarova
GTGiorgi Tadumadze
Giorgi Tadumadze
VSVishal Shete
Vishal Shete
MPMichael Perelshtein
Michael Perelshtein
Liquefied natural gas (LNG) transportation is a critical component of the energy industry. It enables the efficient and large-scale movement of natural gas across vast distances by converting it into a liquid form, thereby addressing global demand and connecting suppliers with consumers. In this study, we present the Parameter-Guided Two-Stage Heuristic (PG-TSH) for the LNG transportation problem, which involves hundreds of contracts and a planning horizon of two to three years. Our model incorporates several fuel types, LNG sloshing in the tank, and speed- and load-dependent consumption rates. We also consider flexible contracts with LNG volume variability, enabling volume optimizations and multiple discharges. An outer derivative-free parameter-search routine tunes the coefficients of mixed-integer programming (MIP) models, allowing better solution-space exploration. In the experiments, this routine is instantiated with the tensor-train optimizer. On the historic and artificially generated data, our approach outperforms the baseline linear programming model by 35% and 7–44%, respectively, while the time overhead is only several minutes.