It is well known that probabilistic boolean decision trees cannot be much more powerful than deterministic ones Motivated by a question if randomization can signiicantly speed up a nondeterministic computation via a boolean decision tree, we address structural properties of Arthur-Merlin games in this model and prove some lower bounds. We consider two cases of interest, the rst when the length ...

What happens if in QMA the quantum channel between Merlin and Arthur is noisy? It is not difficult to show that such a modification does not change the computational power as long as the noise is not too strong so that errors are correctable with high probability, since if Merlin encodes the witness state in a quantum error-correction code and sends it to Arthur, Arthur can correct the error ca...

this article is concerned with eugene fontinell’s idea about personal immortality. fontinell has offered a specific view about the possibility of afterlife, through employing the experimental method, william james’s pragmatic method, and also developing william james’s field theory and his psychological ideas about the “self”.  fontinell believes that it is possible to imagine immortality in a ...