Abstract
AbstractArtificial intelligence algorithms, fueled by continuous technological development and increased computing power, have proven effective across a variety of tasks. Concurrently, quantum computers have shown promise in solving problems beyond the reach of classical computers. These advancements have contributed to a misconception that quantum computers enable hypercomputation, sparking speculation about quantum supremacy leading to an intelligence explosion and the creation of superintelligent agents. We challenge this notion, arguing that current evidence does not support the idea that quantum technologies enable hypercomputation. Fundamental limitations on information storage within finite spaces and the accessibility of information from quantum states constrain quantum computers from surpassing the Turing computing barrier. While quantum technologies may offer exponential speed-ups in specific computing cases, there is insufficient evidence to suggest that focusing solely on quantum-related problems will lead to technological singularity and the emergence of superintelligence. Subsequently, there is no premise suggesting that general intelligence depends on quantum effects or that accelerating existing algorithms through quantum means will replicate true intelligence. We propose that if superintelligence is to be achieved, it will not be solely through quantum technologies. Instead, the attainment of superintelligence remains a conceptual challenge that humanity has yet to overcome, with quantum technologies showing no clear path toward its resolution.
Funder
Priority Research Area Society of the Future under the programme “Excellence Initiative–Research University” at the Jagiellonian University in Krakow
Publisher
Springer Science and Business Media LLC
Reference187 articles.
1. Aaronson, S. (2005). Guest Column: NP-complete problems and physical reality. ACM SIGACT News, 36(1), 30–52. https://doi.org/10.1145/1052796.1052804
2. Aaronson, S. (2007). The Orion Quantum Computer Anti-Hype FAQ. Shtetl-Optimized. Retrieved May 11, 2023, from https://scottaaronson.blog/?p=198
3. Aaronson, S. (2010). BQP and the polynomial hierarchy. Proceedings of the Forty-Second ACM Symposium on Theory of Computing, pp. 141–150.https://doi.org/10.1145/1806689.1806711
4. Aaronson, S. (2013a). Penrose. In Quantum computing since Democritus (pp. 150–159). Cambridge University Press. https://doi.org/10.1017/CBO9780511979309.012
5. Aaronson, S. (2013b). Why philosophers should care about computational complexity. Computability: Turing Gödel Church and Beyond,261, 327.