Factor composite integers via quantum period finding and classical post-processing.
npx skills add https://github.com/unitarylab/quantum-skills --skill shor
Please help me install this Agent Skill. Skill: shor Source: https://github.com/unitarylab/quantum-skills/tree/main/algorithms/cryptography/shor Command: npx skills add https://github.com/unitarylab/quantum-skills --skill shor
Shor's algorithm factors a given composite integer efficiently by reducing factoring to quantum period finding and classical post-processing.
Use a small factoring example with N=15 using the matrix method to observe factors.
High-intent search queries and answers about installing and using this skill.
Quantum period finding uses Quantum Phase Estimation and Inverse Quantum Fourier Transform to derive the order r, reducing factoring to classical post-processing with continued fractions and gcd to extract factors.
You can factor small integers like N=15 by running a Python pipeline with modular exponentiation circuits, followed by continued fractions and a retry loop to handle challenging cases and extract factors.
Matrix-based modular exponentiation and operator-based modular addition are two circuit implementation methods provided for quantum period finding, offering distinct approaches to building the modular exponentiation step.
This implementation is applicable to educational demonstrations and research prototyping of modular exponentiation and QPE-based period finding, targeting simulations on small integers rather than large-scale factoring.
Quantum factorization may fail on certain attempts due to challenging period results, which is why the pipeline includes a classical retry loop to re-attempt factor extraction using continued fractions and gcd.
Estrella-231Design and execute quantum circuits with simulation and hardware integration.
baratadiegoFit GLMs and GLMMs to ecological data with model selection and diagnostics.
unitarylabSolve linear systems with HHL, LCU, and QSP quantum algorithms.
unitarylabSolve discrete logarithms g^x ≡ y (mod P) with quantum period-finding.
