Related papers: A Matrix Product State Representation of Boolean F…
Partially observable Markov decision processes (POMDPs) provide an elegant mathematical framework for modeling complex decision and planning problems in stochastic domains in which states of the system are observable only indirectly, via a…
Learning effective numerical representations, or embeddings, of programs is a fundamental prerequisite for applying machine learning to automate and enhance compiler optimization. Prevailing paradigms, however, present a dilemma. Static…
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…
Selman and Kautz's work on ``knowledge compilation'' established how approximation (strengthening and/or weakening) of a propositional knowledge-base can be used to speed up query processing, at the expense of completeness. In this…
Tensor network methods as presented in our open source Matrix Product States software have opened up the possibility to study many-body quantum physics in one and quasi-one-dimensional systems in an easily accessible package similar to…
We adapt the time-evolving block decimation (TEBD) algorithm, originally devised to simulate the dynamics of 1D quantum systems, to simulate the time-evolution of non-equilibrium stochastic systems. We describe this method in detail; a…
The rapid growth of entanglement under unitary time evolution is the primary bottleneck for modern tensor-network techniques--such as Matrix Product States (MPS)--when computing time-dependent expectation values. This {entanglement barrier}…
Quantum state tomography (QST) is the gold standard technique for obtaining an estimate for the state of small quantum systems in the laboratory. Its application to systems with more than a few constituents (e.g. particles) soon becomes…
Relativistic continuous matrix product states (RCMPS) are a powerful variational ansatz for quantum field theories of a single field. However, they inherit a property of their non-relativistic counterpart that makes them divergent for…
In this work, we study the Neural Tangent Kernel (NTK) of Matrix Product States (MPS) and the convergence of its NTK in the infinite bond dimensional limit. We prove that the NTK of MPS asymptotically converges to a constant matrix during…
We present an alternative to the conventional matrix product state representation, which allows us to avoid the explicit local Hilbert space truncation many numerical methods employ. Utilising chain mappings corresponding to linear and…
We introduce TensorMixedStates, a Julia library built on top of ITensor which allows the simulation of quantum systems in the presence of dissipation using matrix product states (MPS). It offers three key features: i) it implements the MPS…
Matrix product density operators (MPDOs) are tensor network representations of locally purified density matrices where each physical degree of freedom is associated to an environment degree of freedom. MPDOs have interesting properties for…
We obtain an exact matrix-product-state (MPS) representation of a large series of fractional quantum Hall (FQH) states in various geometries of genus 0. The states in question include all paired k=2 Jack polynomials, such as the Moore-Read…
Determinantal Point Processes (DPPs) are probabilistic models that arise in quantum physics and random matrix theory and have recently found numerous applications in computer science. DPPs define distributions over subsets of a given ground…
In the era of noisy, intermediate-scale quantum (NISQ) devices, the efficient preparation of many-body resource states is a task of paramount importance. In this paper we focus on the deterministic preparation of matrix-product states (MPS)…
We present a method to approximate functionals $\text{Tr} \, f(A)$ of very high-dimensional hermitian matrices $A$ represented as Matrix Product Operators (MPOs). Our method is based on a reformulation of a block Lanczos algorithm in tensor…
Bosonic Gaussian states are ubiquitous in quantum optics and condensed matter physics. While they are efficiently handled within the Gaussian formalism, sampling requires calculating amplitudes in the boson occupation basis. This step,…
Bidirectional reflectance distribution functions (BRDFs) are pervasively used in computer graphics to produce realistic physically-based appearance. In recent years, several works explored using neural networks to represent BRDFs, taking…
We develop fast and memory efficient numerical methods for learning functions of many variables that admit sparse representations in terms of general bounded orthonormal tensor product bases. Such functions appear in many applications…