arXiv subjects

Renato Portugal

Publications and source records attributed to Renato Portugal.

63 records · Page 4Linked to original sources

arXiv2008

The Invar tensor package: Differential invariants of Riemann

The long standing problem of the relations among the scalar invariants of the Riemann tensor is computationally solved for all 6x10^23 objects with up to 12 derivatives of the metric. This covers cases ranging from products of up to 6 undifferentiated Riemann tensors to cases with up to 10 covariant derivatives of a single Riemann. We extend our computer algebra system Invar to produce within seconds a canonical form for any of those objects in terms of a basis. The process is as follows: (1) an invariant is converted in real time into a canonical form with respect to the permutation symmetries of the Riemann tensor; (2) Invar reads a database of more than 6x10^5 relations and applies those coming from the cyclic symmetry of the Riemann tensor; (3) then applies the relations coming from the Bianchi identity, (4) the relations coming from commutations of covariant derivatives, (5) the dimensionally-dependent identities for dimension 4, and finally (6) simplifies invariants that can be expressed as product of dual invariants. Invar runs on top of the tensor computer algebra systems xTensor (for Mathematica) and Canon (for Maple).

cs.SC↗

arXiv2007

Simulation of the Single- and Double-Slit Experiments with Quantum Walkers

We employ the broken-link model to create a barrier with slits in a two-dimensional lattice. The diffraction and interference patterns of the probability distribution of quantum walkers passing through the slits are analyzed. Simulations were performed using the main types of coins, and display diffraction and interference patterns that depend on the choice of coins.

quant-ph↗

arXiv2007

Quantum algorithm for the hidden subgroup problem on a class of semidirect product groups

We present efficient quantum algorithms for the hidden subgroup problem (HSP) on the semidirect product of cyclic groups $\Z_{p^r}\rtimes_ϕ\Z_{p^2}$, where $p$ is any odd prime number and $r$ is any integer such that $r>4$. We also address the HSP in the group $\Z_{N}\rtimes_ϕ\Z_{p^2}$, where $N$ is an integer with a special prime factorization. These quantum algorithms are exponentially faster than any classical algorithm for the same purpose.

quant-ph↗

arXiv2007

The Invar Tensor Package

The Invar package is introduced, a fast manipulator of generic scalar polynomial expressions formed from the Riemann tensor of a four-dimensional metric-compatible connection. The package can maximally simplify any polynomial containing tensor products of up to seven Riemann tensors within seconds. It has been implemented both in Mathematica and Maple algebraic systems.

cs.SC↗

arXiv2006

Quantum Games in Open Systems using Biophysic Hamiltonians

We analyze the necessary physical conditions to model an open quantum system as a quantum game. By applying the formalism of Quantum Operations on a particular system, we use Kraus operators as quantum strategies. The physical interpretation is a conflict among different configurations of the environment. The resolution of the conflict displays regimes of minimum loss of information.

quant-ph↗

arXiv2005

Information Processing in Brain Microtubules

Models of the mind are based on the possibility of computing in brain microtubules. From this point of view, information processing is the fundamental issue for understanding the brain mechanisms that produce consciousness. The cytoskeleton polymers could store and process information through their dynamic coupling mediated by mechanical energy. We analyze the problem of information transfer and storage in brain microtubules, considering them as a communication channel. We discuss the implications of assuming that consciousness is generated by the subneuronal process.

q-bio.SC↗

arXiv2004

Genetic Algorithms and Quantum Computation

Recently, researchers have applied genetic algorithms (GAs) to address some problems in quantum computation. Also, there has been some works in the designing of genetic algorithms based on quantum theoretical concepts and techniques. The so called Quantum Evolutionary Programming has two major sub-areas: Quantum Inspired Genetic Algorithms (QIGAs) and Quantum Genetic Algorithms (QGAs). The former adopts qubit chromosomes as representations and employs quantum gates for the search of the best solution. The later tries to solve a key question in this field: what GAs will look like as an implementation on quantum hardware? As we shall see, there is not a complete answer for this question. An important point for QGAs is to build a quantum algorithm that takes advantage of both the GA and quantum computing parallelism as well as true randomness provided by quantum computers. In the first part of this paper we present a survey of the main works in GAs plus quantum computing including also our works in this area. Henceforth, we review some basic concepts in quantum computation and GAs and emphasize their inherent parallelism. Next, we review the application of GAs for learning quantum operators and circuit design. Then, quantum evolutionary programming is considered. Finally, we present our current research in this field and some perspectives.

cs.NE↗

arXiv2001

The d=6 trace anomaly from quantum field theory four-loop graphs in one dimension

We calculate the integrated trace anomaly for a real spin-0 scalar field in six dimensions in a torsionless curved space without a boundary. We use a path integral approach for a corresponding supersymmetric quantum mechanical model. Weyl ordering the corresponding Hamiltonian in phase space, an extra two-loop counterterm ${1/8}\bigg(R + g^{ij} Γ^{l}_{k i} Γ^{k}_{l j} \bigg)$ is produced in the action. Applying a recursive method we evaluate the components of the metric tensor in Riemann normal coordinates in six dimensions and construct the interaction Langrangian density by employing the background field method. The calculation of the anomaly is based on the end-point scalar propagator and not on the string inspired center-of-mass propagator which gives incorrect results for the local trace anomaly. The manipulation of the Feynman diagrams is partly relied on the factorization of four dimensional subdiagrams and partly on a brute force computer algebra program developed to serve this specific purpose. The computer program enables one to perform index contractions of twelve quantum fields (10395 in the present case) a task which cannot be accomplished otherwise. We observe that the contribution of the disconnected diagrams is no longer proportional to the two dimensional trace anomaly (which vanishes in four dimensions). The integrated trace anomaly is finally expressed in terms of the 17 linearly independent scalar monomials constructed out of covariant derivatives and Riemann tensors.

hep-th↗

arXiv1998

An Algorithm to Simplify Tensor Expressions

The problem of simplifying tensor expressions is addressed in two parts. The first part presents an algorithm designed to put tensor expressions into a canonical form, taking into account the symmetries with respect to index permutations and the renaming of dummy indices. The tensor indices are split into classes and a natural place for them is defined. The canonical form is the closest configuration to the natural configuration. In the second part, the Groebner basis method is used to simplify tensor expressions which obey the linear identities that come from cyclic symmetries (or more general tensor identities, including non-linear identities). The algorithm is suitable for implementation in general purpose computer algebra systems. Some timings of an experimental implementation over the Riemann package are shown.

gr-qc↗