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:1903.07007 · Quantum Information Processing

A quantum cellular automaton for one-dimensional QED

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

Published Jan 21, 2020• 44 citations
arXivHTMLPDF
DOI
10.1007/s11128-019-2555-4

Related papers

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•18 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

A Simple n-Dimensional Intrinsically Universal Quantum Cellular Automaton

Pablo J. Arrighi, Jonathan Grattage

arXiv:1002.1015•Lecture notes in computer science•Jan 1, 2010•12 citations

Quantum field as a quantum cellular automaton: The Dirac free evolution in one dimension

Alessandro Bisio, Giacomo Mauro D’Ariano, Alessandro Tosini

arXiv:1212.2839•Annals of Physics•Dec 30, 2014•81 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 one-dimensional 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. KEYWORDS: Quantum cellular automata, Intrinsic universality, Quantum computation.

arXiv:0704.3961•Apr 30, 2007•1 citation

A Physically Universal Quantum Cellular Automaton

Luke Schaeffer

Lecture notes in computer science•Jan 1, 2015•7 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 one-dimensional 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. KEYWORDS: Quantum cellular automata, Intrinsic universality, Quantum computation.