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

Journal of Mathematical & Computer Applications

Parallel Computing in Terms of Gaisi Takeuchi's Quantum Set Theory1

Miklós Banai

Published Jan 5, 2026• 0 citations
Publisher

Abstract

The foundations and results of parallel computing in terms of Gaisi Takeutis’ quantum set theory are presented in this review paper. This approach is based on 1) the extension of the von Neumann’s uniqueness theorem for the solutions of the canonical commutations relations in quantum mechanics of finitely many degrees of freedom to quantum local field theories of infinitely many degrees of freedom [2]; 2) the results of the mathematician Gaisi Takeuti about quantum set theory in extension theory; and 3) the results of the physicist Lev Davidovics Landau about the behavior of the quantum liquids He3 and He4resulting in a more general approach than the one based on the notion of the quantum bit [1-5].

DOI
10.47363/jmca/2026(5)235

Related papers

The Foundations and Results of Parallel Computing in Terms of Gaisi Takeutis’ Quantum Set Theory

Miklós Banai

The foundations and results of parallel computing in terms of Gaisi Takeutis’ quantum set theory are presented in this talk. This approach is based on • The extension of the von Neumann’s uniqueness theorem for the solutions of the canonical commutations relations in quantum mechanics of finitely many degrees of freedom to quantum local field theories of infinitely many degrees of freedom; • The results of the mathematician Gaisi Takeuti about quantum set theory in extension theory; and • The results of the physicist Lev Davidovics Landau about the behavior of the quantum liquids He3 and He4 resulting in a more general approach than the one based on the notion of the quantum bit.

Journal of Artificial Intelligence & Cloud Computing•Apr 2, 2026•0 citations

Quantum Computing: The Alternative Way

Miklós Banai

An alternative way of quantum computing is presented. This approach is more general than the one based on the notion of the quantum bit. Mathematically it is based on the quantum set theory of Gaisi Takeuti. A possible implementation of this quantum computer belonging to this quantum computing could be to build up by centering it on the quantum liquids He3 and He4 at low temperature (below 3K) and by applying the quasi-particle approach of L.D. Landau.

Journal of Artificial Intelligence & Cloud Computing•Oct 20, 2025•1 citation

Computing in Terms of Takeuti's Quantum Set Theory

Miklós Banai

In this letter we discuss computing in terms of Gaisi Takeuti's quantum set theory using an explicit example of a rigid body of cuboid form. The universe V(L) of Takeuti will be determined. A set of real numbers in this Universe are also explicitly described including a set of binary numbers. Thus we arrive at the foundations of von Neumann' theory of computing in terms of ordinary binary numbers. Then we see that this extension of computing to the Universe V(L) provides a sound, mathematically well defined theory of quantum computing.

Journal of Artificial Intelligence & Cloud Computing•Sep 24, 2024•0 citations

Parallel quantum computing: from theory to practice

Einar Pius

The term quantum parallelism is commonly used to refer to a property of quantum computations where an algorithm can act simultaneously on a superposition of states. However, this is not the only aspect of parallelism in quantum computing. Analogously to the classical computing model, every algorithm consists of elementary quantum operations and the application of them could be parallelised itself. This kind of parallelism is explored in this thesis in the one way quantum computing (1WQC) and the quantum circuit model. In the quantum circuit model we explore arithmetic circuits and circuit complexity theory. Two new arithmetic circuits for quantum computers are introduced in this work: an adder and a multiply-adder. The latter is especially interesting because its depth (i.e. the number of parallel steps required to finish the computation) is smaller than for any known classical circuit when applied sequentially. From the complexity theoretical perspective we concentrate on the classes QAC0 and QAC0[2], the quantum counterparts of AC0 and AC0[2]. The class AC0 comprises of constant depth circuits with unbounded fan-in AND and OR gates and AC0[2] is obtained when unbounded fan-in parity gates are added to AC0 circuits. We prove that QAC0 circuits with two layers of multi-qubit gates cannot compute parity exactly. This is a step towards proving QAC0 6= QAC0[2], a relation known to hold for AC0 and AC0[2]. In 1WQC, computation is done through measurements on an entangled state called the resource state. Two well known parallelisation methods exist in this model: signal shifting and finding the maximally delayed general flow. The first one uses the measurement calculus formalism to rewrite the dependencies of an existing computation, whereas the second technique exploits the geometry of the resource state to find the optimal ordering of measurements. We prove that the aforementioned methods result in same depth computations when the input and output sizes are equal. Through showing this equivalence we reveal new properties of 1WQC computations and design a new algorithm for the above mentioned parallelisations.

•Jul 1, 2015•2 citations

Quantum Liquid He3 of Fermi Statistics and Quantum Computing in Terms of the Alternative Field Quantization

Miklós Banai

The quantum liquid He3 of Fermi statistics described by L. D. Landau at low temperature (below 3 K) using the quasiparticle approach is studied in the framework of the alternative field quantization [1]. We discuss in this paper how this physical material may be a candidate for building the processor of a quantum computer of type based on the quantum set theory of G. Takeuti [2].

