Random unitary matrices associated to a graph
arXiv:1311.3585 · doi:10.12693/APhysPolA.124.1098
Abstract
We analyze composed quantum systems consisting of subsystems, each described by states in the -dimensional Hilbert space. Interaction between subsystems can be represented by a graph, with vertices corresponding to individual subsystems and edges denoting a generic interaction, modeled by random unitary matrices of order . The global evolution operator is represented by a unitary matrix of size . We investigate statistical properties of such matrices and show that they display spectral properties characteristic to Haar random unitary matrices provided the corresponding graph is connected. Thus basing on random unitary matrices of a small size one can construct a fair approximation of large random unitary matrices of size . Graph--structured random unitary matrices investigated here allow one to define the corresponding structured ensembles of random pure states.
arXiv comment13 pages, 10 figures, 1 table
References in corpus (16)
- Average Entropy of a Subsystem
- Criticality, the area law, and the computational power of PEPS
- Induced measures in the space of mixed quantum states
- Quantum Graphs: Applications to Quantum Chaos and Universal Spectral Statistics
- Valence Bond Solids for Quantum Computation
- Random Quantum Circuits and Pseudo-Random Operators: Theory and Applications
- Experimental simulation of quantum graphs by microwave networks
- Composed ensembles of random unitary matrices
- Entanglement Distribution in Pure-State Quantum Networks
- Random unistochastic matrices
- Random graph states, maximal flow and Fuss-Catalan distributions
- Multipartite entanglement percolation
- Optimal two-qubit gate for generation of random bipartite entanglement
- Area law for random graph states
- Extremal spacings between eigenphases of random unitary matrices and their tensor products
- Pseudo-Random Circuits from Clifford Plus T-Gates