A parametrization of the density operator, a coherence vector representation, which uses a basis of orthogonal, traceless, Hermitian matrices is discussed. Using this parametrization we find the… Expand

The left and right invariant vector fields are calculated in an “Euler angle”-type parametrization for the group manifold of SU(3), referred to here as Euler coordinates. The corresponding left and… Expand

The group SU(3) is parameterized in terms of generalized {open_quotes}Euler angles{close_quotes}. The differential operators of SU(3) corresponding to the Lie Algebra elements are obtained, the… Expand

In this paper we give an explicit parametrization for all two-qubit density matrices. This is important for calculations involving entanglement and many other types of quantum information processing.… Expand

The algorithm adiabatically finds the low-lying spectrum in the vicinity of the gap between the ground and the first excited states and provides a test of the applicability of the BCS Hamiltonian to mesoscopic superconducting systems, such as ultrasmall metallic grains.Expand

A general method for removingDecoherence-induced leakage errors by using simple decoupling and recoupling pulse sequences that are experimentally accessible in a variety of promising quantum-computing proposals.Expand

It is shown how to generally remove mixing of an encoded subspace with external states (termed leakage errors) using decoupling controls using ‘leakage elimination operations’ or ‘LEOs’.Expand

The adiabatic geometric phases for general three state systems are discussed. An explicit parameterization for space of states of these systems is given. The abelian and non-abelian connection… Expand

It is shown how the dominant decoherence processes can be identified empirically, in order to optimize the decoupling pulses, and removed the need for single-qubit operations, which pose a difficult design constraint.Expand

This work proposes an algorithm that can find the algebraic structure of decoherence-free subspaces (DFS's) for a given noisy quantum channel and proves that this algorithm will work for all cases with probability one, and it is more efficient than the algorithm proposed by Holbrook, Kribs, and Laflamme.Expand