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

COJ Electronics & Communications

Natural Limitations of Quantum Computing

Fayez Fok Al Adeh

Published Oct 25, 2018• 1 citation
Publisher

Abstract

It is a basic principle of quantum computing to leave the quantum computer to itself without any outside intervention while processing prepared states of data (prepared according to quantum rules). Accordingly, we must probe the micro world replacing all the components of the theoretical quantum algorithm, including the necessary time ticks, with events of the micro world. This amalgamation with the micro world provides a guarantee that the quantum processing will be totally isolated from the outside world. The whole theoretical quantum algorithm will be immersed in the micro world and become part of it.

DOI
10.31031/cojec.2018.01.000511

Related papers

Natural Limitations of Quantum Computing

Fayez Fok Al Adeh

It is a basic principle of quantum computing to leave the quantum computer to itself without any outside intervention while processing prepared states of data(prepared according to quantum rules).Accordingly ,we must probe the micro world replacing all the components of the theoretical quantum algorithm,including the necessary time ticks, with events of the micro world.This amalgamation with the micro world provides a guarantee that the quantum processing will be totally isolated from the outside world.The whole theoretical quantum algorithm will be immersed in the micro world and become part of it.

International Journal of Swarm Intelligence and Evolutionary Computation•Jan 1, 2017•6 citations

Principles of quantum computing

David Peter Divincenzo

It has recently been recognized that computers could be profoundly more powerful, if the possibilities offered by the basic principles of quantum mechanics were exploited more completely in machine design. It is physically possible for the binary state of a computer itself to obey quantum mechanics, i.e., to evolve along a superposition of different (logical) pathways that could interfere with one another. This is what is meant by a quantum computer. It has recently been shown that such a computer can perform a class of computational problems, including prime factorization, very rapidly. Quantum computers will require an art that is radically different from any that the computer industry practices today. The bits of such a computer will have to be represented by the states of individual atoms. The use of one such atomic degree of freedom, the "spin", is illustrated below.

Digest of technical papers/Digest of technical papers - IEEE International Solid-State Circuits Conference•Nov 19, 2002•7 citations

Continuum of Change: An Ontology of Discrete Ticks and Emergent Reality

Reddy Govind

This manuscript presents an original ontological framework asserting that change is the sole foundational truth of reality. The universe is conceptualized as a seamless continuum of perpetual reconfiguration occurring through discrete primal increments ("basic ticks"). Perceived permanence—stable objects, linear time, enduring identities—is an illusion arising from consciousness amalgamating these rapid micro-ticks into human-perceivable "frames" or moments. No ontological layers (e.g., quantum vs. classical) exist; all phenomena emerge uniformly from the same flux. Three minimal symbolic equations illustrate the dynamics, while a hand-drawn figure depicts emergent complexity branching from a single basic particle. Quantum wave function collapse remains conceptually unresolved in standard physics, yet macroscopic emergence from micro-changes is widely accepted—this framework reframes collapse as a perceptual artifact of tick amalgamation. The ontology invites direct perception of reality as pure becoming.

•Jan 1, 2025•0 citations

Principles of quantum computing

Jonathan A. Jones, Dieter Jaksch

In Part II of this book we show how computations can be implemented using quantum systems. As we will see, the differences between bits and qubits, briefly outlined in Part I, lead to some important consequences for quantum computing. We begin with a brief introduction to the fundamental principles underlying quantum computing: specific implementations will be considered in later chapters. Reversible computing While quantum computation in its modern form is still a relatively young discipline, researchers have been interested in the relationship between quantum mechanics and computing for a long time. Early workers were not interested in the ideas of quantum parallelism , which will be explored in the next section, but rather in the question of whether explicitly quantum mechanical systems could be used to implement classical computations. In addition to its intrinsic interest, there are two technological reasons why this might be considered an important question. The first reason is a direct consequence of Moore's laws. After the development of integrated circuits, computing technology began its headlong dash down the twin roads of ever-faster and ever-smaller devices. These two phenomena are closely related: as computing devices must communicate within themselves, and as the speed of information transfer cannot exceed the speed of light, faster computers must indeed be smaller. There is, however, a limit to this process, defined by the atomic scale: once the size of individual transistors becomes comparable with that of atoms, the old-fashioned approach of micro-electronics becomes completely untenable.

Cambridge University Press eBooks•Jul 19, 2012•0 citations

How to represent uncertainty via qudits: Probability distributions, regular, intuitionistic and picture fuzzy sets, F-transforms, etc.

Olga M. Kosheleva, Владик Крейнович

While modern computers are fast, there are still many important practical situations in which we need even faster computations. It turns out that, due to the fact that the speed of all communications is limited by the speed of light, the only way to make computers drastically faster is to drastically decrease the size of computer’s components. When we decrease their size to sizes comparable with micro-sizes of individual molecules, it becomes necessary to take into account specific physics of the micro-world – known as quantum physics. Traditional approach to designing quantum computers – i.e., computers that take effect of quantum physics into account – was based on using quantum analogies of bits (2-state systems). However, it has recently been shown that the use of multi-state quantum systems – called qudits – can make quantum computers even more efficient. When processing data, it is important to take into account that in practice, data always comes with uncertainty. In this paper, we analyze how to represent different types of uncertainty by qudits.

