New Scientist, 24/1/2004 contains an article that suggests that
researchers into quantum computing only need to find non-Abelian
anyons to make robust quantum computers that use quantum braiding to
create computations as knots of particle timelines.
Apparently such knots are equivalent to NP-hard problem solvers.
And ordinary anyons exist, but they haven't found non-Abelian ones
yet, though quantum theory says they should exist.
I can't find a link to the story on www.newscientist.com though. (01)
What will a quantum braiding OHS look like though? (02)
--
This message is archived at: (03)
http://collab.blueoxen.net/forums/cgi-bin/mesg.cgi?a=yak&i=4019739E.23928.21E197@localhost (04)
|