Pseudo-random operators of the circular ensembles
Quantum Physics
2009-11-10 v2
Abstract
We demonstrate quantum algorithms to implement pseudo-random operators that closely reproduce statistical properties of random matrices from the three universal classes: unitary, symmetric, and symplectic. Modified versions of the algorithms are introduced for the less experimentally challenging quantum cellular automata. For implementing pseudo-random symplectic operators we provide gate sequences for the unitary part of the time-reversal operator.
Cite
@article{arxiv.quant-ph/0402157,
title = {Pseudo-random operators of the circular ensembles},
author = {Yaakov S. Weinstein and C. Stephen Hellberg},
journal= {arXiv preprint arXiv:quant-ph/0402157},
year = {2009}
}
Comments
5 pages, 4 figures, to be published PRA