CoChat

Quantum Cellular Automata

Wiesner, Karoline · 2009 · Encyclopedia of Complexity and Systems Science

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

Crossref · 10.1007/978-0-387-30440-3_426

Cites

39 of 39 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 39 references

Research works printed but not linked: 12

  1. Aoun B, Tarifi M (2004) Introduction to quantum cellular automata. http://arxiv.org/abs/quant-ph/0401123 · arXiv
  2. Arrighi P, Fargetton R (2007) Intrinsically universal one-dimensional quantum cellular automata. 0704.3961. http://arxiv.org/abs/0704.3961 · arXiv
  3. 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
  4. Arrighi P, Nesme V, Werner R (2007) N-dimensional quantum cellular automata. 0711.3975v1. http://arxiv.org/abs/arXiv:0711.3975
  5. van Dam W (1996) Quantum cellular automata. Master's thesis, University of Nijmegen
  6. 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
  7. Gruska J (1999) Quantum Computing. Osborne/McGraw-Hill. QCA are treated in Section 4.3
  8. 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
  9. Nagaj D, Wocjan P (2008) Hamiltonian quantum cellular automata in 1d. 0802.0886. http://arxiv.org/abs/0802.0886 · arXiv
  10. Perez-Delgado CA, Cheung D (2005) Models of quantum cellular automata. http://arxiv.org/abs/quant-ph/0508164 · arXiv
  11. Schumacher B, Werner RF (2004) Reversible quantum cellular automata. quant-ph/0405174. http://arxiv.org/abs/quant-ph/0405174 · arXiv
  12. Summaries of the topic of QCA can be found in chapter 4.3 of Gruska [21], and in Refs. [1,32].

Cited by

See all 19

Metadata

Authors
Wiesner, K.
Affiliations
University of Bristol (GB)
Corresponding author
Wiesner, Karoline
Venue
Encyclopedia of Complexity and Systems Science
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
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.