Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

> I felt this was a much better layman explanation of what a quantum computer does than simply saying a quantum computer runs all possible paths in parallel.

Relevant concerning your point:

> "The Talk"

> https://www.smbc-comics.com/comic/the-talk-3



That comic is great I understand qubits a bit better now: it has 4 degrees of freedom but can be mapped onto the 2d surface of a sphere because of normalization (circle rule) and global phase symmetry which each take away one of the four DOF

I need a longer think on the interference/computation connection though


Thanks for this! I guess i need to read up on Hilbert Space.

...and Shor's Algorithm


Don't let the terminology intimidate you. The interesting ideas in quantum computing are far more dependent upon a foundation in linear algebra rather than a foundation in mathematical analysis.

When I started out, I was under the assumption that I had to understand at least the undergraduate real analysis curriculum before I could grasp quantum algorithms. In reality, for the main QC algorithms you see discussed, you don't need to understand completeness; you can just treat a Hilbert space as a finite-dimensional vector space with a complex inner product.

For those unfamiliar with said concepts from linear algebra, there is a playlist [1] often recommended here which discusses them thoroughly.

[1] https://www.youtube.com/playlist?list=PLZHQObOWTQDPD3MizzM2x...


Yeah all the names and terminology really do make it seem harder than it is. Took me a long time and I’m still learning. 2d Hilbert space is same as 2d Euclidean space but each dimension has 2 degrees of freedom (real + imaginary). Might even think of it as 4d space, for vector imagining purposes, but that would probably be wrong and someone would call you out


> ...and Shor's Algorithm

Better start with Simon's algorithm (solving Simon's problem) [0]; it already contains a lot of ideas that you need to understand Shor's algorithm, while not having a lot of technicalities. Then progress to Shor's algorithm, and then to Kitaev's algorithm [1] (link from [2]). The latter solves the Abelian stabilizer problem - this problem contains the more abstract mathematical essence of a lot of quantum algorithms.

[0] https://en.wikipedia.org/wiki/Simon%27s_problem

[1] https://arxiv.org/abs/quant-ph/9511026

[2] https://en.wikipedia.org/wiki/Hidden_subgroup_problem#Instan...




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: