1 Introduction
Since its very beginning, quantum information theory has represented a new way of looking at foundations of Quantum Theory (QT), and the study of quantum protocols has provided a significant reconsideration of the of the structure of the theory, which eventually resulted in a new axiomatization program, initiated in the early 2000 [
7-
10]. The purpose was to reconstruct the von Neumann Hilbert-space formulation of the theory starting from information-processing principles. A complete derivation of QT for finite dimensions has been finally achieved in Ref. [
5] within the framework of operational probabilistic theories, starting from six principles assessing the possibility or impossibility to carry out specific information-processing tasks.
As a theory of information processing, however, QT does not carry any physical semantics or mechanical notions – such as space-time, elementary particles, mass, charge – nor physical constants as the Planck constant and the speed of light. The program now aims at recovering also the mechanical features, instead of following the historical approach of imposing quantization rules and mysteriously turning classical Hamiltonians to quantum. The informational approach is pursued even further, with the purpose of reconstructing also the quantum equations of motion, which in the simplest non interacting case are the Weyl, Dirac and Maxwell field theories, along with recovering the fundamental constants, such as and c. The starting idea is to look at physical laws as an effective description of an information processing algorithm, which updates the states of an array of quantum memory cells, with particles emerging as the interpretation of special patterns of the memory. It is important to stress that space-time itself is also emergent in this approach, as the natural set of coordinates in which the emergent dynamics is formulated.
The present follow-up of the informational derivation of QT is also motivated by the the role that information is playing in theoretical physics at the fundamental level of quantum gravity and Planck-scale, e.g., in the holographic-principle and the ultraviolet cutoffs, implying an upper bound to the amount of information that can be stored in a finite space volume [
12-
14]. Imposing an
in-principle upper bound to the information density, forces us to replace continuous quantum fields with countably many finite-dimensional quantum systems, i.e., a quantum cellular automaton (QCA) [
15] representing the unitary evolution of the quantum systems in local interaction [
16-
18].
The possibility of approximating relativistic quantum dynamics with QCAs was already known from Refs. [
19-
21] However, the possibility of reversing the paradigm and deriving the equations of quantum field theory (QFT) from informational principles was proposed by one of the present authors only in recent years in a series of heuristic works [
22-
28], which preluded the main work [
1] from the present authors with the derivation Weyl and Dirac, along with the works [
2,
3] and the derivation of Maxwell [
4]. Other authors then also addressed QFT in the QCA framework [
29,
30].
The QCA framework manifestly breaks the Lorentz covariance, and the claim that relativistic quantum field theory is recovered must be substantiated by an appropriate analysis of the symmetries of the emerging space-time. To this end, one has to introduce the notion of “inertial frame” in terms of the underlying QCA without using space-time. Upon identifying the notion of “reference frame” with that of “representation” of the dynamics, we appeal to the relativity principle to define the “inertial representation” as the one for which the physical law retains the same mathematical form. In such a way the change of inertial reference frame leads to a set of modified Lorentz transformations that recover the usual ones when the observation scale is much larger than the discrete microscopic scale. This problem has been first addressed in Refs. [
32,
33]. While the QCA model recovers the usual Poincaré covariance of QFT in the relativistic limit of wave-vectors much smaller than Planck’s one [
1,
2,
4] (namely in the limit where discreteness cannot be probed), the group of symmetries exhibits a very different behavior in the ultra-relativistic regime of Planckian wave-vectors, where the usual symmetries are distorted as in doubly-special relativity models.
In this paper we review the derivation from principles of Refs. [
1,
4], proving in detail that the graph of the QCA is a
Cayley graph of a finitely presented group, and showing how for the case corresponding to an Euclidean emergent space (where the group resorts to an Abelian one) the automata lead to Weyl, Dirac and Maxwell field dynamics in the relativistic limit. We conclude with some perspectives towards the more general scenario of non-linear automata for interacting quantum field theory.
2 The principles for the QCA
A QCA gives the evolution of a denumerable set
G of cells, each one corresponding to a quantum system. In our framework (see Refs. [
1,
2]) we are interested in exploring the possibility of an automaton description of free QFT and thus assume the quantum systems in
G to be quantum fields. Requiring that the amount of information in a finite number of cells must be finite corresponds to consider
Fermionic modes. In Section 7, based on Ref. [
4], we see how
Bosonic statistics can be recovered in this scenario as a very good approximation with the bosonic mode corresponding to a specially entangled state of a pair of Fermionic modes. The relation between Fermionic modes and finite-dimensional quantum systems, say
qubits, is studied in the literature, and the two theories were proved to be computationally equivalent [
35]. On the other hand the quantum theory of qubits and the quantum theory of Fermions differ in the notion of what are local transformations [
36,
37], with local Fermionic operations mapped into nonlocal qubit transformatioms and vice versa.
From now each cell of G will host an array of Fermionic modes with field operator , obeying the canonical anti-commutation relations
where
denotes the number of field components of the array
at each site
. The general states and effects are linear combinations of even products of field operators (see Ref. [
36]). The evolution occurs in discrete identical steps, and in each one every cell interacts with the others. The construction of the one-step update rule is based on the following assumptions on the interactions among systems [
1]: 1) unitarity, 2) linearity, 3) homogeneity, 4) locality, and 5) isotropy. These constraints regard the algebraic properties of the map providing the update rule of the field. Denoting the variable that counts the evolution steps by
t, and the local array of field operators at
g at step
t by
we can express unitarity as follows
with U unitary operator. The linearity constraint requires that the field evolution can be expressed in terms of linear combinations of field operators, namely,
where is an complex matrix called transition matrix. Linearity thus endows the set G with a graph structure , with vertex set G and edge set . For every , we define the set of non-null transition matrices, along with the neighborhood of g as .
Homogeneity consists in the requirement that every two vertices are indistinguishable. The most general discrimination procedure between two vertices consists of a suitable sequence of state preparations of local modes, at different steps, followed by a sequence of measurements. A necessary condition for homogeneity is thus the following: for every vertex the array has the same length, . If we now consider a general permutation π of the vertices, we will denote by the transformation defined by . Homogeneity can thus be expressed as the requirement that for every there exists π such that , and for every joint state ρ and every joint effect O of the automaton along with a generic ancillary system , one has
where denotes the identical transformation on the ancillary system . As one can easily verify, the dual map coincides with . The first result that we show is thus the following equivalent condition for homogeneity: a cellular automaton on the set G is homogeneous if and only if for every there exists a permutation such that , and
It is easy to check that Eq. (5) equally holds for , for any . The permutations π that satisfy condition (5) are clearly a group Π that acts transitively on G.
Considering a general element , the condition in Eq. (5) implies that for some
Since the field operators are linearly independent, Eq. (6) bears two important consequences: for every there exists such that — or equivalently — and vice versa for every there exists such that . Thus, , and since the group of permutations π satisfying Eq. (5) is transitive, we have that for every there is a bijection . Setting , for every one has a bijection .
Moreover, by Eq. (6), for every g and for every , one has for the permutations π satisfying Eq. (5). Again, since the group of such permutations is transitive on G, for every pair the sets Sg and contain the same transition matrices, namely . If we associate the label hi to the edge whenever , we enrich the structure of the graph , which becomes a vertex-transitive colored directed graph, with colors corresponding to the labels hi. If two transition matrices are equal, we conventionally associate them with two different labels in such a way that Eq. (6) holds. If such choice is not unique, we will pick an arbitrary one, since the homogeneity requirement implies that there exists a choice of labeling for which all the following construction is consistent. In the following we will identify the set S with the set of labels hi, with a slight abuse of notation. We now define the action of S on G formally as when . Notice that by construction, one has , which implies
If we now use the alphabet of labels hi and to form arbitrary words, we obtain a free group F: composition corresponds to word juxtaposition, with the empty word λ representing the identity, and the formal rule . An element of F — with — thus corresponds to a path on the graph, where the symbol denotes a backwards step along an arrow (i.e., from the head of the arrow to its tail). For every , one has . The action of symbols on the elements can now be extended to arbitrary words , by posing iff , and . For every , and for every pair (for the corresponding permutation π), we now show that . The first step consists in proving the result for . Let , namely . Then by Eq. (7) , namely . Notice that, if we define , the last result implies that for every pair there is a bijection , and . Indeed, if and only if for some j, and thus . One can prove that by induction on the length of the word w. Indeed, we know that it is true for . Suppose now that for one has , and consider with . Then with and . In this case we have
where the induction hypothesis is used in the fourth equality.
Let us now suppose that for some and some word one has . Then for every one can take π such that , thus obtaining
Thus, if a path is closed starting from , then it is closed also starting from any other .
In particular, the necessary condition implies that if for some , there exists an element and such that and , then for every one has , namely . We can now easily see that the subset R of F corresponding to words r such that for all is a normal subgroup. Indeed, R is a subgroup because the juxtaposition of two words is again a word , and for every word also . To prove that R is normal in F we just show that it coincides with its normal closure, i.e., for every and every , we have . Indeed, defining for arbitrary g the element , we have , and thus , namely .
We thus identified a normal subgroup R containing all the words r corresponding to closed paths. If one takes the quotient , one obtains a group whose elements are equivalence classes of words in F. If we label an arbitrary element of G by e, it is clear that the elements of G are in one-to-one correspondence with the vertices of G, since for every there is one and only one class in whose elements lead from e to g. We can then write for every such that w represents a path leading from e to g. In technical terms, the graph is the Cayley graph of the group . Homogeneity thus implies that the set G is a group G that can be presented as , where S is the set of generators of G and R is the group of relators. In the following, if we will draw an undirected edge to represent hi. The presentation can be chosen by arbitrarily dividing S into and in such a way that . The above arbitrariness is inherent the very notion of group presentation and corresponding Cayley graph, and will be exploited in the following, in particular in the definition of isotropy.
For convenience of the reader we remind the definition of Cayley graph. Given a group G and a set of generators of the group, the Cayley graph is defined as the colored directed graph having vertex set G, edge set , and a color assigned to each generator . Notice that a Cayley graph is regular — i.e., each vertex has the same degree — and vertex-transitive — i.e., all sites are equivalent, in the sense that the graph automorphism group acts transitively upon its vertices. The Cayley graphs of a group G are in one to one correspondence with its presentations, with corresponding to the presentation . We finally remind that a Cayley graph is said to be arc-transitive when its group of automorphisms acts transitively not only on its vertices but also on its directed edges.
Notice that the sole property of vertex transitivity, without the necessary condition that closed paths are the same starting from every vertex [i.e., Eq. (8)], would not be sufficient to identify a group structure. Consider indeed the Petersen graph in Fig. 1, whose vertices are equivalent. It is known that the Petersen graph cannot represent a Cayley graph, and this is due to the failure of the condition on closed paths. One can easily verify that, up to irrelevant permutations, the Petersen graph can be directed and colored in a unique way, that is the one in Fig. 1. Now, the path is closed starting from vertex 1, while it leads from vertex 2 to vertex 3.
We can now easily prove that if a linear cellular automaton has the property that its transition matrices are independent of the system g, i.e., , and they define the Cayley graph of a group, then is homogeneous. Indeed, in this case one can define for the permutation , which clearly gives , with . In this case, one has
which implies the homogeneity condition of Eq. (4).
Locality is the requirement that the cellular automaton can be determined by preparing and measuring a finite number of systems after they evolve for a finite number of steps. Notice that determining a homogeneous cellular automaton amounts to determine the set S of transition matrices along with the set R of closed paths, which characterizes the group G. If S has to be determined by measurements on a finite number of systems, then the set S has to be finite. For a similar reason, the set R must be completely determined by a finite set of closed paths of finite size. This implies that the group G must be finitely presented. In terms of the evolution rule, every local Fermionic system interacts with a finite number of other systems at each step.
The automaton can then be represented by an operator over the Hilbert space
where T is the right-regular representation of G on , .
We remind now that the set S can be split in many ways as , with denoting the identity in G, that appears only in the presence of self-interaction. The requirement of isotropy amounts to the statement that all directions on are equivalent. This requirement is translated in mathematical terms requiring that there exists a decomposition of , and a faithful representation U over of a group L of graph automorphisms that is transitive over , such that one has the covariance condition
By linear independence of the generators Th of the right regular representation of G one has that the above condition 10 implies
Notice that, as a consequence of this assumption, the Cayley graph must be arc-transitive. Notice also that the same automaton on the Cayley graph corresponding to the presentation might in principle satisfy isotropy for one or more choices of the set and group L. For a given S, different choices of correspond to different orientations of some edges over the same colored graph. However, in the special cases that we consider here, the choice of representation satisfying the isotropy requirement turns out to be unique.
A covariant automaton of the form (10) describes the free evolution of a field by a quantum algorithm with finite algorithmic complexity, and with homogeneity and isotropy corresponding to the universality of the law given by the algorithm.
As a consequence of the assumptions, the unitarity condition — imposing that the map is unitary — is given by
in terms of the transition matrices Ah.
3 Emergent spacetime
In the previous Section we have seen how our assumptions lead to a model of evolution on a discrete computational space endowed with the structure of Cayley graph. The usual dynamics on continuous spacetime is expected to emerge as an effective description that holds in the regimes where the discrete scale cannot be probed.
Within this perspective space and time emerge from the structure of the graph with the time variable corresponding to the computational step of the automaton. The automaton represents a physical law, giving rise to a picture of phenomena in a spacetime
M within a given reference frame corresponding to the description of a specific observer. The spacetime
M has a Cartesian product structure
, with
T the one dimensional manifold corresponding to time (clearly diffeomorphic to the real line) and the
X the (generally
n-dimensional) manifold representing space. The spacetime manifold
M here emerges as described in a fixed reference frame. The notion of change of reference frame based on the invariance of the QCA dynamics was studied in Refs. [
32,
33]. The steps of the automaton evolution can be represented as a totally ordered set of points
with the metric
. Similarly on the graph we take the metric
dx induced by the word-counting on the Cayley graph.
The identification of an emerging spatial manifold is generally more involved because in dimension higher than one the isometric embedding of a discrete graph in a continuous manifold is usually impossible. However, the notion of quasi-isometry introduced in geometric group theory helps us identify the relevant geometric properties of the manifold X, binding the geometry to the algebraic properties of X seen as a group. In order to clarify this point, we now review the notion of quasi isometry. Given two metric spaces and , with d1 and d2 the metric of the two spaces, a map is a quasi-isometry if there exist constants , , such that one has
and there exists such that
Quasi-isometry is an equivalence relation, therefore, given a Cayley graph Γ with word metric
, the emerging space is a manifold
quasi-isometric to
, which is unique modulo quasi-isometries (see Fig. 2). The geometric characterization of the class of metric spaces quasi-isometric to the Cayley graph of a group
G is the subject of
geometric group theory [
38]. A crucial result is that the quasi-isometric class is an invariant of the group, i.e., it does not depend on the group presentations (which instead correspond to different Cayley graphs). Remarkably, for finitely generated groups, the quasi-isometry class always contains a smooth Riemaniann manifold [
38].
A paradigmatic result [
39] of geometric group theory is that an infinite group
G is quasi-isometric to the Euclidean space
Rn if and only if
G is
virtually-Abelian, namely it has an Abelian subgroup
isomorphic to
of finite index (with a finite number of cosets).
The setting of QCAs on Cayley graphs can thus lead to a field dynamics on either a flat spacetime or a spacetime with curvature, depending on whether the group G is virtually Abelian or not. In the remainder we will focus on the flat case.
4 QCAs on Abelian groups and the small wave-vector limit
In this Section we restrict to the specific subclass of automata whose group G is quasi-isometrically embeddable in the Euclidean space, which is then virtually-Abelian. We also assume that the representation of the isotropy group L in (10) induced by the embedding is orthogonal, which implies that the graph neighborhood is embedded in a sphere. In words, we want homogeneity and isotropy to hold locally also in the embedding space. Our present analysis focus on the Abelian groups whose Cayley graphs satisfying the isotropic embedding in the Euclidean space are the Bravais lattices. The more general scenario of virtually-Abelian groups is discussed in Section 8.
In the Abelian case (and also in the virtually-Abelian case as we will discuss in Section 8) it is possible to describe the automaton in the wave-vector space. Since the group is Abelian we label the group elements by vectors , and use the additive notation for the group composition, whereas the unitary representation of on is expressed as
Being the group Abelian, we can diagonalise the regular representation by Fourier analysis, and the operator A can be easily block-diagonalized in the wave-vector representation as follows:
where B is a compact region in corresponding to the smallest region containing only inequivalent wave-vectors (usually called Brillouin zone). Notice that the automaton is unitary if and only if unitary for every . The plane waves on G are given by
The spectrum of the operator , or more precisely its dispersion relation (namely the phases as functions of ), plays a crucial role in the analysis of the automaton dynamics. Indeed the speed of the wave-front of a plane wave with wave-vector is given by the phase-velocity , while the speed of propagation of a narrow-band state having wave-vector peaked around the value is given by the group velocity at , namely the gradient of evaluated at .
4.1 The small wave-vector limit
In order be a valid microscopic description of dynamics, the QCA model must recover the usual phenomenology of QFT at the energy scale of the current particle physics experiments, namely the physics of the QCA model and the one of QFT must be the same as far as we restrict to quantum states that cannot probe the discreteness of the underlying lattice. For this reason it is important to address a comparison between the automaton dynamics and the dynamics dictated by the usual QFT differential equations. Here we show how to evaluate the behaviour of an Abelian automaton for small wave-vectors , and then discuss a possible approach to a rigorous comparison at different frequency scales.
The physical interpretation of the limit clearly depends on the hypotheses that we make on the order of magnitude of the QCA lattice step and time step. As we will see in Sect.6 an heuristic argument leads us to set the scale of discreteness of the QCA at the Planck scale, thus the domain corresponds wavevectors much smaller than the Planck vector (consider that an ultra-high-energy cosmic ray has ). Such regime corresponds to the usual one of particle physics, and is called relativistic regime.
In order to obtain the relativistic limit of an automaton we define its interpolating Hamiltonian as the operator satisfying the following equality
(The term “interpolating” refers to the fact that the Hamiltonian would generate a unitary evolution in continuous time that interpolates the discrete time evolution of the automaton).
Now, one can expand the Hamiltonian to first order in
corresponding to describing the evolution with the following first-order differential equation
for narrow-band states peaked around some with .
The Hamiltonian in Eq. (18) describes the QCA dynamics in the limit of small wave-vectors, and in the next Sections we present QCAs having the Weyl, Dirac and Maxwell Hamiltonian in as such a limit.
In Ref. [
2] another more quantitative approach to the QFT limit of a QCA has been presented. Suppose that some automaton
, (with interpolating Hamiltonian
) has the unitary
(see Eq. (17)) as first-order approximation in
. Then one can set the comparison as a channel discrimination problem and quantify the difference between the two unitary evolutions with the probability of error
pe in the discrimination. This probability can be computed as a function of the discrimination experiment parameters — for example the wave-vector and the number of particles and the duration of the evolution — and one can check that for values achievable in current experiments the automaton evolution is undistinguishable from the QFT one. This approach allows us to provide a rigorous proof that, in the limit of input states with vanishing wave-vector, the QCA model recovers free QFT.
5 The Weyl automaton
Here we present the unique QCAs on Cayley graphs of
,
, that satisfy all the requirements of Section 2 and with minimal internal dimension
s for a non-identical evolution (see Ref. [
1] for the detailed derivation).
In any space dimension the only solution for is the identical QCA, namely there exists no nontrivial QCA. The minimal internal dimension for a non-trivial evolution is then .
Let us start from the case of dimension that is the most relevant from the physical perspective. For the group the only inequivalent isotropic Cayley graphs are the primitive cubic (PC) lattice, the body centered cubic (BCC), and the rhombohedral. However only in the BCC case, whose presentation of involves four vectors with relator , one finds solutions satisfying all the assumptions of Section 2. There are only four solutions, modulo unitary conjugation, that can be divided in two pairs and . A pair of solutions is connected to the other pair by transposition in the canonical basis, i.e., . The first Brillouin zone B for the BCC lattice is defined in Cartesian coordinates as , and the solutions in the wave-vector representation are
where and .
The matrices and have spectrum with dispersion relation and evolution governed by i) the wave-vector ; ii) the helicity direction ; and iii) the group velocity , which represents the speed of a wave-packet peaked around the central wave-vector .
The above solutions satisfy the isotropy constraint and are then covariant with respect to the group of binary rotations around the coordinate axes, with the representation of the group on given by . The group is transitive on the four BCC generators of .
In dimension , the only inequivalent isotropic Cayley graphs of are the square lattice and the hexagonal lattice. Also for we have solutions only on one of the possible Cayley graphs, the square lattice, whose presentation of involves two vectors . The first Brillouin zone B in this case is given by , and there are only two solutions modulo unitary conjugation,
with dispersion relation .
The QCA in Eq. (5) is covariant for the cyclic transitive group generated by the transformation that exchanges and , with representation given by the rotation by π around the x-axis. Since the isotropy group has a reducible representation, the most general automaton is actually given by .
Finally for the unique Cayley graph satisfying our requirements for is the lattice itself, presented as the free Abelian group on one generator . From the unitarity conditions one gets the unique solution
with dispersion relation .
We call the solutions (19), (20) and (21) Weyl automata, because in the limit of small wave-vectors of Section 4.1 their evolution obeys Weyl’s equation in space dimension , and , respectively. All the previous solution in Eqs. (19), (20), and (21) for dimension can be rewritten in the form
for certain uk and , with dispersion relation
It is easily to check that the interpolating Hamiltonian is
and by power expanding at the first order in one has
where coincides with the usual Weyl Hamiltonian in d dimensions once the wave-vector is interpreted as the momentum.
6 The Dirac automaton
From the previous section we know that in our framework all the admissible QCAs with
gives the Weyl equation in the limit of small wave-vectors. In order to get a more general dynamics — say the Dirac one — it is then necessary to increase the internal degree of freedom
s. Instead of deriving the most general QCAs with
, in Ref. [
1] it is shown how the Dirac equation for any space dimension
can be derived from the local coupling of two Weyl automata. Here we shortly review this result.
Starting from two arbitrary Weyl automata W and in dimension d (see the solutions (5), (5) and (5) in for , respectively), the coupling is obtained by performing the direct-sum of their representatives and , obtaining a QCA with , and introducing off-diagonal blocks X and Y in such a way that the obtained matrix is unitary. The locality of the coupling implies that the off-diagonal blocks are independent of , namely
In order to satisfy all the hypothesis of Section 2 it is possible to show that the unique local coupling of Weyl QCAs, modulo unitary conjugation, are
which are conveniently expressed in terms of gamma matrices in the spinorial representation as follows
where the functions and depend on the value of d for the Weyl automaton in Eq. (27). Notice the dispersion relation of the QCAs (28) that is simply given by
The QCAs in Eq. (27) in the small wave-vector limit and for all give the usual Dirac equation in the respective dimension d, with m corresponding to the particle mass. Indeed, the interpolating Hamiltonian is given by
that by power expanding at the first order in is approximated as follows:
Finally, for small values of m, , we have and neglecting terms of order and
one has the Dirac Hamiltonian with the wave-vector
and the parameter
m interpreted as momentum and mass, respectively. For
, modulo a permutation of the canonical basis, the QCA corresponds to two identical and decoupled
automata. Each of these QCAs coincide with the one dimensional Dirac automaton derived in Ref. [
2]. The last one was derived as the simplest (
) homogeneous QCA covariant with respect to the parity and the time-reversal transformation, which are less restrictive than isotropy that singles out the only Weyl QCA (5) in one space dimension.
We want to emphasize that in the above derivation everything is adimensional by construction. Dimensions can be recovered by providing values τ and a in seconds and meters, respectively, to the discreteness scales in time and space of the QCA, and providing the maximum value of the mass M in kilograms corresponding to in Eq. (27). From the relativistic limit, the comparison with the usual dimensional Dirac equation leads to the identities , , which leave only one unknown among the three variables and M. At the maximum value of the mass in Eq. (27) we get a non evolving automaton, with a flat dispersion relation, which can be interpreted as a mini black-hole, where the Schwarzild radius equals the localization length, i.e., the Compton wavelength, corresponding to a mass equal to the Planck mass. We thus heuristically interpret M as the Planck mass, and from the two identities , we get the Planck scale.
7 QCA for free electrodynamics
In Sections 5 and 6 we showed how the dynamics of free Fermionic fields can be derived within the QCA framework starting from informational principles. Within this perspective the information contained in a finite number of systems must be finite and this is the reason why we consider Fermionic QCAs. One might then wonder how the physics of the free electromagnetic field can be recovered in this framework, and more generally any Bosonic quantum field obeying the canonical commutation relations. In the present section we review the results of Ref. [
4], where the above question was answered in detail.
The basic idea behind this approach is to model the photon as an entangled pair of Fermions evolving according to the Weyl QCA presented in Section 5. Then we show that in a suitable regime both the free Maxwell equation in three dimensions and the Bosonic commutation relations are recovered. For this purpose, we consider two Fermionic fields, which in the wave-vector representation are denoted as and . The evolutions of these two fields are given by
Where the matrix can be any of the Weyl QCAs in three space dimensions of Eq. (5), (the whole derivation is independent on this choice) and denotes the complex conjugate matrix.
We now introduce the following bilinear operators
with as in Eq. (23). By construction the field satisfies the following relations
where we used the identity , the matrix acting on regarded as a vector, and representing the infinitesimal generators of in the spin 1 representation. Taking the time derivative of Eq. (36) we obtain
If and are two Hermitian operators defined by the relation
then Eq. (35) and Eq. (37) can be rewritten as
that are the free Maxwell’s equation in the wave-vector space with the substitution . In the limit one has and the usual free electrodynamics is recovered.
However the field defined in Eqs. (34) and (38) does not satisfy the correct Bosonic commutation relations. As shown in Ref. [
4] the solution to this problem is to replace the operators
Gi defined in Eq. (34) with the operators
Fi defined as
where . In terms of , we can define the polarization operators of the electromagnetic field as follows
In order to avoid the technicalities of the continuum we suppose to have a discrete wave-vector space (as if the electromagnetic field were confined in a finite volume) and moreover let us assume to be a constant function over a region which contains modes, i.e., if and if . Then, for a given state of the field we denote by (resp. ) the mean number of type (resp ) Fermionic excitations in the region . One can then show that, for states such that for all and and for we can safely assume , i.e., the polarization operators are Bosonic operators.
8 Future perspectives: Interacting QCAs and gravity
In the previous sections we showed how the dynamics of free relativistic quantum fields emerges from the evolution of states of Fermionic QCAs, provided that they satisfy the requirements of unitarity, linearity, homogeneity and isotropy. However, in order to recover relativistic quantum field theory we need to find also interacting evolutions, where Fermions and Bosons can scatter, with Bosonic fields carrying the fundamental interactions. For this purpose, one needs to overcome the linearity assumption, allowing Fermionic excitations to exchange momentum. There is a very good reason to introduce a non-linear evolution, which is precisely due to the discrete nature of the QCA evolution. Indeed, while in a context where time is continuous it makes sense to require that the canonical basis in the Hilbert space representing a local system [
40] changes continuously in time, when the evolution occurs in discrete steps, as in a QCA, there is no natural way to compare the local reference system at subsequent times, and it is thus necessary to allow for an uncontrollable misalignment of the local reference frame. One can then introduce a completely local non-linear evolution at each step, following the linear one, preserving homogeneity, isotropy and unitarity. This misalignment provides a natural notion of a quantum gauge symmetry, with free evolution of the gauge field dictated by the structure of the local unitary QCA. In this way, one does not need to artificially quantize the gauge fields, nor introduce the free Bosonic Hamiltonian or Lagrangian. This generalization is expected to provide an effective description corresponding to different fundamental interactions, possibly including a fully quantum spontaneous symmetry breaking mechanism providing mass to the massless Fermions. In this case, we would have a dynamical mechanism instead of the construction that we showed in Section 6, which would then be an effective representation. The study of this mechanism along with its symmetries is also expected to provide a reasonable attempt at the formulation of a quantum theory of gravity, as it relates the symmetries of the mechanism lying at the core of mass with the symmetries of the emergent space-time, suggesting a relation between geometry and interactions of quantum fields.
Higher Education Press and Springer-Verlag Berlin Heidelberg 2017