The concept of self-testing (or rigidity) refers to the fact that for certain Bell inequalities the maximal violation can be achieved in an essentially unique manner. In this work we present a family of Bell inequalities which are maximally violated by multiple inequivalent quantum realisations. We completely characterise the quantum realisations achieving the maximal violation and we show that each of them requires a maximally entangled state of two qubits. This implies the existence of a new, weak form of self-testing in which the maximal violation allows us to identify the state, but does not fully determine the measurements. From the geometric point of view the set of probability points that saturate the quantum bound is a line segment. We then focus on a particular member of the family and show that the self-testing statement is robust, i.e. that observing a non-maximal violation allows us to make a quantitative statement about the unknown state. To achieve this we present a new construction of extraction channels and analyse their performance. For completeness we provide two independent approaches: analytical and numerical. The noise robustness, i.e. the amount of white noise at which the bound becomes trivial, of the analytical bound is rather small (~0.06%), but the numerical method takes us into an experimentally-relevant regime (~5%). We conclude by investigating the amount of randomness that can be certified using these Bell violations. Perhaps surprisingly, we find that the qualitative behaviour resembles the behaviour of rigid inequalities like the Clauser-Horne-Shimony-Holt inequality. This shows that at least for some device-independent applications rigidity is not a necessary ingredient.
The concept of self-testing (or rigidity) refers to the fact that for certain Bell inequalities the maximal violation can be achieved in an essentially unique manner. In this work we present a family of Bell inequalities which are maximally violated by multiple inequivalent quantum realisations. We completely characterise the quantum realisations achieving the maximal violation and we show that each of them requires a maximally entangled state of two qubits. This implies the existence of a new, weak form of self-testing in which the maximal violation allows us to identify the state, but does not fully determine the measurements. From the geometric point of view the set of probability points that saturate the quantum bound is a line segment. We then focus on a particular member of the family and show that the self-testing statement is robust, i.e. that observing a non-maximal violation allows us to make a quantitative statement about the unknown state. To achieve this we present a new construction of extraction channels and analyse their performance. For completeness we provide two independent approaches: analytical and numerical. The noise robustness, i.e. the amount of white noise at which the bound becomes trivial, of the analytical bound is rather small (~0.06%), but the numerical method takes us into an experimentally-relevant regime (~5%). We conclude by investigating the amount of randomness that can be certified using these Bell violations. Perhaps surprisingly, we find that the qualitative behaviour resembles the behaviour of rigid inequalities like the Clauser-Horne-Shimony-Holt inequality. This shows that at least for some device-independent applications rigidity is not a necessary ingredient.
Bell inequalities are an important tool in device-independent quantum information processing because their violation can serve as a certificate of relevant quantum properties. Probably the best known example of a Bell inequality is due to Clauser, Horne, Shimony and Holt (CHSH), which is defined in the simplest scenario involving two dichotomic measurements and whose all key properties are well understood. There have been many attempts to generalise the CHSH Bell inequality to higher-dimensional quantum systems, however, for most of them the maximal quantum violation---the key quantity for most device-independent applications---remains unknown. On the other hand, the constructions for which the maximal quantum violation can be computed, do not preserve the natural property of the CHSH inequality, namely, that the maximal quantum violation is achieved by the maximally entangled state and measurements corresponding to mutually unbiased bases. In this work we propose a novel family of Bell inequalities which exhibit precisely these properties, and whose maximal quantum violation can be computed analytically. In the simplest scenario it recovers the CHSH Bell inequality. These inequalities involve d measurements settings, each having d outcomes for an arbitrary prime number d ≥ 3 . We then show that in the three-outcome case our Bell inequality can be used to self-test the maximally entangled state of two-qutrits and three mutually unbiased bases at each site. Yet, we demonstrate that in the case of more outcomes, their maximal violation does not allow for self-testing in the standard sense, which motivates the definition of a new weak form of self-testing. The ability to certify high-dimensional MUBs makes these inequalities attractive from the device-independent cryptography point of view.
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 Clauser-Horne-Shimony-Holt (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.
Self-testing is a method with which a classical user can certify the state and measurements of quantum systems in a device-independent way. In particular, self-testing of entangled states is of great importance in quantum information processing. An understandable example is that the maximal violation of the Clauser-Horne-Shimony-Holt inequality necessarily implies that the bipartite system shares a singlet. One essential question in self-testing is that, when one observes a nonmaximum violation, how far is the tested state from the target state (which maximally violates a certain Bell inequality)? The answer to this question describes the robustness of the used self-testing criterion, which is highly important in a practical sense. Recently, J. Kaniewski derived two analytic self-testing bounds for bipartite and tripartite systems. In this Letter, we experimentally investigate these two bounds with high-quality two-qubit and three-qubit entanglement sources. The results show that these bounds are valid for various entangled states that we prepared. Thereby, a proof-of-concept demonstration of robust self-testing is achieved, which improves on the previous results significantly.
Self-testing is a device-independent technique based on non-local correlations whose aim is to certify the effective uniqueness of the quantum state and measurements needed to produce these correlations. It is known that the maximal violation of some Bell inequalities suffices for this purpose. However, most of the existing self-testing protocols for two devices exploit the well-known Clauser–Horne–Shimony–Holt Bell inequality or modifications of it, and always with two measurements per party. Here, we generalize the previous results by demonstrating that one can construct self-testing protocols based on the chained Bell inequalities, defined for two devices implementing an arbitrary number of two-output measurements. On the one hand, this proves that the quantum state and measurements leading to the maximal violation of the chained Bell inequality are unique. On the other hand, in the limit of a large number of measurements, our approach allows one to self-test the entire plane of measurements spanned by the Pauli matrices X and Z . Our results also imply that the chained Bell inequalities can be used to certify two bits of perfect randomness.
We consider the problem of certifying binary observables based on a Bell inequality violation alone, a task known as self-testing of measurements. We introduce a family of commutation-based measures, which encode all the distinct arrangements of two projective observables on a qubit. These quantities by construction take into account the usual limitations of self-testing and since they are ``weighted'' by the (reduced) state, they automatically deal with rank-deficient reduced density matrices. We show that these measures can be estimated from the observed Bell violation in several scenarios and the proofs rely only on standard linear algebra. The trade-offs turn out to be tight, and in particular, they give nontrivial statements for arbitrarily small violations. On the other extreme, observing the maximal violation allows us to deduce precisely the form of the observables, which immediately leads to a complete rigidity statement. In particular, we show that for all $n\ensuremath{\ge}3$ the n-partite Mermin-Ardehali-Belinskii-Klyshko inequality self-tests the n-partite Greenberger-Horne-Zeilinger state and maximally incompatible qubit measurements on every party. Our results imply that any pair of projective observables on a qubit can be certified in a truly robust manner. Finally, we show that commutation-based measures give a convenient way of expressing relations among more than two observables.
Given a Bell inequality, if its maximal quantum violation can be achieved only by a single set of measurements for each party or a single quantum state, up to local unitaries, one refers to such a phenomenon as self-testing. For instance, the maximal quantum violation of the Clauser-Horne-Shimony-Holt inequality certifies that the underlying state contains the two-qubit maximally entangled state and the measurements of one party contains a pair of anti-commuting qubit observables. As a consequence, the other party automatically verifies the set of states remotely steered, namely the "assemblage", is in the eigenstates of a pair of anti-commuting observables. It is natural to ask if the quantum violation of the Bell inequality is not maximally achieved, or if one does not care about self-testing the state or measurements, are we capable of estimating how close the underlying assemblage is to the reference one? In this work, we provide a systematic device-independent estimation by proposing a framework called "robust self-testing of steerable quantum assemblages". In particular, we consider assemblages violating several paradigmatic Bell inequalities and obtain the robust self-testing statement for each scenario. Our result is device-independent (DI), i.e., no assumption is made on the shared state and the measurement devices involved. Our work thus not only paves a way for exploring the connection between the boundary of quantum set of correlations and steerable assemblages, but also provides a useful tool in the areas of DI quantum certification. As two explicit applications, we show 1) that it can be used for an alternative proof of the protocol of DI certification of all entangled two-qubit states proposed by Bowles et al., and 2) that it can be used to verify all non-entanglement-breaking qubit channels with fewer assumptions compared with the work of Rosset et al.