Simplicial Ricci Flow

We construct a discrete form of Hamiltons Ricci flow (RF) equations for a d-dimensional piecewise flat simplicial geometry, S. These new algebraic equations are derived using the discrete formulation of Einsteins theory of general relativity known as Regge calculus. A Regge-Ricci flow (RRF) equation is naturally associated to each edge, L, of a simplicial lattice. In defining this equation, we find it convenient to utilize both the simplicial lattice, S, and its circumcentric dual lattice, S*. In particular, the RRF equation associated to L is naturally defined on a d-dimensional hybrid block connecting $ell$ with its (d-1)-dimensional circumcentric dual cell, L*. We show that this equation is expressed as the proportionality between (1) the simplicial Ricci tensor, Rc_L, associated with the edge L in S, and (2) a certain volume weighted average of the fractional rate of change of the edges, lambda in L*, of the circumcentric dual lattice, S*, that are in the dual of L. The inherent orthogonality between elements of S and their duals in S* provide a simple geometric representation of Hamiltons RF equations. In this paper we utilize the well established theories of Regge calculus, or equivalently discrete exterior calculus, to construct these equations. We solve these equations for a few illustrative examples.

Is the Measurement Based Quantum Computing Search Algorithm Really Grovers Algorithm?

We question whether the measurement based quantum computing algorithm is in fact Grovers algorithm or simply a similar oracular search method. The two algorithms share several qualitative features especially in the case of the trivial 4 element search, which is the largest size photonic search algorithm that has been experimentally implemented to date. This has led some to refer to both substantiations as Grovers algorithm. We compare multiple features of the two algorithms including the behavior of the oracle tags and the entanglement dynamics, both qualitatively and quantitatively. We find significant and fundamental differences in the operation of the two algorithms, particularly in cases involving searches on more than four elements.