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

International Journal of Computer Applications

A Novel Design of a Random Generator Circuit in QCA

Keikha Andisheh, Chitra Dadkhah, Tehrani Mohammad, Keivan Navi

Published Dec 28, 2011• 9 citations
OpenAlex

Abstract

CMOS miniaturization limits have improved research on other advanced alternative technologies. Quantum Cellular Automata (QCA) is a nanometer scale technology that is one of these alternatives. Two principals have been introducedin the concept of Random Number Generator which are related to some physical occurrences or computational algorithms. In this paper we introduce a QCA circuit which is the first true random generator.

Related papers

LFSR-Keyed MUX for Random Number Generation in Nano Communication Using QCA

Padmapriya Praveenkumar, Santhiya Devi R., Rengarajan Amirtharajan +1 more

Nano industries have been successful trendsetters for the past 30 years, in escalating the speed and dropping the power necessities of nanoelectronic devices. According to Moore's law and the assessment created by the international technology roadmap for semiconductors, beyond 2020, there will be considerable restrictions in manufacturing IC's based on CMOS technologies. As a result, the next prototype to get over these effects is quantum-dot cellular automata (QCA). In this chapter, an efficient quantum cellular automata (QCA) based random number generator (RNG) is proposed. QCA is an innovative technology in the nano regime which guarantees large device density, less power dissipation, and minimal size as compared to the various CMOS technologies. With the aim to maximise the randomness in the proposed nano communication, a linear feedback shift register (LFSR) keyed multiplexer with ring oscillators is developed. The developed RNG is simulated using a quantum cellular automata (QCA) simulator tool.

Advances in information security, privacy, and ethics book series•Jan 1, 2020•0 citations

A Review on Reversible Logic Gates and its QCA Implementation

Md. Abdullah-Al-Shafi, Md. Shifatul, Ali Newaz

Quantum Dot Cellular Automata (QCA) is a rising innovation which seems to be a good competitor for the next generation of digital systems and widely utilized as a part of advanced frameworks.It is an appealing substitute to ordinary CMOS innovation because of diminutive size, faster speed, extremely scalable feature, ultralow power consumption and better switching frequency.The realization of quantum computation is not possible without reversible logic.Reversible logic has enlarged operations in quantum computation.Generally reversible computing is executed when system composes of reversible gates.It has numerous fields of use as applied science, quantum dot cellular automata as well as low power VLSI circuits, low power CMOS, digital signal processing, computer graphics.In this paper, the quantum implementation of primitive reversible gate has been presented.The proposed gates have been designed and simulated using QCADesigner.

International Journal of Computer Applications•Oct 15, 2015•66 citations

Architectural Design of Quantum Cellular Automata to Implement Logical Computation

Alejandro Leon

The limits to miniaturization of electronic devices are reached with sizes where quantum mechanics rules over the dynamics of the system. Because of this, enormous efforts are being made in search of new technologies to store and process information that can efficiently replace classic electronics. The proposal for quantum systems for carrying out computation represents an attempt to create a new generation of information processors (Nielsen & Chuang, 2003). The major advantage of quantum computation is that it can resolve numeric problems that cannot be resolved by classical computation. However, there remains the unresolved problem of the coherence of the proposed systems. Some significant advances have been made in addressing these problems using dislocated qubits with global control protocols (Fitzsimons et al., 2007), with small molecular systems. On the other hand, a completely different solution to quantum computation has been attempted using cellular automata architecture to develop classical computational processes with quantum entities. Important advances have been made with automata based on quantum dot arrays (QCA), the idea for which was proposed by C. Lent and collaborators (Lent et al., 1993). The original idea was introduced as a system of quantum corrals with

InTech eBooks•Apr 11, 2011•0 citations

Quantum-cellular-automata pseudorandom maps

Yaakov S. Weinstein, C. Stephen Hellberg

