Papers
Topics
Authors
Recent
Search
2000 character limit reached

Robust self-testing of the $m-$partite maximally entangled state and observables

Published 20 Aug 2024 in quant-ph | (2408.10732v1)

Abstract: As quantum technologies continue to advance rapidly, the device-independent testing of the functioning of a quantum device has become increasingly important. Self-testing, a correlation based protocol, enables such certification of a promised quantum state as well as measurements performed on it without requiring knowledge of the device's internal workings. This approach typically relies on achieving the optimal quantum violation of a suitable Bell inequality. Self-testing has been extensively investigated in the context of bipartite Bell experiments. However, its extension to multipartite scenarios remains largely unexplored, owing to the intricate nature of multipartite quantum correlations. In this work, we propose a simple and efficient self-testing protocol that certifies the state and observables based on the optimal quantum violation of the Svetlichny inequality involving an arbitrary number of parties, each with two inputs. Our method leverages an elegant sum-of-squares approach to derive the optimal quantum value of the Svetlichny functional, devoid of assuming the dimension of the quantum system. This enables the self-testing of the $m-$partite maximally entangled state and local anti-commuting observables for each party. Moreover, we develop a swap circuit isometry to assess the proximity of reference states and measurements to their ideal counterparts in the presence of noise and imperfections in real experiments, thereby demonstrating the robustness of our self-testing protocol. Finally, we illustrate how our self-testing protocol facilitates the generation of certified genuine randomness from correlations that enable the optimal violation of the Svetlichny inequality.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.