arXiv Analytics

Sign in

arXiv:1210.6782 [quant-ph]AbstractReferencesReviewsResources

Non-Adiabatic Holonomic Quantum Computation in Decoherence-Free Subspaces

G. F. Xu, J. Zhang, D. M. Tong, Erik Sjoqvist, L. C. Kwek

Published 2012-10-25Version 1

Quantum computation that combines the coherence stabilization virtues of decoherence-free subspaces and the fault tolerance of geometric holonomic control is of great practical importance. Some schemes of adiabatic holonomic quantum computation in decoherence-free subspaces have been proposed in the past few years. However, non-adiabatic holonomic quantum computation in decoherence-free subspaces, which avoids long run-time requirement but with all the robust advantages, remains an open problem. Here, we demonstrate how to realize non-adiabatic holonomic quantum computation in decoherence-free subspaces. By using only three neighboring physical qubits undergoing collective dephasing to encode one logical qubit, we realize a universal set of quantum gates.

Related articles: Most relevant | Search more
arXiv:quant-ph/0608204 (Published 2006-08-26)
Relaxation- and Decoherence-free subspaces in networks of weakly and strongly coupled resonators
arXiv:2402.00112 [quant-ph] (Published 2024-01-31, updated 2024-05-11)
Decoherence-Free Subspaces Cannot Prevent the Collapse of Wave Functions
arXiv:1706.02967 [quant-ph] (Published 2017-06-09)
Single-shot realization of nonadiabatic holonomic quantum gates in decoherence-free subspaces