Pith. sign in

REVIEW

Probabilistic inequalities and measurements in bipartite systems

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1903.06591 v1 pith:QRQHIGN3 submitted 2019-03-15 quant-ph

Probabilistic inequalities and measurements in bipartite systems

classification quant-ph
keywords inequalitiesstatesquantumrankclassicalholdinequalitysome
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

Various inequalities (Boole inequality, Chung-Erd\"os inequality, Frechet inequality) for Kolmogorov (classical) probabilities are considered. Quantum counterparts of these inequalities are introduced, which have an extra `quantum correction' term, and which hold for all quantum states. When certain sufficient conditions are satisfied, the quantum correction term is zero, and the classical version of these inequalities holds for all states. But in general, the classical version of these inequalities is violated by some of the quantum states. For example in bipartite systems, classical Boole inequalities hold for all rank one (factorizable) states, and are violated by some rank two (entangled) states. A logical approach to CHSH inequalities (which are related to the Frechet inequalities), is studied in this context.It is shown that CHSH inequalities hold for all rank one (factorizable) states, and are violated by some rank two (entangled) states. The reduction of the rank of a pure state by a quantum measurement with both orthogonal and coherent projectors, is studied. Bounds for the average rank reduction are given.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.