Quantum computation based on quantum-cellular automata (QCA) can greatly reduce the control and precision necessary for experimental implementations of quantum information processing. A QCA system consists of a few species of qubits in which all qubits of a species evolve in parallel. We show that, in spite of its inherent constraints, a QCA system can be used to study complex quantum dynamics. To this aim, we demonstrate scalable operations on a QCA system that fulfill statistical criteria of randomness and explore which criteria of randomness can be fulfilled by operators from various QCA architectures. Other means of realizing random operators with only a few independent operators are also discussed.

arXiv:quant-ph/0401040•Physical Review A•Jun 1, 2004•10 citations

Quantum Cellular Automata Controlled Self-Organizing Networks

László Gyöngyösi, Sándor Imre

Every process of our universe is based on the fundamental elements of nature: information and computation.The basic motivation behind the study of quantum cellular automata (QCA) is the wish to analyze the processes of nature.QCA provide a natural framework within which to describe many classically undescribable and uncomputable physical phenomena, such as the properties of quantum physical systems and the complex background of quantum dynamics.Quantum cellular automata models are based on the working mechanism of classical cellular automata models and use the power of reversible quantum computation.Cellular automata can be used in many fields of science, such as parallel computation, artificial intelligence, image processing, biological systems, simulation of physics systems, hardware design, algorithm theory, and many more.In the first part of this chapter, we give a brief overview of the basic properties of quantum information processing and analyze the quantum versions of classical cellular automata models.We present all materials in a clear, perspicuous, and comprehensible manner, without using a complex mathematical background.After reviewing physical QCA implementations, we sketch future directions, and then conclude the first part.In the second part of the chapter, we examine one possible application of QCA, which uses quantum computing to realize real-life based, truly random network organization.This abstract machine is called a Quantum Cellular Machine (QCM), and we design it for controlling a truly random biologically-inspired network, and to integrate quantum learning algorithms and quantum searching into a controlled, self-organizing system.The selforganizing processes in classical systems cannot be truly random.Using our quantum probabilistic QCM unit, we can add truly random behavior to the self-organizing processes of biological networks.A quantum mechanical-based quantum cellular machine (QCM) controls the self-organizing processes of the network and uses a closed, non-classical quantum mechanical-based language inside the QCM.The proposed QCM solution has deep relevance in the evolution of truly random quantum probabilistic self-organizing network structures.The QCM controls the evolution of the system, changes its environment and creates plans without any human interaction, using truly random quantum probabilistic decisions.In a classical system, the classical circuits can only exhibit deterministic behavior.In a quantum probabilistic control system, the quantum circuits can follow both deterministic and quantum probabilistic quantum cellular machine control behaviors.The QCM has classical and quantum communication layers, it uses the classical layer to detect www.intechopen.comCellular Automata -Innovative Modelling for Science and Engineering 114 the network environment.The lower layer of the quantum cellular machine contains the non-deterministic quantum probabilistic decisions and interacts with the classical level.The quantum cellular machine model with the power of quantum computing can be used for the development of a real-life based network organism.We show, that a real, biologically inspired, non-deterministic, truly random network model can be achieved by the discussed QCM model.In the third part of this chapter, we show that a very efficient quantum searching algorithm can be integrated into the QCM, to find the best solution to a given network input command.We present a quantum searching based method specially designed for quantum probabilistic self-organizing networks, to reduce the complexity of the classical traditional search in the network.The proposed QCM can process both quantum and classical information, and accomplish both deterministic and quantum probabilistic tasks.The information unit is a quantum bit, which can lie in a coherent superposition state of logical states zero and one, and can thus simultaneously store zero and one.Using quantum bits, we can speed up the solutions of classical problems, and even solve some hard problems that classical computers can't solve.The key aspect behind the optimal decisions of a QCM is to design a high-efficiency searching algorithm.A QCM updates the probability amplitudes of its quantum register, according to a given reward value, derived from the network environment.The QCM repeatedly applies a unitary transformation to the quantum states, thus it can enhance, for example, the probability amplitude of the optimal path in the self-organizing network environment, while suppressing the amplitude of all other solutions.The QCM's quantum searching algorithm can help resolve many hard tasks, for example it could be applied to find an optimal logical path, using the effects of quantum mechanics.In the numerical analysis we will show that the quantum communication layer could improve the performance of classical systems.

