Alena Mastiukova

Dr. Alena Mastiukova

orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
12 May 2020 in Physical Review A
Verified
Journal Article
Closed access
PDF file
EKEvgeniy Kiktenko
Evgeniy Kiktenko
AMA. O. Malyshev
A. O. Malyshev
AMAlena Mastiukova
Alena Mastiukova
VMV. I. Man'KO
V. I. Man'KO
AFAleksey Fedorov
Aleksey Fedorov
DCDariusz Chruscinski
Dariusz Chruscinski
In this work, we consider a probability representation of quantum dynamics for finite-dimensional quantum systems with the use of pseudostochastic maps acting on true probability distributions. These probability distributions are obtained via symmetric informationally complete positive operator-valued measure (SIC-POVM) and can be directly accessible in an experiment. We provide SIC-POVM probability representations both for unitary evolution of the density matrix governed by the von Neumann equation and dissipative evolution governed by Markovian master equation. In particular, we discuss whereas the quantum dynamics can simulated via classical random processes in terms of the conditions for the master equation generator in the SIC-POVM probability representation. We construct practical measures of nonclassicality non-Markovianity of quantum processes and apply them for studying experimental realization of quantum circuits realized with the IBM cloud quantum processor.

1 July 2022 in New Journal of Physics
Verified
Journal Article
Open access
PDF file
MGMaksim Gavreev
Maksim Gavreev
AMAlena Mastiukova
Alena Mastiukova
EKEvgeniy Kiktenko
Evgeniy Kiktenko
AFAleksey Fedorov
Aleksey Fedorov
Quantum technologies require methods for preparing and manipulating entangled multiparticle states. However, the problem of determining whether a given quantum state is entangled or separable is known to be an NP-hard problem in general, and even the task of detecting entanglement breakdown for a given class of quantum states is difficult. In this work, we develop an approach for revealing entanglement breakdown using a machine learning technique, which is known as ‘learning by confusion’. We consider a family of quantum states, which is parameterized such that there is a single critical value dividing states within this family into separate and entangled. We demonstrate the ‘learning by confusion’ scheme allows us to determine the critical value. Specifically, we study the performance of the method for the two-qubit, two-qutrit, and two-ququart entangled state. In addition, we investigate the properties of the local depolarization and the generalized amplitude damping channel in the framework of the confusion scheme. Within our approach and setting the parameterization of special trajectories, we obtain an entanglement-breakdown ‘phase diagram’ of a quantum channel, which indicates regions of entangled (separable) states and the entanglement-breakdown region. Then we extend the way of using the ‘learning by confusion’ scheme for recognizing whether an arbitrary given state is entangled or separable. We show that the developed method provides correct answers for a variety of states, including entangled states with positive partial transpose. We also present a more practical version of the method, which is suitable for studying entanglement breakdown in noisy intermediate-scale quantum devices. We demonstrate its performance using an available cloud-based IBM quantum processor.

17 September 2020 in New Journal of Physics
Verified
Journal Article
Open access
PDF file
VYV I Yashin
V I Yashin
EKEvgeniy Kiktenko
Evgeniy Kiktenko
AMAlena Mastiukova
Alena Mastiukova
AFAleksey Fedorov
Aleksey Fedorov
In the present work, we suggest an approach for describing dynamics of finite-dimensional quantum systems in terms of pseudostochastic maps acting on probability distributions, which are obtained via minimal informationally complete quantum measurements. The suggested method for probability representation of quantum dynamics preserves the tensor product structure, which makes it favourable for the analysis of multi-qubit systems. A key advantage of the suggested approach is that minimal informationally complete positive operator-valued measures (MIC-POVMs) are easier to construct in comparison with their symmetric versions (SIC-POVMs). We establish a correspondence between the standard quantum-mechanical formalism and the MIC-POVM-based probability formalism. Within the latter approach, we derive equations for the unitary von-Neumann evolution and the Markovian dissipative evolution, which is governed by the Gorini–Kossakowski–Sudarshan–Lindblad (GKSL) generator. We apply the MIC-POVM-based probability representation to the digital quantum computing model. In particular, for the case of spin-1/2 evolution, we demonstrate identifying a transition of a dissipative quantum dynamics to a completely classical-like stochastic dynamics. One of the most important findings is that the MIC-POVM-based probability representation gives more strict requirements for revealing the non-classical character of dissipative quantum dynamics in comparison with the SIC-POVM-based approach. Our results give a physical interpretation of quantum computations and pave a way for exploring the resources of noisy intermediate-scale quantum devices.

