We present a polynomial-time reduction of the discrete logarithm problem in any periodic (a.k.a. torsion) semigroup (Semigroup DLP) to the classic DLP in a subgroup of the same semigroup. It follows that Semigroup DLP can be solved in polynomial time by quantum computers, and that Semigroup DLP has subexponential algorithms whenever the classic DLP in the corresponding groups has subexponential...

We present a polynomial-time reduction of the discrete logarithm problem in any periodic (a.k.a. torsion) semigroup (Semigroup DLP) to the classic DLP in a subgroup of the same semigroup. It follows that Semigroup DLP can be solved in polynomial time by quantum computers, and that Semigroup DLP has subexponential algorithms whenever the classic DLP in the corresponding groups has subexponential...

We study the Classical Probability analogue of the dilations of a quantum dynamical semigroup in Quantum Probability. Given a (not necessarily homogeneous) Markov chain in discrete time in a finite state space E, we introduce a second system, an environment, and a deterministic invertible time-homogeneous global evolution of the system E with this environment such that the original Markov evolu...

Given a finite state space E, we build a universal dilation for all possible discrete time Markov chains on E, homogeneous or not: we introduce a second system (an “environment”) and a deterministic invertible time-homogeneous global evolution of the system E with this environment such that any Markov evolution of E can be realized by a proper choice of the initial (random) state of the environ...

We discuss some of the experimental motivation for the need for semigroup decay laws, and the quantum Lax-Phillips theory of scattering and unstable systems. In this framework, the decay of an unstable system is described by a semigroup. The spectrum of the generator of the semigroup corresponds to the singularities of the Lax-Phillips S-matrix. In the case of discrete (complex) spectrum of the...

We describe an efficient quantum algorithm for computing discrete logarithms in semigroups using Shor’s algorithms for period finding and discrete log as subroutines. Thus proposed cryptosystems based on the presumed hardness of discrete logarithms in semigroups are insecure against quantum attacks. In contrast, we show that some generalizations of the discrete log problem are hard in semigroup...

–a notion of amenability for topological semigroups is introduced. a topological semigroup s iscalled johnson amenable if for every banach s -bimodule e , every bounded crossed homomorphism froms to e* is principal. in this paper it is shown that a discrete semigroup s is johnson amenable if and only if1(s) is an amenable banach algebra. also, we show that if a topological semigroup s is johns...

We construct  a noncommutative analog of additive functional equations on discrete quantum semigroups and show that this noncommutative functional equation has Hyers-Ulam stability on amenable discrete quantum semigroups. The discrete quantum semigroups that we consider in this paper are in the sense of van Daele, and the amenability is in the sense of Bèdos-Murphy-Tuset. Our main result genera...

We study asymptotic behavior of a Markov semigroup on a von-Neumann algebra by exploring a maximal von-Neumann subalgebra where the Markov semigroup is an automorphism. This enables us to prove that strong mixing is equivalent to ergodic property for continuous time Markov semigroup on a type-I von-Neumann algebra with center completely atomic. For discrete time dynamics we prove that an aperio...

The fundamental mathematical definitions of the controlled feedback Markov dynamics of quantum-mechanical systems are introduced with regard to the dynamical reduction and filtering of quantum states in the course of quantum measurement in either discrete or continuous real time. The concept of sufficient coordinates for the description of a posteriori quantum states in a given class is introdu...