Algorithms developed to solve many-body quantum problems, like tensor networks, can turn into powerful quantum-inspired tools to tackle issues in the classical domain. This work focuses on matrix product operators, a prominent numerical technique to study many-body quantum systems, especially in one dimension. It has been previously shown that such a tool can be used for classification, learning of deterministic sequence-to-sequence processes, and generic quantum processes. We further develop a matrix product operator algorithm to learn probabilistic sequence-to-sequence processes and apply this algorithm to probabilistic cellular automata. This new approach can accurately learn probabilistic cellular automata processes in different conditions, even when the process is a probabilistic mixture of different chaotic rules. In addition, we find that the ability to learn these dynamics is a function of the bitwise difference between the rules and whether one is much more likely than the other. Published by the American Physical Society 2024
Algorithms developed to solve many-body quantum problems, like tensor networks, can turn into powerful quantum-inspired tools to tackle issues in the classical domain. This work focuses on matrix product operators, a prominent numerical technique to study many-body quantum systems, especially in one dimension. It has been previously shown that such a tool can be used for classification, learning of deterministic sequence-to-sequence processes, and generic quantum processes. We further develop a matrix product operator algorithm to learn probabilistic sequence-to-sequence processes and apply this algorithm to probabilistic cellular automata. This new approach can accurately learn probabilistic cellular automata processes in different conditions, even when the process is a probabilistic mixture of different chaotic rules. In addition, we find that the ability to learn these dynamics is a function of the bitwise difference between the rules and whether one is much more likely than the other. Published by the American Physical Society 2024
The method of choice to study one-dimensional strongly interacting many-body quantum systems is based on matrix product states and operators. Such a method allows one to explore the most relevant and numerically manageable portion of an exponentially large space. It also allows one to accurately describe correlations between distant parts of a system, an important ingredient to account for the context in machine learning tasks. Here we introduce a machine learning model in which matrix product operators are trained to implement sequence-to-sequence prediction, i.e., given a sequence at a time step, it allows one to predict the next sequence. We then apply our algorithm to cellular automata (for which we show exact analytical solutions in terms of matrix product operators) and to nonlinear coupled maps. We show advantages of the proposed algorithm when compared to conditional random fields and a bidirectional, long, short-term-memory neural network. To highlight the flexibility of the algorithm, we also show that it can readily perform classification tasks.
We show how a tensor-network-based machine learning algorithm can learn the structures of generic, non-Markovian, quantum stochastic processes. First, a process is represented as a matrix product operator (MPO) and trained with a database of local input states at different times and the corresponding time-nonlocal output state. We then apply the algorithm to predict the output state of a process at different times for a system that is coupled to a spin-chain environment. We then reconstruct the full process, and we quantify the non-Markovian memory by means of the bond dimension of the MPO for various properties of the system, of the environment, and of their interaction. Our study paves the way for a possible experimental investigation into the process tensor and its properties, and an effective characterization of noise in quantum devices.
This is a set of lectures on tensor networks with a strong emphasis on the core algorithms involving Matrix Product States (MPS) and Matrix Product Operators (MPO). Compared to other presentations, particular care has been given to disentangle aspects of tensor networks from the quantum many-body problem: MPO/MPS algorithms are presented as a way to deal with linear algebra on extremely (exponentially) large matrices and vectors, regardless of any particular application. The lectures include well-known algorithms to find eigenvectors of MPOs (the celebrated DMRG), solve linear problems, and recent learning algorithms that allow one to map a known function into an MPS (the Tensor Cross Interpolation, or TCI, algorithm). The lectures end with a discussion of how to represent functions and perform calculus with tensor networks using the "quantics" representation. They include the detailed analytical construction of important MPOs such as those for differentiation, indefinite integration, convolution, and the quantum Fourier transform. Three concrete applications are discussed in detail: the simulation of a quantum computer (either exactly or with compression), the simulation of a quantum annealer, and techniques to solve partial differential equations (e.g. Poisson, diffusion, or Gross-Pitaevskii) within the "quantics" representation. The lectures have been designed to be accessible to a first-year PhD student and include detailed proofs of all statements.
Modeling joint probability distributions over sequences has been studied from many perspectives. The physics community developed matrix product states, a tensor-train decomposition for probabilistic modeling, motivated by the need to tractably model many-body systems. But similar models have also been studied in the stochastic processes and weighted automata literature, with little work on how these bodies of work relate to each other. We address this gap by showing how stationary or uniform versions of popular quantum tensor network models have equivalent representations in the stochastic processes and weighted automata literature, in the limit of infinitely long sequences. We demonstrate several equivalence results between models used in these three communities: (i) uniform variants of matrix product states, Born machines and locally purified states from the quantum tensor networks literature, (ii) predictive state representations, hidden Markov models, norm-observable operator models and hidden quantum Markov models from the stochastic process literature,and (iii) stochastic weighted automata, probabilistic automata and quadratic automata from the formal languages literature. Such connections may open the door for results and methods developed in one area to be applied in another.
Probabilistic inference is a fundamental task in modern machine learning. Recent advances in tensor network (TN) contraction algorithms have enabled the development of better exact inference methods. However, many common inference tasks in probabilistic graphical models (PGMs) still lack corresponding TN-based adaptations. In this paper, we advance the connection between PGMs and TNs by formulating and implementing tensor-based solutions for the following inference tasks: (A) computing the partition function, (B) computing the marginal probability of sets of variables in the model, (C) determining the most likely assignment to a set of variables, (D) the same as (C) but after having marginalized a different set of variables, and (E) generating samples from a learned probability distribution using a generalized method. Our study is motivated by recent technical advances in the fields of quantum circuit simulation, quantum many-body physics, and statistical physics. Through an experimental evaluation, we demonstrate that the integration of these quantum technologies with a series of algorithms introduced in this study significantly improves the performance efficiency of existing methods for solving probabilistic inference tasks. Published by the American Physical Society 2024
Classical computational simulations of biological systems, particularly at the cellular level, face significant limitations due to the exponential growth in computational requirements with system complexity. This work proposes a novel approach to simulating cellular processes utilizing quantum-inspired algorithms, specifically tensor network methods, to overcome these limitations. These algorithms mimic key aspects of quantum computation – superposition and interference – to efficiently model intricate molecular interactions and resulting emergent phenomena. The core idea is to represent complex biological systems using tensor networks, enabling parallel processing and capturing correlations inherent in quantum systems. This approach provides a computationally feasible pathway for simulating dynamic cellular behavior, offering potential breakthroughs in areas such as drug discovery, disease modeling, and understanding fundamental biological mechanisms. The presented framework focuses on the theoretical foundations and algorithmic design, without necessitating access to quantum hardware, making it immediately applicable for high-performance computing environments. We explore the mathematical formalism underpinning the method, detailing the key equations and operations involved in simulating cellular processes. The ultimate goal is to establish a robust and scalable simulation technique capable of tackling the complexities of biological systems.