Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Reliable AI: Does the Next Generation Require Quantum Computing? (2307.01301v2)

Published 3 Jul 2023 in cs.AI and quant-ph

Abstract: In this survey, we aim to explore the fundamental question of whether the next generation of artificial intelligence requires quantum computing. Artificial intelligence is increasingly playing a crucial role in many aspects of our daily lives and is central to the fourth industrial revolution. It is therefore imperative that artificial intelligence is reliable and trustworthy. However, there are still many issues with reliability of artificial intelligence, such as privacy, responsibility, safety, and security, in areas such as autonomous driving, healthcare, robotics, and others. These problems can have various causes, including insufficient data, biases, and robustness problems, as well as fundamental issues such as computability problems on digital hardware. The cause of these computability problems is rooted in the fact that digital hardware is based on the computing model of the Turing machine, which is inherently discrete. Notably, our findings demonstrate that digital hardware is inherently constrained in solving problems about optimization, deep learning, or differential equations. Therefore, these limitations carry substantial implications for the field of artificial intelligence, in particular for machine learning. Furthermore, although it is well known that the quantum computer shows a quantum advantage for certain classes of problems, our findings establish that some of these limitations persist when employing quantum computing models based on the quantum circuit or the quantum Turing machine paradigm. In contrast, analog computing models, such as the Blum-Shub-Smale machine, exhibit the potential to surmount these limitations.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (51)
  1. S. Aaronson and A. Arkhipov. The computational complexity of linear optics. In STOC’11—Proceedings of the 43rd ACM Symposium on Theory of Computing, pages 333–342. ACM, New York, 2011.
  2. The quantum technologies roadmap: a european community view. New Journal of Physics, 20, 2018.
  3. Safety, security and privacy in machine learning based internet of things. J. Sens. Actuator Networks, 11, 38, 2022.
  4. Explainable artificial intelligence (xai): Concepts, taxonomies, opportunities and challenges toward responsible ai. ArXiv, abs/1910.10045, 2019.
  5. On Instabilities of Deep Learning in Image Reconstruction and the Potential Costs of AI. Proceedings of the National Academy of Sciences, 2020.
  6. Guidelines for human-ai interaction. Proceedings of the 2019 CHI Conference on Human Factors in Computing Systems, 2019.
  7. Complexity blowup for solutions of the laplace and the diffusion equation. ArXiv, abs/2212.00693, 2022.
  8. E. S. Bernstein and U. V. Vazirani. Quantum complexity theory. Proceedings of the twenty-fifth annual ACM symposium on Theory of Computing, 1993.
  9. Inverse problems are solvable on real number signal processing hardware. ArXiv, abs/2204.02066, 2022.
  10. Limitations of deep learning for inverse problems on digital hardware. ArXiv, abs/2202.13490, 2022.
  11. Non-computability of the pseudoinverse on digital computers. ArXiv, abs/2212.02940, 2022.
  12. The modern mathematics of deep learning. In Mathematical aspects of deep learning, pages 1–111. Cambridge Univ. Press, Cambridge, 2023.
  13. Fairness and Machine Learning: Limitations and Opportunities. fairmlbook.org, 2019. http://www.fairmlbook.org.
  14. H. Boche and V. Pohl. Turing meets circuit theory: Not every continuous-time lti system can be simulated on a digital computer. IEEE Transactions on Circuits and Systems I: Regular Papers, 67, 5051–5064, 2020.
  15. H. Boche and V. Pohl. Complexity blowup in simulating analog linear time-invariant systems on digital computers. IEEE Transactions on Signal Processing, 69, 5005–5020, 2021.
  16. L. Bottou. Large-scale machine learning with stochastic gradient descent. In International Conference on Computational Statistics, 2010.
  17. T. Brown and  others. Language models are few-shot learners. In Advances in Neural Information Processing Systems, volume 33, pages 1877–1901. Curran Associates, Inc., 2020.
  18. Capacity-achieving input distributions: Algorithmic computability and approximability. In 2022 IEEE International Symposium on Information Theory (ISIT), pages 2774–2779, 2022.
  19. On a theory of computation and complexity over the real numbers: $np$- completeness, recursive functions and universal machines. Bulletin of the American Mathematical Society, 21, 1–46, 1989.
  20. Are we really making much progress? a worrying analysis of recent neural recommendation approaches. Proceedings of the 13th ACM Conference on Recommender Systems, 2019.
  21. D. Deutsch. Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. Roy. Soc. London Ser. A, 400(1818), 97–117, 1985.
  22. D. Deutsch. Quantum computational networks. Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences, 425, 73 – 90, 1989.
  23. P. M. Domingos. A few useful things to know about machine learning. Communications of the ACM, 55, 78 – 87, 2012.
  24. Robust Physical-World Attacks on Deep Learning Visual Classification. In 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 1625–1634, 2018.
  25.  European Commission. Shaping Europe’s digital future. https://digital-strategy.ec.europa.eu/en/library/proposal-regulation-laying-down-harmonised-rules-artificial-intelligence, Last accessed on 2022-12-01.
  26. Evolutionary fuzzy systems for explainable artificial intelligence: Why, when, what for, and where to? IEEE Computational Intelligence Magazine, 14(1), 69–81, 2019.
  27. The Robustness of Deep Networks: A Geometrical Perspective. IEEE Signal Processing Magazine, 34(6), 50–62, 2017.
  28. K. Gödel. über formal unentscheidbare sätze der principia mathematica und verwandter systeme i. Monatshefte für Mathematik, 38(1), 173–198, 1931.
  29. The troublesome kernel: why deep learning for inverse problems is typically unstable. ArXiv, abs/2001.01258, 2020.
  30. Explaining explanations: An overview of interpretability of machine learning. 2018 IEEE 5th International Conference on Data Science and Advanced Analytics (DSAA), pages 80–89, 2018.
  31. Deep learning. Adaptive Computation and Machine Learning. MIT Press, Cambridge, MA, 2016.
  32. A survey of methods for explaining black box models. ACM Comput. Surv., 51(5), aug 2018.
  33. A survey of methods for explaining black box models. ACM Computing Surveys (CSUR), 51, 1 – 42, 2018.
  34. L. K. Grover. A fast quantum mechanical algorithm for database search. In Symposium on the Theory of Computing, 1996.
  35. Human-machine-interaction in the industry 4.0 era. 2014 12th IEEE International Conference on Industrial Informatics (INDIN), pages 289–294, 2014.
  36. Explaining and harnessing adversarial examples. CoRR, abs/1412.6572, 2014.
  37. D. Hangleiter and J. Eisert. Computational advantage of quantum random sampling. ArXiv, abs/2206.04079, 2022.
  38. The global landscape of ai ethics guidelines. Nature Machine Intelligence, pages 1–11, 2019.
  39. J. M. Jumper and  others. Highly accurate protein structure prediction with alphafold. Nature, 596, 583 – 589, 2021.
  40. Computability of optimizers. ArXiv, abs/2301.06148, 2023.
  41. DeepFool: A Simple and Accurate Method to Fool Deep Neural Networks. In 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pages 2574–2582, 2016.
  42. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press, USA, 10th edition, 2011.
  43. Deep Neural Networks are Easily Fooled: High Confidence Predictions for Unrecognizable Images. In 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pages 427–436, 2015.
  44. Artificial intelligence and life in 2030: The one hundred year study on artificial intelligence. ArXiv, abs/2211.06318, 2016.
  45. Energy and policy considerations for deep learning in nlp. ArXiv, abs/1906.02243, 2019.
  46. Hidden technical debt in machine learning systems. In C. Cortes, N. D. Lawrence, D. D. Lee, M. Sugiyama, and R. Garnett, editors, NIPS, 2015.
  47. P. W. Shor. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput., 26, 1484–1509, 1995.
  48. A. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 42(1), 230–265, 1936.
  49. A. C.-C. Yao. Quantum circuit complexity. In IEEE Annual Symposium on Foundations of Computer Science, 1993.
  50. D. Yao. G7, generative ai and the ‘hiroshima ai process’. AI Business, 2023. https://aibusiness.com/responsible-ai/g7-generative-ai-and-the-hiroshima-ai-process-, Last accessed on 2023-06-29.
  51. Phase-programmable gaussian boson sampling using stimulated squeezed light. Physical review letters, 127 18, 180502, 2021.
Citations (2)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now