Phys. Rev. A 77, 040303(R) (2008) [4 pages]Quantum pseudorandomness from cluster-state quantum computation
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. © 2008 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevA.77.040303
DOI:
10.1103/PhysRevA.77.040303
PACS:
03.67.Mn, 03.67.Bg, 03.67.Lx, 05.40.−a
|
|
About | Terms and Conditions | Subscriptions | Search | Help
Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.