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

Boolean Domains, Numbers, and Vectors

Christian Bauckhage, Rafet Sifa

Published Nov 17, 2025• 0 citations
Publisher

Abstract

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.

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

Related papers

Hopfield Nets and Quantum Mechanics

Christian Bauckhage, Rafet Sifa

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.

Cognitive technologies•Nov 17, 2025•0 citations

Mathematical Background

Muhammad Suhail Zubairy

In the spirit of making this book reasonably self-contained, certain topics that may be required in understanding the foundation and the applications of quantum mechanics are discussed. Foremost are the definition and properties of the complex numbers, such as De Moivre’s theorem and Euler’s identity. Trigonometry and vector analysis are the necessary topics for almost any discussion of physical phenomena. In this chapter these topics are discussed to the extent that makes their use in subsequent chapters quite natural and normal. Another topic that reverberates throughout this book due to the nature of quantum mechanics is probability theory. Here the main ideas of probability theory are presented that should be sufficient for an understanding of the topics discussed in this book.

Oxford University Press eBooks•May 7, 2020•0 citations

Traditional Bits in New Clothing

Alice Flarend, Bob Hilborn

Abstract After a quick review of Chapter 2’s bits and gates, Bob and Alice introduce Cardy to several concepts and symbolic representations that will be of crucial importance in understanding quantum computing: state vectors, pictorial representations of state vectors, and simple mathematical forms that help us manipulate and reason about state vectors. State vectors may be represented by arrows in a state space diagram. States may also be represented more abstractly using Dirac notation symbols |⟩. Logic gates, critically important for carrying out computational work, can be represented by mathematical objects called matrices. States are represented by column vectors. Everything you need to know about matrices is presented over just a few pages.

Oxford University Press eBooks•Apr 15, 2022•0 citations

QUBO Models

Christian Bauckhage, Rafet Sifa

Abstract Having previously studied general aspects of QUBO models, we now study application specific examples and how to derive or set them up. Our application examples will consider problems in areas like combinatorial optimization, constraint satisfaction, data mining, and machine learning and are supposed to illustrate that QUBOs provide us with a surprisingly versatile and widely applicable modeling framework. Put differently, our overall goal with this chapter is to demonstrate how to rethink familiar, seemingly unrelated problems in terms of an overarching formalism that will later allow for running Hopfield nets and quantum implementations. This will largely be an exercise in applied linear algebra since we will extensively work with matrix-vector formulations of QUBOs for which we will point out and discuss simplifying modeling assumptions whenever necessary.

Cognitive technologies•Nov 17, 2025•0 citations

The Language of Quantum Mechanics

Eduardo R. Mucciolo

In this chapter we go through the essential mathematical tools needed to develop a quantitative description of quantum systems. The content will seem a bit dry and abstract, but gaining a good grasp of the concepts and the math of vectors and operators will make understanding quantum information processing a lot easier. So, take your time when studying this chapter. It will pay off.

CRC Press eBooks•Aug 6, 2025•0 citations

Kronecker Products

Christian Bauckhage, Rafet Sifa

Abstract Tensor products or, more specifically, Kronecker products play a fundamental role in quantum computing and can also help with modeling certain combinatorial problems. In this chapter, we therefore discuss Kronecker products and their properties. To segue into this discussion, we first introduce the important notion of pseudo Boolean functions and look at their relations to multilinear algebra. Given this use case, we can easily understand the role of different kinds of tensor products and investigate algebraic properties especially of Kronecker products.

Cognitive technologies•Nov 17, 2025•1 citation
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.
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 the spirit of making this book reasonably self-contained, certain topics that may be required in understanding the foundation and the applications of quantum mechanics are discussed. Foremost are the definition and properties of the complex numbers, such as De Moivre’s theorem and Euler’s identity. Trigonometry and vector analysis are the necessary topics for almost any discussion of physical phenomena. In this chapter these topics are discussed to the extent that makes their use in subsequent chapters quite natural and normal. Another topic that reverberates throughout this book due to the nature of quantum mechanics is probability theory. Here the main ideas of probability theory are presented that should be sufficient for an understanding of the topics discussed in this book.
Abstract After a quick review of Chapter 2’s bits and gates, Bob and Alice introduce Cardy to several concepts and symbolic representations that will be of crucial importance in understanding quantum computing: state vectors, pictorial representations of state vectors, and simple mathematical forms that help us manipulate and reason about state vectors. State vectors may be represented by arrows in a state space diagram. States may also be represented more abstractly using Dirac notation symbols |⟩. Logic gates, critically important for carrying out computational work, can be represented by mathematical objects called matrices. States are represented by column vectors. Everything you need to know about matrices is presented over just a few pages.
Abstract Having previously studied general aspects of QUBO models, we now study application specific examples and how to derive or set them up. Our application examples will consider problems in areas like combinatorial optimization, constraint satisfaction, data mining, and machine learning and are supposed to illustrate that QUBOs provide us with a surprisingly versatile and widely applicable modeling framework. Put differently, our overall goal with this chapter is to demonstrate how to rethink familiar, seemingly unrelated problems in terms of an overarching formalism that will later allow for running Hopfield nets and quantum implementations. This will largely be an exercise in applied linear algebra since we will extensively work with matrix-vector formulations of QUBOs for which we will point out and discuss simplifying modeling assumptions whenever necessary.
Abstract Tensor products or, more specifically, Kronecker products play a fundamental role in quantum computing and can also help with modeling certain combinatorial problems. In this chapter, we therefore discuss Kronecker products and their properties. To segue into this discussion, we first introduce the important notion of pseudo Boolean functions and look at their relations to multilinear algebra. Given this use case, we can easily understand the role of different kinds of tensor products and investigate algebraic properties especially of Kronecker products.