Technologie / Logiciels & Algorithmes
Les algorithmes à connaître
Ce que fait chaque grand algorithme quantique, pourquoi il est important, et — parce que ce site refuse de passer cela sous silence — une vérification de la réalité pour chacun d'entre eux.
| Algorithme / famille | Ce qu'il fait | Pourquoi c'est important | Vérification de la réalité |
|---|---|---|---|
| Shor's algorithm | Factors integers and solves discrete logarithms efficiently on a fault-tolerant quantum computer | Threatens RSA and elliptic-curve public-key cryptography | Requires a large, reliable machine not available today |
| Grover's algorithm | Searches an unstructured space with roughly quadratic query improvement | Broad conceptual applicability | Quadratic, not exponential; data loading and constants matter |
| Quantum simulation | Models quantum dynamics, energies, and molecular properties | Natural fit for chemistry and materials | Useful scale requires error correction for many high-value tasks |
| Variational algorithms | Hybridly optimizes parameterized circuits | Designed for shallow circuits | Performance can be limited by noise, optimization difficulty, and classical competition |
| Quantum phase estimation | Estimates eigenvalues such as molecular energies | Core primitive for fault-tolerant simulation | Deep and resource-intensive |
| Amplitude estimation | Estimates probabilities with theoretical quadratic improvement | Potential use in risk and Monte Carlo-type problems | Fault-tolerant resource needs may be substantial |
| Quantum optimization heuristics | Searches for good combinatorial solutions | Logistics, scheduling, portfolios, networks | No general guarantee of practical advantage |
The recurring mistake
Comparing a quantum prototype with naive brute force. The proper benchmark is the best available classical algorithm running on appropriate hardware. Including GPUs, specialized solvers, approximation methods, and problem-specific heuristics. Every advantage claim on this site is read against that bar; the full checklist is on Evaluating claims.
Deeper treatments
The Academy's intermediate course walks Grover, phase estimation and Shor at circuit level (Canonical Quantum Algorithms) and the variational family with its trainability caveats (Variational and Hybrid Algorithms). The advanced course covers Hamiltonian simulation, amplitude estimation, linear systems and dequantization (Advanced Algorithms, Algorithmic Complexity).
Aller plus loin (5 minutes chacun)
Vous voulez que ça reste gravé ? Le cours intermédiaire de l'Académie transforme ces tableaux en une intuition des circuits pleinement opérationnelle.
Commencer les leçons ludiques → Gratuit · pas de notes, pas de pression · quiz ludiques avec tentatives illimitées