Quantum and Classical

Quantum and Classical

• Fenner, Green, Homer and Pruim show the following are the same.
  • Determining whether a Quantum Turing machine accepts with probability zero.
  • Determining whether a classical probabilistic Turing machine accepts with probability exactly one-half.

Previous slide

Next slide

Back to the first slide

View Graphic Version