2000 character limit reached
Upper bound and shareability of quantum discord based on entropic uncertainty relations
Published 30 Jan 2013 in quant-ph, math-ph, and math.MP | (1301.7240v3)
Abstract: By using the quantum-memory-assisted entropic uncertainty relation (EUR), we derive a computable tight upper bound for quantum discord, which applies to an arbitrary bipartite state. Detailed examples show that this upper bound is tighter than other known bounds in a wide regime. Furthermore, we show that for any tripartite pure state, the quantum-memory-assisted EUR imposes a constraint on the shareability of quantum correlations among the constituent parties. This conclusion amends the well accepted result that quantum discord is not monogamous.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.