InTech eBooks•Apr 11, 2011•5 citations

Quantum Cellular Automata

Karoline Wiesner

Quantum cellular automata (QCA) are reviewed, including early and more recent proposals. QCA are a generalization of (classical) cellular automata (CA) and in particular of reversible CA. The latter are reviewed shortly. An overview is given over early attempts by various authors to define one-dimensional QCA. These turned out to have serious shortcomings which are discussed as well. Various proposals subsequently put forward by a number of authors for a general definition of one- and higher-dimensional QCA are reviewed and their properties such as universality and reversibility are discussed.

arXiv:0808.0679•Aug 5, 2008•8 citations
CMOS miniaturization limits have improved research on other advanced alternative technologies. Quantum Cellular Automata (QCA) is a nanometer scale technology that is one of these alternatives. Two principals have been introducedin the concept of Random Number Generator which are related to some physical occurrences or computational algorithms. In this paper we introduce a QCA circuit which is the first true random generator.
Nano industries have been successful trendsetters for the past 30 years, in escalating the speed and dropping the power necessities of nanoelectronic devices. According to Moore's law and the assessment created by the international technology roadmap for semiconductors, beyond 2020, there will be considerable restrictions in manufacturing IC's based on CMOS technologies. As a result, the next prototype to get over these effects is quantum-dot cellular automata (QCA). In this chapter, an efficient quantum cellular automata (QCA) based random number generator (RNG) is proposed. QCA is an innovative technology in the nano regime which guarantees large device density, less power dissipation, and minimal size as compared to the various CMOS technologies. With the aim to maximise the randomness in the proposed nano communication, a linear feedback shift register (LFSR) keyed multiplexer with ring oscillators is developed. The developed RNG is simulated using a quantum cellular automata (QCA) simulator tool.
Quantum Dot Cellular Automata (QCA) is a rising innovation which seems to be a good competitor for the next generation of digital systems and widely utilized as a part of advanced frameworks.It is an appealing substitute to ordinary CMOS innovation because of diminutive size, faster speed, extremely scalable feature, ultralow power consumption and better switching frequency.The realization of quantum computation is not possible without reversible logic.Reversible logic has enlarged operations in quantum computation.Generally reversible computing is executed when system composes of reversible gates.It has numerous fields of use as applied science, quantum dot cellular automata as well as low power VLSI circuits, low power CMOS, digital signal processing, computer graphics.In this paper, the quantum implementation of primitive reversible gate has been presented.The proposed gates have been designed and simulated using QCADesigner.
The limits to miniaturization of electronic devices are reached with sizes where quantum mechanics rules over the dynamics of the system. Because of this, enormous efforts are being made in search of new technologies to store and process information that can efficiently replace classic electronics. The proposal for quantum systems for carrying out computation represents an attempt to create a new generation of information processors (Nielsen & Chuang, 2003). The major advantage of quantum computation is that it can resolve numeric problems that cannot be resolved by classical computation. However, there remains the unresolved problem of the coherence of the proposed systems. Some significant advances have been made in addressing these problems using dislocated qubits with global control protocols (Fitzsimons et al., 2007), with small molecular systems. On the other hand, a completely different solution to quantum computation has been attempted using cellular automata architecture to develop classical computational processes with quantum entities. Important advances have been made with automata based on quantum dot arrays (QCA), the idea for which was proposed by C. Lent and collaborators (Lent et al., 1993). The original idea was introduced as a system of quantum corrals with
Quantum computation based on quantum-cellular automata (QCA) can greatly reduce the control and precision necessary for experimental implementations of quantum information processing. A QCA system consists of a few species of qubits in which all qubits of a species evolve in parallel. We show that, in spite of its inherent constraints, a QCA system can be used to study complex quantum dynamics. To this aim, we demonstrate scalable operations on a QCA system that fulfill statistical criteria of randomness and explore which criteria of randomness can be fulfilled by operators from various QCA architectures. Other means of realizing random operators with only a few independent operators are also discussed.
Every process of our universe is based on the fundamental elements of nature: information and computation.The basic motivation behind the study of quantum cellular automata (QCA) is the wish to analyze the processes of nature.QCA provide a natural framework within which to describe many classically undescribable and uncomputable physical phenomena, such as the properties of quantum physical systems and the complex background of quantum dynamics.Quantum cellular automata models are based on the working mechanism of classical cellular automata models and use the power of reversible quantum computation.Cellular automata can be used in many fields of science, such as parallel computation, artificial intelligence, image processing, biological systems, simulation of physics systems, hardware design, algorithm theory, and many more.In the first part of this chapter, we give a brief overview of the basic properties of quantum information processing and analyze the quantum versions of classical cellular automata models.We present all materials in a clear, perspicuous, and comprehensible manner, without using a complex mathematical background.After reviewing physical QCA implementations, we sketch future directions, and then conclude the first part.In the second part of the chapter, we examine one possible application of QCA, which uses quantum computing to realize real-life based, truly random network organization.This abstract machine is called a Quantum Cellular Machine (QCM), and we design it for controlling a truly random biologically-inspired network, and to integrate quantum learning algorithms and quantum searching into a controlled, self-organizing system.The selforganizing processes in classical systems cannot be truly random.Using our quantum probabilistic QCM unit, we can add truly random behavior to the self-organizing processes of biological networks.A quantum mechanical-based quantum cellular machine (QCM) controls the self-organizing processes of the network and uses a closed, non-classical quantum mechanical-based language inside the QCM.The proposed QCM solution has deep relevance in the evolution of truly random quantum probabilistic self-organizing network structures.The QCM controls the evolution of the system, changes its environment and creates plans without any human interaction, using truly random quantum probabilistic decisions.In a classical system, the classical circuits can only exhibit deterministic behavior.In a quantum probabilistic control system, the quantum circuits can follow both deterministic and quantum probabilistic quantum cellular machine control behaviors.The QCM has classical and quantum communication layers, it uses the classical layer to detect www.intechopen.comCellular Automata -Innovative Modelling for Science and Engineering 114 the network environment.The lower layer of the quantum cellular machine contains the non-deterministic quantum probabilistic decisions and interacts with the classical level.The quantum cellular machine model with the power of quantum computing can be used for the development of a real-life based network organism.We show, that a real, biologically inspired, non-deterministic, truly random network model can be achieved by the discussed QCM model.In the third part of this chapter, we show that a very efficient quantum searching algorithm can be integrated into the QCM, to find the best solution to a given network input command.We present a quantum searching based method specially designed for quantum probabilistic self-organizing networks, to reduce the complexity of the classical traditional search in the network.The proposed QCM can process both quantum and classical information, and accomplish both deterministic and quantum probabilistic tasks.The information unit is a quantum bit, which can lie in a coherent superposition state of logical states zero and one, and can thus simultaneously store zero and one.Using quantum bits, we can speed up the solutions of classical problems, and even solve some hard problems that classical computers can't solve.The key aspect behind the optimal decisions of a QCM is to design a high-efficiency searching algorithm.A QCM updates the probability amplitudes of its quantum register, according to a given reward value, derived from the network environment.The QCM repeatedly applies a unitary transformation to the quantum states, thus it can enhance, for example, the probability amplitude of the optimal path in the self-organizing network environment, while suppressing the amplitude of all other solutions.The QCM's quantum searching algorithm can help resolve many hard tasks, for example it could be applied to find an optimal logical path, using the effects of quantum mechanics.In the numerical analysis we will show that the quantum communication layer could improve the performance of classical systems.
Quantum cellular automata (QCA) are reviewed, including early and more recent proposals. QCA are a generalization of (classical) cellular automata (CA) and in particular of reversible CA. The latter are reviewed shortly. An overview is given over early attempts by various authors to define one-dimensional QCA. These turned out to have serious shortcomings which are discussed as well. Various proposals subsequently put forward by a number of authors for a general definition of one- and higher-dimensional QCA are reviewed and their properties such as universality and reversibility are discussed.