Please use this identifier to cite or link to this item:
Title: Fast non-Abelian geometric gates via transitionless quantum driving
Authors: Zhang, J 
Kyaw, T.H 
Tong, D.M
Sjöqvist, E
Kwek, L.-C 
Issue Date: 2015
Publisher: Nature Publishing Group
Citation: Zhang, J, Kyaw, T.H, Tong, D.M, Sjöqvist, E, Kwek, L.-C (2015). Fast non-Abelian geometric gates via transitionless quantum driving. Scientific Reports 5 : 18414. ScholarBank@NUS Repository.
Abstract: A practical quantum computer must be capable of performing high fidelity quantum gates on a set of quantum bits (qubits). In the presence of noise, the realization of such gates poses daunting challenges. Geometric phases, which possess intrinsic noise-tolerant features, hold the promise for performing robust quantum computation. In particular, quantum holonomies, i.e., non-Abelian geometric phases, naturally lead to universal quantum computation due to their non-commutativity. Although quantum gates based on adiabatic holonomies have already been proposed, the slow evolution eventually compromises qubit coherence and computational power. Here, we propose a general approach to speed up an implementation of adiabatic holonomic gates by using transitionless driving techniques and show how such a universal set of fast geometric quantum gates in a superconducting circuit architecture can be obtained in an all-geometric approach. Compared with standard non-adiabatic holonomic quantum computation, the holonomies obtained in our approach tends asymptotically to those of the adiabatic approach in the long run-time limit and thus might open up a new horizon for realizing a practical quantum computer.
Source Title: Scientific Reports
ISSN: 20452322
DOI: 10.1038/srep18414
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
10_1038_srep18414.pdf1.7 MBAdobe PDF




checked on Jun 25, 2022

Page view(s)

checked on Jun 23, 2022

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.