![Elucyda](/img/default-banner.jpg)
- 231
- 896 788
Elucyda
Australia
Приєднався 25 вер 2016
Elucidating mathematics & physics. Created by Konstantin Lakic
Quantum Cryptanalysis Part 4: Quantum Search and Quantum Counting Algorithm
Identify cybersecurity threats posed by quantum cryptanalysis.
ua-cam.com/play/PLl0eQOWl7mnVdJYDxopo_kDi_ZGaT4pv9.html
ua-cam.com/play/PLl0eQOWl7mnVdJYDxopo_kDi_ZGaT4pv9.html
Переглядів: 505
Відео
Quantum Cryptanalysis Part 3: Discrete Logarithm Quantum Algorithm
Переглядів 177Місяць тому
Identify cybersecurity threats posed by quantum cryptanalysis. ua-cam.com/play/PLl0eQOWl7mnVdJYDxopo_kDi_ZGaT4pv9.html
Quantum Cryptanalysis Part 2: Order-Finding Quantum Algorithm
Переглядів 2262 місяці тому
Identify cybersecurity threats posed by quantum cryptanalysis. ua-cam.com/play/PLl0eQOWl7mnVdJYDxopo_kDi_ZGaT4pv9.html
Quantum Cryptanalysis Part 1: Order-Finding and Discrete Logarithms are Hidden Subgroup Problems
Переглядів 3112 місяці тому
Identify cybersecurity threats posed by quantum cryptanalysis. ua-cam.com/play/PLl0eQOWl7mnVdJYDxopo_kDi_ZGaT4pv9.html
Generalized Discrete Logarithm based Public-Key Cryptosystem Part 2 - Digital Signature Scheme
Переглядів 1553 місяці тому
Public-key cryptosystems based on the computational hardness of discrete logarithms are vulnerable to quantum cryptanalysis. Post-Quantum Cryptography Playlist: ua-cam.com/play/PLl0eQOWl7mnWHLxK_AcbvwoULRfgvS0CB.html
Generalized Discrete Logarithm based Public-Key Cryptosystem Part 1 - Asymmetric Encryption
Переглядів 1583 місяці тому
Public-key cryptosystems based on the computational hardness of discrete logarithms are vulnerable to quantum cryptanalysis. Post-Quantum Cryptography Playlist: ua-cam.com/play/PLl0eQOWl7mnWHLxK_AcbvwoULRfgvS0CB.html
Post-Quantum Cryptography: Lattice based Digital Signature Scheme
Переглядів 6733 місяці тому
Let's construct a digital signature scheme based on the computational hardness of lattice problems, such as Module-LWE. This is unlikely to be vulnerable to classical or quantum cryptanalysis and is one option for post-quantum digital signatures. Post-Quantum Cryptography Playlist: ua-cam.com/play/PLl0eQOWl7mnWHLxK_AcbvwoULRfgvS0CB.html
Post-Quantum Cryptography: Module Learning with Errors (Module-LWE) based Public Key Cryptosystem
Переглядів 7533 місяці тому
Let's construct a public-key cryptosystem based on the computational hardness of Module-LWE. This is unlikely to be vulnerable to classical or quantum cryptanalysis and is one option for post-quantum cryptography. Post-Quantum Cryptography Playlist: ua-cam.com/play/PLl0eQOWl7mnWHLxK_AcbvwoULRfgvS0CB.html
Discrete Logarithm based Public-Key Cryptosystem: Diffie-Hellman Key Exchange & ElGamal Encryption
Переглядів 5074 місяці тому
The mathematics behind the Diffie-Hellman key exchange underpins ElGamal encryption. The ElGamal public-key cryptosystem is based on the computational hardness of discrete logarithms, so it is vulnerable to quantum cryptanalysis. Post-Quantum Cryptography Playlist: ua-cam.com/play/PLl0eQOWl7mnWHLxK_AcbvwoULRfgvS0CB.html
Integer Factorization based Public-Key Cryptosystem: RSA Encryption & Shor's Factoring Algorithm
Переглядів 7684 місяці тому
The RSA public-key cryptosystem is based on the computational hardness of integer factorization, so it is vulnerable to quantum cryptanalysis using Shor's factoring algorithm. Post-Quantum Cryptography Playlist: ua-cam.com/play/PLl0eQOWl7mnWHLxK_AcbvwoULRfgvS0CB.html
Elucidating the Quantum Search Algorithm Part 3 - Matrix Representations of Reflections & Rotations
Переглядів 3785 місяців тому
Explore matrix representations for the quantum search algorithm, which are constructed using an orthonormal basis consisting of the orthogonal and target superpositions. Find more quantum algorithm diagrams on Patreon: patreon.com/user?u=83490112 Elucidating Quantum Algorithms for Cybersecurity: ua-cam.com/play/PLl0eQOWl7mnXsF7WF5ZINbvyR3bFeBNKk.html Konstantin Lakic
Elucidating the Quantum Search Algorithm Part 2 - Amplitude Amplification & Grover's Algorithm
Переглядів 2756 місяців тому
Explore amplitude amplification in the quantum search algorithm, which generalizes Grover's algorithm to account for multiple targets of search. Find more quantum algorithm diagrams on Patreon: patreon.com/user?u=83490112 Elucidating Quantum Algorithms for Cybersecurity: ua-cam.com/play/PLl0eQOWl7mnXsF7WF5ZINbvyR3bFeBNKk.html Konstantin Lakic
Elucidating the Quantum Search Algorithm Part 1 - Oracle Marks Target Computational Basis States
Переглядів 4376 місяців тому
Explore the properties of the oracle in the quantum search algorithm, which distinguishes targets of search from non-targets. Find more quantum algorithm diagrams on Patreon: patreon.com/user?u=83490112 Elucidating Quantum Algorithms for Cybersecurity: ua-cam.com/play/PLl0eQOWl7mnXsF7WF5ZINbvyR3bFeBNKk.html Konstantin Lakic
Elucidating the Quantum Counting Algorithm (Applying Phase Estimation to Quantum Search)
Переглядів 1,2 тис.8 місяців тому
Explore the quantum counting algorithm with detailed mathematical descriptions of the quantum state at 4 key stages, including initialization, creating superposition, applying the sequence of controlled unitary gates and applying the inverse quantum Fourier transform. Download JPEG, PNG and PDF versions of the diagrams in this video on Patreon: patreon.com/user?u=83490112 Elucidating Quantum Al...
Elucidating the Quantum Fourier Transform Tensor Product Definition
Переглядів 3358 місяців тому
Explore the quantum Fourier transform with example diagrams for 1, 2, 3 and 4 qubits including detailed mathematical descriptions of the quantum state. Download JPEG, PNG and PDF versions of the diagrams in this video on Patreon: patreon.com/user?u=83490112 Elucidating Quantum Algorithms for Cybersecurity: ua-cam.com/play/PLl0eQOWl7mnXsF7WF5ZINbvyR3bFeBNKk.html Konstantin Lakic
Elucidating the Quantum Order-Finding Algorithm (Subroutine of Shor's Prime Factorization Algorithm)
Переглядів 4838 місяців тому
Elucidating the Quantum Order-Finding Algorithm (Subroutine of Shor's Prime Factorization Algorithm)
Elucidating the Quantum Phase Estimation Algorithm (Exact Case)
Переглядів 5179 місяців тому
Elucidating the Quantum Phase Estimation Algorithm (Exact Case)
Alternative Quantum Teleportation Protocol Without Measurement in Sending Subroutine
Переглядів 3059 місяців тому
Alternative Quantum Teleportation Protocol Without Measurement in Sending Subroutine
Elucidating Quantum Teleportation and Superdense Coding
Переглядів 8189 місяців тому
Elucidating Quantum Teleportation and Superdense Coding
3-Qubit Inverse Quantum Fourier Transform in Quantum Order-Finding Examples with N=15
Переглядів 1,1 тис.11 місяців тому
3-Qubit Inverse Quantum Fourier Transform in Quantum Order-Finding Examples with N=15
Quantum Order-Finding Example N=15 Part 3: Quantum Algorithm for a=7
Переглядів 79511 місяців тому
Quantum Order-Finding Example N=15 Part 3: Quantum Algorithm for a=7
Quantum Order-Finding Example N=15 Part 2: Quantum Algorithm for a=11
Переглядів 61111 місяців тому
Quantum Order-Finding Example N=15 Part 2: Quantum Algorithm for a=11
Quantum Order-Finding Example N=15 Part 1: Eigenstates & Eigenvalues of U for a=11,7
Переглядів 95111 місяців тому
Quantum Order-Finding Example N=15 Part 1: Eigenstates & Eigenvalues of U for a=11,7
Shor's Factoring Algorithm Order Finding Examples for Prime Factorization of 15 and 21
Переглядів 3,4 тис.11 місяців тому
Shor's Factoring Algorithm Order Finding Examples for Prime Factorization of 15 and 21
Quantum Period-Finding Algorithm, Order-Finding, Phase Estimation, Modular Exponentiation
Переглядів 1,1 тис.11 місяців тому
Quantum Period-Finding Algorithm, Order-Finding, Phase Estimation, Modular Exponentiation
Quantum Order-Finding Subroutine of Shor's Factoring Algorithm, Phase Estimation Quantum Circuit
Переглядів 1,7 тис.11 місяців тому
Quantum Order-Finding Subroutine of Shor's Factoring Algorithm, Phase Estimation Quantum Circuit
Inverse n-qubit Quantum Fourier Transform and Phase Estimation Quantum Circuit
Переглядів 1,9 тис.Рік тому
Inverse n-qubit Quantum Fourier Transform and Phase Estimation Quantum Circuit
Quantum Fourier Transform Matrix Representation, Roots of Unity, Discrete Fourier Transform
Переглядів 2 тис.Рік тому
Quantum Fourier Transform Matrix Representation, Roots of Unity, Discrete Fourier Transform
Shor's Factoring Algorithm, Reducing Prime Factorization to an Order-Finding Problem
Переглядів 3,1 тис.Рік тому
Shor's Factoring Algorithm, Reducing Prime Factorization to an Order-Finding Problem
Quantum Circuit Diagram Examples for Quantum Fourier Transform, Tensor Product Representation
Переглядів 1,4 тис.Рік тому
Quantum Circuit Diagram Examples for Quantum Fourier Transform, Tensor Product Representation
❤❤❤
Sir i am from INDIA thanks for this wonderful explanation. I really respect your efforts,Thanks a lot again.
this is very easy to understand
I was teleported to Mars, but thank God I came back.
You've got really good skills at explaining. Great video :)
Thanks, those concepts becomes more clearer
Wouldn't that be the Kronecker Product at the start rather than the tensor product? Or are they the same thing.
This is the greatest and most clear explanation of teleportation circuit on interney❤ I have exams tomorrow, that's for this❤
Stop parotting and think on your own. Complex numbers is fake invented math because (1) the definition of a complex number contradicts to the laws of formal logic, because this definition is the union of two contradictory concepts: the concept of a real number and the concept of a non-real (imaginary) number-an image. The concepts of a real number and a non-real (imaginary) number are in logical relation of contradiction: the essential feature of one concept completely negates the essential feature of another concept. These concepts have no common feature (i.e. these concepts have nothing in common with each other), therefore one cannot compare these concepts with each other. Consequently, the concepts of a real number and a non-real (imaginary) number cannot be united and contained in the definition of a complex number. The concept of a complex number is a gross formal-logical error; (2) the real part of a complex number is the result of a measurement. But the non-real (imaginary) part of a complex number is not the result of a measurement. The non-real (imaginary) part is a meaningless symbol, because the mathematical (quantitative) operation of multiplication of a real number by a meaningless symbol is a meaningless operation. This means that the theory of complex number is not a correct method of calculation. Consequently, mathematical (quantitative) operations on meaningless symbols are a gross formal-logical error; (3) a complex number cannot be represented (interpreted) in the Cartesian geometric coordinate system, because the Cartesian coordinate system is a system of two identical scales (rulers). The standard geometric representation (interpretation) of a complex number leads to the logical contradictions if the scales (rulers) are not identical. This means that the scale of non-real (imaginary) numbers cannot exist in the Cartesian geometric coordinate system.
A constant specific heat c v0 ideal gas is a perfect gas not an ideal gas.ideal gas only obey the ideal gas lawthat is Z is 1
I think you missed h bar in defining omega and that make differnce in the unit of the final hamitonian (energy) equation
great video, how would these equations look in cgs?
Thanks man
You are good
Very clear and informative thanks!
Thanks
Hey dude why do you subtract the two matrices for the second part of the matrix combination?
Wonderful explanation! Thank you. - Looks like these omega’s, or frequencies, correspond to the roots of Unity on the Argonne diagram?
Wow - so clear, and so much passion! From the video, I believe you consider entanglement to be synonymous with superposition? There is no qubit correlation without entanglement, so therefore no encoding of the ‘problem’ in the qubits. So the qubits are encoded, entangled, superimposed, in the Hadamard stage? Are you familiar with Fourier epicycles? Do you think looking at this process using the Argonne diagram and Fourier epicycles might clarify these steps? Thank you so much!
Very clear presentation. Best video on quantum teleportation
thank you so much, this was such a clear explanation !!
Your hand writing is one of the best I've seen!
Awesome explanation. Thank you for the video.
Love u man!!! thanks a million!!! <3
Wow! That was an mind-blowing explanation. Crystal clear. Thanks!
when i hear 2pi i see the unit circle. :)
Are you missing 1/C and 1/(N-C) in the projection definitions?
Hidden? The Pascal triangle is basically defined as the repeated convolution of 1 with 11.
clear and great explinations!
Thank you from India
Great explanation I wish there would be more of it like em waves in different media and boundary conditions and all that.... Thanks anyways
Thankyou
Thank you for the great explanation. I made a mobile phone app realizing Shor's algorithm based on this lecture. I gained a deeper understanding of Shor's Algorithm using this app, even though it is for small integers.
I smelled burned bacon, the hole video. 😅
stationary state is not time dependent?😊
thnxxx brother....
🫡
This is the real step-by-step explanation <3
You had saved my final term
This channel is criminally underrated
I see what you are doing here and I think this is amazing. You really start from the ground up. For anybody who came this far I can say: Guys, if you are looking for a guide into quantum physics without much experience in abstract math, then you found it. Just make sure to pay attention.
I really love your explanations
Excellent!!!! Thank you 🙏🏼
Thank you so much for explaining it so clearly, i was very lost until I found your video. Thank you very much!!
Well explained
Well said. Good video.
Thank you so much for this
Can you make a lecture on Entanglement entropy?
👍🏇