Related papers: Renormalization and Computation II: Time Cut-off a…
In this article, I give a pedagogical introduction and overview of percolation theory. Special emphasis will be put on the review of some of the most prominent of the algorithms that have been devised to study percolation numerically. At…
A perturbative approach to quantum field theory involves the computation of loop integrals, as soon as one goes beyond the leading term in the perturbative expansion. First I review standard techniques for the computation of loop integrals.…
In this paper we describe the right-sided combinatorial Hopf structure of three Hopf algebras appearing in the context of renormalization in quantum field theory: the non-commutative version of the Fa\`a di Bruno Hopf algebra, the…
We develop a new algorithm for the quantisation of systems with first-class constraints. Our approach lies within the (History Projection Operator) continuous-time histories quantisation programme. In particular, the Hamiltonian treatment…
I explain the methods that are used in field theory for problems involving typical momenta on two or more widely disparate scales. The principal topics are: (a) renormalization, which treats the problem of taking an ultra-violet cut-off to…
The authors present evidence for universality in numerical computations with random data. Given a (possibly stochastic) numerical algorithm with random input data, the time (or number of iterations) to convergence (within a given tolerance)…
We present two new quantum algorithms. Our first algorithm is a generalization of amplitude amplification to the case when parts of the quantum algorithm that is being amplified stop at different times. Our second algorithm uses the first…
In the first purpose, we concentrate on the theory of quantum integrable systems underlying the Connes-Kreimer approach. We introduce a new family of Hamiltonian systems depended on the perturbative renormalization process in renormalizable…
The renormalization of entanglement entropy of quantum field theories is investigated in the simplest setting with a $\lambda \phi^4$ scalar field theory. The 3+1 dimensional spacetime is separated into two regions by an infinitely flat…
We argue that the halting problem for quantum computers which was first raised by Myers, is by no means solved, as has been claimed recently. We explicitly demonstrate the difficulties that arise in a quantum computer when different…
Classical models of computation traditionally resort to halting schemes in order to enquire about the state of a computation. In such schemes, a computational process is responsible for signalling an end of a calculation by setting a halt…
We explore in the framework of Quantum Computation the notion of {\em Computability}, which holds a central position in Mathematics and Theoretical Computer Science. A quantum algorithm for Hilbert's tenth problem, which is equivalent to…
In this talk, we are concerned with the formulation and understanding of the combinatorics of time-ordered n-point functions in terms of the Hopf algebra of field operators. Mathematically, this problem can be formulated as one in…
We present two-loop renormalization of $\phi^3$-model effective action by using the background field method and cutoff momentum regularization. In this paper, we also study a derivation of the quantum equation of motion and its application…
We study the Factorization Paradox from the bottom up by adapting methods from perturbative renormalization. Just as quantum field theories are plagued with loop divergences that need to be cancelled systematically by introducing…
In this expository article we review recent advances in our understanding of the combinatorial and algebraic structure of perturbation theory in terms of Feynman graphs, and Dyson-Schwinger equations. Starting from Lie and Hopf algebras of…
These are the notes of five lectures given at the Summer School {\em Geometric and Topological Methods for Quantum Field Theory}, held in Villa de Leyva (Colombia), July 2--20, 2007. The lectures are meant for graduate or almost graduate…
In 1999, A. Connes and D. Kreimer have discovered the Hopf algebra structure on the Feynman graphs of scalar field theory. They have found that the renormalization can be interpreted as a solving of some Riemann -- Hilbert problem. In this…
This work is concerned with phrasing the concepts of fault-tolerant quantum computation within the framework of disordered systems, Bernoulli site percolation in particular. We show how the so-called "threshold theorems" on the possibility…
In this paper we are going to find a rooted tree representation from universal Hopf algebra of renormalization (in Connes-Marcolli's approach in the study of renormalizable Quantum Field Theories under the scheme minimal subtraction in…