Tag Info

40

Yes, a quantum computer could be simulated by a Turing machine, though this shouldn't be taken to imply that real-world quantum computers couldn't enjoy quantum advantage, i.e. a significant implementation advantage over real-world classical computers. As a rule-of-thumb, if a human could manually describe or imagine how something ought to operate, that ...

7

If we have a QTM with state set $Q$ and a tape alphabet $\Sigma = \{0,1\}$, we cannot say that the qubit being scanned by the tape head "holds" a vector $a|0\rangle + b|1\rangle$ or that the (internal) state is a vector with basis states corresponding to $Q$. The qubits on the tape can be correlated with one another and with the internal state, as well as ...

6

To simulate the collapse of the wave function you'd need a source of randomness. So you'd need a probabilistic Turing machine.

6

Sort of, quite possibly, if by degrees This is a speculative, but plausible, answer First of all, how do qubits interact and states evolve with time? The description of how individual qubits evolve (i.e. a single qubit gate operation) is given by some Hamiltonian1. Multiple, non-interacting qubits (that are exactly the same) therefore evolve using ...

4

There are two notions of Zeno topics related to quantum computation. The first, which is controversial is usually called hypercomputation, which deals with the possibility of surpassing the limitations of the Church-Turing thesis by means of quantum computation. It is related to the Zeno effect through the fact that if it could be realized, it may solve the ...

4

The quantum Turing machine can move into a superposition of moving left and right. This is different from the classical Turing machine which can only move either left or right.

4

We don't yet know if quantum computers are actually better than classical computers, as @heather mentions here. As for now there are just some theoretical algorithms which we know of, specifically for quantum-computers, which have much better time complexities than equivalent classical algorithms. For example - prime factorization and discrete logarithms. ...

2

To complete what others have said: as far as we know a (classical) Turing machine cannot truly simulate quantum correlations. This is explicitly claimed in section Properties of the universal quantum computer by the seminal paper by David Deutsch Quantum theory, the Church-Turing principle and the universal quantum computer (Proceedings of the Royal Society ...

Only top voted, non community-wiki answers of a minimum length are eligible