There are computation devices more powerful than the Turing machine, which is why we have complexity classes. (P, #P, #BQP are some examples described by different kinds of Turing-like machines.)
So calling humans equivalent to standard Turing machine is ultimately wrong if you even start to assume quantum processes are important in our thinking. (which is actually unproven as of yet)
Then you need to start with a more intricate parallel quantum Turing machine, high end mathematics required already. It is already non-deterministic.
And no, quantum effects cannot be simulated efficiently classically. That is the difference between P and #P complexity classes. Add parallelism, you get #BQP. You would be able to tell something about the nature of reality by building physical instances of those problems and timing them.
Timing attack on the structure of reality, structure of time itself, anyone? (Of course the required energies would be ridiculous.)
To falsify any Turing model, you need to answer the question: what cannot be done by any given machine? Or by any machine? It is possible that there's a Goedel trap in this question.
A parallel would be to find and answer to what cannot be computed efficiently by best human geniuses ever. Hard introspective question might I add. Answer probably requires building or finding something more than human.