News for hackers. Stuff that matters.
Re:A Polynomial Time Bounded-Error Quantum Algorithm for Boo... by algorias on Wednesday July 22, 2015 @09:46AM (#9929596)
It's just an exponential overhead. The state of a quantum computer is a superposition over all bitstrings, i.e. a vector of size 2^n for n qubits, and you have to implement quantum operators by multiplying with 2^n x 2^n unitary matrices (you better do that implicitly whenever possible or it will be very slow).

After taking a lecture on quantum computing, it was actually a weekend project to implement a basic quantum simulator myself, very useful to confirm that I actually understood the model as well as I thought.

Re:A Polynomial Time Bounded-Error Quantum Algorithm for Boo... by Xcelerate on Wednesday July 22, 2015 @12:23PM (#9930574)
In fact, you don't even have to understand quantum mechanics to create a quantum simulator. Mostly just linear algebra, and how states evolve through time, given some Hamiltonian.
Re:A Polynomial Time Bounded-Error Quantum Algorithm for Boo... by LunaSea on Wednesday July 22, 2015 @09:58AM (#9929661)
This sounds really interesting! Do you have by any chance a link to some useful resources ?