Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userObservation of nonlocality sharing via not-so-weak measurements
70
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Nonlocality plays a fundamental role in quantum information science. Recently, it has been theoretically predicted and experimentally demonstrated that the nonlocality of an entangled pair may be shared among multiple observers using weak measurements with moderate strength. Here we devise an optimal protocol of nonlocality sharing among three observers and show experimentally that nonlocality sharing may be also achieved using weak measurements with near-maximum strength. Our result sheds light on the interplay between nonlocality and quantum measurements and, may find applications in quantum steering, unbounded randomness certification and quantum communication network.
rate research
Read More
Many graph problems are locally checkable: a solution is globally feasible if it looks valid in all constant-radius neighborhoods. This idea is formalized in the concept of locally checkable labelings (LCLs), introduced by Naor and Stockmeyer (1995). Recently, Chang et al. (2016) showed that in bounded-degree graphs, every LCL problem belongs to one of the following classes: - Easy: solvable in $O(log^* n)$ rounds with both deterministic and randomized distributed algorithms. - Hard: requires at least $Omega(log n)$ rounds with deterministic and $Omega(log log n)$ rounds with randomized distributed algorithms. Hence for any parameterized LCL problem, when we move from local problems towards global problems, there is some point at which complexity suddenly jumps from easy to hard. For example, for vertex coloring in $d$-regular graphs it is now known that this jump is at precisely $d$ colors: coloring with $d+1$ colors is easy, while coloring with $d$ colors is hard. However, it is currently poorly understood where this jump takes place when one looks at defective colorings. To study this question, we define $k$-partial $c$-coloring as follows: nodes are labeled with numbers between $1$ and $c$, and every node is incident to at least $k$ properly colored edges. It is known that $1$-partial $2$-coloring (a.k.a. weak $2$-coloring) is easy for any $d ge 1$. As our main result, we show that $k$-partial $2$-coloring becomes hard as soon as $k ge 2$, no matter how large a $d$ we have. We also show that this is fundamentally different from $k$-partial $3$-coloring: no matter which $k ge 3$ we choose, the problem is always hard for $d = k$ but it becomes easy when $d gg k$. The same was known previously for partial $c$-coloring with $c ge 4$, but the case of $c < 4$ was open.
Recently the authors in [Phys. Rev. Lett. 125, 090401 (2020)] considered the following scenario: Alice and Bob each have half of a pair of entangled qubit state. Bob measures his half and then passes his part to a second Bob who measures again and so on. The goal is to maximize the number of Bobs that can have an expected violation of the Clauser-Horne-Shimony-Holt (CHSH) inequality with the single Alice. By taking the maximally entangled pure two-qubit state as an example, it has been constructively proved that arbitrarily many independent Bobs can share the nonlocality with the single Alice. Here we demonstrate that arbitrarily many independent observers can share the nonlocality of a single arbitrary dimensional bipartite entangled but not necessary two-qubit entangled state. Further, taking the generalized GHZ states as an example, we show that at most two Charlies can share the genuine nonlocality of a single generalized GHZ state with an Alice and a Bob.
In this article, we propose measurement-induced nonlocality (MIN) quantified by Hellinger distance using von Neumann projective measurement. The proposed MIN is a bonafide measure of nonlocal correlation and is resistant to local ancilla problem. We obtain an analytical expression of the Hellinger distance MIN for general pure and $2 otimes n$ mixed states. In addition to comparing with similar measures, we explore the role of weak measurement in capturing nonlocal correlation.
In this work we give a $(n,n)$-threshold protocol for sequential secret sharing of quantum information for the first time. By sequential secret sharing we refer to a situation where the dealer is not having all the secrets at the same time, at the beginning of the protocol; however if the dealer wishes to share secrets at subsequent phases she/he can realize it with the help of our protocol. First of all we present our protocol for three parties and later we generalize it for the situation where we have $(n>3)$ parties. Further in a much more realistic situation, we consider the sharing of qubits through two kinds of noisy channels, namely the phase damping channel (PDC) and the amplitude damping channel (ADC). When we carry out the sequential secret sharing in the presence of noise we observe that the fidelity of secret sharing at the $k^{th}$ iteration is independent of the effect of noise at the $(k-1)^{th}$ iteration. In case of ADC we have seen that the average fidelity of secret sharing drops down to $frac{1}{2}$ which is equivalent to a random guess of the quantum secret. Interestingly, we find that by applying weak measurements one can enhance the average fidelity. This increase of the average fidelity can be achieved with certain trade off with the success probability of the weak measurements.
We give strong analytic and numerical evidence that, under mild measurement assumptions, two qubits cannot both be recycled to generate Bell nonlocality between multiple independent observers on each side. This is surprising, as under the same assumptions it is possible to recycle just one of the qubits an arbitrarily large number of times [P. J. Brown and R. Colbeck, Phys. Rev. Lett. 125, 090401 (2020)]. We derive corresponding one-sided monogamy relations that rule out two-sided recycling for a wide range of parameters, based on a general tradeoff relation between the strengths and maximum reversibilities of qubit measurements. We also show if the assumptions are relaxed to allow sufficiently biased measurement selections, then there is a narrow range of measurement strengths that allows two-sided recycling for two observers on each side, and propose an experimental test. Our methods may be readily applied to other types of quantum correlations, such as steering and entanglement, and hence to general information protocols involving sequential measurements.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
