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

Cognitive technologies

Hopfield Nets and Quantum Mechanics

Christian Bauckhage, Rafet Sifa

Published Nov 17, 2025• 0 citations
Publisher

Abstract

Abstract Previously, we viewed Hopfield nets from the point of view of statistical mechanics. In this chapter, we widen our perspective one again and view them from the point of view of quantum mechanics. This requires us to introduce completely different representations of the states and energy functions of Hopfield nets and relate them to the kind of tensor product spaces we studied earlier. At this point, this different perspective on Hopfield nets is of purely theoretical interest because it generally defies practical implementations on digital computers. However, it establishes a connection between Hopfield nets and important quantum mechanical concepts. In particular, we will get to know the notion of the Hamiltonian of a physical system, its eigenstates, and eigenvalues. Since the material in this chapter is more abstract and less intuitive than in previous chapters, we develop our ideas by looking at an exemplary simple Hopfield net and support our technical claims through practical computations and code examples.

DOI
10.1007/978-3-031-99402-9_9

Related papers

Introduction to Elementary Quantum Mechanics and Stability of the First Kind

Élliott H. Lieb, Robert Seiringer

In this second chapter we will review the basic mathematical and physical facts about quantum mechanics and establish physical units and notation. Those readers already familiar with the subject can safely jump to the next chapter. An attempt has been made to make the presentation in this chapter as elementary as possible, and yet present the basic facts that will be needed later. There are many beautiful and important topics which will not be touched upon such as self-adjointness of Schrödinger operators, the general mathematical structure of quantum mechanics and the like. These topics are well described in other works, e.g.. Much of the following can be done in a Euclidean space of arbitrary dimension, but in this chapter the dimension of the Euclidean space is taken to be three-which is the physical case-unless otherwise stated. We do this to avoid confusion and, occasionally, complications that arise in the computation of mathematical constants. The interested reader can easily generalize what is done here to the R d , d > 3 case. Likewise, in the next chapters we mostly consider N particles, with spatial coordinates in R 3 , so that the total spatial dimension is 3 N . A Brief Review of the Connection Between Classical and Quantum Mechanics Considering the range of validity of quantum mechanics, it is not surprising that its formulation is more complicated and abstract than classical mechanics. Nevertheless, classical mechanics is a basic ingredient for quantum mechanics. One still talks about position, momentum and energy which are notions from Newtonian mechanics.

Cambridge University Press eBooks•Nov 5, 2009•0 citations

Introduction to Quantum Formalism

In this chapter we present a very brief introduction to the quantum formalism. On one hand, the chapter can serve as the first step towards understanding quantum theory. We present sufficient material to understand essentials of quantum theory and especially its probability structure. On the other hand, the chapter may be of some interest for physicists who know quantum theory very well, since this is quite an unusual introduction to the quantum formalism. To escape mathematical difficulties, we restrict our considerations to the case of finite dimensional state spaces . However, the basic definitions and constructions are applicable even for infinite-dimensional state spaces. Interpretational issues will be considered in Chapter 6.

IMPERIAL COLLEGE PRESS eBooks•Feb 28, 2016•0 citations

Adiabatic Quantum Computing

Christian Bauckhage, Rafet Sifa

Abstract In this chapter, we finally have our first look at quantum computing. In particular, we consider adiabatic quantum computing which is a paradigm tailored to the general problem of bipolar QUBO solving. Given our study up to this point, its basic principles will be easy to understand since Hopfield nets for problem solving and adiabatic quantum computing are closely related concepts. Indeed, we already know about tensor products, Hopfield energies and their representation in terms of Hamiltonians, annealing, the axioms of quantum mechanics, the Schrödinger equation, and quantum superposition. All these concepts will now be jointly put to use and brought together with yet another quantum mechanical principle, namely the adiabatic theorem. Based on two examples of simple QUBO problems, we demonstrate how adiabatic quantum computers can explore their exponentially large search spaces in parallel and thus achieve quadratic speedup over classical exhaustive search procedures.

