________________________________________________________________________________
If anyone is interested I've also created a short 1.5 hour lecture on quantum computing aimed specifically at software engineers & computer scientists, which has proven popular:
I'd love to answer any questions people have. In quantum computation, state behaves like a vector and logic gates behave like matrices that multiply the vector to get a new state value. It doesn't get too much more complicated than that.
Any advice on breaking into the industry? Would be really neat to work as a quantum research engineer, or software engineer on quantum computers!
Google, Amazon, IBM, and Microsoft all have quantum programs which use "regular" software engineers in various roles - for example, writing software to support researchers working in the labs. That's what I did for Microsoft. If you want to work on actual research yourself though, you'll probably need a PhD. There are some non-PhD positions that do research-adjacent work like simulating, implementing & refining researcher findings for the specific hardware the company is developing, but those are quite competitive/difficult to get (I tried!)
Microsoft also has a fairly large team working on Q# and the Microsoft Quantum Development Kit. That would also involve research-adjacent things like efficiently compiling programs to specific quantum device layouts with appropriate error correction schemes, etc.
ETH Zurich has a quantum engineering masters:
In that Vein, so does USC. MSc in Quantum Information Science
https://viterbigradadmission.usc.edu/programs/masters/msprog...
Probably a PhD
Just wanted to say I watched your lecture on YouTube a while back and thought it was very well-done and informative. I learned a lot. Thank you!
Glad you enjoyed! I also wrote a couple of follow-up blog posts which examine quantum entanglement & quantum chemistry simulation, respectively:
https://ahelwer.ca/post/2018-12-07-chsh/
https://ahelwer.ca/post/2019-12-21-quantum-chemistry/
That was incredibly insightful! Thank you sharing this!
Nice! This seems to fit my learning style well. I prefer to understand why something matters, than progressively probe backwards into the theory.
For anyone interested in additional resources, MIT has some courses taught by Peter Shor and Isaac Chuang on quantum information science [1-6].
[1]
https://www.edx.org/course/quantum-information-science-i-par...
[2]
https://www.edx.org/course/quantum-information-science-i-par...
[3]
https://www.edx.org/course/quantum-information-science-i-par...
[4]
https://www.edx.org/course/quantum-information-science-ii-qu...
[5]
https://www.edx.org/course/quantum-information-science-ii-ef...
[6]
https://www.edx.org/course/quantum-information-science-ii-ad...
Another great introductory resource is
by Andy Matuschak and Michael Nielsen
Am I the only one who is having issues seeing the recorded session?
This is probably a dumb question but are there any data sciencey or tensorflowy things that can be done faster on a quantum computer?
I think your question is excellently phrased. The answer for anything data science-y is "no." The bottleneck will be transferring the input data onto the quantum CPU.
For algorithms like HHL that have superclassical performance, a complex superposition encoding the data needs to be created first. This state is subsequently "consumed" by the algorithm. The no-cloning theorem forbids creating copies of the encoded state, and hence the encoding step needs to be repeated every time the algorithm is run.
For another example, consider Grover's search that is sub-linear in calls to an oracle function. If the oracle references a linear array of data, for example, it needs to work on superpositions of array indices. In other words, the entire dataset needs to fit in "quantum" memory.
Using a quantum cpu can only be sensible for computationally difficult problems where the hard problem instances can be specified by a relatively small number of bits.
I dont super follow this area, so i might be totally off base, but i think lots of the hopes for that sort of thing was based around the HHL algorithm, but then Tang showed that normal computers can be just as fast doing that problem, so now its up in the air a bit how applicable wuantum computers are
But i really dont know much about this area, might be totally wrong. I'm kind of basing this off this blog post
https://www.scottaaronson.com/blog/?p=3880
Small correction, Tang's classical algorithm considers only low rank matrices, HHL still is more efficient for higher rank matrices.
Wow, that guy is 18 years old!
Ewin Tang is a female.
Also, she's 20.
She was 18 at the time she discovered this algorithm, which in context seems to be what is relevant.
> Ewin Tang is a female.
How do you define "female"?
https://www.google.com/search?q=female&ie=UTF-8&oe=UTF-8&hl=...
I know how to use google, thanks. But tephra is a) thinking of a different definition, b) used the term by mistake or c) is just wrong.
This is not the place for this. Maybe Ctrl+tab to twitter instead?
I was just curious about the unusual choice of words.
You surely must be trolling
Reading "Ewin Tang is a female" instead of "Ewin Tang is a woman" is what made me look into it, really. It seemed a deliberate choice and I wondered if it was related to a gender change from woman to man. Of course, that's completely irrelevant to the subject of quantum computing.
There are some basic linear algebra subroutines (Matrix inversion, finding eigenvalues & eigenvectors) that can be performed with an exponential speedup on a quantum computer in theory, that's why there is so much interest in Quantum Machine Learning. If you are asking about the current hardware level, then no, current quantum computers can not solve any practical problem faster than a classical computer.
In theory classical computers are also not limited to have better solutions to problems where quantum computers claim superiority like prime factorisation or like Tang's quantum inspired classical algorithm that beats HHL for low rank matrices.
> There are some basic linear algebra subroutines (Matrix inversion, finding eigenvalues & eigenvectors) that can be performed with an exponential speedup on a quantum computer in theory
Eh... those particular subroutines have polynomial time algorithms already on a classical computer.
You can't exponentially speed up something that's polynomial time already.
https://quantumalgorithmzoo.org/
lists algorithms, speedups, and descriptions.
That's a great list, thanks!
(Though for the benefit of readers here, the list doesn't include any "basic linear algebra subroutines (Matrix inversion, finding eigenvalues & eigenvectors)").
The "linear systems" and "machine learning" algorithm paragraphs under "Optimization, Numerics, & Machine Learning" reference a number of resources in regards to currently understood limits of and applications for quantum computers and linear optimization.
Can past sessions be downloaded/re-watched?
is anyone attending?
They given time for GMT 6:30 AM..still waiting for the feed to start
I’m joining in too