Quantum computing examples with QISKit.
-
Updated
Mar 14, 2025 - Python
Quantum computing examples with QISKit.
Provider-neutral educational lab for Shor's algorithm, RSA quantum risk and post-quantum cryptography.
CHAOS Quantum Simulator: Breakthrough 20-qubit simulation with only 24MB memory. GPU-accelerated Shor's algorithm, Grover's search, QFT implementation. 1000x more efficient than traditional simulators.
Shor's quantum order-finding arithmetic kernel utilizing continued fractions expansion and convergent analysis for RSA integer factorization.
Shor's quantum order-finding arithmetic kernel utilizing continued fractions expansion and convergent analysis for RSA integer factorization.
Cuatro modulos de criptografia -cuantica, post-cuantica, caotica y entropia fisica- implementados, medidos y verificados: BB84, ML-KEM/ML-DSA sobre liboqs, cifrado por caos determinista y extraccion de entropia de ruido de detector.
Demonstrating Shor's and Grover's algorithms against classical cryptographic primitives.
Do we really need quantum computing? A runnable essay: one matrix-free dial — the effective rank Φ₁ — flags which quantum speedups survive a classical attack, and which were never quantum at all.
A faster implementation of Shor's algorithm in Qiskit.
The tool analyzes actual data flows to map risk levels and geometrically estimate the time gaps for breaking encryption between classical supercomputers and quantum cracking algorithms (Shor and Grover).
Statistical test for genuine quantum signal in ECDLP cryptanalysis — first "beyond verification filter" datapoint (Quantinuum H2 emulator p≈0.0003, IBM control p≈0.61). Open, reproducible.
Shor-15 order finding on IBM Quantum hardware with Qiskit Runtime, compiled modular multiplication, and classical factor recovery.
To associate your repository with the shor-algorithm topic, visit your repo's landing page and select "manage topics."