© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

Intelligent Automation & Soft Computing

Modeling and Processing Using Reversible Conservative Noisy Elementary Cellular Automata Circuits and their M-Ary Quantum Computing

Anas N. Al‐Rabadi

Published Jan 1, 2008• 0 citations

Abstract

Abstract Modeling noisy discrete systems utilizing conservative reversible elementary cellular automata (CRECA) is introduced. Reversibility in the ECA evolution rule and reversibility in the ECA circuit implementation are both achieved using a new Swap-based algorithm called Swap-based CRECA (SCRECA). The new method results in adding variable redundancy to counteract the effect of noise. The problem of obtaining a reversible map from an irreversible map is important because quantum circuits are inherently reversible and thus does not consume power, while irreversible circuits (due to either an irreversible mapping or to noise within a reversible mapping) cannot exist in the quantum domain and its circuits consume power. Since noise is an integral part of any real process and since the reduction of power consumption is a main requirement for the circuit design of future technologies such as in quantum computing (QC), the main features of several future technologies will include reversibility, and thus the...

DOI: 10.1080/10798587.2008.10642990

Related papers

m-Valued Quantum Representations and Operations of Elementary Cellular Automata

Anas N. Al‐Rabadi

This paper introduces the m-valued Swap-based quantum computations (QC) of ECA. The fundamental m-valued quantum representations of: (1) m-valued orthonormal computational basis states quantum decision trees (QDTs) and (2) m-valued orthonormal composite basis states QDTs are also introduced as quantum modeling for the representations and operations of the QECA dynamics. The new m-valued quantum representations and their associated operations can play an important role in the automated design of future QECA circuits that consume minimal power in the quantum domain.

World Automation Congress (WAC)•Jul 1, 2006•1 citation

Reversibility and quantum coherence in one-dimensional quantum cellular automata

Federico Centrone, Camillo Tassi, Marco Barbieri +1 more

Quantum cellular automata are important tools in understanding quantum dynamics, thanks to their simple and effective list of rules. Here we consider a class of noisy, one-dimensional quantum cellular automata that allow one to shift from unitary dynamics to completely positive maps, investigating the evolution of coherence as well as the notion of reversibility in such a setting. To this aim, we associate an approximate reverse automaton to each noisy automaton, and assess its effect, and we define an irreversibility time based on the distance from the maximally mixed state, which is shown to be the only attractor of the automaton map in the presence of dephasing. Our analysis illustrates the interplay between unitary and noisy dynamics.

Physical Review A•Jul 3, 2018•1 citation

Reversibility in one-dimensional quantum cellular automata in the presence of noise

Federico Centrone, Camillo Tassi, Alessio Serafini +1 more

We consider a class of noisy, one-dimensional quantum cellular automata that allow one to shift from unitary dynamics to completely positive maps, and investigate the notion of reversibility in such a setting. To this aim, we associate an approximate reverse automaton to each noisy automaton, and assess its effect, and we define an irreversibility time based on the distance from the maximally mixed state, which is shown to be the only attractor of the automaton map in the presence of dephasing.

arXiv:1801.02060•Jan 6, 2018•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•65 citations

Low power quantum gates for the implementation of reversible memory elements using quantum dot cellular automata

Samyukta A Hassan, Preeta Sharan

Energy can neither be created nor be destroyed but it can be conserved. The processors of present day computers are designed using conventional logic circuits which are irreversible in nature. They suffer from loss of information during computation, leading to energy dissipation in the form of heat affecting the performance and life of the circuits. These limitations of conventional logic circuits can be overcome by the reversible logic circuits designed using quantum gates, the essential elements for quantum computing. Quantum computing is an emerging area of research which finds application in optical computing, DNA computing, cryptography, low power CMOS design, digital signal processing and nanotechnology.

International Conference on Computing for Sustainable Global Development•Mar 16, 2016•4 citations

Reversible quantum cellular automata

Benjamin W. Schumacher, Reinhard F. Werner

