Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture: Quantum Annealing

Dennis Willsch

Published Jan 1, 2025• 0 citations
Publisher
DOI
10.34734/fzj-2025-03602

Related papers

An Introduction to quantum annealing

Kristel F. L. Michielsen

•Jan 1, 2017•0 citations

Resolution of elasto-plastic finite-elements problems by quantum annealing (Plenary Lecture)

Van Dung Nguyen, Ling Wu, F. Remacle +1 more

•Jan 7, 2025•0 citations

Quantum Annealing: an Introduction.

Diego de Falco, Enrico Pertoso, Dario Tamascelli

Italian Conference on Theoretical Computer Science•Jan 1, 2009•0 citations

Lecture Notes: Programming Quantum Computers

Madita Willsch, Dennis Willsch, Kristel F. L. Michielsen

Quantum computing is a new emerging computer technology. Current quantum computing devices are at a development stage where they are gradually becoming suitable for small real-world applications. This lecture is devoted to the practical aspects of programming such quantum computing devices. The first part of these lecture notes focuses on programming gate-based quantum computers, and the second part shows how to program quantum annealers.

arXiv:2201.02051•Jan 6, 2022•4 citations

Quantum annealing – foundations and frontiers

Eliahu Cohen, Boaz Tamir

arXiv:1408.5784•The European Physical Journal Special Topics•Feb 1, 2015•19 citations

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

Xavier Waintal, Chen-How Huang, Christoph W. Groth

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.

quant-pharXiv:2601.03035•SciPost Physics Lecture Notes•Jan 7, 2026•17 citations
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.