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.
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.
QCA, which stands for Quantum Dot-Cellular Automata, is a nanotechnology model that offers an alternative solution to the widely used CMOS technology. Unlike CMOS, QCA is a semiconductor-less technology that transmits information based on the charge of electrons and the electrostatic repulsion between them. This technology provides several advantages over CMOS, including higher device density, faster switching speed, and lower power consumption. When it comes to cryptographic applications, QCA circuits can be extremely useful. Both encryption and decryption processes can be implemented using logic circuits based on QCA. The research paper describes a basic method for generating ciphertext in QCA, which is useful in secure nano communication based on QCA. The paper discusses how to achieve secure authentication in encrypted communication using QCA. To evaluate the performance and test the proposed method, the researchers used the QCA Designer-2.0.3 tool. This is a software tool specifically designed for designing and simulating QCA circuits. It enables researchers to model and analyze the behavior of QCA-based systems, allowing them to evaluate the effectiveness and feasibility of their proposed encryption technique. Overall, the research paper aims to present a secure encryption method using QCA and demonstrates its implementation and testing using the QCA Designer-2.0.3 tool. By leveraging the unique properties of QCA, such as high device density and low power consumption, the researchers aim to provide a novel approach for secure nano communication and cryptographic applications.
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.
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
In this paper we present a systematic view of Quantum Cellular Automata (QCA), a mathematical formalism of quantum computation. First we give a general mathematical framework with which to study QCA models. Then we present four different QCA models, and compare them. One model we discuss is the traditional QCA, similar to those introduced by Shumacher and Werner, Watrous, and Van Dam. We discuss also Margolus QCA, also discussed by Schumacher and Werner. We introduce two new models, Coloured QCA, and Continuous-Time QCA. We also compare our models with the established models. We give proofs of computational equivalence for several of these models. We show the strengths of each model, and provide examples of how our models can be useful to come up with algorithms, and implement them in real-world physical devices.