Entangled basis measurements play a crucial role in distributing quantum entanglement between parties across a quantum network. In this work, we adopt a semi-device-independent approach that enables the self-testing of n-qubit Greenberger-Horne-Zeilinger (GHZ) basis measurements without requiring shared entanglement between distant parties. Our method relies solely on input-output statistics from a communication scenario involving n spatially separated senders, each receiving two bits of input, and a single receiver with no input. We analyze the robustness of the proposed self-testing protocol. Additionally, we introduce a protocol for robust self-testing of the three-outcome partial Bell basis measurement that is easily implementable in an optical setup.
Entangled basis measurements play a crucial role in distributing quantum entanglement between parties across a quantum network. In this work, we adopt a semi-device-independent approach that enables the self-testing of n-qubit Greenberger-Horne-Zeilinger (GHZ) basis measurements without requiring shared entanglement between distant parties. Our method relies solely on input-output statistics from a communication scenario involving n spatially separated senders, each receiving two bits of input, and a single receiver with no input. We analyze the robustness of the proposed self-testing protocol. Additionally, we introduce a protocol for robust self-testing of the three-outcome partial Bell basis measurement that is easily implementable in an optical setup.
Self-testing is an examination for characterizing unknown quantum devices based on correlations of observed statistics in a black-box scenario. With development of large-scale quantum networks, the requirement for self-testing multipartite entangled measurements has become very demanding. We develop here a general procedure for self-testing arbitrary generalized Greenberger-Horne-Zeilinger-state (GHZ-state) measurements which applies to any number of parties. Moreover, it turns out that the existing result for the three-qubit GHZ-state measurement is recovered as a special case. Our results will motivate operational certification of quantum devices related to device-independent quantum information tasks for various scenarios in complicated quantum networks.
Device-independent certification of multipartite entangled states plays a central role
in a wide range of practical applications, including quantum networks, conference key agreement, and verifiable distributed quantum computation. A particularly important class of multipartite entangled states is the class of Greenberger-Horne-Zeilinger (GHZ) states. Many Bell operators have been proposed to self-test GHZ states. However, in practical scenarios, due to imperfections and the finite collection of statistics, the observed statistics do not satisfy the ideal self-testing relations. Hence, it becomes essential to investigate and compare the robustness of the different self-testing protocols. In this work, we investigate the robustness of self-testing schemes constructed from Bell operators due to Svetlichny and Mermin--Ardehali--Belinskii--Klyshko (MABK), using the analytic operator-inequality framework developed by Kaniewski [\href{https://doi.org/10.1103/PhysRevLett.117.070402}{Phys. Rev. Lett. 117, 070402 (2016)}]. We derive lower bounds on the extractable fidelity as a function of the observed value of these Bell operators. Although these protocols self-test the same underlying state, they exhibit markedly different levels of robustness. By comparing the resulting fidelity bounds, we demonstrate that the self-testing scheme based on the Svetlichny's Bell operator is the more robust among the two. Our results thus identify the Svetlichny operator based self-testing protocol as the most favorable candidate for device-independent certification of GHZ states in realistic, noisy experimental scenarios.
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.
Practical robust self-testing of multipartite entanglement has so far been restricted to small-scale systems due to error bounds that degrade severely with system size. In this work, we establish multipartite self-testing with robustness independent of the size of the quantum network. We derive a fully analytic, device-independent self-testing bound for n-qubit Greenberger-Horne-Zeilinger (GHZ) states. The bound scales linearly with the observed violation error and lies universally within a constant factor of two from a theoretical upper bound. Furthermore, the operator-inequality framework reduces the verification of the conjectured optimal bound to a highly efficient numerical check, which we perform up to n=100. Consequently, GHZ entanglement can be certified under a fixed noise level in arbitrarily large systems, enabling scalable device-independent verification.