Can we reduce Quantum Field Theory (QFT) to a quantum computation? Can physics be simulated by a quantum computer? Do we believe that a quantum field is ultimately made of a numerable set of quantum systems that are unitarily interacting? A positive answer to these questions corresponds to substituting QFT with a theory of quantum cellular automata (QCA), and the present work is examining this hypothesis. These investigations are part of a large research program on a "quantum-digitalization" of physics, with Quantum Theory as a special theory of information, and Physics as emergent from the same quantum-information processing. A QCA-based QFT has tremendous potential advantages compared to QFT, being quantum "ab-initio" and free from the problems plaguing QFT due to the continuum hypothesis. Here I will show how dynamics emerges from the quantum processing, how the QCA can reproduce the Dirac-field phenomenology at large scales, and the kind of departures from QFT that that should be expected at a Planck-scale discreteness. I will introduce the notions of linear field quantum automaton and local-matrix quantum automaton, in terms of which I will provide the solution to the Feynman's problem about the possibility of simulating a Fermi field with a quantum computer.
Can we reduce Quantum Field Theory (QFT) to a quantum computation? Can physics be simulated by a quantum computer? Do we believe that a quantum field is ultimately made of a numerable set of quantum systems that are unitarily interacting? A positive answer to these questions corresponds to substituting QFT with a theory of quantum cellular automata (QCA), and the present work is examining this hypothesis. These investigations are part of a large research program on a "quantum-digitalization" of physics, with Quantum Theory as a special theory of information, and Physics as emergent from the same quantum-information processing. A QCA-based QFT has tremendous potential advantages compared to QFT, being quantum "ab-initio" and free from the problems plaguing QFT due to the continuum hypothesis. Here I will show how dynamics emerges from the quantum processing, how the QCA can reproduce the Dirac-field phenomenology at large scales, and the kind of departures from QFT that that should be expected at a Planck-scale discreteness. I will introduce the notions of linear field quantum automaton and local-matrix quantum automaton, in terms of which I will provide the solution to the Feynman's problem about the possibility of simulating a Fermi field with a quantum computer.
Can we reduce Quantum Field Theory (QFT) to a quantum computation? Can physics be simulated by a quantum computer? Do we believe that a quantum field is ultimately made of a numerable set of quantum systems that are unitarily interacting? A positive answer to these questions corresponds to substituting QFT with a theory of quantum cellular automata (QCA), and the present work is examining this hypothesis. These investigations are part of a large research program on a quantum-digitalization of physics, with Quantum Theory as a special theory of information, and Physics as emergent from the same quantum-information processing. A QCA-based QFT has tremendous potential advantages compared to QFT, being quantum ab-initio and free from the problems plaguing QFT due to the continuum hypothesis. Here I will show how dynamics emerges from the quantum processing, how the QCA can reproduce the Dirac-field phenomenology at large scales, and the kind of departures from QFT that that should be expected at a Planckscale discreteness. I will introduce the notions of linear field quantum automaton and local-matrix quantum automaton, in terms of which I will provide the solution to the Feynman's problem about the possibility of simulating a Fermi field with a quantum computer.
This thesis is split into two parts, which are united in the sense that they involve applying ideas from quantum information to fundamental physics. The first part is focused on examining discrete-time models in quantum computation (discrete-time quantum walks and quantum cellular automata) as discretized models of relativistic systems. One of the results here is a theorem demonstrating that a large class of discrete-time quantum walks have relativistic dynamics in the continuum limit. Additionally, the problem of fermion doubling for these models is investigated, and it is seen that the problem can be circumvented in two dimensional space. This was already known for one dimensional systems. Another result involves taking the limits of causal free field theories in discrete spacetime to recover continuum field theories, something that is not straightforward because of the nontrivial nature of the vacuum in quantum field theory. Additionally, it is shown that general systems of fermions evolving causally in discrete spacetime can be represented by quantum cellular automata, which makes them efficiently simulable by quantum computers. A related result is that quantum cellular automata composed of fermions are equivalent to regular quantum cellular automata. In the second part of this thesis, the focus is on the foundations of statistical physics. The main result of this part is a general bound on the time it takes a quantum system to effectively reach equilibrium. The discussion also includes a practical definition of equilibration that takes our measurement capabilities into account. Finally, the nature of the equilibrium state is also discussed, with a focus on initial state independence, which relates to the important question of when the equilibrium state is a Gibbs state.
Can Reality be simulated by a huge Quantum Computer? Do we believe that Reality is made of something more than interacting quantum systems? The idea that the whole Physics is ultimately a quantum computation—a strong quantum version of the Church-Turing hypothesis well synthesized by the Wheeler’s coinage It from bit—is very appealing. It is theoretically very parsimonious: an Occam razor’s quality-guaranteed description of the world. But, if this is the case, then we need to understand the entire Physics as emergent from the quantum computation. Here I will make a short exploration on how this may come about. Ask a physicist what does he thinks the world is made of. Very likely the first impetuous answer will be: it is made of particles! But, at a second thought the answer will be: it is a Quantum Field. Particles are just states or the Field: they can be created and annihilated. We have indeed a beautiful Grand Unified Field Theory, and we are looking forward to see the Higg’s boson at the LHC. But what is the Quantum Field made of? Ultimately, it is made of quantum systems that are interacting, each system located at a different position in space. Things may be indeed more complicated than that, because the field is a continuum. But is Reality actually continuous? We don ’ t know: but it looks easier to think to Reality as a continuum. Now, suppose that this is not the case, namely Reality is ultimately discrete, and the continuum is only a mathematical fiction. Then, what else is out there more than interacting quantum
To date, all proposed quantum algorithms for simulating quantum field theory (QFT) simulate (continuous-time) Hamiltonian lattice QFT as a stepping stone. Two overlooked issues are how large we can take the timestep in these simulations while getting the right physics and whether we can go beyond the standard recipe that relies on Hamiltonian lattice QFT. The first issue is crucial in practice for, e.g., trapped-ion experiments which actually have a lower bound on the possible ratio of timestep to lattice spacing. To this end, we show that a timestep equal to or going to zero faster than the spatial lattice spacing is necessary for quantum simulations of QFT, but far more importantly a timestep equal to the lattice spacing is actually sufficient. To do this, first for ϕ4 theory, we give a quantum circuit exactly equivalent to the real-time path integral from the discrete-time Lagrangian formulation of lattice QFT. Next we give another circuit with no lattice QFT analogue, but, by using Feynman rules applied to the circuit, we see that it also reproduces the correct continuum behaviour. Finally, we look at non-abelian gauge fields, showing that the discrete-time lattice QFT path-integral is exactly equivalent to a finite-depth local circuit. All of these circuits have an analogue of a lightcone on the lattice and therefore are examples of quantum cellular automata. Aside from the potential practical benefit of these circuits, this all suggests that the path-integral approach to lattice QFT need not be overlooked in quantum simulations of physics and has a simple quantum information interpretation.