Pseudo-random operators of the circular ensembles

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.

5 pages, 4 figures, to be published PRA

References in corpus (7)

• Random Quantum Circuits and Pseudo-Random Operators: Theory and Applications
• Superdense coding of quantum states
• Quantum Process Tomography of the Quantum Fourier Transform
• Entangling power of the quantum baker's map
• Entanglement Dynamics in 1D Quantum Cellular Automata
• A Method for Modeling Decoherence on a Quantum Information Processor
• Quantum Cellular Automata Pseudo-Random Maps

Cited by in corpus (4)

• Distribution of bipartite entanglement for random pure states
• Entanglement Generation of Nearly-Random Operators
• Parameters of Pseudo-Random Quantum Circuits
• Matrix Element Distribution as a Signature of Entanglement Generation