Well, for example, the no cloning theorem has a classical analogy. I prepare a coin so that it is heads with probability p. I give you the coin. Your job is to

Well, for example, the no cloning theorem has a classical analogy. I prepare a coin so that it is heads with probability p. I give you the coin. Your job is to prepare two coins so that they are independently heads with probability p. You aren't told p, you only get the coin to work with. We are going to repeat this many times, and with various values of p, and someone will test whether the coins you are producing follow the right distribution. It's obviously not possible for you to do particularly well at this task. See [1] I'm not aware of a probability analogy for tunneling. 1: https://marozols.wordpress.com/2012/05/21/three-myths-about-quantum-computing-part-2/ https://marozols.wordpress.com/2012/05/21/three-myths-about-...