Abstract
A recent work by Mandarino, Linowski and Życzkowski left open the following question. If [Formula: see text] is a certain permutation of entries of an [Formula: see text] matrix (“mixing map”) and [Formula: see text] is an [Formula: see text] Haar unitary random matrix, then is the family [Formula: see text] asymptotically free? (Here by [Formula: see text] we understand the matrix resulted by permuting the entries of [Formula: see text] according to the permutation [Formula: see text].) This paper presents some techniques for approaching such problems. In particular, one easy consequence of the main result is that the question above has an affirmative answer.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Infinite Dimensional Analysis, Quantum Probability and Related Topics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
