O. Important Quantum Papers

A starter shelf, ~thirty papers, book-part by part. Foundations: Einstein–Podolsky–Rosen (1935); Bell (1964, inequalities); Feynman (1982, simulating physics); Deutsch (1985, quantum Turing machine); Shor (1995, code); Grover (1996); Lloyd (1996, universality of simulation). Algorithms: Shor (1994, factoring); Coppersmith (1994, QFT); Kitaev (1995-96, phase estimation/arithmetic); Farhi–Goldstone–Gutmann (2014, QAOA); Peruzzo et al. (2014, VQE); Harrow–Hassidim–Lloyd (2009, HHL); Tang (2019, dequantization). Error correction: Shor (1995); Steane (1996); Knill–Laflamme (1997, conditions); Aharonov–Ben-Or–Kitaev (1997, threshold theorem); Fowler et al. (2012, surface codes practical); Google Quantum AI (2024, Willow below-threshold); Bravyi et al. (2024, qLDPC). Algorithms-era: Gidney–Ekerå (2019) and Gidney (2025) (factoring resources); McClean et al. (2018, barren plateaus). Simulating/verification: Arute et al. (2019, supremacy); Havlíček et al. (2019, kernels); Aaronson–Gunn (2019-20, XEB caveats). Reading method: Ch. 52's three passes; start with the ones your reproduction targets (Ch. 53.2), not chronological order.