Bell's theorem has been proposed to certify, in a device-independent and robust way, blocks either producing or measuring quantum states. In this Letter, we provide a method based on Bell's theorem to certify coherent operations for the storage, processing, and transfer of quantum information. This completes the set of tools needed to certify all building blocks of a quantum computer. Our method distinguishes itself by its robustness to experimental imperfections, and so could be used to certify that today's quantum devices are qualified for usage in future quantum computers.
Bell's theorem has been proposed to certify, in a device-independent and robust way, blocks either producing or measuring quantum states. In this Letter, we provide a method based on Bell's theorem to certify coherent operations for the storage, processing, and transfer of quantum information. This completes the set of tools needed to certify all building blocks of a quantum computer. Our method distinguishes itself by its robustness to experimental imperfections, and so could be used to certify that today's quantum devices are qualified for usage in future quantum computers.
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, it is possible to place a boundary on the singlet fidelity of entangled qubits. Here, beyond this rough estimation, we experimentally demonstrate a complete self-testing process for various pure bipartite entangled states up to four dimensions, by simply inspecting the correlations of the measurement outcomes. We show that this self-testing process can certify the exact form of entangled states with fidelities higher than 99.9% for all the investigated scenarios, which indicates the superior completeness and robustness of this method. Our work promotes self-testing as a practical tool for developing quantum techniques.
Certifying the entanglement of quantum states with Bell inequalities allows one to guarantee the security of quantum information protocols independently of imperfections in the measuring devices. Here, we present a similar procedure for witnessing entangled measurements, which play a central role in many quantum information tasks. Our procedure is termed semi-device-independent, as it uses uncharacterized quantum preparations of fixed Hilbert space dimension. Using a photonic setup, we experimentally certify an entangled measurement using only measurement statistics. We also apply our techniques to certify unentangled but nevertheless inherently quantum measurements.
Genuine multipartite entanglement represents the strongest type of entanglement, which is an essential resource for quantum information processing. Standard methods to detect genuine multipartite entanglement, e.g., entanglement witnesses, state tomography, or quantum state verification, require full knowledge of the Hilbert space dimension and precise calibration of measurement devices, which are usually difficult to acquire in an experiment. The most radical way to overcome these problems is to detect entanglement solely based on the Bell-like correlations of measurement outcomes collected in the experiment, namely, device independently. However, it is difficult to certify genuine entanglement of practical multipartite states in this way, and even more difficult to quantify it, due to the difficulty in identifying optimal multipartite Bell inequalities and protocols tolerant to state impurity. In this Letter, we explore a general and robust device-independent method that can be applied to various realistic multipartite quantum states in arbitrary finite dimension, while merely relying on bipartite Bell inequalities. Our method allows us both to certify the presence of genuine multipartite entanglement and to quantify it. Several important classes of entangled states are tested with this method, leading to the detection of genuinely entangled states. We also certify genuine multipartite entanglement in weakly entangled Greenberger-Horne-Zeilinger states, showing that the method applies equally well to less standard states.
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.