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

arXiv:cs/0001001

Von Neumann Quantum Logic vs. Classical von Neumann Architecture?

Alexander Yu. Vlasov

Published Jan 3, 2000• 0 citations
arXivHTMLPDF

Abstract

The name of John von Neumann is common both in quantum mechanics and computer science. Are they really two absolutely unconnected areas? Many works devoted to quantum computations and communications are serious argument to suggest about existence of such a relation, but it is impossible to touch the new and active theme in a short review. In the paper are described the structures and models of linear algebra and just due to their generality it is possible to use universal description of very different areas as quantum mechanics and theory of Bayesian image analysis, associative memory, neural networks, fuzzy logic.

DOI
10.48550/arxiv.cs/0001001

Related papers

The logic of quantum mechanics – Take II

Bob Coecke

. We put forward a new take on the logic of quantum mechanics, following Schrödinger's point of view that it is composition which makes quantum theory what it is, rather than its particular propositional structure due to the existence of superpositions, as proposed by Birkhoff and von Neumann. This gives rise to an intrinsically quantitative kind of logic, which truly deserves the name ‘logic’ in that it also models meaning in natural language, the latter being the origin of logic, that it supports automation, the most prominent practical use of logic, and that it supports probabilistic inference. The physics and the logic of quantum-ish logic. In 1932 John von Neumann formalized Quantum Mechanics in his book “Mathematische Grundlagen der Quantenmechanik”. This was effectively the official birth of the quantum mechanical formalism which until now, some 75 years later, has remained the same. Quantum theory underpins so many things in our daily lives including chemical industry, energy production and information technology, which arguably makes it the most technologically successful theory of physics ever. However, in 1935, merely three years after the birth of his brainchild, von Neumann wrote in a letter to American mathematician Garrett Birkhoff: “I would like to make a confession which may seem immoral: I do not believe absolutely in Hilbert space no more.” (sic)—for more details see [73]. Soon thereafter they published a paper entitled “The Logic of Quantum Mechanics” [13]. Their ‘quantum logic’ was cast in order-theoretic terms, very much in the spirit of the then reigning algebraic view of logic, with the distributive law being replaced with a weaker (ortho)modular law. This resulted in a research community of quantum logicians [68, 71, 47, 30]. However, despite von Neumann's reputation, and the large body of research that has been produced in the area, one does not find a trace of this activity neither in the mainstream physics, mathematics, nor logic literature. Hence, 75 years later one may want to conclude that this activity was a failure. What went wrong? The mathematics of it. Let us consider the raison d'être for the Hilbert space formalism.

Cambridge University Press eBooks•Feb 26, 2016•12 citations

The logic of quantum mechanics - Take II

Bob Coecke

We put forward a new take on the logic of quantum mechanics, following Schroedinger's point of view that it is composition which makes quantum theory what it is, rather than its particular propositional structure due to the existence of superpositions, as proposed by Birkhoff and von Neumann. This gives rise to an intrinsically quantitative kind of logic, which truly deserves the name `logic' in that it also models meaning in natural language, the latter being the origin of logic, that it supports automation, the most prominent practical use of logic, and that it supports probabilistic inference.

arXiv:1204.3458•Apr 16, 2012•14 citations

Quantum logic as motivated by quantum computing

Jon Michael Dunn, Tobias Hagge, Lawrence S. Moss +1 more