Cognitive technologies•Nov 17, 2025•0 citations

QUBOs

Christian Bauckhage, Rafet Sifa

Abstract In previous chapters, we already came across an instance of a quadratic unconstrained binary optimization problem or QUBO for short. In this chapter, we will now widen our perspective on QUBOs as our major plot line in this book is that any QUBO can be solved by running a Hopfield net and that any problem that can be solved by running a Hopfield net can be solved on a quantum computer. In other words, we will have a closer look at the characteristics and structure of QUBOs and discuss some of their notable peculiarities. However, we will not yet look at practical examples nor will we discuss how to actually solve QUBOs but leave these aspects to later chapters.

Cognitive technologies•Nov 17, 2025•0 citations

Quantum mechanics, functional integrals

Lowell S. Brown

Quantum field theories are quantum mechanical systems with an infinite number of degrees of freedom. We start this book with a review of quantum mechanics in a form that is particularly suited for the field theory generalization. This form utilizes the Heisenberg picture and the functional integral representation of probability amplitudes — the transformation functions of Dirac. Some time will be spent developing and discussing the functional or path integral representation of quantum mechanics since this will enable us to learn a new formalism in a simple and familiar physical context — we won't have to learn too many new things all at once. The functional formulation will be illustrated by applying it at some length to the harmonic oscillator which is not only the simplest (and exactly soluble) non-trivial quantum system but which is also the dynamics of a single mode of a free field theory. The purpose of this review of quantum mechanics is to introduce in the simplest form much of the notation and methods used later in the book. Throughout this chapter we will explicitly work only with systems that have a single degree of freedom (one coordinate variable). The extension to systems with several degrees of freedom is straightforward.

Cambridge University Press eBooks•Sep 10, 1992•0 citations

Boolean Domains, Numbers, and Vectors

Christian Bauckhage, Rafet Sifa

Abstract If we want to firmly understand the behavior of Hopfield nets and many quantum computing algorithms, we first need to understand quite a few properties of vectors whose entries can only assume one of two values. In this chapter, we therefore look at sets of bivalent numbers and vectors and study their characteristics from various different angles. These include Boolean logic, (multi-)liner algebra, probability theory and statistics, geometry, and graph theory. The content of this chapter is therefore dense and technical but its seemingly unrelated topics turn out to be interlinked and fundamental to many of the upcoming chapters. In short, this chapter equips us with a very broad perspective on the apparently innocuous ideas of bivalent numbers and vectors and introduces important terminology and concepts which we will need later on.

