arXiv · 0802.1919
Random Quantum Circuits are Approximate 2-designs
Abstract
Given a universal gate set on two qubits, it is well known that applying random gates from the set to random pairs of qubits will eventually yield an approximately Haar-distributed unitary. However, this requires exponential time. We show that random circuits of only polynomial length will approximate the first and second moments of the Haar distribution, thus forming approximate 1- and 2-designs. Previous constructions required longer circuits and worked only for specific gate sets. As a corollary of our main result, we also improve previous bounds on the convergence rate of random walks on the Clifford group.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Aram W. Harrow, Richard A. Low. 2009-10-13. Random Quantum Circuits are Approximate 2-designs. https://doi.org/10.1007/s00220-009-0873-6
Cite the original work for its findings. Save a collection to share your selection of sources.