We define quantum cellular automata as infinite quantum lattice systems with discrete time dynamics, such that the time step commutes with lattice translations and has strictly finite propagation speed. In contrast to earlier definitions this allows us to give an explicit characterization of all local rules generating such automata. The same local rules also generate the global time step for automata with periodic boundary conditions. Our main structure theorem asserts that any quantum cellular automaton is structurally reversible, i.e., that it can be obtained by applying two blockwise unitary operations in a generalized Margolus partitioning scheme. This implies that, in contrast to the classical case, the inverse of a nearest neighbor quantum cellular automaton is again a nearest neighbor automaton. We present several construction methods for quantum cellular automata, based on unitaries commuting with their translates, on the quantization of (arbitrary) reversible classical cellular automata, on quantum circuits, and on Clifford transformations with respect to a description of the single cells by finite Weyl systems. Moreover, we indicate how quantum random walks can be considered as special cases of cellular automata, namely by restricting a quantum lattice gas automaton with local particle number conservation to the single particle sector.

arXiv:quant-ph/0405174•May 28, 2004•98 citations

Abstract Modeling noisy discrete systems utilizing conservative reversible elementary cellular automata (CRECA) is introduced. Reversibility in the ECA evolution rule and reversibility in the ECA circuit implementation are both achieved using a new Swap-based algorithm called Swap-based CRECA (SCRECA). The new method results in adding variable redundancy to counteract the effect of noise. The problem of obtaining a reversible map from an irreversible map is important because quantum circuits are inherently reversible and thus does not consume power, while irreversible circuits (due to either an irreversible mapping or to noise within a reversible mapping) cannot exist in the quantum domain and its circuits consume power. Since noise is an integral part of any real process and since the reduction of power consumption is a main requirement for the circuit design of future technologies such as in quantum computing (QC), the main features of several future technologies will include reversibility, and thus the...

This paper introduces the m-valued Swap-based quantum computations (QC) of ECA. The fundamental m-valued quantum representations of: (1) m-valued orthonormal computational basis states quantum decision trees (QDTs) and (2) m-valued orthonormal composite basis states QDTs are also introduced as quantum modeling for the representations and operations of the QECA dynamics. The new m-valued quantum representations and their associated operations can play an important role in the automated design of future QECA circuits that consume minimal power in the quantum domain.

Quantum cellular automata are important tools in understanding quantum dynamics, thanks to their simple and effective list of rules. Here we consider a class of noisy, one-dimensional quantum cellular automata that allow one to shift from unitary dynamics to completely positive maps, investigating the evolution of coherence as well as the notion of reversibility in such a setting. To this aim, we associate an approximate reverse automaton to each noisy automaton, and assess its effect, and we define an irreversibility time based on the distance from the maximally mixed state, which is shown to be the only attractor of the automaton map in the presence of dephasing. Our analysis illustrates the interplay between unitary and noisy dynamics.

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.

Energy can neither be created nor be destroyed but it can be conserved. The processors of present day computers are designed using conventional logic circuits which are irreversible in nature. They suffer from loss of information during computation, leading to energy dissipation in the form of heat affecting the performance and life of the circuits. These limitations of conventional logic circuits can be overcome by the reversible logic circuits designed using quantum gates, the essential elements for quantum computing. Quantum computing is an emerging area of research which finds application in optical computing, DNA computing, cryptography, low power CMOS design, digital signal processing and nanotechnology.

We define quantum cellular automata as infinite quantum lattice systems with discrete time dynamics, such that the time step commutes with lattice translations and has strictly finite propagation speed. In contrast to earlier definitions this allows us to give an explicit characterization of all local rules generating such automata. The same local rules also generate the global time step for automata with periodic boundary conditions. Our main structure theorem asserts that any quantum cellular automaton is structurally reversible, i.e., that it can be obtained by applying two blockwise unitary operations in a generalized Margolus partitioning scheme. This implies that, in contrast to the classical case, the inverse of a nearest neighbor quantum cellular automaton is again a nearest neighbor automaton. We present several construction methods for quantum cellular automata, based on unitaries commuting with their translates, on the quantization of (arbitrary) reversible classical cellular automata, on quantum circuits, and on Clifford transformations with respect to a description of the single cells by finite Weyl systems. Moreover, we indicate how quantum random walks can be considered as special cases of cellular automata, namely by restricting a quantum lattice gas automaton with local particle number conservation to the single particle sector.