Quantum Cellular Automata
The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Abstract
Configuration The state of all cells at a given point in time. Neighborhood All cells with respect to a given cell that can affect this cell’s state at the next time step. A neighborhood always contains a finite number of cells. Space-homogeneous The transition function / update table is the same for each cell. Time-homogeneous The transition function / update table is time-independent. Update table Takes the current state of a cell and its neighborhood as an argument and returns the cell’s state at the next time step. Schrodinger picture Time evolution is represented by a quantum state evolving in time according to a timeindependent unitary operator acting on it. Heisenberg picture Time evolution is represented by observables (elements of an operator algebra) evolving in time according to a unitary operator acting on them. BQP complexity class Bounded error, quantum probabilistic, the class of decision problems solvable by a quantum computer in polynomial time with an error probability of at most 1/3. QMA complexity class Quantum Merlin–Arthur, the class of decision problems such that a “yes” answer can be verified by a 1-message quantum interactive proof (verifiable in BQP). QuantumTuring machine A quantum version of a Turing machine – an abstract computational model able to compute any computable sequence. Swap operation The one-qubit unitary gateU D 0 1 1 0 Hadamard gate The one-qubit unitary gate
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Therefore, QCA is not uniquely defined like its classical counterpart.”
From Dirac Cellular Automaton from Split-step Quantum Walk (2016) · cites this paper as [9]
Citations
Cites
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Theory of Self-Reproducing Automata
Schwartz, J. T., von Neumann, J., & Burks, A. W. (1967) · Mathematics of Computation · doi:10.2307/2005041 · Cited by 5,422
A single quantum cannot be cloned
Wootters, W. K., & Zurek, W. H. (1982) · Nature · doi:10.1038/299802a0 · Cited by 5,406 · cited 1×
“Quantum states, however, cannot be copied in general due to the so-called no-cloning theorem (20).”
BackgroundStatistical mechanics of cellular automata
Wolfram, S. (1983) · Reviews of Modern Physics · doi:10.1103/revmodphys.55.601 · Cited by 3,114
Efficient Simulation of One-Dimensional Quantum Many-Body Systems
Vidal, G. (2004) · Physical Review Letters · doi:10.1103/physrevlett.93.040502 · Cited by 1,779 · cited 1×
“It has been shown that such 1-dimensional spin chains can be simulated efficiently on a classical computer (31).”
BackgroundUltracold quantum gases in optical lattices
Bloch, I. (2005) · Nature Physics · doi:10.1038/nphys138 · Cited by 1,457
Quantum random walks: An introductory overview
Kempe, J. (2003) · Contemporary Physics · doi:10.1080/00107151031000110776 · Cited by 1,413
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244 · cited 1×
“A contemporary paper by Benioff contains the first proposal of a quantum Turing machine (3).”
BackgroundUniversality in Elementary Cellular Automata
Department of Computation and Neural Systems, C., & Cook, M. (2004) · Complex Systems · doi:10.25088/complexsystems.15.1.1 · Cited by 681
A Potentially Realizable Quantum Computer
Lloyd, S. (1993) · Science · doi:10.1126/science.261.5128.1569 · Cited by 649 · cited 3×
“Implementations of computationally universal QCA have been suggested by Lloyd (29) and Benjamin (30).”
BackgroundMethodInfluential
Research works printed but not linked: 12
- Aoun B, Tarifi M (2004) Introduction to quantum cellular automata. http://arxiv.org/abs/quant-ph/0401123 · arXiv
- Arrighi P, Fargetton R (2007) Intrinsically universal one-dimensional quantum cellular automata. 0704.3961. http://arxiv.org/abs/0704.3961 · arXiv
- Arrighi P, Nesme V, Werner R (2007) One-dimensional quantum cellular automata over finite, unbounded configurations. 0711.3517v1. http://arxiv.org/abs/0711.3517 · arXiv
- Arrighi P, Nesme V, Werner R (2007) N-dimensional quantum cellular automata. 0711.3975v1. http://arxiv.org/abs/arXiv:0711.3975
- van Dam W (1996) Quantum cellular automata. Master's thesis, University of Nijmegen
- Dürr C, LêThanh H, Santha M (1997) A decision procedure for well-formed linear quantum cellular automata. Random Struct Algorithms 11:381–394 · doi:10.1002/(sici)1098-2418(199712)11:4<381::aid-rsa6>3.0.co;2-v
- Gruska J (1999) Quantum Computing. Osborne/McGraw-Hill. QCA are treated in Section 4.3
- Margolus N (1991) Parallel quantum computation. In: Zurek WH (ed) Complexity, Entropy, and the Physics of Information, Santa Fe Institute Series. Addison Wesley, Redwood City, pp 273–288
- Nagaj D, Wocjan P (2008) Hamiltonian quantum cellular automata in 1d. 0802.0886. http://arxiv.org/abs/0802.0886 · arXiv
- Perez-Delgado CA, Cheung D (2005) Models of quantum cellular automata. http://arxiv.org/abs/quant-ph/0508164 · arXiv
- Schumacher B, Werner RF (2004) Reversible quantum cellular automata. quant-ph/0405174. http://arxiv.org/abs/quant-ph/0405174 · arXiv
- Summaries of the topic of QCA can be found in chapter 4.3 of Gruska [21], and in Refs. [1,32].
Cited by
On a three-parameter quantum battle of the sexes cellular automaton
Alonso‐Sanz, R. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0496-2 · Cited by 56
“The reader unfamiliar with the CA literature should not confuse the quantum-game CA approach proposed here with general quantum CA models [23].”
MethodDirac Cellular Automaton from Split-step Quantum Walk
Mallick, A., & Chandrashekar, C. M. (2016) · Scientific Reports · doi:10.1038/srep25779 · Cited by 45
Mixed Multi-Chaos Quantum Image Encryption Scheme Based on Quantum Cellular Automata (QCA)
Mohamed, N. A. E.-S., El‐sayed, H. S., & Youssif, A. A. A. (2023) · Fractal and Fractional · doi:10.3390/fractalfract7100734 · Cited by 43
Gillman, E., Carollo, F., & Lesanovsky, I. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.100403 · Cited by 41
“Note that the term QCA is also used in the quantum information (QI) context [36–43], e.”
MethodVariable entangling in a quantum prisoner’s dilemma cellular automaton
Alonso‐Sanz, R. (2014) · Quantum Information Processing · doi:10.1007/s11128-014-0834-7 · Cited by 22
Metadata
- Authors
- Wiesner, K.
- Affiliations
- University of Bristol (GB)
- Corresponding author
- Wiesner, Karoline
- ORCID
- Wiesner, Karoline
- Venue
- Encyclopedia of Complexity and Systems Science
- Publisher
- Springer New York
- Published
- 2009
- Pages
- 7154-7164
- OpenAlex
- W4302395174
- Cited by
- 19
- References
- 38
- Citations by year
- 2023: 1 · 2021: 3 · 2020: 4 · 2019: 1 · 2017: 2 · 2016: 2 · 2015: 1 · 2014: 3 · 2012: 1
- Type
- reference entry
- Language
- en
- Open access
- closed
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
- Locations
- Encyclopedia of Complexity and Systems Science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Cellular Automata and Applications
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Mathematics › Theoretical Computer Science › DNA and Biological Computing
- Keywords
- quantum cellular automata, quantum computing, cellular automata, quantum mechanics
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Quantum Cellular Automata. https://app.cochat.ai/papers/10.1007/978-0-387-30440-3_426
- The paper
- Wiesner, K. (2009). Quantum Cellular Automata. Encyclopedia of Complexity and Systems Science. https://doi.org/10.1007/978-0-387-30440-3_426
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.