Self-testing is a method of quantum state and measurement estimation that does not rely on assumptions about the inner working of the devices used.Its experimental realization has been limited to sources producing single quantum states so far.In this work, we experimentally implement two significant building blocks of a quantum network involving two independent sources: namely, a parallel configuration, in which two parties share two copies of a state, and a tripartite configuration, where a central node shares two independent states with peripheral nodes.Then, by extending previous self-testing techniques, we provide device-independent lower bounds on the fidelity between the generated states and an ideal target made by the tensor product of two maximally entangled two-qubit states.Given its scalability and versatility, this technique can find application in the certification of larger networks of different topologies for quantum communication and cryptography tasks and randomness generation protocols.
Self-testing is a method of quantum state and measurement estimation that does not rely on assumptions about the inner working of the devices used.Its experimental realization has been limited to sources producing single quantum states so far.In this work, we experimentally implement two significant building blocks of a quantum network involving two independent sources: namely, a parallel configuration, in which two parties share two copies of a state, and a tripartite configuration, where a central node shares two independent states with peripheral nodes.Then, by extending previous self-testing techniques, we provide device-independent lower bounds on the fidelity between the generated states and an ideal target made by the tensor product of two maximally entangled two-qubit states.Given its scalability and versatility, this technique can find application in the certification of larger networks of different topologies for quantum communication and cryptography tasks and randomness generation protocols.
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 method to characterise an arbitrary quantum system based only on its classical input-output correlations, and plays an important role in device-independent quantum information processing as well as quantum complexity theory. Prior works on self-testing require the assumption that the system's state is shared among multiple parties that only perform local measurements and cannot communicate. Here, we replace the setting of multiple non-communicating parties, which is difficult to enforce in practice, by a single computationally bounded party. Specifically, we construct a protocol that allows a classical verifier to robustly certify that a single computationally bounded quantum device must have prepared a Bell pair and performed single-qubit measurements on it, up to a change of basis applied to both the device's state and measurements. This means that under computational assumptions, the verifier is able to certify the presence of entanglement, a property usually closely associated with two separated subsystems, inside a single quantum device. To achieve this, we build on techniques first introduced by Brakerski et al. (2018) and Mahadev (2018) which allow a classical verifier to constrain the actions of a quantum device assuming the device does not break post-quantum cryptography.
Self-testing is a method to characterise an arbitrary quantum system based only on its classical input-output correlations, and plays an important role in device-independent quantum information processing as well as quantum complexity theory. Prior works on self-testing require the assumption that the system’s state is shared among multiple parties that only perform local measurements and cannot communicate. Here, we replace the setting of multiple non-communicating parties, which is difficult to enforce in practice, by a single computationally bounded party. Specifically, we construct a protocol that allows a classical verifier to robustly certify that a single computationally bounded quantum device must have prepared a Bell pair and performed single-qubit measurements on it, up to a change of basis applied to both the device’s state and measurements. This means that under computational assumptions, the verifier is able to certify the presence of entanglement, a property usually closely associated with two separated subsystems, inside a single quantum device. To achieve this, we build on techniques first introduced by Brakerski et al. (2018) and Mahadev (2018) which allow a classical verifier to constrain the actions of a quantum device assuming the device does not break post-quantum cryptography.
Self-testing is a method to characterise an arbitrary quantum system based only on its classical input-output correlations, and plays an important role in device-independent quantum information processing as well as quantum complexity theory. Prior works on self-testing require the assumption that the system’s state is shared among multiple parties that only perform local measurements and cannot communicate. Here, we replace the setting of multiple non-communicating parties, which is difficult to enforce in practice, by a single computationally bounded party. Specifically, we construct a protocol that allows a classical verifier to robustly certify that a single computationally bounded quantum device must have prepared a Bell pair and performed single-qubit measurements on it, up to a change of basis applied to both the device’s state and measurements. This means that under computational assumptions, the verifier is able to certify the presence of entanglement, a property usually closely associated with two separated subsystems, inside a single quantum device. To achieve this, we build on techniques first introduced by Brakerski et al. (2018) and Mahadev (2018) which allow a classical verifier to constrain the actions of a quantum device assuming the device does not break post-quantum cryptography.
Abstract Quantum entanglement is the key resource for quantum information processing. Device-independent certification of entangled states is a long standing open question, which arouses the concept of self-testing. The central aim of self-testing is to certify the state and measurements of quantum systems without any knowledge of their inner workings, even when the used devices cannot be trusted. Specifically, utilizing Bell’s theorem, one can infer the appearance of certain entangled state when the maximum violation is observed, e.g., to self-test singlet state using CHSH inequality. In this work, by constructing a versatile entanglement source, we experimentally demonstrate a generalized self-testing proposal for various bipartite entangled states up to four dimensions. We show that the high-quality generated states can approach the maximum violations of the utilized Bell inequalities, and thus, their Schmidt coefficients can be precisely inferred by self-testing them into respective target states with near-unity fidelities. Our results indicate the superior completeness and robustness of this method and promote self-testing as a practical tool for developing quantum techniques.
Self-testing protocols are methods to determine the presence of shared entangled states in a device independent scenario, where no assumptions on the measurements involved in the protocol are made. A particular type of self-testing protocol, called parallel self-testing, can certify the presence of copies of a state, however such protocols typically suffer from the problem of requiring a number of measurements that increases with respect to the number of copies one aims to certify. Here we propose a procedure to transform single-copy self-testing protocols into a procedure that certifies the tensor product of an arbitrary number of (not necessarily equal) quantum states, without increasing the number of parties or measurement choices. Moreover, we prove that self-testing protocols that certify a state and rank-one measurements can always be parallelized to certify many copies of the state. Our results suggest a method to achieve device-independent unbounded randomness expansion with high-dimensional quantum states.