Zobrazeno 1 - 10
of 29
pro vyhledávání: '"Schutski, Roman"'
Autor:
Zholus, Artem, Kuznetsov, Maksim, Schutski, Roman, Shayakhmetov, Rim, Polykovskiy, Daniil, Chandar, Sarath, Zhavoronkov, Alex
Generating novel active molecules for a given protein is an extremely challenging task for generative models that requires an understanding of the complex physical interactions between the molecule and its environment. In this paper, we present a nov
Externí odkaz:
http://arxiv.org/abs/2406.03686
Autor:
Sozykin, Konstantin, Chertkov, Andrei, Schutski, Roman, Phan, Anh-Huy, Cichocki, Andrzej, Oseledets, Ivan
We present a novel procedure for optimization based on the combination of efficient quantized tensor train representation and a generalized maximum matrix volume principle. We demonstrate the applicability of the new Tensor Train Optimizer (TTOpt) me
Externí odkaz:
http://arxiv.org/abs/2205.00293
In this work, we present a new large-scale quantum circuit simulator. It is based on the tensor network contraction technique to represent quantum circuits. We propose a novel parallelization algorithm based on \stepslice . In this paper, we push the
Externí odkaz:
http://arxiv.org/abs/2012.02430
Publikováno v:
Phys. Rev. A 102, 062614 (2020)
Tensor networks are the main building blocks in a wide variety of computational sciences, ranging from many-body theory and quantum computing to probability and machine learning. Here we propose a parallel algorithm for the contraction of tensor netw
Externí odkaz:
http://arxiv.org/abs/2004.10892
Publikováno v:
Phys. Rev. A 101, 042335 (2020)
Efficient simulation of quantum computers is essential for the development and validation of near-term quantum devices and the research on quantum algorithms. Up to date, two main approaches to simulation were in use, based on either full state or si
Externí odkaz:
http://arxiv.org/abs/1911.12242
Publikováno v:
NeurIPS 2020 Learning Meets Combinatorial Algorithms Workshop
We propose a Reinforcement Learning based approach to approximately solve the Tree Decomposition (TD) problem. TD is a combinatorial problem, which is central to the analysis of graph minor structure and computational complexity, as well as in the al
Externí odkaz:
http://arxiv.org/abs/1910.08371
Publikováno v:
Phys. Rev. C 99, 034320 (2019)
The impact of applying state-of-the-art tensor factorization techniques to modern nuclear Hamiltonians derived from chiral effective field theory is investigated. Subsequently, the error induced by the tensor decomposition of the input Hamiltonian on
Externí odkaz:
http://arxiv.org/abs/1810.08419
Publikováno v:
J. Chem. Phys. 147, 184113 (2017)
We derive and implement a new way of solving coupled cluster equations with lower computational scaling. Our method is based on decomposition of both amplitudes and two electron integrals, using a combination of tensor hypercontraction and canonical
Externí odkaz:
http://arxiv.org/abs/1708.02674
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.