Local Random Quantum Circuits are Approximate Polynomial-Designs
Name
220_2016_2706_ReferencePDF.pdf
Size
7.52 MB
Format
Adobe PDF
Checksum (MD5)
ac43a887c484d3bb9125384fb0f36f86
Author(s)
Horodecki, Michał
Brandão, Fernando G. S. L.
Harrow, Aram W
Date Issued
August 2016
Journal
Communications in Mathematical Physics
Publisher
Springer Berlin Heidelberg
Citation
Brandão, Fernando G. S. L., Aram W. Harrow, and Michał Horodecki. “Local Random Quantum Circuits Are Approximate Polynomial-Designs.” Communications in Mathematical Physics 346.2 (2016): 397–434.
Version
Author's final manuscript
Abstract
We prove that local random quantum circuits acting on n qubits composed of O(t[superscript 10]n[superscript 2]) many nearest neighbor two-qubit gates form an approximate unitary t-design. Previously it was unknown whether random quantum circuits were a t-design for any t > 3. The proof is based on an interplay of techniques from quantum many-body theory, representation theory, and the theory of Markov chains. In particular we employ a result of Nachtergaele for lower bounding the spectral gap of frustration-free quantum local Hamiltonians; a quasi-orthogonality property of permutation matrices; a result of Oliveira which extends to the unitary group the path-coupling method for bounding the mixing time of random walks; and a result of Bourgain and Gamburd showing that dense subgroups of the special unitary group, composed of elements with algebraic entries, are ∞-copy tensor-product expanders. We also consider pseudo-randomness properties of local random quantum circuits of small depth and prove that circuits of depth O(t[superscript 10]n) constitute a quantum t-copy tensor-product expander. The proof also rests on techniques from quantum many-body theory, in particular on the detectability lemma of Aharonov, Arad, Landau, and Vazirani. We give applications of the results to cryptography, equilibration of closed quantum dynamics, and the generation of topological order. In particular we show the following pseudo-randomness property of generic quantum circuits: Almost every circuit U of size O(n[superscript k]) on n qubits cannot be distinguished from a Haar uniform unitary by circuits of size O(n[superscript (k-9)/11]) that are given oracle access to U.
MIT Department
Massachusetts Institute of Technology. Center for Theoretical Physics
Massachusetts Institute of Technology. Department of Physics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s00220-016-2706-8
