Composite nonadiabatic holonomic quantum computation

G. F. Xu, P. Z. Zhao, T. H. Xing, Erik Sjöqvist, and D. M. Tong
Phys. Rev. A 95, 032311 – Published 8 March 2017

Abstract

Nonadiabatic holonomic quantum computation has a robust feature in suppressing control errors because of its holonomic feature. However, this kind of robust feature is challenged since the usual way of realizing nonadiabatic holonomic gates introduces errors due to systematic errors in the control parameters. To resolve this problem, we here propose a composite scheme to realize nonadiabatic holonomic gates. Our scheme can suppress systematic errors while preserving holonomic robustness. It is particularly useful when the evolution period is shorter than the coherence time. We further show that our composite scheme can be protected by decoherence-free subspaces. In this case, the strengthened robust feature of our composite gates and the coherence stabilization virtue of decoherence-free subspaces are combined.

  • Figure
  • Received 26 December 2016

DOI:https://doi.org/10.1103/PhysRevA.95.032311

©2017 American Physical Society

Physics Subject Headings (PhySH)

  1. Research Areas
Quantum Information, Science & Technology

Authors & Affiliations

G. F. Xu1,2, P. Z. Zhao1, T. H. Xing1, Erik Sjöqvist2, and D. M. Tong1,*

  • 1Department of Physics, Shandong University, Jinan 250100, China
  • 2Department of Physics and Astronomy, Uppsala University, Box 516, Se-751 20 Uppsala, Sweden

  • *tdm@sdu.edu.cn

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 95, Iss. 3 — March 2017

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×