To reach the error threshold required to successfully perform error-correcting algorithms in quantum computers, geometric quantum gates have been considered because of their natural resilience against noise. Non-cyclic geometric gates have been proposed to reduce the run time of conventional geometric gates, to further guard against decoherence. However, while these proposed gates remove the dynamical phase from the computational basis, they do not in general remove it from the eigenstates of the time evolution operator. For a non-cyclic gate to genuinely be considered geometric the dynamical phase should be removed from both the computational basis and the eigenstates. Here, a scheme for finding genuine non-cyclic geometric gates is proposed. The gates are designed to evolve the computational basis along non-cyclic paths, consisting of two geodesic segments, chosen such that the dynamical phase is removed from the eigenstates. The gates found with this scheme did not have shorter runtimes than cyclic gates, but it was possible to implement any gate with this scheme. The findings are important for the understanding of how general quantum computations can be implemented with geometric gates.
| Identifer | oai:union.ndltd.org:UPSALLA1/oai:DiVA.org:uu-479116 |
| Date | January 2022 |
| Creators | Eivarsson, Nils |
| Publisher | Uppsala universitet, Materialteori |
| Source Sets | DiVA Archive at Upsalla University |
| Language | English |
| Detected Language | English |
| Type | Student thesis, info:eu-repo/semantics/bachelorThesis, text |
| Format | application/pdf |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | UPTEC F, 1401-5757 ; 22043 |
Page generated in 0.002 seconds