Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAlgorithmic construction of local models for entangled quantum states: optimization for two-qubit states
118
0
0.0
(
0
)
Added by
S\\'ebastien Designolle
Publication date
2018
fields
Physics
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
The correlations of certain entangled quantum states can be fully reproduced via a local model. We discuss in detail the practical implementation of an algorithm for constructing local models for entangled states, recently introduced by Hirsch et al. [Phys. Rev. Lett. 117, 190402 (2016)] and Cavalcanti et al. [Phys. Rev. Lett. 117, 190401 (2016)]. The method allows one to construct both local hidden state (LHS) and local hidden variable (LHV) models, and can be applied to arbitrary entangled states in principle. Here we develop an improved implementation of the algorithm, discussing the optimization of the free parameters. For the case of two-qubit states, we design a ready-to-use optimized procedure. This allows us to construct LHS models (for projective measurements) that are almost optimal, as we show for Bell diagonal states, for which the optimal model has recently been derived. Finally, we show how to construct fully analytical local models, based on the output of the convex optimization procedure.
rate research
Read More
Constructing local hidden variable (LHV) models for entangled quantum states is challenging, as the model should reproduce quantum predictions for all possible local measurements. Here we present a simple method for building LHV models, applicable to general entangled states, which consists in verifying that the statistics resulting from a finite set of measurements is local, a much simpler problem. This leads to a sequence of tests which, in the limit, fully capture the set of quantum states admitting a LHV model. Similar methods are developed for constructing local hidden state models. We illustrate the practical relevance of these methods with several examples, and discuss further applications.
Entanglement allows for the nonlocality of quantum theory, which is the resource behind device-independent quantum information protocols. However, not all entangled quantum states display nonlocality, and a central question is to determine the precise relation between entanglement and nonlocality. Here we present the first general test to decide whether a quantum state is local, and that can be implemented by semidefinite programming. This method can be applied to any given state and for the construction of new examples of states with local hidden-variable models for both projective and general measurements. As applications we provide a lower bound estimate of the fraction of two-qubit local entangled states and present new explicit examples of such states, including those which arise from physical noise models, Bell-diagonal states, and noisy GHZ and W states.
A quantum memory for light is a key element for the realization of future quantum information networks. Requirements for a good quantum memory are (i) versatility (allowing a wide range of inputs) and (ii) true quantum coherence (preserving quantum information). Here we demonstrate such a quantum memory for states possessing Einstein-Podolsky-Rosen (EPR) entanglement. These multi-photon states are two-mode squeezed by 6.0 dB with a variable orientation of squeezing and displaced by a few vacuum units. This range encompasses typical input alphabets for a continuous variable quantum information protocol. The memory consists of two cells, one for each mode, filled with cesium atoms at room temperature with a memory time of about 1msec. The preservation of quantum coherence is rigorously proven by showing that the experimental memory fidelity 0.52(2) significantly exceeds the benchmark of 0.45 for the best possible classical memory for a range of displacements.
Among various definitions of quantum correlations, quantum discord has attracted considerable attention. To find analytical expression of quantum discord is an intractable task. Exact results are known only for very special states, namely, two-qubit X-shaped states. We present in this paper a geometric viewpoint, from which two-qubit quantum discord can be described clearly. The known results about X state discord are restated in the directly perceivable geometric language. As a consequence, the dynamics of classical correlations and quantum discord for an X state in the presence of decoherence is endowed with geometric interpretation. More importantly, we extend the geometric method to the case of more general states, for which numerical as well as analytica results about quantum discord have not been found yet. Based on the support of numerical computations, some conjectures are proposed to help us establish geometric picture. We find that the geometric picture for these states has intimate relationship with that for X states. Thereby in some cases analytical expressions of classical correlations and quantum discord can be obtained.
We plot the geometry of several distance-based quantifiers of coherence for Bell-diagonal states. We find that along with both $l_{1}$ norm and relative entropy of coherence changes continuously from zero to one, their surfaces move from the separable regions to the entangled regions. Based on this fact, it is more illuminating to use an intuitive geometry to explain quantum states with nonzero coherence can be used for entanglement creation, rather than the other way around. We find the necessary and sufficient conditions that quantum discord of Bell-diagonal states equal to its relative entropy of coherence and depict the surfaces of the equality. We give surfaces of relative entropy of coherence for $X$ states. We show the surfaces of dynamics of relative entropy of coherence for Bell-diagonal states under local nondissipative channels and find that all coherence under local nondissipative channels decrease.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