Notes on Intuitionistic Fuzzy Sets•Sep 8, 2022•0 citations

Quantum computing: A view from the enemy camp

M. I. Dyakonov

Quantum computing relies on processing of information within a quantum system with many continuous degrees of freedom. The practical implementation of this idea requires complete control over all of the 2 n independent amplitudes of a many-particle wave function, where n >1000. The principles of quantum computing are discussed from the practical point of view, with the conclusion that a working device cannot be built in the foreseeable future.

arXiv:cond-mat/0110326•Optics and Spectroscopy•Aug 1, 2003•33 citations
It is a basic principle of quantum computing to leave the quantum computer to itself without any outside intervention while processing prepared states of data (prepared according to quantum rules). Accordingly, we must probe the micro world replacing all the components of the theoretical quantum algorithm, including the necessary time ticks, with events of the micro world. This amalgamation with the micro world provides a guarantee that the quantum processing will be totally isolated from the outside world. The whole theoretical quantum algorithm will be immersed in the micro world and become part of it.
It is a basic principle of quantum computing to leave the quantum computer to itself without any outside intervention while processing prepared states of data(prepared according to quantum rules).Accordingly ,we must probe the micro world replacing all the components of the theoretical quantum algorithm,including the necessary time ticks, with events of the micro world.This amalgamation with the micro world provides a guarantee that the quantum processing will be totally isolated from the outside world.The whole theoretical quantum algorithm will be immersed in the micro world and become part of it.
It has recently been recognized that computers could be profoundly more powerful, if the possibilities offered by the basic principles of quantum mechanics were exploited more completely in machine design. It is physically possible for the binary state of a computer itself to obey quantum mechanics, i.e., to evolve along a superposition of different (logical) pathways that could interfere with one another. This is what is meant by a quantum computer. It has recently been shown that such a computer can perform a class of computational problems, including prime factorization, very rapidly. Quantum computers will require an art that is radically different from any that the computer industry practices today. The bits of such a computer will have to be represented by the states of individual atoms. The use of one such atomic degree of freedom, the "spin", is illustrated below.
This manuscript presents an original ontological framework asserting that change is the sole foundational truth of reality. The universe is conceptualized as a seamless continuum of perpetual reconfiguration occurring through discrete primal increments ("basic ticks"). Perceived permanence—stable objects, linear time, enduring identities—is an illusion arising from consciousness amalgamating these rapid micro-ticks into human-perceivable "frames" or moments. No ontological layers (e.g., quantum vs. classical) exist; all phenomena emerge uniformly from the same flux. Three minimal symbolic equations illustrate the dynamics, while a hand-drawn figure depicts emergent complexity branching from a single basic particle. Quantum wave function collapse remains conceptually unresolved in standard physics, yet macroscopic emergence from micro-changes is widely accepted—this framework reframes collapse as a perceptual artifact of tick amalgamation. The ontology invites direct perception of reality as pure becoming.
In Part II of this book we show how computations can be implemented using quantum systems. As we will see, the differences between bits and qubits, briefly outlined in Part I, lead to some important consequences for quantum computing. We begin with a brief introduction to the fundamental principles underlying quantum computing: specific implementations will be considered in later chapters. Reversible computing While quantum computation in its modern form is still a relatively young discipline, researchers have been interested in the relationship between quantum mechanics and computing for a long time. Early workers were not interested in the ideas of quantum parallelism , which will be explored in the next section, but rather in the question of whether explicitly quantum mechanical systems could be used to implement classical computations. In addition to its intrinsic interest, there are two technological reasons why this might be considered an important question. The first reason is a direct consequence of Moore's laws. After the development of integrated circuits, computing technology began its headlong dash down the twin roads of ever-faster and ever-smaller devices. These two phenomena are closely related: as computing devices must communicate within themselves, and as the speed of information transfer cannot exceed the speed of light, faster computers must indeed be smaller. There is, however, a limit to this process, defined by the atomic scale: once the size of individual transistors becomes comparable with that of atoms, the old-fashioned approach of micro-electronics becomes completely untenable.
While modern computers are fast, there are still many important practical situations in which we need even faster computations. It turns out that, due to the fact that the speed of all communications is limited by the speed of light, the only way to make computers drastically faster is to drastically decrease the size of computer’s components. When we decrease their size to sizes comparable with micro-sizes of individual molecules, it becomes necessary to take into account specific physics of the micro-world – known as quantum physics. Traditional approach to designing quantum computers – i.e., computers that take effect of quantum physics into account – was based on using quantum analogies of bits (2-state systems). However, it has recently been shown that the use of multi-state quantum systems – called qudits – can make quantum computers even more efficient. When processing data, it is important to take into account that in practice, data always comes with uncertainty. In this paper, we analyze how to represent different types of uncertainty by qudits.