Efficiency of producing random unitary matrices with quantum circuits

We study the scaling of the convergence of several statistical properties of a recently introduced random unitary circuit ensemble towards their limits given by the circular unitary ensemble (CUE). Our study includes the full distribution of the absolute square of a matrix element, moments of that distribution up to order eight, as well as correlators containing up to 16 matrix elements in a given column of the unitary matrices. Our numerical scaling analysis shows that all of these quantities can be reproduced efficiently, with a number of random gates which scales at most as $n_q\log (n_q/\epsilon)$ with the number of qubits $n_q$ for a given fixed precision $\epsilon$. This suggests that quantities which require an exponentially large number of gates are of more complex nature.

[1]  M B Plenio,et al.  Generic entanglement can be generated efficiently. , 2007, Physical review letters.

[2]  Lorenza Viola,et al.  Quantum pseudorandomness from cluster-state quantum computation , 2008, 0802.2675.

[3]  A. Harrow,et al.  Superdense coding of quantum states. , 2003, Physical review letters.

[4]  Timothy F. Havel,et al.  Design of strongly modulating pulses to implement precise effective Hamiltonians for quantum information processing , 2002, quant-ph/0202065.

[5]  DiVincenzo.  Two-bit gates are universal for quantum computation. , 1994, Physical review. A, Atomic, molecular, and optical physics.

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

[7]  K. Życzkowski,et al.  Composed ensembles of random unitary matrices , 1997, chao-dyn/9707006.

[8]  Juan Jose Garcia-Ripoll,et al.  Efficient algorithm for multi-qudit twirling , 2006, quant-ph/0609052.

[9]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

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

[11]  Sleator,et al.  Realizable Universal Quantum Logic Gates. , 1995, Physical review letters.

[12]  Distribution of interference in random quantum algorithms , 2006, quant-ph/0612168.

[13]  Seth Lloyd,et al.  Convergence conditions for random quantum circuits , 2005, quant-ph/0503210.

[14]  A. Barenco.  A universal two-bit gate for quantum computation , 1995, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[15]  I. Chuang,et al.  Quantum Computation and Quantum Information: Introduction to the Tenth Anniversary Edition , 2010 .

[16]  D. Vernon.  Inform , 1995, Encyclopedia of the UN Sustainable Development Goals.

[17]  Marko Znidaric.  Optimal two-qubit gate for generation of random bipartite entanglement , 2007 .

[18]  M. B. Plenio,et al.  The emergence of typical entanglement in two-party random processes , 2007 .

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

[20]  S. Aubert,et al.  Invariant Integration over the Unitary Group , 2003 .

[21]  F. Haake.  Quantum signatures of chaos , 1991 .

[22]  M. Stephanov,et al.  Random Matrices , 2005, hep-ph/0509286.

[23]  Barenco,et al.  Elementary gates for quantum computation. , 1995, Physical review. A, Atomic, molecular, and optical physics.

[24]  Marko Znidaric,et al.  Exact convergence times for generation of random bipartite entanglement , 2008, 0809.0554.