Device-Independent Entanglement Certification of All Entangled States

Semi-Device-Independent Certification of Causal Nonseparability with Trusted Quantum Inputs

While the standard formulation of quantum theory assumes a fixed background causal structure, one can relax this assumption within the so-called process matrix framework. Remarkably, some processes, termed causally nonseparable, are incompatible with a definite causal order. We explore a form of certification of causal nonseparability in a semi-device-independent scenario where the involved parties receive trusted quantum inputs, but whose operations are otherwise uncharacterized. Defining the notion of causally nonseparable distributed measurements, we show that certain causally nonseparable processes that cannot violate any causal inequality, including the canonical example of the quantum switch, can generate noncausal correlations in such a scenario. Moreover, by imposing some further natural structure to the untrusted operations, we show that all bipartite causally nonseparable process matrices can be certified with trusted quantum inputs.

Nonlocality for Generic Networks

Bell's theorem shows that correlations created by a single entangled quantum state cannot be reproduced classically. Such correlations are called nonlocal. They are the elementary manifestation of a broader phenomenon called network nonlocality, where several entangled states shared in a network create network nonlocal correlations. In this Letter, we provide the first class of strategies producing nonlocal correlations in generic networks. In these strategies, called color matching (CM), any source takes a color at random or in superposition, where the colors are labels for a basis of the associated Hilbert space. A party (besides other things) checks if the color of neighboring sources match. We show that in a large class of networks without input, well-chosen quantum CM strategies result in nonlocal correlations that cannot be produced classically. For our construction, we introduce the graph theoretical concept of rigidity of classical strategies in networks, and using the Finner inequality, establish a deep connection between network nonlocality and graph theory. In particular, we establish a link between CM strategies and the graph coloring problem. This work is extended in a longer paper [35M.-O. Renou, Phys. Rev. A 105, 022408 (2022)PLRAAN2469-992610.1103/PhysRevA.105.022408], where we introduce a second family of rigid strategies called token counting, leading to network nonlocality.

Scalable Bell Inequalities for Qubit Graph States and Robust Self-Testing

Bell inequalities constitute a key tool in quantum information theory: they not only allow one to reveal nonlocality in composite quantum systems, but, more importantly, they can be used to certify relevant properties thereof. We provide a general construction of Bell inequalities that are maximally violated by the multiqubit graph states and can be used for their robust self-testing. Apart from their theoretical relevance, our inequalities offer two main advantages from an experimental viewpoint: (i) they present a significant reduction of the experimental effort needed to violate them, as the number of correlations they contain scales only linearly with the number of observers; (ii) numerical results indicate that the self-testing statements for graph states derived from our inequalities tolerate noise levels that are met by present experimental data. We also discuss possible generalizations of our approach to entangled states whose stabilizers are not tensor products of Pauli matrices. Our work introduces a promising approach for the certification of complex many-body quantum states.

Experimentally Verified Approach to Nonentanglement-Breaking Channel Certification

Ensuring the nonentanglement-breaking (non-EB) property of quantum channels is crucial for the effective distribution and storage of quantum states. However, a practical method for direct and accurate certification of the non-EB feature is highly desirable. Here, we propose and verify a realistic source based measurement device independent certification of non-EB channels. Our method is resilient to repercussions on the certification from experimental conditions, such as multiphotons and imperfect state preparation, and can be implemented with an information incomplete set. We achieve good agreement between experimental outcomes and theoretical predictions, which is validated by the expected results of the ideal semiquantum signaling game, and accurately certify the non-EB channels. Furthermore, our approach is highly robust to effects from noise. Therefore, the proposed approach can be expected to play a significant role in the design and evaluation of realistic quantum channels.

Device-Independent Detection of Genuine Multipartite Entanglement for All Pure States

We show that genuine multipartite entanglement of all multipartite pure states in arbitrary finite dimension can be detected in a device-independent way by employing bipartite Bell inequalities on states that are deterministically generated from the initial state via local operations. This leads to an efficient scheme for large classes of multipartite states that are relevant in quantum computation or condensed-matter physics, including cluster states and the ground state of the Affleck-Kennedy-Lieb-Tasaki (AKLT) model. For cluster states the detection of genuine multipartite entanglement involves only measurements on a constant number of systems with an overhead that scales linearly with the system size, while for the AKLT model the overhead is polynomial. In all cases our approach shows some robustness against experimental imperfections.

Experimentally Robust Self-testing for Bipartite and Tripartite Entangled States

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.