2016
DOI: 10.1007/s11467-016-0616-z
|View full text |Cite
|
Sign up to set email alerts
|

Quantum cellular automata and free quantum field theory

Abstract: In a series of recent papers it has been shown how free quantum field theory can be derived without using mechanical primitives (including space-time, special relativity, quantization rules, etc.), but only considering the easiest quantum algorithm encompassing a countable set of quantum systems whose network of interactions satisfies the simple principles of unitarity, homogeneity, locality, and isotropy. This has opened the route to extending the axiomatic information-theoretic derivation of the quantum theo… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
19
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 24 publications
(19 citation statements)
references
References 27 publications
0
19
0
Order By: Relevance
“…when defining a system as a succession of events. Promising and clever theories that describe events in quantum mechanics have appeared in the literature, for example [18,20,35,36,[39][40][41], but none of them satisfy all these requirements.…”
Section: Comments On the Above Desideratamentioning
confidence: 99%
“…when defining a system as a succession of events. Promising and clever theories that describe events in quantum mechanics have appeared in the literature, for example [18,20,35,36,[39][40][41], but none of them satisfy all these requirements.…”
Section: Comments On the Above Desideratamentioning
confidence: 99%
“…The homogeneity condition is that every two graph vertices are indistinguishable: for every pair of vertices, there exists a permutation πG such that πfalse(gfalse)=g that commutes with any discrimination procedure, that is, preparation of local modes and subsequent joint measurement. This condition renders γ(G,E) a Cayley graph, the properties of which include regularity and vertex transitivity . The “locality” condition is that the evolution is completely determined by a prescription depending on a finite number N of systems and, so, each system interacts with a finite number of others and G is finitely presented.…”
Section: Reconstruction Of “Mechanics” From Informational Principlesmentioning
confidence: 99%
“…Refs. [12,35]) that, thanks to homogeneity, the closed paths on the graph correspond to the same sequences of colours, independently of what vertex one starts from. Thus, one can find a normal subgroup R in F , corresponding to the normal closure of the set of words w = e. The quotient F/S + is a group, that we will denote by G. In particular, the graph that we constructed starting from the FCA corresponds to a Cayley graph Γ(G, S + ).…”
Section: B Neighbourhoods and Cayley Graphs Of Groupsmentioning
confidence: 99%
“…Following Refs. [34,35], we can then rigorously associate the local modes of a homogeneous FCA with the nodes of the Cayley graph of some group G. Different FCAs, with different neighbourhood schemes, determine different Cayley graphs.…”
Section: B Neighbourhoods and Cayley Graphs Of Groupsmentioning
confidence: 99%