Maksim Gavreev

Dr. Maksim Gavreev

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
3 October 2022 in Physical Review Research
Verified
Journal Article
Open access
PDF file
ILIlia Luchnikov
Ilia Luchnikov
EKEvgeniy Kiktenko
Evgeniy Kiktenko
MGMaksim Gavreev
Maksim Gavreev
HOHenni Ouerdane
Henni Ouerdane
Sergey FilippovSergey Filippov
Sergey Filippov
AFAleksey Fedorov
Aleksey Fedorov
A precise understanding of the influence of a quantum system's environment on its dynamics, which is at the heart of the theory of open quantum systems, is crucial for further progress in the development of controllable large-scale quantum systems. However, existing approaches to account for complex system-environment interaction in the presence of memory effects are either based on heuristic and oversimplified principles or give rise to computational difficulties. In practice, one can leverage on available experimental data and replace first-principles simulations with a data-driven analysis that is often much simpler. Inspired by recent advances in data analysis and machine learning, we propose a data-driven approach to the analysis of the non-Markovian dynamics of open quantum systems. Our method allows, on the one hand, capturing the most important characteristics of open quantum systems such as the effective dimension of the environment and the spectrum of the joint system-environment quantum dynamics, and, on the other hand, reconstructing a predictive model of non-Markovian quantum dynamics, and denoising the measured quantum trajectories. We demonstrate the performance of the proposed approach with various models of open quantum systems, including a qubit coupled with a finite environment, a spin-boson model, and the damped Jaynes-Cummings model.

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.

13 February 2024 in Physical Review Research
Verified
Journal Article
Open access
PDF file
ILIlia Luchnikov
Ilia Luchnikov
MGMaksim Gavreev
Maksim Gavreev
AFAleksey Fedorov
Aleksey Fedorov
Quantum many-body control is among the most challenging problems in quantum science due to its outstanding computational complexity in a general case. We propose an efficient approach to a class of many-body quantum control problems, where time-dependent controls are applied to a sufficiently small subsystem. The method employs a tensor-network scheme to construct a reduced-order model of a subsystem's non-Markovian dynamics. The resulting reduced-order model serves as a digital twin of the original subsystem. Such twins allow significantly more efficient dynamics simulation, which enables the use of a gradient-based optimization toolbox in the control parameter space. This approach to building control protocols takes advantage of non-Markovian dynamics of subsystems by design. We validate the proposed method by solving control problems for quantum spin chains. In particular, the approach automatically identifies control sequences for exciting and guiding quasiparticles to recover and transmit quantum information across the system. In addition, we find generalized spin-echo sequences for a system in a many-body localized phase enabling significant revivals. We expect our approach can be useful for ongoing experiments with noisy intermediate-scale quantum devices. Published by the American Physical Society 2024

28 November 2023 in IEEE Access
Verified
Journal Article
Open access
SGSergey V. Grebnev
Sergey V. Grebnev
MGMaksim Gavreev
Maksim Gavreev
EKEvgeniy Kiktenko
Evgeniy Kiktenko
AGAnton P. Guglya
Anton P. Guglya
AEAlbert R. Efivmov
Albert R. Efivmov
AFAleksey Fedorov
Aleksey Fedorov
Quantum computing devices are believed to be powerful in solving the prime factorization problem, which is at the heart of widely deployed public-key cryptographic tools. However, the implementation of Shor’s quantum factorization algorithm requires significant resources scaling linearly with the number size; taking into account an overhead that is required for quantum error correction the estimation is that 20 millions of (noisy) physical qubits are required for factoring 2048-bit RSA key in 8 hours. Recent proposal by Yan et. al. claims a possibility of solving the factorization problem with sublinear quantum resources. As we demonstrate in our work, this proposal lacks systematic analysis of the computational complexity of the classical part of the algorithm, which exploits the Schnorr’s lattice-based approach. We provide several examples illustrating the need in additional resource analysis for the proposed quantum factorization algorithm.

9 September 2025 in Physical Review A
Verified
Journal Article
Closed access
DBDaniil S. Bagaev
Daniil S. Bagaev
MGMaksim Gavreev
Maksim Gavreev
AMAlena S. Mastiukova
Alena S. Mastiukova
AFAleksey Fedorov
Aleksey Fedorov
NNNikita A. Nemkov
Nikita A. Nemkov

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.