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

zbMATH Keywords

Haar measureapproximate unitary t-designquantum randomnessrandom unitaries

Mathematics Subject Classification ID

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 (35)

Mixing and localization in random time-periodic quantum circuits of Clifford unitaries ⋮ Rescuing complementarity with little drama ⋮ Chaos in quantum channels ⋮ Complete entropic inequalities for quantum Markov chains ⋮ Explicit construction of exact unitary designs ⋮ Local random quantum circuits: Ensemble completely positive maps and swap algebras ⋮ Small violations of Bell inequalities for multipartite pure random states ⋮ Spectral decoupling in many-body quantum chaos ⋮ Mixing properties of stochastic quantum Hamiltonians ⋮ Entanglement, quantum randomness, and complexity beyond scrambling ⋮ Linear growth of circuit complexity from Brownian dynamics ⋮ Thermalization in Kitaev’s quantum double models via tensor network techniques ⋮ Chaos and complexity by design ⋮ Pseudorandom (function-Like) quantum state generators: new definitions and applications ⋮ Efficient unitary designs with a system-size independent number of non-Clifford gates ⋮ An efficient superpostional quantum Johnson-Lindenstrauss lemma via unitary \(t\)-designs ⋮ Approximate unitary \(t\)-designs by short random quantum circuits using nearest-neighbor and long-range gates ⋮ Approximate orthogonality of permutation operators, with application to quantum information ⋮ Random quantum circuits transform local noise into global white noise ⋮ Chaos, complexity, and random matrices ⋮ Erratum to: Onset of random matrix behavior in scrambling systems ⋮ Complexity growth in integrable and chaotic models ⋮ Thermalization and canonical typicality in translation-invariant quantum lattice systems ⋮ Propagation of correlations in local random quantum circuits ⋮ Certified randomness from quantum supremacy ⋮ Decoupling with random quantum circuits ⋮ Efficient simulation of random states and random unitaries ⋮ Approximate Unitary n^2/3-Designs Give Rise to Quantum Channels with Super Additive Classical Holevo Capacity ⋮ Correlation length in random MPS and PEPS ⋮ A random unitary circuit model for black hole evaporation ⋮ Quantifying scrambling in quantum neural networks ⋮ Quantum statistical mechanics of encryption: reaching the speed limit of classical block ciphers ⋮ On the explicit constructions of certain unitaryt-designs ⋮ On barren plateaus and cost function locality in variational quantum algorithms ⋮ Can the macroscopic fluctuation theory be quantized?

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

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