Local Random Quantum Circuits are Approximate Polynomial-Designs
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 o...
Main Authors: | Horodecki, Michał (Author), Brandão, Fernando G. S. L. (Author), Harrow, Aram W (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Center for Theoretical Physics (Contributor), Massachusetts Institute of Technology. Department of Physics (Contributor) |
Format: | Article |
Language: | English |
Published: |
Springer Berlin Heidelberg,
2016-12-21T14:32:31Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Efficient Quantum Pseudorandomness
by: Brandão, Fernando G. S. L, et al.
Published: (2018) -
Product-State Approximations to Quantum States
by: Brandão, Fernando G. S. L., et al.
Published: (2017) -
Product-state approximations to quantum ground states
by: Brandao, Fernando G.S.L, et al.
Published: (2014) -
Quantum de Finetti Theorems Under Local Measurements with Applications
by: Brandão, Fernando G. S. L., et al.
Published: (2017) -
Quantum de finetti theorems under local measurements with applications
by: Brandao, Fernando G.S.L, et al.
Published: (2014)