Approximate unitary \(t\)-designs by short random quantum circuits using nearest-neighbor and long-range gates

DOI10.1007/s00220-023-04675-zarXiv1809.06957OpenAlexW2891685619MaRDI QIDQ6165434

Saeed Mehraban, Aram W. Harrow

Publication date: 4 July 2023

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

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

Mathematics Subject Classification ID

Theory of computing (68Qxx) Circuits, networks (94Cxx) Foundations, quantum information and its processing, quantum axioms, and philosophy (81Pxx)

Related Items

Linear growth of circuit complexity from Brownian dynamics ⋮ Random quantum circuits transform local noise into global white noise

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Local random quantum circuits are approximate polynomial-designs
• 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)\)
• Decoupling with random quantum circuits
• Integration with respect to the Haar measure on unitary, orthogonal and symplectic group
• Random quantum circuits are approximate 2-designs
• Tail bounds for sums of geometric and exponential variables
• Cutoff for a stratified random walk on the hypercube
• Computational complexity and black hole horizons
• Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
• The computational complexity of ball permutations
• Quantum Supremacy and the Complexity of Random Circuit Sampling
• Quantum advantage with shallow circuits
• The emergence of typical entanglement in two-party random processes
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• The computational complexity of linear optics
• Unitary 2-designs from random X- and Z-diagonal unitaries
• Random Walk and the Theory of Brownian Motion