From the course: Cloud Quantum Computing Essentials
Join today to access over 25,300 courses taught by industry experts.
Cloud quantum Shor's algorithm: Part 1
From the course: Cloud Quantum Computing Essentials
Cloud quantum Shor's algorithm: Part 1
- [Instructor] Shor's Algorithm is one of the first problems that got people excited about quantum programming, And let's just start diving into it, there are several layers. So, from my repository, you can see the URL here. I've summarized a place for everyone to get started. So the functionality is given some integer, find its prime factors. The key, though, is to do so in what's called polynomial time, and that's a very fancy word for fast solvability. So I've got a reference here from wolf from mathworld. It says an algorithm is said to be solvable in polynomial time if the number of steps required for a given input, blah, blah, blah. Polynomial time algorithms are said to be fast. So it has to do with computability in terms of practicality. So, in plain English, can quantum programming have some applicability to this particular problem? So if we drill in a little bit more there are some constraints, N has to be odd,…
Download courses and learn on the go
Watch courses on your mobile device without an internet connection. Download courses using your iOS or Android LinkedIn Learning app.