Comments on: Topological quantum computing http://michaelnielsen.org/blog/topological-quantum-computing/ Fri, 10 Feb 2012 10:56:26 +0000 hourly 1 http://wordpress.org/?v=3.3 By: Sacha http://michaelnielsen.org/blog/topological-quantum-computing/comment-page-1/#comment-4507 Sacha Thu, 06 Jul 2006 02:08:19 +0000 http://michaelnielsen.org/?p=243#comment-4507 Thanks for the reference, Michael. When I read the sci am article, I wondered about the relation between calculating a knot polynomial and using that to simulate a quantum computer, and this is discussed in this article. Reading my previous comment - of course, doing something conceptually can be easy. Actually doing it may be difficult! (eg multiplying all the matrices representing the braidings in a braid and then taking the quantum trace of the resultant). Thanks for the reference, Michael. When I read the sci am article, I wondered about the relation between calculating a knot polynomial and using that to simulate a quantum computer, and this is discussed in this article.

Reading my previous comment – of course, doing something conceptually can be easy. Actually doing it may be difficult! (eg multiplying all the matrices representing the braidings in a braid and then taking the quantum trace of the resultant).

]]> By: Sacha http://michaelnielsen.org/blog/topological-quantum-computing/comment-page-1/#comment-4506 Sacha Thu, 06 Jul 2006 00:41:41 +0000 http://michaelnielsen.org/?p=243#comment-4506 I'll check it out when I have time - I only started understanding it in the scientific american article a few months ago - it sounded as if you could compute something, somehow, by creating a braid to encode the computation, and then calculating the Jones polynomial for the braid, which is a pretty straightforward thing to do, conceptually. (Just taking the quantum trace of a matrix). I’ll check it out when I have time – I only started understanding it in the scientific american article a few months ago – it sounded as if you could compute something, somehow, by creating a braid to encode the computation, and then calculating the Jones polynomial for the braid, which is a pretty straightforward thing to do, conceptually. (Just taking the quantum trace of a matrix).

]]> By: Michael Nielsen http://michaelnielsen.org/blog/topological-quantum-computing/comment-page-1/#comment-4505 Michael Nielsen Wed, 05 Jul 2006 19:51:58 +0000 http://michaelnielsen.org/?p=243#comment-4505 I haven't followed the work closely, but do know that there is a sense in which computing the Jones polynomial is complete for quantum computing. (I.e., it can be regarded as a canonical problem for quantum computing, to which all the others can be reduced). Start from quant-ph/0605181 and work backwards! I haven’t followed the work closely, but do know that there is a sense in which computing the Jones polynomial is complete for quantum computing. (I.e., it can be regarded as a canonical problem for quantum computing, to which all the others can be reduced). Start from quant-ph/0605181 and work backwards!

]]> By: Sacha http://michaelnielsen.org/blog/topological-quantum-computing/comment-page-1/#comment-4504 Sacha Wed, 05 Jul 2006 14:11:11 +0000 http://michaelnielsen.org/?p=243#comment-4504 It would be interesting if knot invariants actually ended up having an application, eg in topological quantum computing! I havn't had the time to properly understand topological quantum computing (being trained as a maths person and all that), however I do know about knot invariants and quantum groups etc, and the potential of topological quantum computing is very interesting! It would be interesting if knot invariants actually ended up having an application, eg in topological quantum computing!

I havn’t had the time to properly understand topological quantum computing (being trained as a maths person and all that), however I do know about knot invariants and quantum groups etc, and the potential of topological quantum computing is very interesting!

]]>