Cognitive technologies•Nov 17, 2025•0 citations
Abstract Previously, we viewed Hopfield nets from the point of view of statistical mechanics. In this chapter, we widen our perspective one again and view them from the point of view of quantum mechanics. This requires us to introduce completely different representations of the states and energy functions of Hopfield nets and relate them to the kind of tensor product spaces we studied earlier. At this point, this different perspective on Hopfield nets is of purely theoretical interest because it generally defies practical implementations on digital computers. However, it establishes a connection between Hopfield nets and important quantum mechanical concepts. In particular, we will get to know the notion of the Hamiltonian of a physical system, its eigenstates, and eigenvalues. Since the material in this chapter is more abstract and less intuitive than in previous chapters, we develop our ideas by looking at an exemplary simple Hopfield net and support our technical claims through practical computations and code examples.
In this second chapter we will review the basic mathematical and physical facts about quantum mechanics and establish physical units and notation. Those readers already familiar with the subject can safely jump to the next chapter. An attempt has been made to make the presentation in this chapter as elementary as possible, and yet present the basic facts that will be needed later. There are many beautiful and important topics which will not be touched upon such as self-adjointness of Schrödinger operators, the general mathematical structure of quantum mechanics and the like. These topics are well described in other works, e.g.. Much of the following can be done in a Euclidean space of arbitrary dimension, but in this chapter the dimension of the Euclidean space is taken to be three-which is the physical case-unless otherwise stated. We do this to avoid confusion and, occasionally, complications that arise in the computation of mathematical constants. The interested reader can easily generalize what is done here to the R d , d > 3 case. Likewise, in the next chapters we mostly consider N particles, with spatial coordinates in R 3 , so that the total spatial dimension is 3 N . A Brief Review of the Connection Between Classical and Quantum Mechanics Considering the range of validity of quantum mechanics, it is not surprising that its formulation is more complicated and abstract than classical mechanics. Nevertheless, classical mechanics is a basic ingredient for quantum mechanics. One still talks about position, momentum and energy which are notions from Newtonian mechanics.
In this chapter we present a very brief introduction to the quantum formalism. On one hand, the chapter can serve as the first step towards understanding quantum theory. We present sufficient material to understand essentials of quantum theory and especially its probability structure. On the other hand, the chapter may be of some interest for physicists who know quantum theory very well, since this is quite an unusual introduction to the quantum formalism. To escape mathematical difficulties, we restrict our considerations to the case of finite dimensional state spaces . However, the basic definitions and constructions are applicable even for infinite-dimensional state spaces. Interpretational issues will be considered in Chapter 6.
Abstract In this chapter, we finally have our first look at quantum computing. In particular, we consider adiabatic quantum computing which is a paradigm tailored to the general problem of bipolar QUBO solving. Given our study up to this point, its basic principles will be easy to understand since Hopfield nets for problem solving and adiabatic quantum computing are closely related concepts. Indeed, we already know about tensor products, Hopfield energies and their representation in terms of Hamiltonians, annealing, the axioms of quantum mechanics, the Schrödinger equation, and quantum superposition. All these concepts will now be jointly put to use and brought together with yet another quantum mechanical principle, namely the adiabatic theorem. Based on two examples of simple QUBO problems, we demonstrate how adiabatic quantum computers can explore their exponentially large search spaces in parallel and thus achieve quadratic speedup over classical exhaustive search procedures.
Abstract In previous chapters, we already came across an instance of a quadratic unconstrained binary optimization problem or QUBO for short. In this chapter, we will now widen our perspective on QUBOs as our major plot line in this book is that any QUBO can be solved by running a Hopfield net and that any problem that can be solved by running a Hopfield net can be solved on a quantum computer. In other words, we will have a closer look at the characteristics and structure of QUBOs and discuss some of their notable peculiarities. However, we will not yet look at practical examples nor will we discuss how to actually solve QUBOs but leave these aspects to later chapters.
Quantum field theories are quantum mechanical systems with an infinite number of degrees of freedom. We start this book with a review of quantum mechanics in a form that is particularly suited for the field theory generalization. This form utilizes the Heisenberg picture and the functional integral representation of probability amplitudes — the transformation functions of Dirac. Some time will be spent developing and discussing the functional or path integral representation of quantum mechanics since this will enable us to learn a new formalism in a simple and familiar physical context — we won't have to learn too many new things all at once. The functional formulation will be illustrated by applying it at some length to the harmonic oscillator which is not only the simplest (and exactly soluble) non-trivial quantum system but which is also the dynamics of a single mode of a free field theory. The purpose of this review of quantum mechanics is to introduce in the simplest form much of the notation and methods used later in the book. Throughout this chapter we will explicitly work only with systems that have a single degree of freedom (one coordinate variable). The extension to systems with several degrees of freedom is straightforward.
Abstract If we want to firmly understand the behavior of Hopfield nets and many quantum computing algorithms, we first need to understand quite a few properties of vectors whose entries can only assume one of two values. In this chapter, we therefore look at sets of bivalent numbers and vectors and study their characteristics from various different angles. These include Boolean logic, (multi-)liner algebra, probability theory and statistics, geometry, and graph theory. The content of this chapter is therefore dense and technical but its seemingly unrelated topics turn out to be interlinked and fundamental to many of the upcoming chapters. In short, this chapter equips us with a very broad perspective on the apparently innocuous ideas of bivalent numbers and vectors and introduces important terminology and concepts which we will need later on.