pith. sign in

arxiv: 1210.6782 · v1 · pith:FUVDMVLBnew · submitted 2012-10-25 · 🪐 quant-ph

Non-Adiabatic Holonomic Quantum Computation in Decoherence-Free Subspaces

classification 🪐 quant-ph
keywords quantumcomputationdecoherence-freeholonomicsubspacesnon-adiabaticrealizeadiabatic
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.