Shor's Factoring Algorithm, Reducing Prime Factorization to an Order-Finding Problem

Поделиться
HTML-код
  • Опубликовано: 7 ноя 2024

Комментарии • 9

  • @catmatism
    @catmatism 6 дней назад

    Your depth of knowledge is amazing.

  • @jacobvandijk6525
    @jacobvandijk6525 Год назад +2

    Students nowadays are very fortunate with playlists like this. Chapeau!

    • @jacobvandijk6525
      @jacobvandijk6525 Год назад

      Funny to see that your own communication is based on 1's and 0's too ;-)

    • @parmachine470
      @parmachine470 9 месяцев назад

      quantum is morethan 2 @@jacobvandijk6525

  • @yamafu
    @yamafu 4 месяца назад

    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.

  • @LydellAaron
    @LydellAaron 6 месяцев назад

    Wonderful topic.
    Suppose the Order Finding could be accomplished in constant time, then what would be the runtime implication?
    3:26 was very helpful to hear.

  • @roberthuff3122
    @roberthuff3122 3 месяца назад

    I think the NSA took note of this 30 years ago.

  • @dilawaizkhanjadoon5993
    @dilawaizkhanjadoon5993 6 месяцев назад

    Thank you man

  • @imwendima
    @imwendima Год назад

    🤩