Local random quantum circuits are approximate polynomial-designs
DOI10.1007/s00220-016-2706-8zbMath1367.81035arXiv1208.0692OpenAlexW3123208069WikidataQ59711908 ScholiaQ59711908MaRDI QIDQ506483
Aram W. Harrow, Fernando G. S. L. Brandão, Michał Horodecki
Publication date: 1 February 2017
Published in: Communications in Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1208.0692
Random matrices (probabilistic aspects) (60B20) Quantum computation (81P68) Design techniques (robust design, computer-aided design, etc.) (93B51) Cryptography (94A60) Analytic circuit theory (94C05) Set functions and measures on topological groups or semigroups, Haar measures, invariant measures (28C10) Quantum coherence, entanglement, quantum correlations (81P40) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Towards the fast scrambling conjecture
- Comment on ``Random quantum circuits are approximate 2-designs by A.W. Harrow and R.A. Low (Commun. Math. Phys. 291, 257-302 (2009))
- A spectral gap theorem in SU\((d)\)
- Feller processes on nonlocally compact spaces
- Aspects of generic entanglement
- Linear trimmed means for the linear regression with AR(1) errors model
- Unitary designs and codes
- Random quantum circuits are approximate 2-designs
- Asymptotic theory of finite dimensional normed spaces. With an appendix by M. Gromov: Isoperimetric inequalities in Riemannian manifolds
- Finitely correlated states on quantum spin chains
- Randomizing quantum states: constructions and applications
- Fault-tolerant quantum computation by anyons
- The spectral gap for some spin chains with discrete symmetry breaking
- On the convergence to equilibrium of Kac's random walk on matrices
- Derandomized constructions of \(k\)-wise (almost) independent permutations
- Simple permutations mix well
- Computational complexity and black hole horizons
- An Introduction to the Mathematics of Anderson Localization
- Non-Abelian anyons and topological quantum computation
- Pseudo-Random Unitary Operators for Quantum Information Processing
- Simple permutations mix even better
- Superpolynomial Speedups Based on Almost Any Quantum Circuit
- Evenly distributed unitaries: On the structure of unitary designs
- Cryptography in the Bounded-Quantum-Storage Model
- The mother of all protocols: restructuring quantum information’s family tree
- Large deviation bounds for k -designs
- Efficient Quantum Tensor Product Expanders and k-Designs
- Nonmalleable encryption of quantum information
- A quantum central limit theorem for non-equilibrium systems: exact local relaxation of correlated states
- Symmetric groups and expanders
- Thermalization under randomized local Hamiltonians
- Quantum complexity theory
- The emergence of typical entanglement in two-party random processes
- Subsystem dynamics under random Hamiltonian evolution
- Quantum logarithmic Sobolev inequalities and rapid mixing