English
Related papers

Related papers: Locally accessible information: How much can the p…

200 papers

Quantum theory imposes fundamental limitations to the amount of information that can be carried by any quantum system. On the one hand, Holevo bound rules out the possibility to encode more information in a quantum system than in its…

Quantum Physics · Physics 2015-07-29 Michele Dall'Arno

Bound information, a cryptographic classical analogue of bound entanglement, is defined as classical secret correlations from which no secret key can be extracted. Its existence was conjectured and shown in a multipartite case. In this…

Quantum Physics · Physics 2011-05-03 Giuseppe Prettico , Joonwoo Bae

We introduce an effective thermodynamics for multipartite entangled pure states and derive an upper bound on extractable energy with feedback control from a subsystem under a local Hamiltonian. The inequality that gives the upper bound…

Quantum Physics · Physics 2024-08-26 Kanji Itoh , Yusuke Masaki , Hiroaki Matsueda

In this work, we consider an upper bound for the quantum mutual information in thermal states of a bipartite quantum system. This bound is related with the interaction energy and logarithm of the partition function of the system. We…

Quantum Physics · Physics 2015-03-20 Aleksey Fedorov , Evgeny Kiktenko

The definition of accessible coherence is proposed. Through local measurement on the other subsystem and one way classical communication, a subsystem can access more coherence than the coherence of its density matrix. Based on the local…

Quantum Physics · Physics 2017-04-27 Teng Ma , Ming-Jing Zhao , Hai-Jun Zhang , Shao-Ming Fei , Gui-Lu Long

A new type of complementary relation is found between locally accessible information and final average entanglement for given ensemble. It is also shown that in some well known distillation protocol, this complementary relation is optimally…

Quantum Physics · Physics 2009-11-10 Sibasish Ghosh , Pramod Joag , Guruprasad Kar , Samir Kunkri , Anirban Roy

We derive lower limits on the inefficiency and classical communication costs of dilution between two-term bipartite pure states that are partially entangled. We first calculate explicit relations between the allowable error and classical…

Quantum Physics · Physics 2009-11-10 Ben Fortescue , Hoi-Kwong Lo

Operations that are trivial in the classical world, like accessing information without introducing any change or disturbance, or like copying information, become non-trivial in the quantum world. In this note we discuss several limitations…

Quantum Physics · Physics 2016-08-10 Marco Piani

Quantum data processing inequality bounds the set of bipartite states that can be generated by two far apart parties under local operations; Having access to a bipartite state as a resource, two parties cannot locally transform it to…

Quantum Physics · Physics 2023-03-14 Salman Beigi

A Holevo measure is used to discuss how much information about a given POVM on system $a$ is present in another system $b$, and how this influences the presence or absence of information about a different POVM on $a$ in a third system $c$.…

Quantum Physics · Physics 2013-05-29 Patrick J. Coles , Li Yu , Vlad Gheorghiu , Robert B. Griffiths

We give a capacity formula for the classical communication over a noisy quantum channel, when local operations and global permutations allowed in the encoding and bipartite states preshared between the sender and the receiver. The two…

Quantum Physics · Physics 2020-01-10 Kun Wang , Masahito Hayashi

I consider deterministic distinguishability of a set of orthogonal, bipartite states when only a single copy is available and the parties are restricted to local operations and classical communication, but with the additional requirement…

Quantum Physics · Physics 2009-11-13 Scott M. Cohen

We study the entanglement of a multipartite quantum state. An inequality between the bipartite concurrence and the multipartite concurrence is obtained. More effective lower and upper bounds of the multipartite concurrence are obtained. By…

Quantum Physics · Physics 2015-05-19 Ming Li , Shao-Ming Fei , Zhi-Xi Wang

We pose a problem called ``broadcasting Holevo-information'': given an unknown state taken from an ensemble, the task is to generate a bipartite state transfering as much Holevo-information to each copy as possible. We argue that upper…

Quantum Physics · Physics 2013-05-29 Dominik Janzing , Bastian Steudel

We initiate the study of quantifying nonlocalness of a bipartite measurement by the minimum amount of classical communication required to simulate the measurement. We derive general upper bounds, which are expressed in terms of certain…

Quantum Physics · Physics 2011-11-04 Yaoyun Shi , Yufan Zhu

We present a family of easily computable upper bounds for the Holevo quantity of ensemble of quantum states depending on a reference state as a free parameter. These upper bounds are obtained by combining probabilistic and metric…

Quantum Physics · Physics 2019-10-18 M. E. Shirokov

How should we gather information in a network, where each node's visibility is limited to its local neighborhood? This problem arises in numerous real-world applications, such as surveying and task routing in social networks, team formation…

Artificial Intelligence · Computer Science 2015-05-07 Adish Singla , Eric Horvitz , Pushmeet Kohli , Ryen White , Andreas Krause

Holevo information is an upper bound for the accessible classical information of an ensemble of quantum states. In this work, we use Holevo information to investigate the ensemble theory interpretation of quantum gravity. We study the…

High Energy Physics - Theory · Physics 2022-03-02 Xiao-Liang Qi , Zhou Shangnan , Zhenbin Yang

We demonstrate the existence of Gaussian multipartite bound information which is a classical analog of Gaussian multipartite bound entanglement. We construct a tripartite Gaussian distribution from which no secret key can be distilled, but…

Quantum Physics · Physics 2015-05-30 Ladislav Mišta, , Natalia Korolkova

In the collaborative clustering framework, the hope is that by combining several clustering solutions, each one with its own bias and imperfections, one will get a better overall solution. The goal is that each local computation, quite…

Machine Learning · Computer Science 2021-03-25 Yohan Foucade , Younès Bennani