Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userTypical local measurements in generalised probabilistic theories: emergence of quantum bipartite correlations
180
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
What singles out quantum mechanics as the fundamental theory of Nature? Here we study local measurements in generalised probabilistic theories (GPTs) and investigate how observational limitations affect the production of correlations. We find that if only a subset of typical local measurements can be made then all the bipartite correlations produced in a GPT can be simulated to a high degree of accuracy by quantum mechanics. Our result makes use of a generalisation of Dvoretzkys theorem for GPTs. The tripartite correlations can go beyond those exhibited by quantum mechanics, however.
rate research
Read More
Generalized probabilistic theories (GPT) provide a general framework that includes classical and quantum theories. It is described by a cone $C$ and its dual $C^*$. We show that whether some one-way communication complexity problems can be solved within a GPT is equivalent to the recently introduced cone factorisation of the corresponding communication matrix $M$. We also prove an analogue of Holevos theorem: when the cone $C$ is contained in $mathbb{R}^{n}$, the classical capacity of the channel realised by sending GPT states and measuring them is bounded by $log n$. Polytopes and optimising functions over polytopes arise in many areas of discrete mathematics. A conic extension of a polytope is the intersection of a cone $C$ with an affine subspace whose projection onto the original space yields the desired polytope. Extensions of polytopes can sometimes be much simpler geometric objects than the polytope itself. The existence of a conic extension of a polytope is equivalent to that of a cone factorisation of the slack matrix of the polytope, on the same cone. We show that all $0/1$ polytopes whose vertices can be recognized by a polynomial size circuit, which includes as a special case the travelling salesman polytope and many other polytopes from combinatorial optimisation, have small conic extension complexity when the cone is the completely positive cone. Using recent exponential lower bounds on the linear extension complexity of polytopes, this provides an exponential gap between the communication complexity of GPT based on the completely positive cone and classical communication complexity, and a conjectured exponential gap with quantum communication complexity. Our work thus relates the communication complexity of generalisations of quantum theory to questions of mainstream interest in the area of combinatorial optimisation.
Various inequalities (Boole inequality, Chung-Erdos 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.
Bit-commitment is a fundamental cryptographic task, in which Alice commits a bit to Bob such that she cannot later change the value of the bit, while, simultaneously, the bit is hidden from Bob. It is known that ideal bit-commitment is impossible within quantum theory. In this work, we show that it is also impossible in generalised probabilistic theories (under a small set of assumptions) by presenting a quantitative trade-off between Alices and Bobs cheating probabilities. Our proof relies crucially on a formulation of cheating strategies as cone programs, a natural generalisation of semidefinite programs. In fact, using the generality of this technique, we prove that this result holds for the more general task of integer-commitment.
We introduce quantum correlations measures based on the minimal change in unified entropies induced by local rank-one projective measurements, divided by a factor that depends on the generalized purity of the system in the case of non-additive entropies. In this way, we overcome the issue of the artificial increasing of the value of quantum correlations measures based on non-additive entropies when an uncorrelated ancilla is appended to the system without changing the computability of our entropic correlations measures with respect to the previous ones. Moreover, we recover as limiting cases the quantum correlations measures based on von Neumann and Renyi entropies (i.e., additive entropies), for which the adjustment factor becomes trivial. In addition, we distinguish between total and semiquantum correlations and obtain some relations between them. Finally, we obtain analytical expressions of the entropic correlations measures for typical quantum bipartite systems.
In this article, we show a sufficient and necessary condition for locally distinguishable bipartite states via one-way local operations and classical communication (LOCC). With this condition, we present some minimal structures of one-way LOCC indistinguishable quantum state sets. As long as an indistinguishable subset exists in a state set, the set is not distinguishable. We also list several distinguishable sets as instances.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
