Related papers: Matrix product states for anyonic systems and effi…
Markov decisions processes (MDPs) are becoming increasing popular as models of decision theoretic planning. While traditional dynamic programming methods perform well for problems with small state spaces, structured methods are needed for…
We propose a unified mathematical framework for classifying phases of matter. The framework is based on different types of combinatorial structures with a notion of locality called lattices. A tensor lattice is a local prescription that…
In this work, we present a novel representation of matrix product states (MPS) within the framework of quasi-local algebras. By introducing an enhanced compatibility condition, we enable the extension of finite MPS to an infinite-volume…
We study the $J_1$-$J_2$ spin-$1/2$ chain using a path integral constructed over matrix product states (MPS). By virtue of its non-trivial entanglement structure, the MPS ansatz captures the key phases of the model even at a semi-classical,…
A large, or even infinite, local Hilbert space dimension poses a significant computational challenge for simulating quantum systems. In this work, we present a matrix product state (MPS)-based method for simulating one-dimensional quantum…
We present a tensorization algorithm for constructing tensor train/matrix product state (MPS) representations of functions, drawing on sketching and cross interpolation ideas. The method only requires black-box access to the target function…
The inverse problem of 'eigenstates-to-Hamiltonian' is considered for an open chain of $N$ quantum spins in the context of Many-Body-Localization. We first construct the simplest basis of the Hilbert space made of $2^N$ orthonormal…
We show how to efficiently simulate pure quantum states in one dimensional systems that have both finite energy density and vanishingly small energy fluctuations. We do so by studying the performance of a tensor network algorithm that…
The large deviation (LD) statistics of dynamical observables is encoded in the spectral properties of deformed Markov generators. Recent works have shown that tensor network methods are well suited to compute the relevant leading…
We present an approach to identify topological order based on unbiased infinite projected entangled-pair states (iPEPS) simulations, i.e. where we do not impose a virtual symmetry on the tensors during the optimization of the tensor network…
Sampling problems have emerged as a central avenue for demonstrating quantum advantage on noisy intermediate-scale quantum devices. However, physical noise can fundamentally alter their computational complexity, often making them…
This work proposes a novel robust model predictive control (MPC) algorithm for linear systems affected by dynamic model uncertainty and exogenous disturbances. The uncertainty is modeled using a linear fractional perturbation structure with…
We develop a comprehensive framework for realizing anyon condensation of topological orders within the string-net model by constructing a Hamiltonian that bridges the parent string-net model before and the child string-net model after anyon…
We focus on symmetries related to matrices and vectors appearing in the simulation of quantum many-body systems. Spin Hamiltonians have special matrix-symmetry properties such as persymmetry. Furthermore, the systems may exhibit physical…
Dynamic mode decomposition (DMD) has become a powerful data-driven method for analyzing the spatiotemporal dynamics of complex, high-dimensional systems. However, conventional DMD methods are limited to matrix-based formulations, which…
In this thesis I develop a formalism whereby a tensor network may be understood in terms of a unitary braided tensor category, and represented in a particularly efficient manner corresponding to the exploitation of this mathematical…
Understanding the quantum evolution of light in nonlinear media is central to the development of next-generation quantum technologies. Yet modeling these processes remains computationally demanding, as the required resources grow rapidly…
In traditional topology optimization, the computing time required to iteratively update the material distribution within a design domain strongly depends on the complexity or size of the problem, limiting its application in real engineering…
In this work, we combine an established method for open quantum systems -- the time evolving density matrix using orthogonal polynomials algorithm (TEDOPA) -- with the transfer tensors formalism (TTM), a new tool for the analysis,…
We present a method to apply the well-known matrix product state (MPS) formalism to partially separable states in solid state systems. The computational effort of our method is equal to the effort of the standard density matrix…