# The Geometry of Quantum Computing

**Authors:** E. Ercolessi, R. Fioresi, T. Weber  
**arXiv:** [2312.14807](https://arxiv.org/abs/2312.14807)  
**Date:** 2023-12-22  
**Summary page:** https://www.summarizepaper.com/en/arxiv-id/2312.14807v1/

## Key points

- The paper "The Geometry of Quantum Computing" by E. Ercolessi, R. Fioresi, and T. Weber provides a comprehensive overview of geometrical modeling in quantum computing.
- Introduction establishes terminology before exploring quantum information geometry and ZX-calculus.
- Connection between quantum computing questions and quantum groups, particularly Hopf algebras, is examined.
- R. Feynman introduced the concept of using quantum mechanics for computer algorithms in 1981, laying the foundation for universal quantum computers with qubits and elementary gates.
- Understanding geometric aspects of quantum computing is crucial for solving complex computational problems efficiently.
- Concepts like quantum information geometry and ZX-calculus are explored to enhance understanding of quantum computing processes.
- The paper sheds light on the intersection of geometry and quantum computing, offering new perspectives that could revolutionize computational methodologies in the future.
- Research was supported by various funding sources including Gnsaga-Indam, COST Action CaLISTA CA21109, HORIZON-MSCA-2022-SE-01-01 CaLIGOLA, PNRR MNESYS, PNRR National Center for HPC, Big Data and Quantum Computing.

## Summary

The paper "The Geometry of Quantum Computing" by E. Ercolessi, R. Fioresi, and T. Weber provides a comprehensive overview of the geometrical modeling of quantum computing problems. The authors begin with a brief introduction to establish the terminology before delving into quantum information geometry and ZX-calculus. They explore the connection between quantum computing questions and quantum groups, specifically Hopf algebras. The concept of using quantum mechanics for computer algorithms was first introduced by R. Feynman in 1981, who proposed the idea of quantum computing in a seminal talk. Feynman's analysis of universal quantum computers built from qubits and elementary quantum gates laid the foundation for further research in this field. The authors discuss the significance of understanding the geometric aspects of quantum computing, highlighting its relevance in solving complex computational problems efficiently. By exploring concepts such as quantum information geometry and ZX-calculus, they aim to provide insights into how geometrical modeling can enhance our understanding of quantum computing processes. Overall, this expository paper offers valuable insights into the intersection of geometry and quantum computing, shedding light on new perspectives that can potentially revolutionize computational methodologies in the future. The research was supported by various funding sources, including Gnsaga-Indam, COST Action CaLISTA CA21109, HORIZON-MSCA-2022-SE-01-01 CaLIGOLA, PNRR MNESYS, PNRR National Center for HPC, Big Data and Quantum Computing.