Quantum Computing: A new Paradigm and it's Type Theory Martin Wehr Quantum Computing Seminar, Lehrstuhl Prof. Beth, Universit"at Karlsruhe, July 1996 To use quantum mechanical behavior for computing has been proposed by Feynman. Shor gave an algorithm for the quantum computer which raised a big stream of research. This was because Shor's algorithm did reduce the yet assumed exponential complexity of the security relevant factorization problem, to a quadratic complexity if quantum computed. In the paper a short introduction to quantum mechanics can be found in the appendix. With this material the operation of the quantum computer, and the ideas of quantum logic will be explained. The focus will be the argument that a connection of quantum logic and linear logic is the right type theory for quantum computing. These ideas are inspired by Vaughan Pratt's view that the intuitionistic formulas argue about states (i.e physical quantum states) and linear formulas argue about state transformations (i.e computation steps).