§1. Introduction. Our understanding of Nature comes in layers, so should the development of logic. Classic logic is an indispensable part of our knowledge, and its interactions with computer science have recently dramatically changed our life. A new layer of logic has been developing ever since the discovery of quantum mechanics. G. D. Birkhoff and von Neumann introduced quantum logic in a seminal paper in 1936 [1]. But the definition of quantum logic varies among authors (see [2]). How to capture the logic structure inherent in quantum mechanics is very interesting and challenging. Given the close connection between classical logic and theoretical computer science as exemplified by the coincidence of computable functions through Turing machines, recursive function theory, and λ-calculus, we are interested in how to gain some insights about quantum logic from quantum computing. In this note we make some observations about quantum logic as motivated by quantum computing (see [5]) and hope more people will explore this connection. The quantum logic as envisioned by Birkhoff and von Neumann is based on the lattice of closed subspaces of a Hilbert space, usually an infinite dimensional one. The quantum logic of a fixed Hilbert space ℍ in this note is the variety of all the true equations with finitely many variables using the connectives meet, join and negation. Quantum computing is theoretically based on quantum systems with finite dimensional Hilbert spaces, especially the states space of a qubit ℂ2. (Actually the qubit is merely a convenience.

arXiv:math/0412144•Journal of Symbolic Logic•Jun 1, 2005•24 citations

An Introduction to Logical Operations on Classical and Quantum Bits

Franklin de Lima Marquezino, Junior, R. R. Mello

This article is a short review on the concept of information. We show the strong relation between Information Theory and Physics, and the differences between classical and quantum information, with emphasis in their manipulation through logical gates. This paper is intended to be read by non-specialists and undergraduate students of Computer Science, Mathematics and Physics, with knowledge in Linear Algebra and Quantum Mechanics.

arXiv:physics/0404134•Apr 28, 2004•2 citations

Classical Computers

A mathematical model of classical computer was invented by Alan Turing and named “ Turing machine ” model, which is an idealized computer with a simple set of instructions and infinite memories. Soon after Turing’s model was proposed, John von Neumann developed a theoretical model for how to implement all the components in a computer to be fully capable as a Turing machine. In more practical way, we will make use of the circuit model, which is useful also in the study of quantum computation. A circuit may involve many inputs, outputs, many wires and many logic gates. These circuits will be implemented by semi-conductors, which have two functions as conductor and insulator and acts under given conditions as a high-speed switch that leads and stops electricity. Modern computers such as personal computers (PC) use integrated circuits (IC) of semiconductor. While the peculiar feature of semiconductor is based entirely on physics of quantum mechanics, we do not call these computers “quantum computers” but rather called “classical computers”, because logic gates are based on binary representations and any quantum state of atom or molecule is not used as a logic gate: in classical computers, the data are represented by two logical values 0 and 1 in the circuits using devices with high voltage/low voltage, current on/off, and/or direction of magnetization up/down.

WORLD SCIENTIFIC eBooks•Sep 24, 2020•0 citations

An Introduction to Logical Operations on Classical and Quantum Bits

Xavier Sigaud

This article is a short review on the concept of information. We show the strong relation between Information Theory and Physics, and the differences between classical and quantum information, with emphasis in their manipulation through logical gates.This paper is intended to be read by non-specialists and undergraduate students of Computer Science, Mathematics and Physics, with knowledge in Linear Algebra and Quantum Mechanics.

•Jan 1, 2004•0 citations
The name of John von Neumann is common both in quantum mechanics and computer science. Are they really two absolutely unconnected areas? Many works devoted to quantum computations and communications are serious argument to suggest about existence of such a relation, but it is impossible to touch the new and active theme in a short review. In the paper are described the structures and models of linear algebra and just due to their generality it is possible to use universal description of very different areas as quantum mechanics and theory of Bayesian image analysis, associative memory, neural networks, fuzzy logic.
. We put forward a new take on the logic of quantum mechanics, following Schrödinger's point of view that it is composition which makes quantum theory what it is, rather than its particular propositional structure due to the existence of superpositions, as proposed by Birkhoff and von Neumann. This gives rise to an intrinsically quantitative kind of logic, which truly deserves the name ‘logic’ in that it also models meaning in natural language, the latter being the origin of logic, that it supports automation, the most prominent practical use of logic, and that it supports probabilistic inference. The physics and the logic of quantum-ish logic. In 1932 John von Neumann formalized Quantum Mechanics in his book “Mathematische Grundlagen der Quantenmechanik”. This was effectively the official birth of the quantum mechanical formalism which until now, some 75 years later, has remained the same. Quantum theory underpins so many things in our daily lives including chemical industry, energy production and information technology, which arguably makes it the most technologically successful theory of physics ever. However, in 1935, merely three years after the birth of his brainchild, von Neumann wrote in a letter to American mathematician Garrett Birkhoff: “I would like to make a confession which may seem immoral: I do not believe absolutely in Hilbert space no more.” (sic)—for more details see [73]. Soon thereafter they published a paper entitled “The Logic of Quantum Mechanics” [13]. Their ‘quantum logic’ was cast in order-theoretic terms, very much in the spirit of the then reigning algebraic view of logic, with the distributive law being replaced with a weaker (ortho)modular law. This resulted in a research community of quantum logicians [68, 71, 47, 30]. However, despite von Neumann's reputation, and the large body of research that has been produced in the area, one does not find a trace of this activity neither in the mainstream physics, mathematics, nor logic literature. Hence, 75 years later one may want to conclude that this activity was a failure. What went wrong? The mathematics of it. Let us consider the raison d'être for the Hilbert space formalism.
We put forward a new take on the logic of quantum mechanics, following Schroedinger's point of view that it is composition which makes quantum theory what it is, rather than its particular propositional structure due to the existence of superpositions, as proposed by Birkhoff and von Neumann. This gives rise to an intrinsically quantitative kind of logic, which truly deserves the name `logic' in that it also models meaning in natural language, the latter being the origin of logic, that it supports automation, the most prominent practical use of logic, and that it supports probabilistic inference.
§1. Introduction. Our understanding of Nature comes in layers, so should the development of logic. Classic logic is an indispensable part of our knowledge, and its interactions with computer science have recently dramatically changed our life. A new layer of logic has been developing ever since the discovery of quantum mechanics. G. D. Birkhoff and von Neumann introduced quantum logic in a seminal paper in 1936 [1]. But the definition of quantum logic varies among authors (see [2]). How to capture the logic structure inherent in quantum mechanics is very interesting and challenging. Given the close connection between classical logic and theoretical computer science as exemplified by the coincidence of computable functions through Turing machines, recursive function theory, and λ-calculus, we are interested in how to gain some insights about quantum logic from quantum computing. In this note we make some observations about quantum logic as motivated by quantum computing (see [5]) and hope more people will explore this connection. The quantum logic as envisioned by Birkhoff and von Neumann is based on the lattice of closed subspaces of a Hilbert space, usually an infinite dimensional one. The quantum logic of a fixed Hilbert space ℍ in this note is the variety of all the true equations with finitely many variables using the connectives meet, join and negation. Quantum computing is theoretically based on quantum systems with finite dimensional Hilbert spaces, especially the states space of a qubit ℂ2. (Actually the qubit is merely a convenience.
A mathematical model of classical computer was invented by Alan Turing and named “ Turing machine ” model, which is an idealized computer with a simple set of instructions and infinite memories. Soon after Turing’s model was proposed, John von Neumann developed a theoretical model for how to implement all the components in a computer to be fully capable as a Turing machine. In more practical way, we will make use of the circuit model, which is useful also in the study of quantum computation. A circuit may involve many inputs, outputs, many wires and many logic gates. These circuits will be implemented by semi-conductors, which have two functions as conductor and insulator and acts under given conditions as a high-speed switch that leads and stops electricity. Modern computers such as personal computers (PC) use integrated circuits (IC) of semiconductor. While the peculiar feature of semiconductor is based entirely on physics of quantum mechanics, we do not call these computers “quantum computers” but rather called “classical computers”, because logic gates are based on binary representations and any quantum state of atom or molecule is not used as a logic gate: in classical computers, the data are represented by two logical values 0 and 1 in the circuits using devices with high voltage/low voltage, current on/off, and/or direction of magnetization up/down.