Document Type
Article
Publication Date
4-30-2008
Publication Title
Physical Review A - Atomic, Molecular, and Optical Physics
Department
Department of Physics and Astronomy
Abstract
We show how to efficiently generate pseudorandom states suitable for quantum information processing via cluster-state quantum computation. By reformulating pseudorandom algorithms in the cluster-state picture, we identify a strategy for optimizing pseudorandom circuits by properly choosing single-qubit rotations. A Markov chain analysis provides the tool for analyzing convergence rates to the Haar measure and finding the optimal single-qubit gate distribution. Our results may be viewed as an alternative construction of approximate unitary 2-designs.
DOI
10.1103/PhysRevA.77.040303
Dartmouth Digital Commons Citation
Brown, Winton G.; Weinstein, Yaakov S.; and Viola, Lorenza, "Quantum Pseudorandomness from Cluster-State Quantum Computation" (2008). Dartmouth Scholarship. 1922.
https://digitalcommons.dartmouth.edu/facoa/1922
