The quantum game of life
Open accessAbstract
The idea that our universe can be modelled as a giant computer dates back to the 1970s. But as Pablo Arrighi and Jonathan Grattage describe, quantum-information theorists are now hoping to revitalize this idea by making the "digital physics" project compatible with quantum theory.
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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?
Quantum cellular automata have attracted great interest due to their potential in quantum computation.
“Recently, quantum cellular automata have attracted great interest due to their potential in quantum computation [8-10]”
From Photonic cellular automaton simulation of relativistic quantum fields: Observation of <i>Zitterbewegung</i> (2024) · cites this paper as [9]
“Towards quantum cellular automata” describes automata built from qubits and quantum gates and discusses their computational universality. “Beyond quantum digital physics” says these concepts are likely to be important for studying a parallel quantum computer. The paper does not establish the broader claim that quantum cellular automata have attracted great interest specifically because of their potential in quantum computation; its focus is on models of physical phenomena. (LLM, conf=0.78)
Experimental — accuracy not yet measured
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Cites
<i>Quantum Computation and Quantum Information</i>
Nielsen, M. A., Chuang, I., & Grover, L. K. (2002) · American Journal of Physics · doi:10.1119/1.1463744 · Cited by 21,895 · see citing works
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691 · see citing works
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,468 · see citing works
Feynman, R. P. (1986) · Foundations of Physics · doi:10.1007/bf01886518 · Cited by 1,770 · see citing works
Fredkin, E., & Toffoli, T. (2001) · Cited by 1,307 · see citing works
From Quantum Cellular Automata To Quantum Lattice GasesPreprint
Meyer, D., Qca, F., David, Q., & Meyer, A. (1996) · Cited by 502 · see citing works
Physics-like models of computation
Margolus, N. (1984) · Physica D Nonlinear Phenomena · doi:10.1016/0167-2789(84)90252-5 · Cited by 411 · see citing works
Computation and construction universality of reversible cellular automata
Toffoli, T. (1977) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(77)80007-x · Cited by 210 · see citing works
Weyl, Dirac, and Maxwell equations on a lattice as unitary cellular automata
Bialynicki-Birula, I. (1994) · Physical Review D · doi:10.1103/physrevd.49.6920 · Cited by 195 · see citing works
On one-dimensional quantum cellular automata
Watrous, J. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1995.492583 · Cited by 156 · see citing works
Computation Universality of One-Dimensional Reversible (Injective) Cellular Automata
Morita, K., & Harao, M. (1989) · Institutional Repositories DataBase (IRDB) · Cited by 115 · see citing works
Reversible quantum cellular automata
Schumacher, B., & Werner, R. F. (2004) · arXiv · doi:10.48550/arxiv.quant-ph/0405174 · Cited by 113 · see citing works
A Simple Universal Cellular Automaton and its One-Way and Totalistic Version.
Albert, J., & Čulík, K. (1987) · Complex Systems · Cited by 110 · see citing works
Quantum lattice-gas model for the many-particle Schrödinger equation in d dimensions
Boghosian, B. M., & Taylor, W. (1998) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.57.54 · Cited by 105 · see citing works
Universality in cellular automata
Banks, E. R. (1970) · Annual Symposium on Switching & Automata Theory · doi:10.1109/swat.1970.27 · Cited by 104 · see citing works
Unitarity plus causality implies localizability
Arrighi, P., Nesme, V., & Werner, R. (2011) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2010.05.004 · Cited by 99 · see citing works
Self-citationSimulating Quantum Mechanics on a Quantum Computer
Boghosian, B. M., & Taylor, W. (1997) · Cited by 98 · see citing works
Reversible simulation of one-dimensional irreversible cellular automata
Morita, K. (1995) · Theoretical Computer Science · doi:10.1016/0304-3975(95)00038-x · Cited by 76 · see citing works
Entanglement dynamics in one-dimensional quantum cellular automata
Brennen, G. K., & Williams, J. (2003) · Physical Review A · doi:10.1103/physreva.68.042311 · Cited by 62 · see citing works
A theory of quantum gravity based on quantum computationPreprint
Lloyd, S. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0501135 · Cited by 60 · see citing works
Quantum cellular automaton for universal quantum computation
Raussendorf, R. (2005) · Physical Review A · doi:10.1103/physreva.72.022301 · Cited by 54 · see citing works
Hamiltonian quantum cellular automata in one dimension
Nagaj, D., & Wocjan, P. (2008) · Physical Review A · doi:10.1103/physreva.78.032311 · Cited by 54 · see citing works
Universally Programmable Quantum Cellular Automaton
Shepherd, D. J., Franz, T., & Werner, R. F. (2006) · Physical Review Letters · doi:10.1103/physrevlett.97.020502 · Cited by 50 · see citing works
Progresses in the analysis of stochastic 2D cellular automata: A study of asynchronous 2D minority
Regnault, D., Schabanel, N., & Thierry, É. (2009) · Theoretical Computer Science · doi:10.1016/j.tcs.2009.06.024 · Cited by 49 · see citing works
Universalities in cellular automata: a (short) survey
Ollinger, N. (2008) · Cited by 48 · see citing works
Partitioned quantum cellular automata are intrinsically universal
Arrighi, P. J., & Grattage, J. (2011) · Natural Computing · doi:10.1007/s11047-011-9277-6 · Cited by 44 · see citing works
Self-citationIntrinsic universality of a 1-dimensional reversible Cellular Automaton
Durand-Lose, J. O. (1997) · Lecture notes in computer science · doi:10.1007/bfb0023479 · Cited by 41 · see citing works
Inducing an order on cellular automata by a grouping operation
Mazoyer, J., & Rapaport, I. (1998) · Lecture notes in computer science · doi:10.1007/bfb0028554 · Cited by 37 · see citing works
One-Dimensional Quantum Cellular Automata over Finite, Unbounded Configurations
Arrighi, P. J., Nesme, V., & Werner, R. F. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-88282-4_8 · Cited by 35 · see citing works
Self-citationDefinition and evolution of quantum cellular automata with two qubits per cell
Karafyllidis, I. G. (2004) · Physical Review A · doi:10.1103/physreva.70.044301 · Cited by 34 · see citing works
Reversible universal quantum computation within translation-invariant systems
Vollbrecht, K. G. H., & Cirac, J. I. (2006) · Physical Review A · doi:10.1103/physreva.73.012324 · Cited by 33 · see citing works
Computation-Universal Models of Two-Dimensional 16-State Reversible Cellular Automata
Morita, K., & Ueno, S. (1992) · Institutional Repositories DataBase (IRDB) · Cited by 32 · see citing works
From Dirac to Diffusion: Decoherence in Quantum Lattice Gases
Love, P. J., & Boghosian, B. M. (2005) · Quantum Information Processing · doi:10.1007/s11128-005-7852-4 · Cited by 30 · see citing works
Reversible cellular automaton able to simulate any other reversible one using partitioning automata
Durand-Lose, J. O. (1995) · Lecture notes in computer science · doi:10.1007/3-540-59175-3_92 · Cited by 27 · see citing works
Quantum mechanics of lattice gas automata: boundary conditions and other inhomogeneities
MEYER, D. A. (1998) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/31/10/009 · Cited by 26 · see citing works
van Dam, W. (1996) · Cited by 22 · see citing works
Intrinsically Universal One-dimensional Quantum Cellular Automata in Two Flavours
Arrighi, P. J., Fargetton, R., & Wang, Z. (2009) · Fundamenta Informaticae · doi:10.3233/fi-2009-0041 · Cited by 22 · see citing works
Self-citationA decision procedure for well-formed linear quantum cellular automata
Dürr, C., Thanh, H. L., & Sántha, M. (1996) · Lecture notes in computer science · doi:10.1007/3-540-60922-9_24 · Cited by 20 · see citing works
Theyssier, G. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-28629-5_32 · Cited by 19 · see citing works
A Particular Universal Cellular Automaton
Ollinger, N., & Richard, G. (2009) · Electronic Proceedings in Theoretical Computer Science · doi:10.4204/eptcs.1.20 · Cited by 19 · see citing works
Algebraic Characterizations of Unitary Linear Quantum Cellular Automata
Arrighi, P. J. (2006) · Lecture notes in computer science · doi:10.1007/11821069_11 · Cited by 9 · see citing works
Self-citationQuantum Cellular Automata from Lattice Field TheoriesPreprint
McGuigan, M. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0307176 · Cited by 7 · see citing works
On Quantum Cellular AutomataPreprint
Vlasov, A. Y. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0406119 · Cited by 6 · see citing works
Quantum Cellular Automata, the Epr Paradox and the Stages Paradigm
Eakins, J. (2003) · Springer eBooks · doi:10.1007/978-94-010-0155-7_34 · Cited by 5 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
A review of Quantum Cellular Automata
Farrelly, T. (2020) · Quantum · doi:10.22331/q-2020-11-30-368 · Cited by 138 · see citing works
Suprano, A., Zia, D., Polino, E., Poderini, D., Carvacho, G., Sciarrino, F., Lugli, M., Bisio, A., & Perinotti, P. (2024) · Physical Review Research · doi:10.1103/physrevresearch.6.033136 · Cited by 2 · see citing works
- Authors
- Arrighi, P., & Grattage, J.
- Affiliations
- Laboratoire d'Informatique de Grenoble (FR)
- Laboratoire de l'Informatique du Parallélisme (FR)
- Venue
- Physics World
- Publisher
- IOP Publishing
- Published
- 2012-06
- Volume
- 25
- Issue
- 06
- Pages
- 23-26
- ISSN
- 0953-8585 (ISSN-L)
- 2058-7058
- OpenAlex
- W1510036950
- Cited by
- 16
- References
- 44
- Citations by year
- 2026: 1 · 2024: 1 · 2023: 1 · 2022: 1 · 2021: 1 · 2020: 5 · 2019: 2 · 2018: 1 · 2017: 1 · 2016: 1 · 2015: 1
- FWCI
- 0.34
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- Physics World (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- HAL (submittedVersion, other-oa)
- arXiv (Cornell University)
- 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 › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- digital physics, 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
