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

arXiv:1801.02060

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

Federico Centrone, Camillo Tassi, Alessio Serafini, Marco Barbieri

Published Jan 6, 2018• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.1801.02060

Related papers

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

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

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

Anas N. Al‐Rabadi

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...

Intelligent Automation & Soft Computing•Jan 1, 2008•0 citations

On one-dimensional quantum cellular automata

John Watrous

Since Richard Feynman introduced the notion of quantum computation in 1982, various models of "quantum computers" have been proposed (R. Feynman, 1992). These models include quantum Turing machines and quantum circuits. We define another quantum computational model, one dimensional quantum cellular automata, and demonstrate that any quantum Turing machine can be efficiently simulated by a one dimensional quantum cellular automaton with constant slowdown. This can be accomplished by consideration of a restricted class of one dimensional quantum cellular automata called one dimensional partitioned quantum cellular automata. We also show that any one dimensional partitioned quantum cellular automaton can be simulated by a quantum Turing machine with linear slowdown, but the problem of efficiently simulating an arbitrary one dimensional quantum cellular automaton with a quantum Turing machine is left open. From this discussion, some interesting facts concerning these models are easily deduced.

Annual Symposium on Foundations of Computer Science•Nov 19, 2002•156 citations

Quantum Coherence in Noisy Cellular Automata

Federico Centrone, Marco Barbieri, Alessio Serafini

Quantum cellular automata are important tools in understanding quantum dynamics, thanks to their simple and effective list of rules. Here we investigate explicitly how coherence is built and lost in the evolution of one-dimensional automata subject to noise. Our analysis illustrates the interplay between unitary and noisy dynamics, and draws considerations on their behaviour in the pseudo-frequency domain.

arXiv:1801.02057•Jan 6, 2018•0 citations

Quantum state transfer through noisy quantum cellular automata

Avalle, M, Genoni, MG, Alessio Serafini

We model the transport of an unknown quantum state on one dimensional qubit lattices by means of a quantum cellular automata evolution. We do this by first introducing a class of discrete noisy dynamics, in the first excitation sector, in which a wide group of classical stochastic dynamics is embedded within the more general formalism of quantum operations. We then extend the Hilbert space of the system to accommodate a global vacuum state, thus allowing for the transport of initial on-site coherences besides excitations, and determine the dynamical constraints that define the class of noisy quantum cellular automata in this subspace. We then study the transport performance through numerical simulations, showing that for some instances of the dynamics perfect quantum state transfer is attainable. Our approach provides one with a natural description of both unitary and open quantum evolutions, where the homogeneity and locality of interactions allow one to take into account several forms of quantum noise in a plausible scenario.

•May 15, 2015•6 citations
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.
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.
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.
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...
Since Richard Feynman introduced the notion of quantum computation in 1982, various models of "quantum computers" have been proposed (R. Feynman, 1992). These models include quantum Turing machines and quantum circuits. We define another quantum computational model, one dimensional quantum cellular automata, and demonstrate that any quantum Turing machine can be efficiently simulated by a one dimensional quantum cellular automaton with constant slowdown. This can be accomplished by consideration of a restricted class of one dimensional quantum cellular automata called one dimensional partitioned quantum cellular automata. We also show that any one dimensional partitioned quantum cellular automaton can be simulated by a quantum Turing machine with linear slowdown, but the problem of efficiently simulating an arbitrary one dimensional quantum cellular automaton with a quantum Turing machine is left open. From this discussion, some interesting facts concerning these models are easily deduced.
We model the transport of an unknown quantum state on one dimensional qubit lattices by means of a quantum cellular automata evolution. We do this by first introducing a class of discrete noisy dynamics, in the first excitation sector, in which a wide group of classical stochastic dynamics is embedded within the more general formalism of quantum operations. We then extend the Hilbert space of the system to accommodate a global vacuum state, thus allowing for the transport of initial on-site coherences besides excitations, and determine the dynamical constraints that define the class of noisy quantum cellular automata in this subspace. We then study the transport performance through numerical simulations, showing that for some instances of the dynamics perfect quantum state transfer is attainable. Our approach provides one with a natural description of both unitary and open quantum evolutions, where the homogeneity and locality of interactions allow one to take into account several forms of quantum noise in a plausible scenario.