The Clifford group forms a unitary 3-design

Unitary $k$-designs are finite ensembles of unitary matrices that approximate the Haar distribution over unitary matrices. Several ensembles are known to be 2-designs, including the uniform distribution over the Clifford group, but no family of ensembles was previously known to form a 3-design. We prove that the Clifford group is a 3-design, showing that it is a better approximation to Haar-random unitaries than previously expected. Our proof strategy works for any distribution of unitaries satisfying a property we call Pauli 2-mixing and proceeds without the use of heavy mathematical machinery. We also show that the Clifford group does not form a 4-design, thus characterizing how well random Clifford elements approximate Haar-random unitaries. Additionally, we show that the generalized Clifford group for qudits is not a 3-design unless the dimension of the qudit is a power of 2.

[1]  Andris Ambainis,et al.  Quantum t-designs: t-wise Independence in the Quantum World , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[2]  A. J. Scott.  Tight informationally complete quantum measurements , 2006, quant-ph/0604049.

[3]  W. Dur,et al.  Standard forms of noisy quantum operations via depolarization , 2005 .

[4]  N. Sloane,et al.  Quantum error correction via codes over GF(4) , 1996, Proceedings of IEEE International Symposium on Information Theory.

[5]  Aidan Roy,et al.  Unitary designs and codes , 2008, Des. Codes Cryptogr..

[6]  Richard Andrew Low,et al.  Pseudo-randonmess and Learning in Quantum Computation , 2010, 1006.5227.

[7]  Aram Wettroth Harrow,et al.  Efficient Quantum Tensor Product Expanders and k-Designs , 2008, APPROX-RANDOM.

[8]  Felix Krahmer,et al.  Improved Recovery Guarantees for Phase Retrieval from Coded Diffraction Patterns , 2014, arXiv.org.

[9]  Debbie W. Leung,et al.  Quantum data hiding , 2002, IEEE Trans. Inf. Theory.

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

[11]  Li Liu,et al.  Near-linear constructions of exact unitary 2-designs , 2015, Quantum Inf. Comput..

[12]  Michal Horodecki,et al.  A Decoupling Approach to the Quantum Capacity , 2007, Open Syst. Inf. Dyn..

[13]  Michal Horodecki,et al.  Exponential quantum speed-ups are generic , 2010, Quantum Inf. Comput..

[14]  Andreas J. Winter,et al.  Counterexamples to the Maximal p-Norm Multiplicativity Conjecture for all p > 1 , 2008, ArXiv.

[15]  Seth Lloyd,et al.  Pseudo-Random Unitary Operators for Quantum Information Processing , 2003, Science.

[16]  A. Harrow,et al.  Random Quantum Circuits are Approximate 2-designs , 2008, 0802.1919.

[17]  A. Acín,et al.  Complexity of energy eigenstates as a mechanism for equilibration , 2011, 1108.0374.

[18]  J. Preskill.  Reliable quantum computers , 1997, Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences.

[19]  Richard Kueng,et al.  Qubit stabilizer states are complex projective 3-designs , 2015, ArXiv.

[20]  D. Gottesman.  The Heisenberg Representation of Quantum Computers , 1998, quant-ph/9807006.

[21]  F. Brandão,et al.  Local random quantum circuits are approximate polynomial-designs: numerical results , 2012, 1208.0692.

[22]  F. Brandão,et al.  Convergence to equilibrium under a random Hamiltonian. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[23]  A. Winter,et al.  Randomizing Quantum States: Constructions and Applications , 2003, quant-ph/0307104.

[24]  Huangjun Zhu.  Multiqubit Clifford groups are unitary 3-designs , 2015, 1510.02619.

[25]  J. M. Farinholt,et al.  An ideal characterization of the Clifford operators , 2013, 1307.5087.

[26]  D. Gross,et al.  Evenly distributed unitaries: On the structure of unitary designs , 2006, quant-ph/0611002.

[27]  A. Winter,et al.  Aspects of Generic Entanglement , 2004, quant-ph/0407049.