18 January 2023 in Frontiers in Physics
Verified
Journal Article
Open access
ABAleksey S. Boev
Aleksey S. Boev
SUSergey R. Usmanov
Sergey R. Usmanov
ASAlexander M. Semenov
Alexander M. Semenov
MUMaria M. Ushakova
Maria M. Ushakova
GSGleb V. Salahov
Gleb V. Salahov
AFAleksey Fedorov
Aleksey Fedorov
Problems related to wavelength assignment (WA) in optical communications networks involve allocating transmission wavelengths for known transmission paths between nodes that minimize a certain objective function, for example, the total number of wavelengths. Playing a central role in modern telecommunications, this problem belongs to NP-complete class for a general case so that obtaining optimal solutions for industry-relevant cases is exponentially hard. In this work, we propose and develop a quantum-inspired algorithm for solving the wavelength assignment problem. We propose an advanced embedding procedure to transform this problem into the quadratic unconstrained binary optimization (QUBO) form, having a improvement in the number of iterations with price-to-pay being a slight increase in the number of variables (“spins”). Then, we compare a quantum-inspired technique for solving the corresponding QUBO form against classical heuristic and industrial combinatorial solvers. The obtained numerical results indicate on an advantage of the quantum-inspired approach in a substantial number of test cases against the industrial combinatorial solver that works in the standard setting. Our results pave the way to the use of quantum-inspired algorithms for practical problems in telecommunications and open a perspective for further analysis of the use of quantum computing devices.

22 February 2020 in Optical Engineering
Verified
Journal Article
Closed access
PDF file
EKEvgeniy O. Kiktenko
Evgeniy O. Kiktenko
AMAlena Mastiukova
Alena Mastiukova
AFAleksey Fedorov
Aleksey Fedorov
<!-- *** Custom HTML *** --> Decoherence is a fundamental obstacle to the implementation of large-scale and low-noise quantum information-processing devices. We suggest an approach for suppressing errors by employing preprocessing and postprocessing unitary operations, which precede and follow the action of a decoherence channel. In contrast to quantum error correction and measurement-based methods, the suggested approach relies on specifically designed unitary operators for a particular state without the need in ancillary qubits or postselection procedures. We consider the case of decoherence channels acting on a single qubit belonging to a many-qubit state. Preprocessing and postprocessing operators can be either individual, which is acting on the qubit effected by the decoherence channel only, or collective, which is acting on the whole multiqubit state. We give a classification of possible strategies for the protection scheme, analyze them, and derive expressions for the optimal unitary operators providing the maximal value of the fidelity regarding initial and final states. Specifically, we demonstrate the equivalence of the schemes where one of the unitary operations is individual while the other is collective. We then consider the realization of our approach for the basic decoherence models, which include single-qubit depolarizing, dephasing, and amplitude damping channels. We also demonstrate that the decoherence robustness of multiqubit states for these decoherence models is determined by the entropy of the reduced state of the qubit undergoing the decoherence channel.

30 December 2022 in Entropy
Verified
Journal Article
Open access
PDF file
MGMaksim Gavreev
Maksim Gavreev
EKEvgeniy Kiktenko
Evgeniy Kiktenko
AMAlena Mastiukova
Alena Mastiukova
AFAleksey Fedorov
Aleksey Fedorov
Decoherence is the fundamental obstacle limiting the performance of quantum information processing devices. The problem of transmitting a quantum state (known or unknown) from one place to another is of great interest in this context. In this work, by following the recent theoretical proposal, we study an application of quantum state-dependent pre- and post-processing unitary operations for protecting the given (multi-qubit) quantum state against the effect of decoherence acting on all qubits. We observe the increase in the fidelity of the output quantum state both in a quantum emulation experiment, where all protecting unitaries are perfect, and in a real experiment with a cloud-accessible quantum processor, where protecting unitaries themselves are affected by the noise. We expect the considered approach to be useful for analyzing capabilities of quantum information processing devices in transmitting known quantum states. We also demonstrate the applicability of the developed approach for suppressing decoherence in the process of distributing a two-qubit state over remote physical qubits of a quantum processor.