1. Mathematical models of classical and quantum mechanics.
2. Correspondence principle and quantization.
3. Classical and quantum computation: gates, circuits, algorithms
(Shor, Grover). Solovay-Kitaev. Some ideas of cryptography
4. Quantum noise and measurement, and rigidity of the Poisson bracket.
5. Noisy classical and quantum computing and error correction, threshold theorem- quantum fault tolerance (small noise is good for quantum computation). Kitaev's surface code.
6. Quantum speed limit/time-energy uncertainty vs symplectic displacement energy.
7. Time-energy uncertainty and quantum computation (Dorit or her student?)
8. Berezin transform, Markov chains, spectral gap, noise.
9. Adiabatic computation, quantum PCP (probabilistically checkable proofs) conjecture
[? under discussion]
10. Noise stability and noise sensitivity of Boolean functions, noisy boson
11. Connection to quantum field theory (Guy?).
Aharonov, D. Quantum computation, In "Annual Reviews of Computational Physics" VI, 1999
Kalai, G., Three puzzles on mathematics computations, and games, Proc. Int
Congress Math 2018, Rio de Janeiro, Vol. 1 pp. 551–606.
Nielsen, M.A., and Chuang, I.L., Quantum computation and quantum information. Cambridge University Press, Cambridge, 2000.
Polterovich, L., Symplectic rigidity and quantum mechanics, European Congress of Mathematics, 155–179, Eur. Math. Soc., Zürich, 2018.
Polterovich L., and Rosen D., Function theory on symplectic manifolds. American Mathematical Society; 2014. [Chapters 1,9]
Wigderson, A., Mathematics and computation, Princeton Univ. Press, 2019.
Sunday, 10 November, 2019 - 14:00 to 16:00
Repeats every week every Sunday until Sat Feb 01 2020 except Sun Dec 29 2019