Tap Next (or use your arrow keys) to move one idea at a time. A fixed three-question check waits at the end: the course's own checkpoint, same questions every attempt. The ← up top exits whenever you like; progress keeps.
Hamiltonian simulation
Methods include product formulas, Taylor-series and linear-combination techniques, qubitization, and signal processing. Cost depends on sparsity, norm, locality, precision, and oracle access.
Hamiltonian simulation is a foundational primitive for scientific applications.
Amplitude estimation
Quantum amplitude estimation can provide a quadratic improvement in precision scaling relative to Monte Carlo under appropriate assumptions. Fault-tolerant variants may reduce constants or avoid a full quantum Fourier transform.
The advantage is attractive for risk and simulation but depends on coherent depth and state preparation.
Linear systems and quantum walks
HHL-type algorithms can produce a quantum state proportional to a linear-system solution under restrictive conditioning, sparsity, input, and output assumptions. Quantum walks underpin search and graph algorithms.
Elegant asymptotic speedups may not translate into full classical outputs.
Applied activity
Advanced exercise: derive or simulate one representative result from this module, document assumptions, and produce a one-page technical interpretation for a non-specialist decision maker.
레슨 전체 텍스트 읽기
1. Hamiltonian simulation
Methods include product formulas, Taylor-series and linear-combination techniques, qubitization, and signal processing. Cost depends on sparsity, norm, locality, precision, and oracle access.
Hamiltonian simulation is a foundational primitive for scientific applications.
2. Amplitude estimation
Quantum amplitude estimation can provide a quadratic improvement in precision scaling relative to Monte Carlo under appropriate assumptions. Fault-tolerant variants may reduce constants or avoid a full quantum Fourier transform.
The advantage is attractive for risk and simulation but depends on coherent depth and state preparation.
3. Linear systems and quantum walks
HHL-type algorithms can produce a quantum state proportional to a linear-system solution under restrictive conditioning, sparsity, input, and output assumptions. Quantum walks underpin search and graph algorithms.
Elegant asymptotic speedups may not translate into full classical outputs.
4. Applied activity
Advanced exercise: derive or simulate one representative result from this module, document assumptions, and produce a one-page technical interpretation for a non-specialist decision maker.
Audio playback uses your device's built-in voice: no downloads, works offline.
