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

arXiv:1002.1015 · Lecture notes in computer science

A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton

Pablo J. Arrighi, Jonathan Grattage

Published Jan 1, 2010• 11 citations
arXivHTMLPDF
DOI
10.1007/978-3-642-13089-2_6

Related papers

A Physically Universal Quantum Cellular Automaton

Luke Schaeffer

Lecture notes in computer science•Jan 1, 2015•7 citations

A quantum cellular automaton for one-dimensional QED

Pablo J. Arrighi, Cédric Bény, Terry Farrelly

arXiv:1903.07007•Quantum Information Processing•Jan 21, 2020•58 citations

Intrinsically universal n-dimensional quantum cellular automata

Pablo J. Arrighi, Jonathan Grattage

arXiv:0907.3827•Journal of Computer and System Sciences•Jan 12, 2012•27 citations

Path-integral solution of the one-dimensional Dirac quantum cellular automaton

Giacomo Mauro D’Ariano, Nicola Mosco, Paolo Perinotti +1 more

arXiv:1406.1021•Physics Letters A•Sep 1, 2014•17 citations

A non-qubit quantum adder as one-dimensional cellular automaton

C. H. Wu, C. A. Cain

Physica E Low-dimensional Systems and Nanostructures•Feb 1, 2014•4 citations

Intrinsically Universal One-dimensional Quantum Cellular Automata in Two Flavours

Pablo J. Arrighi, Renan Fargetton, Zizhu Wang

We give a one-dimensional quantum cellular automaton (QCA) capable of simulating all others. By this we mean that the initial configuration and the local transition rule of any onedimensional QCA can be encoded within the initial configuration of the universal QCA. Several steps of the universal QCA will then correspond to one step of the simulated QCA. The simulation preserves the topology in the sense that each cell of the simulated QCA is encoded as a group of adjacent cells in the universal QCA. The encoding is linear and hence does not carry any of the cost of the computation. We do this in two flavours: a weak one which requires an infinite but periodic initial configuration and a strong one which needs only a finite initial configuration.

arXiv:0704.3961•Fundamenta Informaticae•Jan 1, 2009•23 citations
We give a one-dimensional quantum cellular automaton (QCA) capable of simulating all others. By this we mean that the initial configuration and the local transition rule of any onedimensional QCA can be encoded within the initial configuration of the universal QCA. Several steps of the universal QCA will then correspond to one step of the simulated QCA. The simulation preserves the topology in the sense that each cell of the simulated QCA is encoded as a group of adjacent cells in the universal QCA. The encoding is linear and hence does not carry any of the cost of the computation. We do this in two flavours: a weak one which requires an infinite but periodic initial configuration and a strong one which needs only a finite initial configuration.