nLab Scott Aaronson

• webpage

Selected writings

On quantum information theory:

• Scott Aaronson, Introduction to Quantum Information Science (2018) [pdf, webpage]

  Introduction to Quantum Information Science II (2022) [pdf]

On quantum complexity theory:

• Scott Aaronson, Quantum computing, postselection, and probabilistic polynomial-time, Proceedings of the Royal Society A, Volume 461, Issue 2063, pages 3473–3482, 08 November 2005. (doi:10.1098/rspa.2005.1546, arXiv:quant-ph/0412187)

On complexity theoretic aspects of quantum supremacy:

• Scott Aaronson, Lijie Chen, Complexity-Theoretic Foundations of Quantum Supremacy Experiments, CCC ‘17: Proceedings of the 32nd Computational Complexity Conference (2017) 22 1–67 [arXiv:1612.05903, doi;10.5555/3135595.3135617]

• Scott Aaronson, How Much Structure Is Needed for Huge Quantum Speedups?, talk at: 28th Solvay Physics Conference in Brussels on May 21, 2022 [arXiv:2209.06930, slides: ppt]

On the Ryu-Takayanagi formula:

• Scott Aaronson, Jason Pollack, Discrete Bulk Reconstruction [arXiv:2210.15601]

Related entries

• quantum computation

category: people