Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 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

Local Transformations Requiring Infinite Rounds of Classical Communication (1105.3451v1)

Published 17 May 2011 in quant-ph

Abstract: In this paper, we study the number of rounds of communication needed to implement certain tasks by local quantum operations and classical communication (LOCC). We find that the class of LOCC operations becomes strictly more powerful as more rounds of classical communication are permitted. Specifically, for every $n$, there always exists an $n$ round protocol that is impossible to implement in $n-2$ rounds. Furthermore, we show that certain entanglement transformations are possible if and only if the protocol uses an infinite (unbounded) number of rounds. Interestingly, the number of rounds required to deterministically distill bipartite entanglement from a single multipartite state can be strongly discontinuous with respect to the amount of entanglement distilled.

Summary

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