Journal of Artificial Intelligence & Cloud Computing•Aug 4, 2025•1 citation

Entanglement Entropy and Algebra in Quantum Field Theory

Halawani, Ahmed

Quantum Field Theory (QFT) represents a vast generalization of Quantum Mechanics (QM), as it deals with systems that have an infinite number of degrees of freedom. The Stone-von Neumann theorem, which establishes the equivalence of irreducible representations of the canonical commutation relations (CCR) in QM, does not extend to QFT. Consequently, QFT admits multiple inequivalent irreducible representations, leading to a much richer algebraic structure. This essay aims to explore the physics of QFT from the operator algebra perspective, particularly focusing on entanglement entropy. We discuss the role of von Neumann algebras of different types in QFT, describe the local operator algebra approach to QFT, and explain how entanglement entropy can be defined in terms of the algebra of observables. Additionally, we explore the benefits of this approach in concrete applications, specifically in quantum field theory on curved spacetime.

arXiv:2307.06286•Jul 12, 2023•0 citations
The foundations and results of parallel computing in terms of Gaisi Takeutis’ quantum set theory are presented in this review paper. This approach is based on 1) the extension of the von Neumann’s uniqueness theorem for the solutions of the canonical commutations relations in quantum mechanics of finitely many degrees of freedom to quantum local field theories of infinitely many degrees of freedom [2]; 2) the results of the mathematician Gaisi Takeuti about quantum set theory in extension theory; and 3) the results of the physicist Lev Davidovics Landau about the behavior of the quantum liquids He3 and He4resulting in a more general approach than the one based on the notion of the quantum bit [1-5].
The foundations and results of parallel computing in terms of Gaisi Takeutis’ quantum set theory are presented in this talk. This approach is based on • The extension of the von Neumann’s uniqueness theorem for the solutions of the canonical commutations relations in quantum mechanics of finitely many degrees of freedom to quantum local field theories of infinitely many degrees of freedom; • The results of the mathematician Gaisi Takeuti about quantum set theory in extension theory; and • The results of the physicist Lev Davidovics Landau about the behavior of the quantum liquids He3 and He4 resulting in a more general approach than the one based on the notion of the quantum bit.
In this letter we discuss computing in terms of Gaisi Takeuti's quantum set theory using an explicit example of a rigid body of cuboid form. The universe V(L) of Takeuti will be determined. A set of real numbers in this Universe are also explicitly described including a set of binary numbers. Thus we arrive at the foundations of von Neumann' theory of computing in terms of ordinary binary numbers. Then we see that this extension of computing to the Universe V(L) provides a sound, mathematically well defined theory of quantum computing.
The term quantum parallelism is commonly used to refer to a property of quantum computations where an algorithm can act simultaneously on a superposition of states. However, this is not the only aspect of parallelism in quantum computing. Analogously to the classical computing model, every algorithm consists of elementary quantum operations and the application of them could be parallelised itself. This kind of parallelism is explored in this thesis in the one way quantum computing (1WQC) and the quantum circuit model. In the quantum circuit model we explore arithmetic circuits and circuit complexity theory. Two new arithmetic circuits for quantum computers are introduced in this work: an adder and a multiply-adder. The latter is especially interesting because its depth (i.e. the number of parallel steps required to finish the computation) is smaller than for any known classical circuit when applied sequentially. From the complexity theoretical perspective we concentrate on the classes QAC0 and QAC0[2], the quantum counterparts of AC0 and AC0[2]. The class AC0 comprises of constant depth circuits with unbounded fan-in AND and OR gates and AC0[2] is obtained when unbounded fan-in parity gates are added to AC0 circuits. We prove that QAC0 circuits with two layers of multi-qubit gates cannot compute parity exactly. This is a step towards proving QAC0 6= QAC0[2], a relation known to hold for AC0 and AC0[2]. In 1WQC, computation is done through measurements on an entangled state called the resource state. Two well known parallelisation methods exist in this model: signal shifting and finding the maximally delayed general flow. The first one uses the measurement calculus formalism to rewrite the dependencies of an existing computation, whereas the second technique exploits the geometry of the resource state to find the optimal ordering of measurements. We prove that the aforementioned methods result in same depth computations when the input and output sizes are equal. Through showing this equivalence we reveal new properties of 1WQC computations and design a new algorithm for the above mentioned parallelisations.
Quantum Field Theory (QFT) represents a vast generalization of Quantum Mechanics (QM), as it deals with systems that have an infinite number of degrees of freedom. The Stone-von Neumann theorem, which establishes the equivalence of irreducible representations of the canonical commutation relations (CCR) in QM, does not extend to QFT. Consequently, QFT admits multiple inequivalent irreducible representations, leading to a much richer algebraic structure. This essay aims to explore the physics of QFT from the operator algebra perspective, particularly focusing on entanglement entropy. We discuss the role of von Neumann algebras of different types in QFT, describe the local operator algebra approach to QFT, and explain how entanglement entropy can be defined in terms of the algebra of observables. Additionally, we explore the benefits of this approach in concrete applications, specifically in quantum field theory on curved spacetime.