<html>
<head>
<meta content="text/html; charset=windows-1252"
http-equiv="Content-Type">
</head>
<body bgcolor="#FFFFFF" text="#000000">
<br>
<div class="moz-cite-prefix">On 01/25/2015 12:50 PM, Tao Effect
wrote:<br>
</div>
<blockquote
cite="mid:9F9B23FF-F09A-4965-8155-8503C17EDCBE@taoeffect.com"
type="cite">
<meta http-equiv="Content-Type" content="text/html;
charset=windows-1252">
<blockquote type="cite">
<div bgcolor="#FFFFFF" text="#000000">The problem with this
algorithm (and with other attempts to solve SAT with a quantum
computer) is that nobody knows how to build the quantum
function "completely_zero".<br>
</div>
</blockquote>
<div><br>
</div>
That's not very reassuring.
<div><br>
</div>
<div>-g<br>
</div>
</blockquote>
So, I'm not at all a quantum computing expert, but so far as I know
they just aren't expected to work like this. There almost certainly
won't be an oracle which will distinguish with high probability
between a register that's all zeros and one with a 2^-n amplitude to
be nonzero.<br>
<br>
Quantum algorithms rely on more subtle effects, like the ability to
approximate the large coefficients of an exponentially large Fourier
transform in polynomial time.<br>
<br>
-- Mike<br>
</body>
</html>