Comments on: Quantum hype http://programming-musings.org/2007/02/18/quantum-hype/ random thoughts on programming and programming languages Sun, 22 Apr 2012 00:53:21 +0000 hourly 1 http://wordpress.com/ By: Matt http://programming-musings.org/2007/02/18/quantum-hype/#comment-12242 Tue, 20 Feb 2007 06:38:30 +0000 http://jaortega.wordpress.com/2007/02/18/quantum-hype/#comment-12242 Interestingly, dwave has a blog here at WordPress.com:

http://dwave.wordpress.com/

]]> By: hawk http://programming-musings.org/2007/02/18/quantum-hype/#comment-12230 Mon, 19 Feb 2007 04:50:37 +0000 http://jaortega.wordpress.com/2007/02/18/quantum-hype/#comment-12230 we don’t know that. factoring is probably not in P, and is also not NP-complete. it is obviously in NP.
If we could somehow prove that factoring was NP-hard (and hence NP-complete), it would imply NP=coNP and that is suspected false.

]]> By: japple http://programming-musings.org/2007/02/18/quantum-hype/#comment-12229 Sun, 18 Feb 2007 17:17:37 +0000 http://jaortega.wordpress.com/2007/02/18/quantum-hype/#comment-12229 “(note, by the way, that factoring is not NP-complete).”

Is that actually known? Factoring would be trivially NP-complete, for instance, if P=NP.

]]> By: Bit By Bit, Byte by Byte, Char by Char, Word by Word Blog Posts to Note today « http://programming-musings.org/2007/02/18/quantum-hype/#comment-12228 Sun, 18 Feb 2007 16:52:15 +0000 http://jaortega.wordpress.com/2007/02/18/quantum-hype/#comment-12228 [...] an another note, Programming Musings has done a survey of programming languages for quantum computing. Interest in quantum computing has gone up dramatically since a Candian company called D-Wave [...]

]]>