Property testing of unitary operators

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.

[1]  J. Paz,et al.  Selective and efficient quantum process tomography without ancilla. , 2011, Physical review letters.

[2]  Yi-Kai Liu,et al.  Direct fidelity estimation from few Pauli measurements. , 2011, Physical review letters.

[3]  Joseph Emerson,et al.  Scalable and robust randomized benchmarking of quantum processes. , 2010, Physical review letters.

[4]  R. Kosut,et al.  Efficient measurement of quantum dynamics via compressive sensing. , 2009, Physical review letters.

[5]  Christian Tomás Schmiegelow,et al.  Selective and efficient quantum process tomography with single photons. , 2010, Physical review letters.

[6]  Stephen Becker,et al.  Quantum state tomography via compressed sensing. , 2009, Physical review letters.

[7]  R. L. Kosut,et al.  Simplified quantum process tomography , 2009, 0910.4609.

[8]  R. A. Low,et al.  Learning and testing algorithms for the Clifford group , 2009, 0907.2833.

[9]  Christoph Dankert,et al.  Exact and approximate unitary 2-designs and their application to fidelity estimation , 2009 .

[10]  Fernando Pastawski,et al.  Selective and efficient quantum process tomography , 2009, 0906.3002.

[11]  F. Pastawski,et al.  Selective and efficient estimation of parameters for quantum process tomography. , 2008, Physical review letters.

[12]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[13]  Raymond Laflamme,et al.  Symmetrized Characterization of Noisy Quantum Processes , 2007, Science.

[14]  Daniel A. Lidar,et al.  Direct characterization of quantum dynamics: General theory , 2006, quant-ph/0601034.

[15]  Daniel A. Lidar,et al.  Direct characterization of quantum dynamics. , 2006, Physical review letters.

[16]  J. Emerson,et al.  Scalable noise estimation with random unitary operators , 2005, quant-ph/0503243.

[17]  Andrew G. White,et al.  Ancilla-assisted quantum process tomography. , 2003, Physical review letters.

[18]  G. D’Ariano,et al.  Imprinting complete information about a quantum channel on its output state. , 2002, Physical review letters.

[19]  G M D'Ariano,et al.  Quantum tomography for measuring experimentally the matrix elements of an arbitrary quantum operation. , 2001, Physical review letters.

[20]  D. Gottesman.  Theory of fault-tolerant quantum computation , 1997, quant-ph/9702029.

[21]  P. Zoller,et al.  Complete Characterization of a Quantum Process: The Two-Bit Quantum Gate , 1996, quant-ph/9611013.

[22]  I. Chuang,et al.  Prescription for experimental determination of the dynamics of a quantum black box , 1996, quant-ph/9610001.

[23]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[24]  Steane,et al.  Error Correcting Codes in Quantum Theory. , 1996, Physical review letters.

[25]  Charles H. Bennett,et al.  Mixed-state entanglement and quantum error correction. , 1996, Physical review. A, Atomic, molecular, and optical physics.

[26]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[27]  Shor,et al.  Scheme for reducing decoherence in quantum computer memory. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[28]  Carsten Lund,et al.  Proof verification and hardness of approximation problems , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[29]  Man-Duen Choi.  Completely positive linear maps on complex matrices , 1975 .

[30]  A. Jamiołkowski.  Linear transformations which preserve trace and positive semidefiniteness of operators , 1972 .