Abstract

In this paper a microscopic quantum mechanical model of computers as represented by Turing machines is constructed. It is shown that for each numberN and Turing machineQ there exists a HamiltonianH N Q and a class of appropriate initial states such that if c is such an initial state, thenψ Q N (t)=exp(−1H N Q t)ψ Q N (0) correctly describes at timest 3,t 6,⋯,t 3N model states that correspond to the completion of the first, second, ⋯, Nth computation step ofQ. The model parameters can be adjusted so that for an arbitrary time intervalΔ aroundt 3,t 6,⋯,t 3N, the “machine” part ofψ Q N (t) is stationary.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call