Related publications (8)

Riemannian Optimization For High-Dimensional Tensor Completion

Michael Maximilian Steinlechner

Tensor completion aims to reconstruct a high-dimensional data set where the vast majority of entries is missing. The assumption of low-rank structure in the underlying original data allows us to cast the completion problem into an optimization problem rest ...
Siam Publications2016

Implementing global Abelian symmetries in projected entangled-pair state algorithms

Due to the unfavorable scaling of tensor-network methods with the refinement parameter M, new approaches are necessary to improve the efficiency of numerical simulations based on such states, in particular for gapless, strongly entangled systems. In one-di ...
2011

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.