arXiv subjects
Publications and source records attributed to R. Portugal.
We review Grover's algorithm by means of a detailed geometrical interpretation and a worked out example. Some basic concepts of Quantum Mechanics and quantum circuits are also reviewed. This work is intended for non-specialists which have basic knowledge on undergraduate Linear Algebra.
We describe how Computational Group Theory provides tools for manipulating tensors in explicit index notation. In special, we present an algorithm that puts tensors with free indices obeying permutation symmetries into the canonical form. The method is based on algorithms for determining the canonical coset representative of a subgroup of the symmetric group. The complexity of our algorithm is polynomial on the number of indices and is useful for implementating general purpose tensor packages on the computer algebra systems.
Computational Group Theory is applied to indexed objects (tensors, spinors, and so on) with dummy indices. There are two groups to consider: one describes the intrinsic symmetries of the object and the other describes the interchange of names of dummy indices. The problem of finding canonical forms for indexed objects with dummy indices reduces to finding double coset canonical representatives. Well known computational group algorithms are applied to index manipulation, which allow to address the simplification of expressions with hundreds of indices going further to what is needed in practical applications.
We have done a study of the zero-dimensional $λϕ^{4}$ model. Firstly, we exhibit the partition function as a simple exact expression in terms of the Macdonald's function for $Re(λ)>0$. Secondly, an analytic continuation of the partition function for $Re(λ)<0$ is performed, and we obtain an expression defined in the complex coupling constant plane $λ$, for $|arg λ|<π$. Consequently, the partition function understood as an analytic continuation is defined for all values of $λ$, except for a branch cut along the real negative $λ$ axis. We also evaluate the partition function on perturbative grounds, using the Borel summation technique and we found that in the common domain of validity for $Re(λ)>0$, it coincides precisely with the exact expression.