Reversible implementation of a disrete linear transformation

Discrete linear transformations form important steps in processing information. Many such transformations are injective and therefore are prime candidates for a physically reversible implementation into hardware. We present here the first steps towards a reversible digital implementation of two different integer transformations on four inputs: The Haar wavelet and the H.264 transform

From the arrow of time in Badiali's quantum approach to the dynamic meaning of Riemann's hypothesis

The novelty of the Jean Pierre Badiali last scientific works stems to a quantum approach based on both (i) a return to the notion of trajectories (Feynman paths) and (ii) an irreversibility of the quantum transitions. These iconoclastic choices find again the Hilbertian and the von Neumann algebraic point of view by dealing statistics over loops. This approach confers an external thermodynamic origin to the notion of a quantum unit of time (Rovelli Connes' thermal time). This notion, basis for quantization, appears herein as a mere criterion of parting between the quantum regime and the thermodynamic regime. The purpose of this note is to unfold the content of the last five years of scientific exchanges aiming to link in a coherent scheme the Jean Pierre's choices and works, and the works of the authors of this note based on hyperbolic geodesics and the associated role of Riemann zeta functions. While these options do not unveil any contradictions, nevertheless they give birth to an intrinsic arrow of time different from the thermal time. The question of the physical meaning of Riemann hypothesis as the basis of quantum mechanics, which was at the heart of our last exchanges, is the backbone of this note.Comment: 13 pages, 2 figure

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. This paper considers factoring integers and finding discrete logarithms, two problems which are generally thought to be hard on a classical computer and have been used as the basis of several proposed cryptosystems. Efficient randomized algorithms are given for these two problems on a hypothetical quantum computer. These algorithms take a number of steps polynomial in the input size, e.g., the number of digits of the integer to be factored.Comment: 28 pages, LaTeX. This is an expanded version of a paper that appeared in the Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, Nov. 20--22, 1994. Minor revisions made January, 199

Towards the quantum Brownian motion

We consider random Schr\"odinger equations on \bR^d or \bZ^d for $d\ge 3$ with uncorrelated, identically distributed random potential. Denote by $\lambda$ the coupling constant and $\psi_t$ the solution with initial data $\psi_0$. Suppose that the space and time variables scale as $x\sim \lambda^{-2 -\kappa/2}, t \sim \lambda^{-2 -\kappa}$ with $0< \kappa \leq \kappa_0$, where $\kappa_0$ is a sufficiently small universal constant. We prove that the expectation value of the Wigner distribution of $\psi_t$, \bE W_{\psi_{t}} (x, v), converges weakly to a solution of a heat equation in the space variable $x$ for arbitrary $L^2$ initial data in the weak coupling limit $\lambda \to 0$. The diffusion coefficient is uniquely determined by the kinetic energy associated to the momentum $v$.Comment: Self-contained overview (Conference proceedings). The complete proof is archived in math-ph/0502025. Some typos corrected and new references added in the updated versio