2
$\begingroup$

As I understand it, quantum circuits as a model are equivalent to quantum Turing machines, or at least they can be simulated on each other.

So my question is, why have quantum circuits become the chosen implementation rather than quantum Turing machines, such as in the IBM Q?

Is it related to entanglement and reversible gates? I wondered if quantum Turing machines could not take full advantage of entanglement.

$\endgroup$
  • 1
    $\begingroup$ In short: quantum circuits are easier to comprehend than Turing machines. Similar to why programmers don't code in machine language. Re: "I wondered if quantum Turing machines could not take full advantage of entanglement."...that doesn't make much sense as the two models are equivalent. $\endgroup$ – Blue May 9 at 11:00
  • $\begingroup$ [cont.] You might be interested in John Watrous' answer to In a Quantum Turing Machine, how is the decision to move along the memory tape made?. $\endgroup$ – Blue May 9 at 14:42

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.