arXiv subjects

Oleg M. Sotnikov

Publications and source records attributed to Oleg M. Sotnikov.

6 recordsLinked to original sources

arXiv2026

Quantum-optical reset with classical memory

Dynamic quantum circuits generate states that depend on the measurement results obtained during circuit execution. To date such a quantum computing model has mainly been implemented with qubit-based superconducting hardware utilizing reset operations and classical logic. Here we develop a model of optical reset by using time-bin self-looped interferometers demonstrated in recent experiments. Synchronizing the optical reset with a simple classical device storing history of measurement results allows one to decrease uncertainty of future measurements, which suggests new possibilities for constructing dynamical circuits on optical platforms. Information flow with significant multi-time correlations and memory depth is identified through distinct information-theoretic measures. We discuss potential applications of the proposed reset model, including the realization of boson sampling and experimental tests of the quantum-mechanical formulation of Landauer's principle.

quant-ph↗

arXiv2025

Emergence of global receptive fields capturing multipartite quantum correlations

In quantum physics, even simple data with a well-defined structure at the wave function level can be characterized by extremely complex correlations between its constituent elements. The inherent non-locality of the quantum correlations generally prevents one from providing their simple and transparent interpretation, which also remains a challenging problem for advanced classical techniques that approximate quantum states with neural networks. Here we show that monitoring the neural network weight space while learning quantum statistics from measurements allows to develop physical intuition about complex multipartite patterns and thus helps to construct more effective classical representations of the wave functions. Particularly, we observe the formation of distinct global convolutional structures, receptive fields in the hidden layer of the Restricted Boltzmann Machine (RBM) within the neural quantum tomography of the highly-entangled Dicke states. On this basis we propose an exact two-parameter classical representation not only for a specific quantum wave function, but for the whole family of the N-qubit Dicke states of different entanglement. Our findings suggest a fresh look at constructing convolutional neural networks for processing data with non-local patterns and pave the way for developing exact learning-based representations of entangled quantum states.

quant-ph↗

arXiv2024

Achieving the volume-law entropy regime with random-sign Dicke states

Manipulating entanglement, which reflects non-local correlations in a quantum system and defines the complexity of describing its wave function, represents the extremely tough challenge in the fields of quantum computing, quantum information, and condensed matter physics. In this work, by the example of the well-structured Dicke states we demonstrate that the complexity of these real-valued wave functions can be accurately tuned by introducing a random-sign structure, which allows us to explore the regime of the volume-law entanglement. Importantly, setting nontrivial sign structure one can increase the entanglement entropy of the Dicke state to the values that are close to Page's estimates for Haar-random states. The practical realization of these random-sign Dicke states is possible on different physical platforms with shallow quantum circuits. On the level of the measurements the change in the quantum state complexity due to sign structure can be traced out with the dissimilarity measure that estimates multi-scale variety of patterns in bit-string arrays.

quant-ph↗

arXiv2023

Benchmarking a boson sampler with Hamming nets

Analyzing the properties of complex quantum systems is crucial for further development of quantum devices, yet this task is typically challenging and demanding with respect to required amount of measurements. A special attention to this problem appears within the context of characterizing outcomes of noisy intermediate-scale quantum devices, which produce quantum states with specific properties so that it is expected to be hard to simulate such states using classical resources. In this work, we address the problem of characterization of a boson sampling device, which uses interference of input photons to produce samples of non-trivial probability distributions that at certain condition are hard to obtain classically. For realistic experimental conditions the problem is to probe multi-photon interference with a limited number of the measurement outcomes without collisions and repetitions. By constructing networks on the measurements outcomes, we demonstrate a possibility to discriminate between regimes of indistinguishable and distinguishable bosons by quantifying the structures of the corresponding networks. Based on this we propose a machine-learning-based protocol to benchmark a boson sampler with unknown scattering matrix. Notably, the protocol works in the most challenging regimes of having a very limited number of bitstrings without collisions and repetitions. As we expect, our framework can be directly applied for characterizing boson sampling devices that are currently available in experiments.

quant-ph↗

arXiv2023

Estimating Patterns of Classical and Quantum Skyrmion States

In this review we discuss the latest results concerning development of the machine learning algorithms for characterization of the magnetic skyrmions that are topologically-protected magnetic textures originated from the Dzyaloshinskii-Moriya interaction that competes Heisenberg isotropic exchange in ferromagnets. We show that for classical spin systems there is a whole pool of machine approaches allowing their accurate phase classification and quantitative description on the basis of few magnetization snapshots. In turn, investigation of the quantum skyrmions is a less explored issue, since there are fundamental limitations on the simulation of such wave functions with classical supercomputers. One needs to find the ways to imitate quantum skyrmions on near-term quantum computers. In this respect, we discuss implementation of the method for estimating structural complexity of classical objects for characterization of the quantum skyrmion state on the basis of limited number of bitstrings obtained from the projective measurements.

cond-mat.str-el↗

arXiv2019

Neural network agent playing spin Hamiltonian games on a quantum computer

Quantum computing is expected to provide new promising approaches for solving the most challenging problems in material science, communication, search, machine learning and other domains. However, due to the decoherence and gate imperfection errors modern quantum computer systems are characterized by a very complex, dynamical, uncertain and fluctuating computational environment. We develop an autonomous agent effectively interacting with such an environment to solve magnetism problems. By using the reinforcement learning the agent is trained to find the best-possible approximation of a spin Hamiltonian ground state from self-play on quantum devices. We show that the agent can learn the entanglement to imitate the ground state of the quantum spin dimer. The experiments were conducted on quantum computers provided by IBM. To compensate the decoherence we use local spin correction procedure derived from a general sum rule for spin-spin correlation functions of a quantum system with even number of antiferromagnetically-coupled spins in the ground state. Our study paves a way to create a new family of the neural network eigensolvers for quantum computers.

quant-ph↗