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

• URL: http://arxiv.org/abs/2601.03035v1
• Date: Tue, 06 Jan 2026 14:09:10 GMT
• Title: Who can compete with quantum computers? Lecture notes on quantum inspired tensor networks computational techniques
• Authors: Xavier Waintal, Chen-How Huang, Christoph W. Groth,
• Abstract summary: The lectures include well-known algorithms to find eigenvectors of MPOs, solve linear problems, and recent learning algorithms that allow one to map a known function into an MPS.<n>The lectures end with a discussion of how to represent functions and perform calculus with tensor networks using the "quantics" representation.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Approximate simulation of complex quantum circuits using sparse tensors [0.0]
  We introduce a method to approximately simulate quantum circuits using sparse tensors.<n>We show that the data structure and contraction algorithm are efficient, leading to expected runtime scalings versus qubit number and circuit depth.
  arXiv  Detail & Related papers  (2026-02-03T20:58:32Z)
• Solving Linear Systems of Equations with the Quantum HHL Algorithm: A Tutorial on the Physical and Mathematical Foundations for Undergraduate Students [36.94429692322632]
  In 2009, Harrow, Hassidim and Lloyd proposed an algorithm for solving linear systems of equations with a complexity of $poly(log N)$.<n>This paper presents a tutorial addressing the physical and mathematical foundations of the HHL algorithm, aimed at undergraduate students.
  arXiv  Detail & Related papers  (2025-09-20T11:37:48Z)
• Tensor Network Techniques for Quantum Computation [41.94295877935867]
  This book serves as an introductory yet thorough guide to tensor networks and their applications in quantum computation and quantum information.<n>In Part I, foundational topics are covered, including tensor structures and network representations like Matrix Product States (MPS) and Tree Networks (TTN)<n>Part II explores practical applications of tensor networks in simulating quantum dynamics.<n>A final chapter addresses the emerging role of "quantum magic" in tensor networks.
  arXiv  Detail & Related papers  (2025-03-06T13:31:17Z)
• Quantum Annealing and Tensor Networks: a Powerful Combination to Solve Optimization Problems [0.0]
  The aim of this thesis is not to compare quantum devices with tensor network algorithms.<n>We explore a potential synergy between these technologies, focusing on how two flagship algorithms might collaborate in the future.<n>This thesis outlines an approach to this problem using finite automata, which we apply to construct the MPO for our case study.
  arXiv  Detail & Related papers  (2024-12-07T09:20:20Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Hybrid Quantum-Classical Machine Learning with String Diagrams [49.1574468325115]
  This paper develops a formal framework for describing hybrid algorithms in terms of string diagrams. A notable feature of our string diagrams is the use of functor boxes, which correspond to a quantum-classical interfaces.
  arXiv  Detail & Related papers  (2024-07-04T06:37:16Z)
• Tensor Quantum Programming [0.0]
  We develop an algorithm that encodes Matrix Product Operators into quantum circuits with a depth that depends linearly on the number of qubits. It demonstrates effectiveness on up to 50 qubits for several frequently encountered in differential equations, optimization problems, and quantum chemistry.
  arXiv  Detail & Related papers  (2024-03-20T10:44:00Z)
• A hybrid quantum-classical algorithm for multichannel quantum scattering of atoms and molecules [62.997667081978825]
  We propose a hybrid quantum-classical algorithm for solving the Schr"odinger equation for atomic and molecular collisions. The algorithm is based on the $S$-matrix version of the Kohn variational principle, which computes the fundamental scattering $S$-matrix. We show how the algorithm could be scaled up to simulate collisions of large polyatomic molecules.
  arXiv  Detail & Related papers  (2023-04-12T18:10:47Z)
• TeD-Q: a tensor network enhanced distributed hybrid quantum machine learning framework [48.491303218786044]
  TeD-Q is an open-source software framework for quantum machine learning.<n>It seamlessly integrates classical machine learning libraries with quantum simulators.<n>It provides a graphical mode in which the quantum circuit and the training progress can be visualized in real-time.
  arXiv  Detail & Related papers  (2023-01-13T09:35:05Z)
• A didactic approach to quantum machine learning with a single qubit [68.8204255655161]
  We focus on the case of learning with a single qubit, using data re-uploading techniques. We implement the different proposed formulations in toy and real-world datasets using the qiskit quantum computing SDK.
  arXiv  Detail & Related papers  (2022-11-23T18:25:32Z)
• Variational Quantum Continuous Optimization: a Cornerstone of Quantum Mathematical Analysis [0.0]
  We show how universal quantum computers can handle mathematical analysis calculations for functions with continuous domains. The basic building block of our approach is a variational quantum circuit where each qubit encodes up to three continuous variables. By combining this encoding with quantum state tomography, a variational quantum circuit of $n$ qubits can optimize functions of up to $3n$ continuous variables.
  arXiv  Detail & Related papers  (2022-10-06T18:00:04Z)
• Efficient construction of tensor-network representations of many-body Gaussian states [59.94347858883343]
  We present a procedure to construct tensor-network representations of many-body Gaussian states efficiently and with a controllable error. These states include the ground and thermal states of bosonic and fermionic quadratic Hamiltonians, which are essential in the study of quantum many-body systems.
  arXiv  Detail & Related papers  (2020-08-12T11:30:23Z)
• Simple heuristics for efficient parallel tensor contraction and quantum circuit simulation [1.4416132811087747]
  We propose a parallel algorithm for the contraction of tensor networks using probabilistic models. We apply the resulting algorithm to the simulation of random quantum circuits.
  arXiv  Detail & Related papers  (2020-04-22T23:00:42Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.