The Internet Archive has a preservation copy of this work in our general collections.
The file type is
Noisy computation and reversible computation have been studied separately, and it is known that they are as powerful as unrestricted computation. We study the case where both noise and reversibility are combined and show that the combined model is weaker than unrestricted computation. In our noisy reversible circuits, each wire is flipped with probability p each time step, and all the inputs to the circuit are present in time 0. We prove that any noisy reversible circuit must have sizearXiv:quant-ph/9611028v1 fatcat:eehjdujtuffk3n4bj4khaxxjwu