activity
20162023
most citedGrassmann phase-space methods for fermions: uncovering classical probability structure

8 citations · 34 across the 12 of their papers we have counts for

collaborators

12 papers

quant-ph2023★ 5 cited

Probing quantum chaos with the entropy of decoherent histories

Evgeny Polyakov, Nataliya Arefyeva

Quantum chaos, a phenomenon that began to be studied in the last century, still does not have a rigorous understanding. By virtue of the correspondence principle, the properties of…

quant-ph2022★ 1 cited

Beyond The Fermi's Golden Rule: Discrete-Time Decoherence Of Quantum Mesoscopic Devices Due To Bandlimited Quantum Noise

Evgeny A. Polyakov

We are at the midst of second quantum revolution where the mesoscopic quantum devies are actively employed for technological purposes. Despite this fact, the description of their r…

quant-ph2020

Real-Time Motion of Open Quantum Systems: Structure of Entanglement, Renormalization Group, and Trajectories

Evgeny A. Polyakov

In this work we provide a complete description of the lifecycle of entanglement during the real-time motion of open quantum systems. The quantum environment can have arbitrary (e.g…

cond-mat.dis-nn2020★ 2 cited

Effectively Trainable Semi-Quantum Restricted Boltzmann Machine

Ya. S. Lyakhova, E. A. Polyakov, A. N. Rubtsov

We propose a novel quantum model for the restricted Boltzmann machine (RBM), in which the visible units remain classical whereas the hidden units are quantized as noninteracting fe…

cond-mat.str-el2019

Non-Markovian Quantum State Diffusion in a Fermionic Bath

Evgeny A. Polyakov, Alexey N. Rubtsov

We present a stochastic approach for the description of the quantum dynamics of open system in a fermionic environment (bath). The full quantum evolution as provided by the Schrodi…

quant-ph2019★ 4 cited

Highly parallel algorithm for the Ising ground state searching problem

A. Yavorsky, L. A. Markovich, E. A. Polyakov +1

Finding an energy minimum in the Ising model is an exemplar objective, associated with many combinatorial optimization problems, that is computationally hard in general, but occurs…