QSilver36 - Quantum Computing and Programming Workshop organized by QPoland - Day 5 (6.03.2026)

Value of the Information & Strength of the Argument

The video provides a solid, step-by-step explanation of Shor’s algorithm, from the mathematical foundations to the practical implementation. The presenter carefully justifies each step, such as why R must be even and why the condition A^(R/2) ≠ -1 mod N is necessary. The argumentation is logical and builds on previous sessions, making it accessible to those who have followed the workshop. The use of a concrete example (N=15) and a coding demonstration reinforces the theoretical concepts. However, the presentation is somewhat informal and occasionally lacks precision (e.g., ‘short algorithm’ instead of ‘Shor’s algorithm’), and the video is a recording of a live session with potential distractions. Overall, the value of the information is high for learners seeking a practical understanding of Shor’s algorithm.

Scientific Rigor, Source Quality, Title Accuracy

The scientific rigor is generally good, with accurate explanations of the algorithm and its mathematical basis. The presenter correctly describes the classical complexity and the quantum advantage. The sources are limited to the workshop page, which provides context but no external references. The title accurately reflects the content, and the video is well-structured. The lack of formal citations is a minor weakness, but the content itself is reliable and consistent with established quantum computing literature. The presenter also correctly notes the current limitations of quantum computers and the existence of post-quantum cryptography.

The title accurately describes the content: a workshop session on quantum computing and programming, specifically focusing on Shor's algorithm on the final day.

8/10

The video provides a clear and structured explanation of Shor's algorithm, including the mathematical derivation and a practical coding example. The content is technically accurate and consistent with established quantum computing principles. However, the video is a workshop recording with limited production quality, and the presenter occasionally makes minor slips (e.g., 'short algorithm' instead of 'Shor's algorithm'). The sources are limited to the workshop page, but the content itself is reliable.

Markers derived by PSI from the transcript: the creator did not define chapters.

• 00:00Introduction and overview of the session.
• 02:00Explanation of RSA encryption and the factoring problem.
• 05:00Classical complexity of factoring and introduction to Shor's algorithm.
• 10:00Step-by-step procedure of Shor's algorithm: picking A, gcd check, order finding.
• 15:00Post-processing: ensuring R is even and A^(R/2) ≠ -1 mod N.
• 20:00Derivation of the factorization using gcd and the three possible cases.
• 25:00Worked example with N=15, using a spreadsheet to find the period.
• 30:00Discussion of post-quantum cryptography and current limitations.
• 35:00Coding demonstration in Jupyter notebook: factoring 21 with Qiskit.
• 40:00Conclusion and wrap-up of the workshop.

• QSilver36 Workshop Page — Official page for the QSilver36 workshop, providing details about the sessions and materials.

• Shor's algorithm - Wikipedia — Provides a comprehensive overview of Shor's algorithm, confirming the steps and mathematical basis presented in the video.