Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOne-sided Device-independent Self-testing of any Pure Two-qubit Entangled State
84
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We consider the problem of $1$-sided device-independent self-testing of any pure entangled two-qubit state based on steering inequalities which certify the presence of quantum steering. In particular, we note that in the $2-2-2$ steering scenario (involving $2$ parties, $2$ measurement settings per party, $2$ outcomes per measurement setting), the maximal violation of a fine-grained steering inequality can be used to witness certain extremal steerable correlations, which certify all pure two-qubit entangled states. We demonstrate that the violation of analogous CHSH inequality of steering or nonvanishing value of a quantity constructed using a correlation function called mutual predictability together with the maximal violation of fine-grained steering inequality can be used to self-test any pure entangled two-qubit state in a $1$-sided device-independent way.
rate research
Read More
Previous theoretical works showed that all pure two-qubit entangled states can generate one bit of local randomness and can be self-tested through the violation of proper Bell inequalities. We report an experiment in which nearly pure partially entangled states of photonic qubits are produced to investigate these tasks in a practical scenario. We show that small deviations from the ideal situation make low entangled states impractical to self-testing and randomness generation using the available techniques. Our results show that in practice lower entanglement implies lower randomness generation, recovering the intuition that maximally entangled states are better candidates for deviceindependent quantum information processing.
We study the problem of remote one-qubit mixed state creation using a pure initial state of two-qubit sender and spin-1/2 chain as a connecting line. We express the parameters of creatable states in terms of transition amplitudes. We show that the creation of complete receivers state-space can be achieved only in the chain engineered for the one-qubit perfect state transfer (PST) (for instance, in the fully engineered Ekert chain), the chain can be arbitrarily long in this case. As for the homogeneous chain, the creatable receivers state region decreases quickly with the chain length. Both homogeneous chains and chains engineered for PST can be used for the purpose of selective state creation, when only the restricted part of the whole receivers state space is of interest. Among the parameters of the receivers state, the eigenvalue is the most hard creatable one and therefore deserves the special study. Regarding the homogeneous spin chain, an arbitrary eigenvalue can be created only if the chain is of no more then 34 nodes. Alternating chain allows us to increase this length up to 68 nodes.
It is well-known that observing nonlocal correlations allows us to draw conclusions about the quantum systems under consideration. In some cases this yields a characterisation which is essentially complete, a phenomenon known as self-testing. Self-testing becomes particularly interesting if we can make the statement robust, so that it can be applied to a real experimental setup. For the simplest self-testing scenarios the most robust bounds come from the method based on operator inequalities. In this work we elaborate on this idea and apply it to the family of tilted CHSH inequalities. These inequalities are maximally violated by partially entangled two-qubit states and our goal is to estimate the quality of the state based only on the observed violation. For these inequalities we have reached a candidate bound and while we have not been able to prove it analytically, we have gathered convincing numerical evidence that it holds. Our final contribution is a proof that in the usual formulation, the CHSH inequality only becomes a self-test when the violation exceeds a certain threshold. This shows that self-testing scenarios fall into two distinct classes depending on whether they exhibit such a threshold or not.
The states of three-qubit systems split into two inequivalent types of genuine tripartite entanglement, namely the Greenberger-Horne-Zeilinger (GHZ) type and the $W$ type. A state belonging to one of these classes can be stochastically transformed only into a state within the same class by local operations and classical communications. We provide local quantum operations, consisting of the most general two-outcome measurement operators, for the deterministic transformations of three-qubit pure states in which the initial and the target states are in the same class. We explore these transformations, originally having standard GHZ and standard $W$ states, under the local measurement operations carried out by a single party and $p$ ($p=2,3$) parties (successively). We find a notable result that the standard GHZ state cannot be deterministically transformed to a GHZ-type state in which all its bipartite entanglements are nonzero, i.e., a transformation can be achieved with unit probability when the target state has at least one vanishing bipartite concurrence.
With the growing availability of experimental loophole-free Bell tests, it has become possible to implement a new class of device-independent random number generators whose output can be certified to be uniformly random without requiring a detailed model of the quantum devices used. However, all of these experiments require many input bits in order to certify a small number of output bits, and it is an outstanding challenge to develop a system that generates more randomness than is used. Here, we devise a device-independent spot-checking protocol which uses only uniform bits as input. Implemented with a photonic loophole-free Bell test, we can produce 24% more certified output bits (1,181,264,237) than consumed input bits (953,301,640), which is 5 orders of magnitude more efficient than our previous work [arXiv:1812.07786]. The experiment ran for 91.0 hours, creating randomness at an average rate of 3606 bits/s with a soundness error bounded by $5.7times 10^{-7}$ in the presence of classical side information. Our system will allow for greater trust in public sources of randomness, such as randomness beacons, and the protocols may one day enable high-quality sources of private randomness as the device footprint shrinks.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
