Random quantum circuits are approximate 2-designs

DOI10.1007/s00220-009-0873-6zbMath1188.81043arXiv0802.1919OpenAlexW2070375169MaRDI QIDQ1048095

Richard A. Low, Aram W. Harrow

Publication date: 11 January 2010

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Quantum computation (81P68) Applications of design theory to circuits and networks (94C30)

Related Items

Mixing and localization in random time-periodic quantum circuits of Clifford unitaries ⋮ Towards the fast scrambling conjecture ⋮ A bound on chaos ⋮ Stringy effects in scrambling ⋮ Explicit construction of exact unitary designs ⋮ Local random quantum circuits: Ensemble completely positive maps and swap algebras ⋮ Approximate unitary 3-designs from transvection Markov chains ⋮ Spectral decoupling in many-body quantum chaos ⋮ Mixing properties of stochastic quantum Hamiltonians ⋮ (Pseudo) random quantum states with binary phase ⋮ Mitigating barren plateaus with transfer-learning-inspired parameter initializations ⋮ Linear growth of circuit complexity from Brownian dynamics ⋮ Chaos and complexity by design ⋮ qLEET: visualizing loss landscapes, expressibility, entangling power and training trajectories for parameterized quantum circuits ⋮ The SWITCH test for discriminating quantum evolutions ⋮ Efficient unitary designs with a system-size independent number of non-Clifford gates ⋮ Approximate unitary \(t\)-designs by short random quantum circuits using nearest-neighbor and long-range gates ⋮ The barren plateaus of quantum neural networks: review, taxonomy and trends ⋮ Random quantum circuits transform local noise into global white noise ⋮ Efficient and feasible state tomography of quantum many-body systems ⋮ Decoupling with unitary approximate two-designs ⋮ Generating a statet-design by diagonal quantum circuits ⋮ Erratum to: Onset of random matrix behavior in scrambling systems ⋮ Measuring the distance between quantum many-body wave functions ⋮ Local random quantum circuits are approximate polynomial-designs ⋮ Neural networks with quantum architecture and quantum learning ⋮ Comment on ``Random quantum circuits are approximate 2-designs by A.W. Harrow and R.A. Low (Commun. Math. Phys. 291, 257-302 (2009)) ⋮ Unitary 2-designs from random X- and Z-diagonal unitaries ⋮ One-shot randomized and nonrandomized partial decoupling ⋮ Decoupling with random quantum circuits ⋮ Quantum causal influence ⋮ Unitary designs and codes ⋮ A random unitary circuit model for black hole evaporation ⋮ Approximate randomized benchmarking for finite groups ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiplicativity of completely bounded \(p\)-norms implies a new additivity result
• Comparison theorems for reversible Markov chains
• Logarithmic Sobolev inequalities for finite Markov chains
• Simple permutations mix even better
• A Decoupling Approach to the Quantum Capacity
• Superpolynomial Speedups Based on Almost Any Quantum Circuit
• Evenly distributed unitaries: On the structure of unitary designs
• The mother of all protocols: restructuring quantum information’s family tree
• Mathematical Aspects of Mixing Times in Markov Chains
• Stabilization of Quantum Computations by Symmetrization
• Quantum data hiding
• The emergence of typical entanglement in two-party random processes
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques