An Overview of Quantum Algorithms
Talkat Near-Term Quantum Computers: Fault Tolerance + Benchmarking + Quantum Advantage + Quantum Algorithms · 2024-04-22..04-26·
summary
Survey of quantum algorithms lists concrete claims and numbers: fault-tolerant Shor-style breaks need roughly 8 hours and 23 million physical qubits for RSA‑2048; time dynamics simulation can range from 10^6 down to 10^3 two‑qubit gate depth depending on product formulas; chemistry and materials work uses VQE, QITE and adiabatic methods and practical circuits of a few thousand gates; generic speedups are often quadratic (Grover/quantum walks) while many apparent exponential gains shrink after classical or quantum‑inspired refinements.
AI-written summary · about
chapters (9)
- 0:00Introduction
- 1:40Taxonomy of algorithms
- 5:23Near-term and fault tolerance
- 9:11Quantum simulation: Static
- 18:56Quantum simulation: Dynamic
- 27:47Cryptographic applications
- 32:34Search and optimization
- 42:13Linear algebra algorithms
- 47:10Benchmarks and conclusion
related talks
01h 02mQuantum Computing Concepts
41mQuantum Computing
28mThe future of computing with Quantum Computing
01h 01mBuilding a Quantum Computer with QLDPC Codes
47mQuantum Computing: The Important Stuff
46mQuantum computing
21mDrug Design on Quantum Computers - a (Fact Based, Zero Hype) Perspective
25mCrypto's Quantum Leap: Blockchain vs Quantum Computer