When is a Quantum Cellular Automaton (QCA) a Quantum Lattice Gas Automaton (QLGA)

@article{Shakeel2012WhenIA,
  title={When is a Quantum Cellular Automaton (QCA) a Quantum Lattice Gas Automaton (QLGA)},
  author={Asif Shakeel and Peter J. Love},
  journal={arXiv: Mathematical Physics},
  year={2012}
}
Quantum cellular automata (QCA) are models of quantum computation of particular interest from the point of view of quantum simulation. Quantum lattice gas automata (QLGA - equivalently partitioned quantum cellular automata) represent an interesting subclass of QCA. QLGA have been more deeply analyzed than QCA, whereas general QCA are likely to capture a wider range of quantum behavior. Discriminating between QLGA and QCA is therefore an important question. In spite of much prior work… Expand

Figures from this paper

Quantum cellular automata without particles
Quantum cellular automata (QCA) constitute space and time homogeneous discrete models for quantum field theories (QFTs). Although QFTs are defined without reference to particles, computations areExpand
THE EQUIVALENCE OF SCHRÖDINGER AND HEISENBERG PICTURES IN QUANTUM CELLULAR AUTOMATA
Quantum cellular automata (QCA) are discrete models of space and time homogeneous quantum field theories (QFTs) and regarded as natural candidates for quantum simulation. Description of a QCA overExpand
A review of Quantum Cellular Automata
TLDR
This review discusses all of these applications of QCAs, including the matrix product unitary approach and higher dimensional classifications, as well as some other interesting results on the structure of quantum cellular automata. Expand
The Equivalence of Schr\"{o}dinger and Heisenberg Pictures in Quantum Cellular Automata
Quantum cellular automata (QCA) are discrete models of space and time homogeneous quantum field theories (QFTs) and regarded as natural candidates for quantum simulation. Description of a QCA overExpand
History dependent quantum random walks as quantum lattice gas automata
Quantum Random Walks (QRW) were first defined as one-particle sectors of Quantum Lattice Gas Automata (QLGA). Recently, they have been generalized to include history dependence, either on previousExpand
Neighborhood-history quantum walk
History dependent discrete time quantum walks (QWs) are often studied for their lattice traversal properties. A particular model in the literature uses the state of a memory qubit at each site toExpand
An overview of quantum cellular automata
  • P. Arrighi
  • Physics, Computer Science
  • Natural Computing
  • 2019
TLDR
An overview of quantum cellular automata theory is given, with particular focus on structure results; computability and universality results; and quantum simulation results. Expand
On Quantum Extensions of Hydrodynamic Lattice Gas Automata
We consider quantum extensions of classical hydrodynamic lattice gas models. We find that the existence of local conserved quantities strongly constrains such extensions. We find the only extensionsExpand
QUANTUM LATTICE ALGORITHMS : SIMILARITIES AND CONNECTIONS TO SOME CLASSIC FINITE DIFFERENCE ALGORITHMS
Quantum lattice algorithms originated with the Feynman checkerboard model for the onedimensional Dirac equation. They offer discrete models of quantum mechanics in which the complex numbersExpand
Quantum lattice algorithms: similarities and connections to some classic finite difference algorithms
Quantum lattice algorithms originated with the Feynman checkerboard model for the one-dimensional Dirac equation. They offer discrete models of quantum mechanics in which the complex numbersExpand
...
1
2
...

References

SHOWING 1-10 OF 80 REFERENCES
A universal quantum cellular automaton
We will prove the existence of a universal quantum cellular automaton. Such qca are defined as the quantum-mechanical pendant of classical one-dimensional cellular automata. As is the case withExpand
Reversible quantum cellular automata
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 propagationExpand
One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations
TLDR
It is shown that QCA always admit a two-layered block representation, and hence the inverse QCA is again a QCA, a striking result since the property does not hold for classical one-dimensional cellular automata as defined over such finite configurations. Expand
From quantum cellular automata to quantum lattice gases
A natural architecture for nanoscale quantum computation is that of a quantum cellular automaton. Motivated by this observation, we begin an investigation of exactly unitary cellular automata. AfterExpand
On one-dimensional quantum cellular automata
  • J. Watrous
  • Mathematics, Computer Science
  • Proceedings of IEEE 36th Annual Foundations of Computer Science
  • 1995
TLDR
It is demonstrated that any quantum Turing machine can be efficiently simulated by a one dimensional quantum cellular automaton with constant slowdown, and this can be accomplished by consideration of a restricted class of one dimensionalquantum cellular automata called one dimensional partitioned quantum Cellular automata. Expand
A Decision Procedure for Unitary Linear Quantum Cellular Automata
TLDR
An efficient algorithm to decide if a linear quantum cellular automaton is unitary is given and the complexity of the algorithm is O(n(3r-1)/(r+1) = O( n3) in the algebraic computational model if the automaton has a continuous neighborhood of size r, where n is the size of the input. Expand
Local unitary quantum cellular automata
In this paper we present a quantization of cellular automata. Our formalism is based on a lattice of qudits and an update rule consisting of local unitary operators that commute with their ownExpand
When-and how-can a cellular automaton be rewritten as a lattice gas?
TLDR
It is proved that an LG presentation is out of the question for the vanishingly small class of surjective ones and the tradeoff between dissipation rate and structural complexity implied by the above results have compelling implications for the thermodynamics of computation at a microscopic scale. Expand
UNITARITY IN ONE DIMENSIONAL NONLINEAR QUANTUM CELLULAR AUTOMATA
Unitarity of the global evolution is an extremely stringent condition on finite state models in discrete spacetime. Quantum cellular automata, in particular, are tightly constrained. In previous workExpand
The Bravyi-Kitaev transformation for quantum computation of electronic structure.
TLDR
An alternative method of simulating fermions with qubits, first proposed by Bravyi and Kitaev, is developed that reduces the simulation cost to O(log n) qubit operations for one fermionic operation and demonstrates the superior efficiency of the Bravyi-Kitaev method for all quantum computations of electronic structure. Expand
...
1
2
3
4
5
...