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 Artificial Intelligence & Cloud Computing

Quantum Computing: The Alternative Way

Miklós Banai

Published Oct 20, 2025• 1 citation
Publisher

Abstract

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.

DOI
10.47363/jaicc/2025(4)488

Related papers

Quantum computing with superconducting circuits

Robert J. Schoelkopf

Quantum computation is a completely new and different paradigm for how to store and process information. It offers the possibility of exponential computational advantage for certain types of hard problems, but the hardware for implementing quantum algorithms is still at an early stage. The basic idea of quantum computing is to replace the ordinary binary bits of conventional computing with their quantum equivalent, or qubit. A qubit can be any quantum system whose states can be prepared and controlled, provided that we can then fabricate them in large quantities and then couple them to one another in prescribed ways. While there are several candidate technologies for building a quantum computer, one of the most promising is superconducting quantum circuits, operated at cryogenic temperatures approaching 0.01 K.

IEEE International Interconnect Technology Conference (IITC)•May 1, 2016•2 citations

Quantum Liquids He3 and He4 and Quantum Computing

Miklós Banai

L. D. Landau described the quantum liquids He3 and He4 at low temperature (below 3K) by applying the quasi particle approach called the quasi particles (elementary excitations) as “rotons”. We discuss in this paper how these physical materials may be candidates for building the processor of a quantum computer of type based on the quantum set theory of G. Takeuti.

Journal of Artificial Intelligence & Cloud Computing•Nov 22, 2024•1 citation

Alternative Forms of Quantum Computing

Eduardo R. Mucciolo

The approach we considered so far for computing using quantum mechanics relies on preparing a suitable initial state, applying single and two-qubit quantum gates, and performing measurements. It is known as the circuit model of quantum computing. Howeveer, this is not the only approach. In this chapter, we will cover a few alternatives. Some still rely on circuits to some extend, but they either explore alternative paradigms of fault tolerance, utilize protocols that do not require entangling gates, or avoid multi-shot computations. One of these alternative approaches is entirely based on measurements. Another requires fine tunning gates and repeating measurments.

CRC Press eBooks•Aug 6, 2025•0 citations

Quantum Computing

Miklós Banai

L. D. Landau described the quantum liquids He3 and He4 at low temperature (below 3K) by applying the quasi-particle approach called the quasi particles (elementary excitations) as “rotons”. We discuss in this paper how these physical materials may be candidates for building the processor of a quantum computer of type based on the quantum set theory of G. Takeuti.

Journal of Artificial Intelligence & Cloud Computing•May 8, 2025•0 citations

General Framework for Quantum Computing

Mohamed Eldosuky

Quantum computing is a promising approach of computation that is based on equations from Quantum Mechanics and nanotechnology. Understanding and simulating quantum operations on a classical computer has different approaches and is modeled in different ways. However, the most repute ways are Quantum Turing Machine, Network Model or circuit model of connected gates and Quantum Programming Language. Many simulators do exist that varies in many features such as implementation languages, target platforms, paradigms, visuality, and applied quantum algorithms. There was a developmental trade-off between the simplicity and the functionality of the simulator. The goals and research activities are outlined as follows: First, surveying the quantum computing world, its characteristics, issues, problems, and challenges. Second, surveying the existing quantum simulators, illustrating representative simulators of major approaches, their features, and functionalities. Third, introducing a framework to provide the power of quantum computing , while insisting the simplicity and high usability. Finally, providing a case study for a new quantum algorithm based on the introduced framework.

•Oct 15, 2014•0 citations

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
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.
Quantum computation is a completely new and different paradigm for how to store and process information. It offers the possibility of exponential computational advantage for certain types of hard problems, but the hardware for implementing quantum algorithms is still at an early stage. The basic idea of quantum computing is to replace the ordinary binary bits of conventional computing with their quantum equivalent, or qubit. A qubit can be any quantum system whose states can be prepared and controlled, provided that we can then fabricate them in large quantities and then couple them to one another in prescribed ways. While there are several candidate technologies for building a quantum computer, one of the most promising is superconducting quantum circuits, operated at cryogenic temperatures approaching 0.01 K.
The approach we considered so far for computing using quantum mechanics relies on preparing a suitable initial state, applying single and two-qubit quantum gates, and performing measurements. It is known as the circuit model of quantum computing. Howeveer, this is not the only approach. In this chapter, we will cover a few alternatives. Some still rely on circuits to some extend, but they either explore alternative paradigms of fault tolerance, utilize protocols that do not require entangling gates, or avoid multi-shot computations. One of these alternative approaches is entirely based on measurements. Another requires fine tunning gates and repeating measurments.
Quantum computing is a promising approach of computation that is based on equations from Quantum Mechanics and nanotechnology. Understanding and simulating quantum operations on a classical computer has different approaches and is modeled in different ways. However, the most repute ways are Quantum Turing Machine, Network Model or circuit model of connected gates and Quantum Programming Language. Many simulators do exist that varies in many features such as implementation languages, target platforms, paradigms, visuality, and applied quantum algorithms. There was a developmental trade-off between the simplicity and the functionality of the simulator. The goals and research activities are outlined as follows: First, surveying the quantum computing world, its characteristics, issues, problems, and challenges. Second, surveying the existing quantum simulators, illustrating representative simulators of major approaches, their features, and functionalities. Third, introducing a framework to provide the power of quantum computing , while insisting the simplicity and high usability. Finally, providing a case study for a new quantum algorithm based on the introduced framework.
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.