2023/07/16 by Daniele Cuomo, Cuomo, Daniele
Computer Science · Physics and Astronomy · #Computability, Logic, AI Algorithms #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Mechanics and Applications #Quantum Physics (quant-ph) #quant-ph
paper · pdf · doi:10.48550/arxiv.2307.07908
published as Springer Theses 2024 · PhD Thesis
arxiv created 2023/07/16 · openalex publication_date 2023/07/16 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28 · arxiv updated 2026/08/03
This thesis treats networks providing quantum computation based on distributed paradigms. Compared to architectures relying on one processor, a network promises to be more scalable and less fault-prone. Developing a distributed system able to provide practical quantum computation comes with many challenges, each of which need to be faced with careful analysis in order to create a massive integration of several components properly engineered. In accordance with hardware technologies, currently under construction around the globe, telegates represent the fundamental inter-processor operations. Each telegate consists of several tasks: i) entanglement generation and distribution, ii) local operations, and iii) classical communications. Entanglement generation and distribution is an expensive resource, as it is time-consuming. The main contribution of this thesis is on the definition of compilers that minimize the impact of telegates on the overall fidelity. Specifically, we give rigorous formulations of the subject problem, allowing us to identify the inter-dependence between computation and communication. With the support of some of the best tools for reasoning -- i.e. network optimization, circuit manipulation, group theory and ZX-calculus -- we found new perspectives on the way a distributed quantum computing system should evolve.