Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
157 tokens/sec
GPT-4o
8 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Low entropy output states for products of random unitary channels (1208.1449v1)

Published 7 Aug 2012 in math-ph, math.MP, math.PR, and quant-ph

Abstract: In this paper, we study the behaviour of the output of pure entangled states after being transformed by a product of conjugate random unitary channels. This study is motivated by the counterexamples by Hastings and Hayden-Winter to the additivity problems. In particular, we study in depth the difference of behaviour between random unitary channels and generic random channels. In the case where the number of unitary operators is fixed, we compute the limiting eigenvalues of the output states. In the case where the number of unitary operators grows linearly with the dimension of the input space, we show that the eigenvalue distribution converges to a limiting shape that we characterize with free probability tools. In order to perform the required computations, we need a systematic way of dealing with moment problems for random matrices whose blocks are i.i.d. Haar distributed unitary operators. This is achieved by extending the graphical Weingarten calculus introduced in Collins and Nechita (2010).

Summary

We haven't generated a summary for this paper yet.