Related papers: Renormalization and Computation II: Time Cut-off a…
Learning and planning in partially-observable domains is one of the most difficult problems in reinforcement learning. Traditional methods consider these two problems as independent, resulting in a classical two-stage paradigm: first learn…
Stable computational algorithms for the approximate solution of the Cauchy problem for nonstationary problems are based on implicit time approximations. Computational costs for boundary value problems for systems of coupled multidimensional…
Adaptive perturbation is a new method for perturbatively computing the eigenvalues and eigenstates of quantum mechanical Hamiltonians that heretofore were not believed to be obtainable by such methods. The novel feature of adaptive…
One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little further philosophical importance. In this essay, I offer a detailed case that one would be wrong. In…
This article studies the problem of modifying the action ordering of a plan in order to optimise the plan according to various criteria. One of these criteria is to make a plan less constrained and the other is to minimize its parallel…
In this paper, we study the phenomenon of Hopf or more specifically quantum double symmetry breaking. We devise a criterion for this type of symmetry breaking which is more general than the one existing in the literature, and therefore…
The usual mathematical formalism of quantum field theory is non-rigorous because it contains divergences that can only be renormalized by non-rigorous mathematical methods. The purpose of this paper is to present a method of subtraction of…
Entanglement renormalization can be viewed as an encoding circuit for a family of approximate quantum error correcting codes. The logical information becomes progressively more well-protected against erasure errors at larger length scales.…
As an inverse problem, we recover the topology of the effective spacetime that a system lies in, in an operational way. This means that from a series of experiments we get a set of points corresponding to events. This continues the previous…
We construct multiplicative renormalization for the Epstein--Glaser renormalization scheme in perturbative Algebraic Quantum Field Theory: To this end, we fully combine the Connes--Kreimer renormalization framework with the Epstein--Glaser…
We review here the recent success in quantum annealing, i.e., optimization of the cost or energy functions of complex systems utilizing quantum fluctuations. The concept is introduced in successive steps through the studies of mapping of…
We study the perturbative renormalization of quantum gauge theories in the Hopf algebra setup of Connes and Kreimer. It was shown by van Suijlekom (2007) that the quantum counterparts of gauge symmetries -- the so-called Ward--Takahashi and…
The main difficulty of quantum field theory is the problem of divergences and renormalization. However, realistic models of quantum field theory are renormalized within the perturbative framework only. It is important to investigate…
The problem of renormalization of the semiclassical one-loop equations used in the non-equilibrium field theory is considered. Recently, the renormalizability of such equations has been justified for some special cases of classical field…
People solve different problems and know that some of them are simple, some are complex and some insoluble. The main goal of this work is to develop a mathematical theory of algorithmic complexity for problems. This theory is aimed at…
An error in the gauge fixed quantization of section 3 is corrected. The result is a much simpler treatment of the clock field, leading to a simplification of the gauge fixed quantum theory and the treatment of the semiclassical limit.
We consider the question of removing the ultraviolet cutoff in a 2D Quantum Field Theory with an interaction term which is non-renormalizable by power counting. This model arises as the first non-trivial correction beyond the Gaussian…
This paper talk about the complexity of computation by Turing Machine. I take attention to the relation of symmetry and order structure of the data, and I think about the limitation of computation time. First, I make general problem named…
We consider the initial value problem and its renormalisation in the framework of the two-particle-irreducible (2PI) effective action. We argue that in the case of appropriately chosen self-consistent initial conditions, the counterterms…
The procedures to overcome nonrenormalizability of \phi^4_n, n\ge5, quantum field theory models that were presented in a recent paper are extended to address nonrenormalizability of \phi^p_3, p=8,10,12,..., models. The principles involved…