SearcharxivSearch

arXiv subjects

I. A. Iakovlev

Publications and source records attributed to I. A. Iakovlev.

7 recordsLinked to original sources

Extremely slow scaling of minimal Hamming distance in quantum sampling data

Quantum data can be obtained from a diverse range of sources, including direct measurements from noisy quantum processors, cold-atom simulators, and classical approximations such as variational neural-network states. However, our ability to characterize these systems is fundamentally limited, as the available measurement data is often sparse compared to the exponentially large Hilbert space of the system. To address this, we propose using the average minimal Hamming distance calculated for a set of unique bitstrings as a robust metric revealing a universal power-law behaviour. Through various examples of real experiments and simulations, we show that the power-law parameters reliably capture the complexity of quantum states and identify quantum phase transitions from limited quantum information, without the need for accumulating extensive statistics or explicitly calculating physical observables. This enables the analysis of completely different quantum experiments within a single framework.

quant-ph

Quantifying spatio-temporal patterns in classical and quantum systems out of equilibrium

A rich variety of non-equilibrium dynamical phenomena and processes unambiguously calls for the development of general numerical techniques to probe and estimate a complex interplay between spatial and temporal degrees of freedom in many-body systems of completely different nature. In this work we provide a solution to this problem by adopting a structural complexity measure to quantify spatio-temporal patterns in the time-dependent digital representation of a system. On the basis of very limited amount of data our approach allows to distinguish different dynamical regimes and define critical parameters in both classical and quantum systems. By the example of the discrete time crystal realized in non-equilibrium quantum systems we provide a complete low-level characterization of this nontrivial dynamical phase with only processing bitstrings, which can be considered as a valuable alternative to previous studies based on the calculations of qubit correlation functions.

quant-ph

Certification of quantum states with hidden structure of their bitstrings

The rapid development of quantum computing technologies already made it possible to manipulate a collective state of several dozen of qubits. This success poses a strong demand on efficient and reliable methods for characterization and verification of large-scale many-body quantum states. Traditional methods, such as quantum tomography, which require storing and operating wave functions on classical computers, become problematic to use in the regime of large number of degrees of freedom. In this paper, we propose a numerically cheap procedure to describe and distinguish quantum states which is based on a limited number of simple projective measurements in at least two different bases and computing inter-scale dissimilarities of the resulting bit-string patterns via coarse-graining. The information one obtains through this procedure can be viewed as a "hash function" of quantum state -- a simple set of numbers which is specific for a concrete many-body wave function and can be used for certification. By studying a number of archetypal examples, we show that it is enough to characterize quantum states with different structure of entanglement, including the chaotic quantum states. The connection of the dissimilarity to standard measures of quantum correlations such as von Neumann entropy is discussed. We also demonstrate that our approach can be employed to detect phase transitions of different nature in many-body quantum magnetic systems.

quant-ph

Recurrent network classifier for ultrafast skyrmion dynamics

By using the supervised learning we train a recurrent neural network to recognize and classify ultrafast magnetization processes realized in two-dimensional nanosystems with Dzyaloshinskii-Moriya interaction. Our focus is on the different types of skyrmion dynamics driven by ultrafast magnetic pulses. Each process is represented as a sequence of the sorted magnetization vectors inputted into the network. The trained network can perform an accurate classification of the skyrmionic processes at zero temperature in wide ranges of parameters that are the magnetic pulse width and damping factor. The network performance is also demonstrated on different types of unseen data including finite temperature processes. Our approach can be easily adapted for creating an autonomous control system on skyrmion dynamics for experiments or device operations.

cond-mat.str-el

Supervised learning magnetic skyrmion phases

We propose and apply simple machine learning approaches for recognition and classification of complex non-collinear magnetic structures in two-dimensional materials. The first approach is based on the implementation of the single-hidden-layer neural network that only relies on the z projections of the spins. In this setup one needs a limited set of magnetic configurations to distinguish ferromag- netic, skyrmion and spin spiral phases, as well as their different combinations in transitional areas of the phase diagram. The network trained on the configurations for square-lattice Heisenberg model with Dzyaloshinskii-Moriya interaction can classify the magnetic structures obtained from Monte Carlo calculations for triangular lattice and vice versa. The second approach we apply, a minimum distance method performs a fast and cheap classification in cases when a particular configuration is to be assigned to only one magnetic phase. The methods we propose are also easy to use for analysis of the numerous experimental data collected with spin-polarized scanning tunneling microscopy and Lorentz transmission electron microscopy experiments.

cond-mat.str-el

Profile approach for recognition of three-dimensional magnetic structures

We propose an approach for low-dimensional visualisation and classification of complex topological magnetic structures formed in magnetic materials. Within the approach one converts a three-dimensional magnetic configuration to a vector containing the only components of the spins that are parallel to the z axis. The next crucial step is to sort the vector elements in ascending or descending order. Having visualized profiles of the sorted spin vectors one can distinguish configurations belonging to different phases even with the same total magnetization. For instance, spin spiral and paramagnetic states with zero total magnetic moment can be easily identified. Being combined with a simplest neural network our profile approach provides a very accurate phase classification for three-dimensional magnets characterized by complex multispiral states even in the critical areas close to phases transitions. By the example of the skyrmionic configurations we show that profile approach can be used to separate the states belonging to the same phase.

cond-mat.str-el

Bimeron nanoconfined design

We report on the stabilization of the topological bimeron excitations in confined geometries. The Monte Carlo simulations for a ferromagnet with a strong Dzyaloshinskii-Moriya interaction revealed the formation of a mixed skyrmion-bimeron phase. The vacancy grid created in the spin lattice drastically changes the picture of the topological excitations and allows one to choose between the formation of a pure bimeron and skyrmion lattice. We found that the rhombic plaquette provides a natural environment for stabilization of the bimeron excitations. Such a rhombic geometry can protect the topological state even in the absence of the magnetic field.

cond-mat.str-el