Fast non-Abelian geometric gates via transitionless quantum driving
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 perform...
Saved in:
Main Authors: | , , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2016
|
Online Access: | https://hdl.handle.net/10356/81699 http://hdl.handle.net/10220/39668 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-81699 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-816992022-02-16T16:28:27Z Fast non-Abelian geometric gates via transitionless quantum driving Zhang, J. Kyaw, Thi Ha Tong, D. M. Sjöqvist, Erik Kwek, Leong-Chuan Institute of Advanced Studies 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. Published version 2016-01-12T06:17:35Z 2019-12-06T14:36:22Z 2016-01-12T06:17:35Z 2019-12-06T14:36:22Z 2015 Journal Article 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-. 2045-2322 https://hdl.handle.net/10356/81699 http://hdl.handle.net/10220/39668 10.1038/srep18414 26687580 en Scientific Reports This work is licensed under a Creative Commons Attribution 4.0 International License. The images or other third party material in this article are included in the article’s Creative Commons license, unless indicated otherwise in the credit line; if the material is not included under the Creative Commons license, users will need to obtain permission from the license holder to reproduce the material. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/ 7 p. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
description |
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. |
author2 |
Institute of Advanced Studies |
author_facet |
Institute of Advanced Studies Zhang, J. Kyaw, Thi Ha Tong, D. M. Sjöqvist, Erik Kwek, Leong-Chuan |
format |
Article |
author |
Zhang, J. Kyaw, Thi Ha Tong, D. M. Sjöqvist, Erik Kwek, Leong-Chuan |
spellingShingle |
Zhang, J. Kyaw, Thi Ha Tong, D. M. Sjöqvist, Erik Kwek, Leong-Chuan Fast non-Abelian geometric gates via transitionless quantum driving |
author_sort |
Zhang, J. |
title |
Fast non-Abelian geometric gates via transitionless quantum driving |
title_short |
Fast non-Abelian geometric gates via transitionless quantum driving |
title_full |
Fast non-Abelian geometric gates via transitionless quantum driving |
title_fullStr |
Fast non-Abelian geometric gates via transitionless quantum driving |
title_full_unstemmed |
Fast non-Abelian geometric gates via transitionless quantum driving |
title_sort |
fast non-abelian geometric gates via transitionless quantum driving |
publishDate |
2016 |
url |
https://hdl.handle.net/10356/81699 http://hdl.handle.net/10220/39668 |
_version_ |
1725985663017287680 |