Scott Aaronson - Quantum Computing, Complexity, and Creativity

Career Trajectory & Early Education

• Aronson earned a GED from New York State at age 15, though he claims no high school diploma was issued due to a missing physical education requirement.
• He spent one year in Hong Kong attending an American international school, where he was forced to skip a grade to match his advanced math proficiency.
• He enrolled in the Clarkson School (a specialized high school program at Clarkson University) to bypass traditional high school curricula and access college-level courses like differential equations.
• Despite being rejected by most colleges, he was accepted by Cornell and Carnegie Mellon, eventually choosing Cornell after state officials granted him an exception to the age-17 GED requirement.
• Aronson completed his PhD by age 22, admitting this accelerated path resulted in social and dating challenges compared to peers, though he views his early unhappiness in high school as a primary motivator for the move.

Academic Philosophy & Specialization

• Aronson advocates for young experts to specialize in extremely narrow problems rather than attempting to master entire fields immediately.
• He notes that "teenagerhood" as a prolonged period of childhood is a modern construction; historically, adolescents functioned as apprentices in trades.
• He emphasizes that his academic success was driven by the ability to pursue deep interests (mathematics and computer science) rather than generalist requirements like the standard five-paragraph essay.
• Aronson identifies the "fundamentals of computing" as the specific intellectual passion he pursued starting at age 16.

Historical Timing of Scientific Discoveries

• Aronson attributes the delay in the development of quantum information science (decades after quantum mechanics was formulated in the 1920s) to several converging factors:
  • Early physicists focused on solving immediate problems like chemistry and particle physics rather than foundational interpretation.
  • World War II diverted key scientists toward the Manhattan Project and Bletchley Park.
  • The theoretical framework of computational complexity (P vs. NP) was not established until the 1960s and 1970s.
• He credits John Bell's 1964 work on inequalities as the pivotal shift that allowed entanglement to be viewed as a resource for information processing rather than a metaphysical paradox.
• Aronson notes that while many foundational ideas were "ripe" in the early 20th century, the intellectual ecosystem required to combine them (quantum theory + computer science) did not exist until later.

Theories on Early Innovation and "Miracle Years"

• Aronson observes that many breakthroughs in physics and mathematics occur in youth (e.g., Einstein's 1905 papers, Newton's work at 22), but cautions that older scientists also contribute significantly later in life.
• He attributes his own reduced research output in his 40s and 50s not necessarily to cognitive decline, but to reduced time due to parenting and a shift in identity away from research being his sole life goal.
• Regarding David Deutsch, Aronson confirms that the Many-Worlds Interpretation was a specific conceptual catalyst for Deutsch's development of the quantum computer model.
• Conversely, Aronson clarifies that Richard Feynman's motivation for quantum computing was practical simulation efficiency, not a specific commitment to Many-Worlds.

Academic Accessibility & Outsider Contributions

• Aronson argues that academia is not necessarily less open to new ideas now; the pre-print server (arXiv) has democratized access, removing the traditional gatekeeping power of journals.
• He cites the mathematician Yitang Zhang as a prime example of a non-academic (working in sandwich shops) producing a major breakthrough in number theory.
• He warns that "autodidacts" often propose flawed solutions to major problems (like P vs. NP), though some genuinely curious outsiders have made valuable contributions.
• Aronson is currently co-authoring a paper with a former industry computer scientist/hobbyist regarding the Busy Beaver function.

The Busy Beaver Function & Mathematical Limits

• The Busy Beaver function ($BB(n)$) defines the maximum number of steps a halting Turing machine of $n$ states can execute; it grows faster than any computable function.
• Known values are extremely sparse: $BB(1)=1$, $BB(2)=6$, $BB(3)=21$, $BB(4)=107$.
• $BB(5)$ is known to be at least 47 million, $BB(6)$ is at least $10^{36,652}$, and $BB(7)$ exceeds $10^{10^{10^{18}}}$.
• Due to Gödel's Incompleteness Theorem, there are specific values of $BB(n)$ (likely around $n=7,500$ or lower) that are true but unprovable within standard Zermelo-Fraenkel set theory (ZFC).
• In 2016, Aronson and student Adam Yedidia constructed a Turing machine with 7,918 states that halts if ZFC is inconsistent; a hobbyist later optimized this to under 800 states.
• Aronson argues that while humanity can extend set theory with "large cardinal axioms" to prove more values, the process is never systematic, as any such system would itself be subject to incompleteness.

Future of Quantum Algorithms

• Aronson suggests that no fundamentally new quantum algorithms as significant as Shor's or Grover's have been discovered in the 25 years since they were found.
• He posits that Shor's and Grover's algorithms represent the "basic motifs" or "low-hanging fruit" of quantum computing, similar to dynamic programming in classical algorithms.
• He notes that while generalizations and applications abound, new fundamental algorithms will likely require the identification of new, previously unimagined problems rather than just better optimization of existing ones.
• Specific open problems with potential for quantum speedups include calculating the edit distance between strings (e.g., for DNA alignment).

Complexity Theory in Economics

• Aronson highlights the 2006 result proving that computing a Nash equilibrium is PPAD-complete, meaning it is as hard as finding a solution to a class of problems guaranteed to exist but computationally intensive.
• He distinguishes between "lack of knowledge" (information asymmetry) and "lack of computational ability" (intractability), noting that economic models often struggle to integrate the latter.
• The hardness of finding Nash equilibria implies that real-world markets may not reach equilibrium efficiently, even if one mathematically exists.

Creativity and Universal Explanations

• Aronson is skeptical of the notion of an "algorithm for creativity," viewing the term as oxymoronic; if it were algorithmic, the output would cease to be creative.
• He acknowledges a qualitative threshold in human cognitive abilities (language, writing, universal machines) that separates humans from other animals.
• Regarding David Deutsch's "Universal Explainer" hypothesis, Aronson remains agnostic, preferring to treat the assumption that an explanation exists as a useful heuristic rather than an absolute ontological truth.
• He suggests that questions like the "hard problem of consciousness" or "why there is a universe" might be fundamentally unexplainable, whereas Deutsch assumes they are solvable.

Advice for Aspiring Technical Researchers

• Aronson advises young researchers to utilize the vast free resources available (online literature, papers, professors) to learn deeply.
• He suggests that while becoming an expert in a whole field takes decades, one can become a "world expert" on a specific, narrow problem relatively quickly.
• He recommends that independent researchers should read new papers daily, identify open problems, and attempt to solve them or engage with the authors.
• This process of mastering narrow topics serves as a gateway to broader collaborations and expertise.