That is my understanding also. Here, 8 cities form an 8 by 8 connection grid, with a total of 64 potential connections (that's half of the qubits in a 128 bit machine). The connections might be weighted, or not - I am not clear enough on the machine architecture to know that.
Anyways, 8 by 8 gives us a theoretical limit of 2^64 potential routes to consider. Presumably the chip would select one of those after being faced with all of the possibilities and constraints. If you can see a better way to represent this problem from a hardware design perspective, I'd be interested in hearing about it. Thanks, -- Raul On Sat, Oct 12, 2013 at 2:38 PM, Robert Bernecky <[email protected]> wrote: > My understanding (which is not very good here - I've only read > one poorly written book on the subject, some years ago...) is that > an N-bit quantum computer effectively lets you compute on > 2^N things (See my hands waving?) at once. Which ain't half bad. > > Hence, a 128-bit machine is a fairly hefty piece of tin, and well > worth all that refrigeration: 2^128 is a Big Number, roughly 1E38. > > Bob > > > On 13-10-12 02:30 PM, Raul Miller wrote: >> >> With that kind of representation, I can see how a 128qubit machine >> could handle M=8. >> >> I suppose that's a start. Still: half the qubits get "wasted", and >> you'd need something considerably more general if you wanted to deal >> with other problems. >> >> Thanks, >> > > > -- > Robert Bernecky > Snake Island Research Inc > 18 Fifth Street > Ward's Island > Toronto, Ontario M5J 2B9 > > [email protected] > tel: +1 416 203 0854 > > ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
