In this paper, we propose a way to achieve protected universal computation in a neutral atom quantum computer subject to collective dephasing. Our proposal relies on the existence of a Decoherence Free Subspace (DFS), resulting from symmetry properties of the errors. After briefly describing the physical system and the error model considered, we show how to encode information into the DFS and build a complete set of safe universal gates. Finally, we provide numerical simulations for the fidelity of the different gates in the presence of time-dependent phase errors and discuss their performance and practical feasibility.Comment: 7 pages, 8 figure
16 February 2008 in Quantum Information Processing
In this paper, we propose a way to achieve protected universal computation in a neutral atom quantum computer subject to collective dephasing. Our proposal relies on the existence of a Decoherence Free Subspace (DFS), resulting from symmetry properties of the errors. After briefly describing the physical system and the error model considered, we show how to encode information into the DFS and build a complete set of safe universal gates. Finally, we provide numerical simulations for the fidelity of the different gates in the presence of time-dependent phase errors and discuss their performance and practical feasibility.
We present a derivation and numerous applications of a compact explicit formula for the average fidelity of a quantum operation on a finite dimensional quantum system. The formula can be applied to averages over particularly relevant subspaces; it is easily generalized to multi-component systems, and as a special result, we show that when the same completely positive trace-preserving map is applied to a large number of qubits with one-bit fidelity F close to unity, the average fidelity of the operation on the full K-bit register scales as $F^{3K/2}$.
We show how to control and perform universal three-qubit quantum computation with trapped electron quantum states. The three qubits are the electron spin, and the first two quantum states of the cyclotron and axial harmonic oscillators. We explicitly show how the universal gates can be performed. As an example of a non-trivial quantum algorithm, we outline the implementation of the Deutsch-Jozsa algorithm in this system.