Examinando por Autor "Velez, Mario"

Mostrando 1 - 8 de 8
  • No hay miniatura disponible
    Ítem
    Analytical solution for transient flow of a generalized bingham fluid with memory in a movable tube using computer algebra
    (SPRINGER, 2007-01-01) Ospina, Juan; Velez, Mario; Ospina, Juan; Velez, Mario; Universidad EAFIT. Departamento de Ciencias; Lógica y Computación
    A rheological linear model for a certain generalized Bingham fluid with rheological memory, which flows in a movable tube is proposed and analytically solved. The model is a system of two linear and coupled partial differential equations with integral memory. We apply the Laplace transform method making the inverse transform by means of the Bromwich integral and the theorem of residues and the analytical solution are obtained using computer algebra. We deduce the explicit forms of the velocity and stress profiles for the generalized Bingham fluid in terms of Bessel and Struve functions. Various limit cases are obtained and the standard Hagen-Poiseuille and Buckingham-Reiner equations are recovered from more general equations. This works shows the powerful of Maple to solve complex rheological problems in an analytical form as it is presented here by the first time. © Springer-Verlag Berlin Heidelberg 2007.
  • No hay miniatura disponible
    Ítem
    Gravitational topological quantum computation
    (SPRINGER, 2007-01-01) Velez, Mario; Ospina, Juan; Velez, Mario; Ospina, Juan; Universidad EAFIT. Departamento de Ciencias; Lógica y Computación
    A new model in topological quantum computing, named Gravitational Topological Quantum Computing (GTQC), is introduced as an alternative respect to the Anyonic Topological Quantum Computing and DNA Computing. In the new model the quantum computer is the quantum space-time itself and the corresponding quantum algorithms refer to the computation of topological invariants for knots, links and tangles. Some applications of GTQC in quantum complexity theory and computability theory are discussed, particularly it is conjectured that the Khovanov polynomial for knots and links is more hard than #P-hard; and that the homeomorphism problem, which is noncomputable, maybe can be computed after all via a hyper-computer based on GTQC. © Springer-Verlag Berlin Heidelberg 2007.
  • No hay miniatura disponible
    Ítem
    Possible universal quantum algorithms for generalized Khovanov homology and the Rasmussen's invariant
    (SPIE-INT SOC OPTICAL ENGINEERING, 2012-01-01) Velez, Mario; Ospina, Juan; Velez, Mario; Ospina, Juan; Universidad EAFIT. Departamento de Ciencias; Lógica y Computación
    Possible quantum algorithms for generalized Khovanov homology and the Rasmussen's invariant are proposed. Such algorithms are resulting from adaptations of the recently proposed Kauffmans` algorithm for the standard Khovanov homology. The method that was applied consists in to write the relevant quantum invariant as the trace of a certain unitary operator and then to compute the trace using the Hadamard test. We apply such method to the quantum computation of the Jones polynomial, HOMFLY polynomial, Chromatic polynomial, Tutte polynomial and Bollobàs-Riordan polynomial. These polynomials are quantum topological invariants for knots, links, graphs and ribbon graphs respectively. The Jones polynomial is categorified by the standard Khovanov homology and the others polynomials are categorified by generalized Khovanov homologies, such as the Khovanov-Rozansky homology and the graph homologies. The algorithm for the Rasmussen's invariant is obtained using the gauge theory; and the recently introduced program of homotopyfication is linked with the super-symmetric quantum mechanics. It is claimed that a new program of analytification could be development from the homotopyfication using the celebrated Atiyah-Singer theorem and its super-symmetric interpretations. It is hoped that the super-symmetric quantum mechanics provides the hardware for the implementation of the proposed quantum algorithms. © 2012 SPIE.
  • No hay miniatura disponible
    Ítem
    Possible universal quantum algorithms for generalized Turaev-Viro invariants
    (SPIE-INT SOC OPTICAL ENGINEERING, 2011-01-01) Velez, Mario; Ospina, Juan; Velez, Mario; Ospina, Juan; Universidad EAFIT. Departamento de Ciencias; Lógica y Computación
    An emergent trend in quantum computation is the topological quantum computation (TQC). Briefly, TQC results from the application of quantum computation with the aim to solve the problems of quantum topology such as topological invariants for knots and links (Jones polynomials, HOMFLY polynomials, Khovanov polynomials); topological invariants for graphs (Tutte polynomial and Bollobás-Riordan polynomial); topological invariants for 3-manifolds (Reshetiskin-Turaev, Turaev-Viro and Turaer-Viro-Ocneanu invariants) and topological invariants for 4-manifolds (Crane-Yetter invariants). In a few words, TQC is concerned with the formulation of quantum algorithms for the computation of these topological invariants in quantum topology. Given that one of the fundamental achievements of quantum topology was the discovery of strong connections between monoidal categories and 3-dimensional manifolds, in TQC is possible and necessary to exploit such connections with the purpose to formulate universal quantum algorithms for topological invariants of 3-manifolds. In the present work we make an exploration of such possibilities. Specifically we search for universal quantum algorithms for generalized Turaev-Viro invariants of 3-manifolds such as the Turaev-Viro-Ocneanu invariants, the Kashaev-Baseilhac-Benedetti invariants of 3-manifolds with links and the Geer-Kashaev-Turaev invariants of 3-manifolds with a link and a principal bundle. We also look for physical systems (three dimensional topological insulators and three-dimensional gravity) over which implement the resulting universal topological quantum algorithms.
  • No hay miniatura disponible
    Ítem
    Quantum algorithms for virtual Jones polynomials via thistlethwaite theorems
    (SPIE-INT SOC OPTICAL ENGINEERING, 2010-01-01) Velez, Mario; Ospina, Juan; Velez, Mario; Ospina, Juan; Universidad EAFIT. Departamento de Ciencias; Lógica y Computación
    Recently a quantum algorithm for the Jones polynomial of virtual links was proposed by Kauffman and Dye via the implementation of the virtual braid group in anyonic topological quantum computation when the virtual crossings are considered as generalized swap gates. Also recently, a mathematical method for the computation of the Jones polynomial of a given virtual link in terms of the relative Tuttle polynomial of its face (Tait) graph with some suitable variable substitutions was proposed by Diao and Hetyei. The method of Diao and Hetyei is offered as an alternative to the ribbon graph approach according to which the Tutte polynomial of a given virtual link is computed in terms of the Bollobás- Riordan polynomial of the corresponding ribbon graph. The method of Diao and Hetyei can be considered as an extension of the celebrated Thistlethwaite theorem according to which invariant polynomials for knots and links are derived from invariant polynomials for graphs. Starting from these ideas we propose a quantum algorithm for the Jones polynomial of a given virtual link in terms of the generalized Tutte polynomials by exploiting the Thistlethwaite theorem and the Kauffman algorithm. Our method is claimed as the quantum version of the Diao-Hetyei method. Possible supersymmetric implementations of our algortihm are discussed jointly with its formulations using topological quantum lambda calculus. © 2010 SPIE.
  • No hay miniatura disponible
    Ítem
    Tutte polynomials and topological quantum algorithms in social network analysis for epidemiology, bio-surveillance and bio-security
    (SPRINGER, 2008-01-01) Velez, Mario; Ospina, Juan; Hincapie, Doracelly; Velez, Mario; Ospina, Juan; Hincapie, Doracelly; Universidad EAFIT. Departamento de Ciencias; Lógica y Computación
    The Tutte polynomial and the Aharonov-Arab-Ebal-Landau algorithm are applied to Social Network Analysis (SNA) for Epidemiology, Biosurveillance and Biosecurity. We use the methods of Algebraic Computational SNA and of Topological Quantum Computation. The Tutte polynomial is used to describe both the evolution of a social network as the reduced network when some nodes are deleted in an original network and the basic reproductive number for a spatial model with bi-networks, borders and memories. We obtain explicit equations that relate evaluations of the Tutte polynomial with epidemiological parameters such as infectiousness, diffusivity and percolation. We claim, finally, that future topological quantum computers will be very important tools in Epidemiology and that the representation of social networks as ribbon graphs will permit the full application of the Bollobás-Riordan-Tutte polynomial with all its combinatorial universality to be epidemiologically relevant. © 2008 Springer Berlin Heidelberg.
  • No hay miniatura disponible
    Ítem
    Universal quantum gates Via Yang-baxterization of dihedral quantum double
    (SPRINGER, 2007-01-01) Velez, Mario; Ospina, Juan; Velez, Mario; Ospina, Juan; Universidad EAFIT. Departamento de Ciencias; Lógica y Computación
    The recently discovered Yang-Baxterization process for the quantum double of the dihedral group algebra, is presented keeping on mind the quantum computation. The products resultant from Yang-Baxterization process are interpreted as universal quantum gates using the Bryslinski's theorem. Results are obtained for two-qubits and two-qutrits gates. Using the Zhang-Kauffman-Ge method (ZKGM), certain Hamiltonians responsible for the quantum evolution of the quantum gates are obtained. Possible physical systems such as anyons systems are mentioned as referents for practical implementation. © Springer-Verlag Berlin Heidelberg 2007.
  • No hay miniatura disponible
    Ítem
    Using computer algebra for Yang-Baxterization applied to quantum computing
    (SPIE-INT SOC OPTICAL ENGINEERING, 2006-05-12) Velez, Mario; Ospina, Juan; Velez, Mario; Ospina, Juan; Universidad EAFIT. Departamento de Ciencias; Lógica y Computación
    Using Computer Algebra Software (Mathematica and Maple), the recently introduced topic of Yang-Baxterization applied to quantum computing, is explored from the mathematical and computational views. Some algorithms of computer algebra were elaborated with the aim to make the calculations to obtain some of results that were originally presented in the paper by Shang-Kauffman-Ge. Also certain new results about computational Yang-baxterization are presented. We obtain some Hamiltonians for hypothetical physical systems which can be realized within the domain of spin chains and certain diffusion process. We conclude that it is possible to have real physical systems on which implement, via Yang-baxterization, the standard quantum gates with topological protection. Finally some lines for future research are deligned.