Unitarity plus causality implies localizability
From MaRDI portal
Publication:632800
DOI10.1016/J.JCSS.2010.05.004zbMATH Open1210.81067arXiv0711.3975OpenAlexW1990541804WikidataQ62124821 ScholiaQ62124821MaRDI QIDQ632800FDOQ632800
Authors: Pablo Arrighi, Vincent Nesme, Reinhard F. Werner 
Publication date: 28 March 2011
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Abstract: We consider a graph with a single quantum system at each node. The entire compound system evolves in discrete time steps by iterating a global evolution . We require that this global evolution be unitary, in accordance with quantum theory, and that this global evolution be causal, in accordance with special relativity. By causal we mean that information can only ever be transmitted at a bounded speed, the speed bound being quite naturally that of one edge of the underlying graph per iteration of . We show that under these conditions the operator can be implemented locally; i.e. it can be put into the form of a quantum circuit made up with more elementary operators -- each acting solely upon neighbouring nodes. We take quantum cellular automata as an example application of this representation theorem: this analysis bridges the gap between the axiomatic and the constructive approaches to defining QCA. KEYWORDS: Quantum cellular automata, Unitary causal operators, Quantum walks, Quantum computation, Axiomatic quantum field theory, Algebraic quantum field theory, Discrete space-time.
Full work available at URL: https://arxiv.org/abs/0711.3975
Recommendations
- Algebraic Characterizations of Unitary Linear Quantum Cellular Automata
- A physically universal quantum cellular automaton
- A decision procedure for unitary linear quantum cellular automata
- One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations
- Approximate locality for quantum systems on graphs
Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Axiomatic quantum field theory; operator algebras (81T05)
Cites Work
- Simulating quantum mechanics on a quantum computer.
- From quantum cellular automata to quantum lattice gases
- Title not available (Why is that?)
- Index theory of one dimensional quantum walks and cellular automata
- On \(L(d,1)\)-labelings of graphs
- Title not available (Why is that?)
- From Dirac to diffusion: decoherence in quantum lattice gases
- Locality and information transfer in quantum operations
- Approximate locality for quantum systems on graphs
- One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations
- Quantum mechanics of lattice gas automata: boundary conditions and other inhomogeneities
- A decision procedure for well-formed linear quantum cellular automata
- Algebraic Characterizations of Unitary Linear Quantum Cellular Automata
Cited In (32)
- Reversibility vs Local Creation/Destruction
- Applying causality principles to the axiomatization of probabilistic cellular automata
- The group structure of quantum cellular automata
- Quantum walks, deformed relativity and Hopf algebra symmetries
- Block representation of reversible causal graph dynamics
- Consistency of Higgsplosion in localizable QFT
- Reversible causal graph dynamics: invertibility, block representation, vertex-preservation
- A quantum walk with both a continuous-time limit and a continuous-spacetime limit
- When is a quantum cellular automaton (QCA) a quantum lattice gas automaton (QLGA)?
- Discrete Lorentz covariance for quantum walks and quantum cellular automata
- Lieb-Schultz-Mattis anomalies as obstructions to gauging (non-on-site) symmetries
- An overview of quantum cellular automata
- Intrinsically universal \(n\)-dimensional quantum cellular automata
- Partitioned quantum cellular automata are intrinsically universal
- Path-integral solution of the one-dimensional Dirac quantum cellular automaton
- An index for quantum cellular automata on fusion spin chains
- Reversible causal graph dynamics
- Index theory of one dimensional quantum walks and cellular automata
- Symmetries of the Dirac quantum walk and emergence of the de Sitter group
- Clifford quantum cellular automata: Trivial group in 2D and Witt group in 3D
- Weyl, Dirac and Maxwell quantum cellular automata
- Nontrivial quantum cellular automata in higher dimensions
- Quantum field as a quantum cellular automaton: the Dirac free evolution in one dimension
- An algorithm to factorize quantum walks into shift and coin operations
- DHR bimodules of quasi-local algebras and symmetric quantum cellular automata
- Quantum cellular automaton theory of light
- Revisiting the simulation of quantum Turing machines by quantum circuits
- Universal topological phase of two-dimensional stabilizer codes
- Causal structure of the entanglement renormalization ansatz
- Classification of quantum cellular automata
- Invertible subalgebras
- A quantum cellular automaton for one-dimensional QED
This page was built for publication: Unitarity plus causality implies localizability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q632800)
