Property testing of unitary operators
- Computer Science Division, University of California, Berkeley, California 94720 (United States)
In this paper, we systematically study property testing of unitary operators. We first introduce a distance measure that reflects the average difference between unitary operators. Then we show that, with respect to this distance measure, the orthogonal group, quantum juntas (i.e., unitary operators that only nontrivially act on a few qubits of the system), and the Clifford group can be all efficiently tested. In fact, their testing algorithms have query complexities independent of the system's size and have only one-sided error. Then we give an algorithm that tests any finite subset of the unitary group, and demonstrate an application of this algorithm to the permutation group. This algorithm also has one-sided error and polynomial query complexity, but it is unknown whether it can be efficiently implemented in general.
- OSTI ID:
- 22093497
- Journal Information:
- Physical Review. A, Vol. 84, Issue 5; Other Information: (c) 2011 American Institute of Physics; Country of input: International Atomic Energy Agency (IAEA); ISSN 1050-2947
- Country of Publication:
- United States
- Language:
- English
Similar Records
Finding cycles and trees in sublinear time.
Clifford Circuit Optimization with Templates and Symbolic Pauli Gates