First Browser-Based Quantum Computer Simulator Released
greg65535 (1209048) writes "Following the trend of on-line coding playgrounds like JSFiddle or CodePen, Google researchers unveiled the first browser-based, GPU-powered Quantum Computing Playground. With a typical GPU card you can simulate up to 22 qubits, write, debug, and share your programs, visualize the quantum state in 2D and 3D, see quantum factorization and quantum search in action, and even... execute your code backwards."
They both released it and didn't release it simultaneously.
It prints "I buried Paul".
They must mean simulates as in sim-city, not simulates as in actual simulation.
This is actually a requirement for such a simulator as all unitary QM transformations are reversible.
It's kind of ironic that Google released this project given that they are at the same time heavily betting on D-Wave with a radically different approach to QM than the Gate based model.
The D-Wave founder Geordie Rose is know for disparaging the Quantum Gate based model as completely impractical, and in turn other QC researchers have been very critical of his approach to the matter. Spawning a contentious controversy almost as old as the Canadian start-up itself.
Would a simple botnet be able to easily crack all encryption crackable by quantum computing, or are there better ways to go at it given a botnet?
Yes it is crackable using a bother simulating a quantum computer, in the same sense that you would be able to simulate a quantum computer solving the traveling salesman problem by using a botnet. Or by using a massively parallel supercomputer.
That is to say, the quantum computer simulation is Turing computable. This really doesn't help for anything more than trivial problems, much like pointing out the Halting Problem is decidable if you "simply" observe the Turing machine for the appropriate Busy Beaver function's number of execution steps.
More succinctly, the simulation would gain you nothing over a direct parallel processing attack on the key space, and in fact the quantum computer simulation would add execution overhead that would reduce efficiency compared to straightforward brute force attacks.
Should have included this in the previous comment, but couldn't find the link at first.
What I did use occasionally when taking the course was this little browser based gem. While certainly not nearly as powerful as this Google simulator it was still quite useful.
Ignoring the typical Slashdot cynicism (and often lack of understanding disguised as such), this is actually pretty damn neat! Quantum mechanics and quantum computing using the gates model aren't intuitive, especially not for people without a physics background, so this could really help learning the fundamentals of quantum computing. Being able to visualize the state of the qubits at each step of the process as something other than a big formula is a pretty big deal.
As it is right now, QC is pretty much just taught using pen and paper, but I think this deserves some attention too. I don't think many people in the classroom understood what the hell Shor's algorithm was doing when the prof presented it (I know I didn't), but perhaps with a more interactive demo it'd be a bit easier to grasp. Grover's algorithm would also be extremely cool to watch unfold, I think.
Isn't it ironic that a consumer graphics card can simulate more qubits than most actual quantum computers have right now?
If it's possible to simulate qubits using, at the bottom, bits, and, if qubits and quantum computing allow for performing NP calcs in parametric time
Being able to simulate qubits doesn't mean you can do so in parametric time.
One can simulate a few molecules chemically reacting, but you can't reasonably do so at a molecular level for a macroscopic sample - yet in reality both would take a similar amount of time.
* the above is an uninformed guess
systemd is Roko's Basilisk.
Simulation as in "simulation", not simulation as in "emulation".
Slashdot social media options: AIM, ICQ, Yahoo, Jabber and Mobile Text. Why no MySpace?
Parent post is so full of (intentional?) disinformation that it hurts.
Why haven't we been doing this for decades? We have. The only novel part here is "in a web browser." Simulation is not a new concept. Any nondeterministic computing problem can be simulated by a deterministic machine, and vice versa.
Second, instruction runtime on the simulated machine does not correlate with the runtime on the physical machine -- at all. A deterministic machine can simulate a nondeterministic one in O(2^n) by trying every possible combination. More on this later.
Third, integer factorization and graph isomorphism are two algorithms known to be be in NP ^ coNP. If P != NP, that means these algorithms are not NP hard, so the fact that a QC can do integer factorization faster than a general purpose machine says nothing about how fast a QC can solve NP complete problems.
Finally, a QC with only 22 qbits is hilariously pointless, because 22 bits can be brute forced in O(1) with 512kiB state table. I won't even be impressed when someone makes a 44 qbit machine, because that state table will fit on a 2TiB hard drive. I will be impressed if anyone ever builds 128 qbit quantum computer in my lifetime that (1) can solve 128qbit problems in less than a second, (2) runs faster than the fastest known conventional supercomputer at the time, (3) uses less power than a desktop PC, and (3) costs less than a desktop PC. Until then, meh.
Hold on a minute. If it's possible to simulate qubits using, at the bottom, bits, and, if qubits and quantum computing allow for performing NP calcs in parametric time (and hence breaking crypto), then haven't we already been able to do all of these things for decades?
Oblig xkcd - http://www.xkcd.com/505/
My appreciation of Douglas Adams is far deeper than yours.
You mean a simulation like this? /dev/random | grep "the answer to life, the universe and everything" | sed -e 's/the answer to life, the universe and everything/42/'
# cat
10 little-endian boys went out to dine, a big-endian carp ate one, and then there were -246.
It didn't output 42 for me:
# cat /dev/random | grep "the answer to life, the universe and everything" | sed -e 's/the answer to life, the universe and everything/42/'
Binary file (standard input) matches
Yes, I saw that right after I posted. Autocorrect stymied me as I spelled "botnet". Fixed it once, but then it "helped me out" again when I edited the sentence later.