Amazing video! Completely followable, understandable. Not too much handwaving and on topic. Also the ambient music just helps keep you focused. Thanks for the post going to jump through all of your videos. Please keep these videos up!
Whyyyyyy.... why ending so soon... Dear Jin, 7 is too early. Please take it to atleast 20... Very nice explanation Jin. You've got yourself a fan here. Will miss the friday excitement though.
@@jin-sungkim8492 Absolutely! I have a small request. QNLP is a less talked about topic. If a part of next season can include that, I guess more masses will know how to apply QC to various AI problems. Just a suggestion, if it seems feasible to you guys.
Nooo..!!! Why did you end this at the fifteen minute mark?? I watched this video twice to make it longer. Excellent content. Please make more of these. Cheers!
Is there anywhere where I can look up how to get that modular exponentiation function with quantum gates for any given N, a? How does that even work? All I find are examples that give no explanation whatsoever...
Because its all a hoax - Shors Algorithm is simply a way to solve the problem with less guesses. And it doesn't need a quantum computer. Two laser light beams would do it too (if you could get their frequencies a bit better set-up).
@@user_375a82 You obviously do not understand the problem lol. But that's okay, the field is still new and people are still having the classical mindset. The algorithm is specifically made for a QM and if you knew how QM hardware works, you'd be aware that it would be indeed more efficient than algorithms on classical computers. We haven't reached that point (yet), but we're getting there. Simply calling it a "hoax" is a pretty strong statement, especially when pretty much all of the scientists in that field will disagree with you and show you the proper papers that show that you're wrong. Specifically, it takes quantum gates of order {\displaystyle O\!\left((\log N)^{2}(\log \log N)(\log \log \log N) ight)} using fast multiplication, thus demonstrating that the integer factorization problem can be efficiently solved on a quantum computer and is consequently in the complexity class BQP. This is almost exponentially faster than the most efficient known classical factoring algorithm, the general number field sieve, which works in sub-exponential time.
Now you can convery the unitary to a gate and then append the controlled version to a new circuit: U_gate = U.to_gate() qc.append(U_gate.control(1), qr)
Thanks for this excellent video, yet I ran into a problem while using AerSimulator: There is an error: AerError: 'unknown instruction: cU(1)' while simulating the distribution of a circuit with a gate "U". Is there something I'm doing wrong? thanks!!
from qiskit.aqua.algorithms import Shor from qiskit.aqua import QuantumInstance import numpy as np from qiskit import QuantumCircuit, Aer, execute from qiskit.tools.visualization import plot_histogram
Hey Jin, so you touched on the topic of creating the U gate efficiently using a few swaps. For any other a and N, are there any general ways to compute the U gate or any specific references I can look up for this? Thanks!
Yeah, a bunch of things have moved around. Use ctr+f or scroll down this link for some info on the new system: qiskit.org/documentation/stable/0.28/aqua_tutorials/Qiskit%20Algorithms%20Migration%20Guide.html
Jin-Sung Kim, Phd, how are you ok? I hope so. I've been watching your videos about qiskit and I first congratulate you on your teaching and knowledge on the topic. I'm Professor Joseval Santana, Phd, and I'm doing work on Shor's algorithm. To this end, I am trying to implement the Oracle for factoring any value of N (number to be factored) and any value of a (guess), I would like your help, if possible, in this part. I await your response and thank you in advance.
To obtain the final result as 3 and 5, greatest common divisor is used; gcd(p,N) = gcd((a^(r/2)-1),N) = gcd(48,15) = 3 gcd(q,N) = gcd((a^(r/2)+1),N) = gcd(50,15) = 5
I am seeing: """ quantum_instance = QuantumCircuit(backend, shots=1000) TypeError: __init__() got an unexpected keyword argument 'shots' """ Is Pycharm version different from Jupyter?
Amazing video! Completely followable, understandable. Not too much handwaving and on topic. Also the ambient music just helps keep you focused.
Thanks for the post going to jump through all of your videos. Please keep these videos up!
over too soon :(( thanks so much jin and qiskit! cant wait for season 3 🤩
Thanks for watching!! Let us know what you would want to see for next season 🤞
Wow this was actually a very useful resource, 2 methods the library one and a handmade implementation. Great video
Jin...Amaaazing again, last episode already? I cant wait for next season then! stay cool and best from Amsterdam cosy west side...
Thanks so much for tuning in each week! Hope you enjoyed this season!
Whyyyyyy.... why ending so soon... Dear Jin, 7 is too early. Please take it to atleast 20...
Very nice explanation Jin. You've got yourself a fan here. Will miss the friday excitement though.
🤩thanks for tuning in each week!! Glad you enjoyed the series! We might have to bump up the number of episodes for next season then 👀
@@jin-sungkim8492 Absolutely! I have a small request. QNLP is a less talked about topic. If a part of next season can include that, I guess more masses will know how to apply QC to various AI problems. Just a suggestion, if it seems feasible to you guys.
Nooo..!!! Why did you end this at the fifteen minute mark?? I watched this video twice to make it longer. Excellent content. Please make more of these. Cheers!
Great content!
Thank you!!
Nice video! Especially as it was nice an quisk!
Is there anywhere where I can look up how to get that modular exponentiation function with quantum gates for any given N, a? How does that even work? All I find are examples that give no explanation whatsoever...
Because its all a hoax - Shors Algorithm is simply a way to solve the problem with less guesses. And it doesn't need a quantum computer.
Two laser light beams would do it too (if you could get their frequencies a bit better set-up).
ruclips.net/video/IFmkzWF-S2k/видео.html
About the minute 50 is the thing that you're looking for
@@user_375a82 You obviously do not understand the problem lol. But that's okay, the field is still new and people are still having the classical mindset. The algorithm is specifically made for a QM and if you knew how QM hardware works, you'd be aware that it would be indeed more efficient than algorithms on classical computers. We haven't reached that point (yet), but we're getting there. Simply calling it a "hoax" is a pretty strong statement, especially when pretty much all of the scientists in that field will disagree with you and show you the proper papers that show that you're wrong. Specifically, it takes quantum gates of order {\displaystyle O\!\left((\log N)^{2}(\log \log N)(\log \log \log N)
ight)} using fast multiplication, thus demonstrating that the integer factorization problem can be efficiently solved on a quantum computer and is consequently in the complexity class BQP. This is almost exponentially faster than the most efficient known classical factoring algorithm, the general number field sieve, which works in sub-exponential time.
why is the a_mod15 function hardcoded for 7 and 15, i dont understand the logic, and if i want to use any N or a, how could i change the code ?
how do you fix this now that .control() is deprecated?
Now you can convery the unitary to a gate and then append the controlled version to a new circuit:
U_gate = U.to_gate()
qc.append(U_gate.control(1), qr)
Thanks for this excellent video, yet I ran into a problem while using AerSimulator:
There is an error: AerError: 'unknown instruction: cU(1)' while simulating the distribution of a circuit with a gate "U".
Is there something I'm doing wrong?
thanks!!
My guess is that you have a newer version of qiskit than what was used here.
Can we combine normal encryption like chaos with quantum encryption?
How is calculating the greatest common denominator between two numbers easier than factoring the number?
from qiskit.aqua.algorithms import Shor
from qiskit.aqua import QuantumInstance
import numpy as np
from qiskit import QuantumCircuit, Aer, execute
from qiskit.tools.visualization import plot_histogram
Hey Jin, so you touched on the topic of creating the U gate efficiently using a few swaps. For any other a and N, are there any general ways to compute the U gate or any specific references I can look up for this? Thanks!
great question, check out this reference! arxiv.org/pdf/quant-ph/0205095.pdf
@@jin-sungkim8492 Thanks :)
Yes, even I wanted to know the same, if you have got any reference please do share; Thanks
I have an annoying error when trying to import: ImportError: cannot import name 'Shor' from 'qiskit.algorithms'. can someone explain?
Same error. Did you find out the solution for it?
Shor is depreciated now, why? Ask to them
Did the built in Shor algorithm move from aqua in the qiskit 0.34.2?
Yeah, a bunch of things have moved around.
Use ctr+f or scroll down this link for some info on the new system:
qiskit.org/documentation/stable/0.28/aqua_tutorials/Qiskit%20Algorithms%20Migration%20Guide.html
@@quoipi Thanks a lot.
Incredible
Are the code examples you used available somewhere?
why we used the swap gates?
Brilliant
Clean video haha how did you show the graphical interface?
So if you return photo-radioactive constants you can cache those back into your code.
Very interesting, but I just can't figure out how the tensor algebras are working behind it.
Check out qiskit.org/textbook/ch-algorithms/shor.html for a more detailed breakdown of Shor's Algorithm
Jin-Sung Kim, Phd, how are you ok? I hope so. I've been watching your videos about qiskit and I first congratulate you on your teaching and knowledge on the topic. I'm Professor Joseval Santana, Phd, and I'm doing work on Shor's algorithm. To this end, I am trying to implement the Oracle for factoring any value of N (number to be factored) and any value of a (guess), I would like your help, if possible, in this part.
I await your response and thank you in advance.
i have an error in first step is that cannot import name Shor
Shor is depreciated now, why, ask to IBM Quantum.
Waiting for the next season
Note: cu1 is deprecated use cp instead!!!
I can factor 15 too. Am I a quantum computer?
yes, U R
Well explained sir can you please teach us how to solve ecdlp on quantum
14:56 ? The example is way too basic
What would be next episode?
Are you shor? I mean, how can you be if it's encrypted? Primal?
waaaaaaat? 48 is 3 and 50 is 5 .... I didnt get any thing
To obtain the final result as 3 and 5, greatest common divisor is used;
gcd(p,N) = gcd((a^(r/2)-1),N) = gcd(48,15) = 3
gcd(q,N) = gcd((a^(r/2)+1),N) = gcd(50,15) = 5
I am seeing:
"""
quantum_instance = QuantumCircuit(backend, shots=1000)
TypeError: __init__() got an unexpected keyword argument 'shots'
"""
Is Pycharm version different from Jupyter?
ShoRr Enuff🙀⚖️⚜️🖖
I don't like limp biscuit, I much prefer to pimp quiskit!
waiting for a 1000 Qubit computer;; to run this and crack the net (evil smile)
IBM already have a 1000 qubit quantum processor, they now want a supercomputer with 100,000 qubits until 2033, stay tunned.
Hi