2021/02/01 by G. F. Xu, Guofu Xu, P. Z. Zhao +2 · 18 citations
Computer Science · Mathematics · Physics and Astronomy · #Algorithm #Artificial intelligence #Bipartite graph #Block (permutation group theory) #Computation #Computer science #Graph #Hilbert space #Holonomic #Implementation #Mathematics #Physics #Pure mathematics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum and electron transport phenomena #Quantum computer #Quantum mechanics #Qubit #Realization (probability) #Theoretical computer science #Topology (electrical circuits) #quant-ph
paper · pdf · doi:10.1103/physreva.103.052605
published in Physical Review A 103(5) (American Physical Society) · 7 pages, 2 figures
arxiv created 2021/02/01 · openalex created_date 2021/02/15 · openalex publication_date 2021/05/13 · arxiv updated 2021/05/19 · openalex updated_date 2026/08/05
Nonadiabatic holonomic quantum computation (NHQC) provides a method to implement error resilient gates and that has attracted considerable attention recently. Since it was proposed, three-level \mathrm\ensuremathΛ systems have become the typical building block for NHQC and a number of NHQC schemes have been developed based on such systems. In this paper, we investigate the realization of NHQC beyond the standard three-level setting. The central idea of our proposal is to improve NHQC by enlarging the Hilbert space of the building block system and letting it have a bipartite graph structure in order to ensure purely holonomic evolution. Our proposal not only improves conventional qubit-based NHQC by efficiently reducing its duration, but also provides implementations of qudit-based NHQC. Therefore, our proposal provides a further development of NHQC that can contribute significantly to the physical realization of efficient quantum information processors.