Feynman Machine: A Geometric Computational Machinery Based on the Path Integration

AbstractThis paper proposes a framework for a new quantum computation based on the Feynman's path integral. The Feynman's path integral has been studied in quantum physics, however, the computational machinery may be used in universal computations. The light path design will be done in a light geometric automaton. As examples, we will present the primality test of an integer (for the deterministic case of light particle) and the stable marriage problem (for the probabilistic case of light wave)