  Pseudo-random operators consist of sets of operators that exhibit many of the
important statistical features of uniformly distributed random operators. Such
pseudo-random sets of operators are most useful whey they may be parameterized
and generated on a quantum processor in a way that requires exponentially fewer
resources than direct implementation of the uniformly random set. Efficient
pseudo-random operators can overcome the exponential cost of random operators
required for quantum communication tasks such as super-dense coding of quantum
states and approximately secure quantum data-hiding, and enable efficient
stochastic methods for noise estimation on prototype quantum processors. This
paper summarizes some recently published work demonstrating a random circuit
method for the implementation of pseudo-random unitary operators on a quantum
processor [Emerson et al., Science 302:2098 (Dec.~19, 2003)], and further
elaborates the theory and applications of pseudo-random states and operators.
