Shor's algorithm is competitive with about 600 of these objects.
The phase space for these objects is the simplest possible example of a four-point non-commutative phase space.In a Haskell API for these objects, they are the most primitive instance of a typeclass that defines make, measure, conditional, and let methods, and they are wrapped by the QIO monad. In 2009, Monz et al. realized a Toffoli gate over these objects, which allows universality when coupled with any nontrivial gate that uses one of them. A computation that uses an auxiliary one of these objects, called an ancilla, is (*) unitary if it returns the ancilla to its original state. The first step when using these objects, as in Deutsch's algorithm, is often to apply the Hadamard transformation, which takes N of these in their base states into a linear combination of 2 to the N orthogonal states by rotating the Bloch sphere by pi radians. Shor's algorithm is competitive with about 600 of these objects. For10 points, name these units of information in quantum computing. 
The phase space for these objects is the simplest possible example of a four-point non-commutative phase space.
qubits