Who can compete with quantum computers? Lecture notes on quantum inspired tensor networks computational techniques

Abstract

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.

65 pages, 92 figures. Set of lectures given at the Jyväskylä summer school during August 2025

References in corpus (31)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• The density-matrix renormalization group in the age of matrix product states
• Area laws for the entanglement entropy - a review
• A Practical Introduction to Tensor Networks: Matrix Product States and Projected Entangled Pair States
• Improved Simulation of Stabilizer Circuits
• An Area Law for One Dimensional Quantum Systems
• The ITensor Software Library for Tensor Network Calculations
• Matrix Product States and Projected Entangled Pair States: Concepts, Symmetries, and Theorems
• Unifying time evolution and optimization with matrix product states
• Efficient numerical simulations with Tensor Networks: Tensor Network Python (TeNPy)
• Hand-waving and Interpretive Dance: An Introductory Course on Tensor Networks
• Barren Plateaus in Variational Quantum Computing
• What limits the simulation of quantum computers?
• Time integration of tensor trains
• Generic Construction of Efficient Matrix Product Operators
• Phase transition in Random Circuit Sampling
• Learning Feynman Diagrams with Tensor Trains
• Faster identification of optimal contraction sequences for tensor networks
• Quasioptimality of maximum-volume cross interpolation of tensors
• Parallel cross interpolation for high-precision calculation of high-dimensional integrals
• A density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity
• Quantum Fourier Transform Has Small Entanglement
• Contracting Arbitrary Tensor Networks: General Approximate Algorithm and Applications in Graphical Models and Quantum Circuit Simulations
• Learning tensor networks with tensor cross interpolation: new algorithms and libraries
• How to simulate quantum measurement without computing marginals
• The Quantum House Of Cards
• What determines the ultimate precision of a quantum computer?
• Superfast solution of linear convolutional Volterra equations using QTT approximation
• Direct interpolative construction of the discrete Fourier transform as a matrix product operator
• Solving the Gross-Pitaevskii equation on multiple different scales using the quantics tensor train representation
• Feasibility of performing quantum chemistry calculations on quantum computers