Correlation/Communication complexity of generating bipartite states

Details Correlation/Communication complexity of generating bipartite states Correlation/Communication complexity of generating bipartite states

2012-03-06

arxiv.org/abs/1203.1153v1

Computer Science

Computational Complexity

12 pages, no figure

Scientific paper

We study the correlation complexity (or equivalently, the communication complexity) of generating a bipartite quantum state $\rho$. When $\rho$ is a pure state, we completely characterize the complexity for approximately generating $\rho$ by a corresponding approximate rank, closing a gap left in Ambainis, Schulman, Ta-Shma, Vazirani and Wigderson (SIAM Journal on Computing, 32(6):1570-1585, 2003). When $\rho$ is a classical distribution $P(x,y)$, we tightly characterize the complexity of generating $P$ by the psd-rank, a measure recently proposed by Fiorini, Massar, Pokutta, Tiwary and de Wolf (STOC 2012). We also present a characterization of the complexity of generating a general quantum state $\rho$.

Affiliated with

Also associated with

No associations

Rating

Correlation/Communication complexity of generating bipartite states does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Correlation/Communication complexity of generating bipartite states, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Correlation/Communication complexity of generating bipartite states will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-537102