On quantum computing and quantum complexity theory:
Scott Aaronson, Quantum computing, postselection, and probabilistic polynomial-time, Proceedings of the Royal Society A 461 2063 (2005) 3473–3482 [doi:10.1098/rspa.2005.1546, arXiv:quant-ph/0412187]
Scott Aaronson, Quantum Computing Since Democritus, Lecture notes (2006) [web]
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, Brussels (May 2022) [arXiv:2209.06930, slides: ppt]
On the quantum complexity theory of a kind of permutational quantum computing:
On quantum information theory:
Scott Aaronson, Introduction to Quantum Information Science (2018) [pdf, webpage]
Introduction to Quantum Information Science II (2022) [pdf]
On the Ryu-Takayanagi formula:
Last revised on February 17, 2025 at 08:41:56. See the history of this page for a list of all contributions to it.