Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Bulletin of the American Physical Society

Quantum cellular automata part I: Entanglement, physical complexity, and Goldilocks rules

Logan Edward Hillberry, M. Jones, David L. Vargas, Patrick Rall, Nicole Yunger Halpern, Ning Bao, Simone Notarnicola, Simone Montangero, Lincoln D. Carr

Published Mar 16, 2021• 0 citations
OpenAlex

Related papers

Quantum cellular automata part II: Robust complexity under analog and digital evolution in 1- and 2-dimensions

Matthew Jones, Logan Edward Hillberry, Eric Jones +5 more

Bulletin of the American Physical Society•Mar 16, 2021•0 citations

Quantum Computing from Addition-rule-based Cellular Automata

Cheng‐Wen Wu

Bulletin of the American Physical Society•Mar 3, 2014•0 citations

Operator Entanglement Growth Quantifies Complexity of Cellular Automata

Calvin C. Bakker, Wout Merbis

Lecture notes in computer science•Jan 1, 2024•2 citations

Entanglement dynamics in quantum cellular automata

M. Andrecut

Physics Letters A•May 1, 2004•0 citations

Entangled quantum cellular automata, physical complexity, and Goldilocks rules

Logan Edward Hillberry, Matthew Timothy Jones, David L. Vargas +6 more

Cellular automata are interacting classical bits that display diverse emergent behaviors, from fractals to random-number generators to Turing-complete computation. We discover that quantum cellular automata (QCA) can exhibit complexity in the sense of the complexity science that describes biology, sociology, and economics. QCA exhibit complexity when evolving under 'Goldilocks rules' that we define by balancing activity and stasis. Our Goldilocks rules generate robust dynamical features (entangled breathers), network structure and dynamics consistent with complexity, and persistent entropy fluctuations. Present-day experimental platforms- Rydberg arrays, trapped ions, and superconducting qubits- can implement our Goldilocks protocols, making testable the link between complexity science and quantum computation exposed by our QCA.

•Jan 1, 2021•31 citations

Entangled quantum cellular automata, physical complexity, and Goldilocks rules

Logan Edward Hillberry, Matthew Timothy Jones, David L. Vargas +6 more

Cellular automata are interacting classical bits that display diverse emergent behaviors, from fractals to random-number generators to Turing-complete computation. We discover that quantum cellular automata (QCA) can exhibit complexity in the sense of the complexity science that describes biology, sociology, and economics. QCA exhibit complexity when evolving under 'Goldilocks rules' that we define by balancing activity and stasis. Our Goldilocks rules generate robust dynamical features (entangled breathers), network structure and dynamics consistent with complexity, and persistent entropy fluctuations. Present-day experimental platforms—Rydberg arrays, trapped ions, and superconducting qubits—can implement our Goldilocks protocols, making testable the link between complexity science and quantum computation exposed by our QCA.

arXiv:2005.01763•Quantum Science and Technology•Aug 10, 2021•2 citations
Cellular automata are interacting classical bits that display diverse emergent behaviors, from fractals to random-number generators to Turing-complete computation. We discover that quantum cellular automata (QCA) can exhibit complexity in the sense of the complexity science that describes biology, sociology, and economics. QCA exhibit complexity when evolving under 'Goldilocks rules' that we define by balancing activity and stasis. Our Goldilocks rules generate robust dynamical features (entangled breathers), network structure and dynamics consistent with complexity, and persistent entropy fluctuations. Present-day experimental platforms- Rydberg arrays, trapped ions, and superconducting qubits- can implement our Goldilocks protocols, making testable the link between complexity science and quantum computation exposed by our QCA.
Cellular automata are interacting classical bits that display diverse emergent behaviors, from fractals to random-number generators to Turing-complete computation. We discover that quantum cellular automata (QCA) can exhibit complexity in the sense of the complexity science that describes biology, sociology, and economics. QCA exhibit complexity when evolving under 'Goldilocks rules' that we define by balancing activity and stasis. Our Goldilocks rules generate robust dynamical features (entangled breathers), network structure and dynamics consistent with complexity, and persistent entropy fluctuations. Present-day experimental platforms—Rydberg arrays, trapped ions, and superconducting qubits—can implement our Goldilocks protocols, making testable the link between complexity science and quantum computation exposed by our QCA.