Investigation of nonlocal information as condition for violations of Bell inequality and information causality

On the basis of local realism theory, nonlocal information is necessary for violation of Bell's inequality. From a theoretical point of view, nonlocal information is essentially the mutual information on distant outcome and measurement setting. In this work we prove that if the measurement is free and unbiased, the mutual information about the distant outcome and setting is both necessary for the violation of Bell's inequality in the case with unbiased marginal probabilities. In the case with biased marginal probabilities, we point out that the mutual information about distant outcome cease to be necessary for violation of Bell's inequality, while the mutual information about distant measurement settings is still required. We also prove that the mutual information about distant measurement settings must be contained in the transmitted messages due to the freedom of measurement choices. Finally we point out that the mutual information about both distant outcome and measurement settings are necessary for a violation of information causality.Comment: 5 pages, 3 figures, big change, version as close as possible to the published version in Eur. Phys. J.

Analysis of Generalized Grover's Quantum Search Algorithms Using Recursion Equations

The recursion equation analysis of Grover's quantum search algorithm presented by Biham et al. [PRA 60, 2742 (1999)] is generalized. It is applied to the large class of Grover's type algorithms in which the Hadamard transform is replaced by any other unitary transformation and the phase inversion is replaced by a rotation by an arbitrary angle. The time evolution of the amplitudes of the marked and unmarked states, for any initial complex amplitude distribution is expressed using first order linear difference equations. These equations are solved exactly. The solution provides the number of iterations T after which the probability of finding a marked state upon measurement is the highest, as well as the value of this probability, P_max. Both T and P_max are found to depend on the averages and variances of the initial amplitude distributions of the marked and unmarked states, but not on higher moments.Comment: 8 pages, no figures. To appear in Phys. Rev.

Quantum state merging and negative information

We consider a quantum state shared between many distant locations, and define a quantum information processing primitive, state merging, that optimally merges the state into one location. As announced in [Horodecki, Oppenheim, Winter, Nature 436, 673 (2005)], the optimal entanglement cost of this task is the conditional entropy if classical communication is free. Since this quantity can be negative, and the state merging rate measures partial quantum information, we find that quantum information can be negative. The classical communication rate also has a minimum rate: a certain quantum mutual information. State merging enabled one to solve a number of open problems: distributed quantum data compression, quantum coding with side information at the decoder and sender, multi-party entanglement of assistance, and the capacity of the quantum multiple access channel. It also provides an operational proof of strong subadditivity. Here, we give precise definitions and prove these results rigorously.Comment: 23 pages, 3 figure

Diagnostic yield of next-generation sequencing in very early-onset inflammatory bowel diseases: a multicenter study (vol 12, pg 1104, 2021)

Transplantation and immunomodulatio