Quantum pseudo-randomness from cluster-state quantum computation
arXiv:0802.2675 · doi:10.1103/PhysRevA.77.040303
Abstract
We show how to efficiently generate pseudo-random states suitable for quantum information processing via cluster-state quantum computation. By reformulating pseudo-random algorithms in the cluster-state picture, we identify a strategy for optimizing pseudo-random 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.
4 pages, 4 figures, version appearing in Phys. Rev. A
References in corpus (11)
- Aspects of generic entanglement
- Randomizing quantum states: Constructions and applications
- Symmetrised Characterisation of Noisy Quantum Processes
- Superdense coding of quantum states
- Remote preparation of quantum states
- Emergence of typical entanglement in two-party random processes
- Quantum Chaos, Delocalization, and Entanglement in Disordered Heisenberg Models
- Generalized entanglement as a framework for complex quantum systems: Purity vs delocalization measures
- Optimal two-qubit gate for generation of random bipartite entanglement
- Photonic entanglement as a resource in quantum computation and quantum communication
- Formation of Multipartite Entanglement Using Random Quantum Gates