Local random quantum circuits are approximate polynomial-designs: numerical results

DOI10.1088/1751-8113/46/30/305301MaRDI QIDQ2843765zbMATH OpenOpenAlexFDO

Authors Piotr Ćwikliński, Marek Mozrzymas, Łukasz Pańkowski, Michał Studziński, M. Horodecki

Publication date 26 August 2013

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1212.2556

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum computation (81P68)

Abstract: We numerically investigate the statement that local random quantum circuits acting on n qubits composed of polynomially many nearest neighbour two-qubit gates form an approximate unitary poly(n)-design [F.G.S.L. Brandao et al., arXiv:1208.0692]. Using a group theory formalism, spectral gaps that give a ratio of convergence to a given t-design are evaluated for a different number of qubits n (up to 20) and degrees t (t=2,3,4 and 5), improving previously known results for n=2 in the case of t=2 and 3. Their values lead to a conclusion that the previously used lower bound that bounds spectral gaps values may give very little information about the real situation and in most cases, only tells that a gap is closed. We compare our results to the another lower bounding technique, again showing that its results may not be tight.

Recommendations

• Local random quantum circuits are approximate polynomial-designs
• Random quantum circuits are approximate 2-designs
• Diagonal-unitary 2-design and their implementations by quantum circuits
• Efficient unitary designs with a system-size independent number of non-Clifford gates
• Comment on ``Random quantum circuits are approximate 2-designs by A.W. Harrow and R.A. Low (Commun. Math. Phys. 291, 257-302 (2009))

Cited in

(10)

• Random quantum circuits are approximate 2-designs
• Chaos and complexity by design
• Efficient unitary designs with a system-size independent number of non-Clifford gates
• Local random quantum circuits: ensemble completely positive maps and swap algebras
• Modern compressive tomography for quantum information science
• Local random quantum circuits are approximate polynomial-designs
• Compatibility of quantum measurements and inclusion constants for the matrix jewel
• Generating a state t-design by diagonal quantum circuits
• Comment on ``Random quantum circuits are approximate 2-designs by A.W. Harrow and R.A. Low (Commun. Math. Phys. 291, 257-302 (2009))
• Approximate unitary t-designs by short random quantum circuits using nearest-neighbor and long-range gates

This page was built for publication: Local random quantum circuits are approximate polynomial-designs: numerical results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2843765)