Abstract Entangled quantum systems feature non-local correlations that are stronger than could be realized classically. This property makes it possible to perform self-testing, the strongest form of quantum functionality verification, which allows a classical user to deduce the quantum state and measurements used to produce a given set of measurement statistics. While self-testing of quantum states is well understood, self-testing of measurements, especially in high dimensions, remains relatively unexplored. Here we prove that every real projective measurement can be self-tested. Our approach employs the idea that existing self-tests can be extended to verify additional untrusted measurements, known as post-hoc self-testing. We formalize the method of post-hoc self-testing and establish the condition under which it can be applied. Using this condition, we construct self-tests for all real projective measurements. We build on this result to develop an iterative self-testing technique that provides a clear methodology for constructing new self-tests from pre-existing ones.
Abstract Entangled quantum systems feature non-local correlations that are stronger than could be realized classically. This property makes it possible to perform self-testing, the strongest form of quantum functionality verification, which allows a classical user to deduce the quantum state and measurements used to produce a given set of measurement statistics. While self-testing of quantum states is well understood, self-testing of measurements, especially in high dimensions, remains relatively unexplored. Here we prove that every real projective measurement can be self-tested. Our approach employs the idea that existing self-tests can be extended to verify additional untrusted measurements, known as post-hoc self-testing. We formalize the method of post-hoc self-testing and establish the condition under which it can be applied. Using this condition, we construct self-tests for all real projective measurements. We build on this result to develop an iterative self-testing technique that provides a clear methodology for constructing new self-tests from pre-existing ones.
Self-testing is a powerful certification of quantum systems relying on measured, classical statistics. This paper considers self-testing in bipartite Bell scenarios with small number of inputs and outputs, but with quantum states and measurements of arbitrarily large dimension. The contributions are twofold. Firstly, it is shown that every maximally entangled state can be self-tested with four binary measurements per party. This result extends the earlier work of Mančinska-Prakash-Schafhauser (2021), which applies to maximally entangled states of odd dimensions only. Secondly, it is shown that every single binary projective measurement can be self-tested with five binary measurements per party. A similar statement holds for self-testing of projective measurements with more than two outputs. These results are enabled by the representation theory of quadruples of projections that add to a scalar multiple of the identity. Structure of irreducible representations, analysis of their spectral features and post-hoc self-testing are the primary methods for constructing the new self-tests with small number of inputs and outputs.
Quantum nonlocality has recently been intensively studied in connection to device-independent quantum information processing, where the extremal points of the set of quantum correlations play a crucial role through self-testing. In most protocols, the proofs for self-testing rely on the maximal violation of the Bell inequalities, but there is another known proof based on the geometry of state vectors for self-testing a maximally entangled state. We extend the geometrical proof to the case of partially entangled states. We show that, when a set of correlators in the simplest Bell scenario satisfies a condition, the geometry of the state vectors of the realization is uniquely determined. However, the realization becomes self-testable only when another unitary observable exists on the geometry. Applying this result, we propose self-testing protocols by intentionally adding one more measurement. This geometrical scheme for self-testing is superior in that, by using this as a building block and repeatedly adding measurements, a realization with an arbitrary number of measurements can be self-tested. Besides the application, we also attempt to describe nonlocal correlations by guessing probabilities of distant measurement outcomes. In this description, the quantum set is also convex, and a large class of extremal points is identified by the uniqueness of the geometry.
Abstract Quantum nonlocality has recently been intensively studied in connection to device-independent quantum information processing, where the extremal points of the set of quantum correlations play a crucial role through self-testing. In most protocols, the proofs for self-testing rely on the maximal violation of the Bell inequalities, but there is another known proof based on the geometry of state vectors to self-test a maximally entangled state. We present a geometrical proof in the case of partially entangled states. We show that, when a set of correlators in the simplest Bell scenario satisfies a condition, the geometry of the state vectors is uniquely determined. The realization becomes self-testable when another unitary observable exists on the geometry. Applying this proven fact, we propose self-testing protocols by intentionally adding one more measurement. This geometrical scheme for self-testing is superior in that, by using this as a building block and repeatedly adding measurements, a realization with an arbitrary number of measurements can be self-tested. Besides the application, we also attempt to describe nonlocal correlations by guessing probabilities of distant measurement outcomes. In this description, the quantum set is also convex, and a large class of extremal points is identified by the uniqueness of the geometry.
Quantum self-testing is the task of certifying quantum states and measurements using the output statistics solely, with minimal assumptions about the underlying quantum system. It is based on the observation that some extremal points in the set of quantum correlations can only be achieved, up to isometries, with specific states and measurements. Here, we present a new approach for quantum self-testing in Bell non-locality scenarios, motivated by the following observation: the quantum maximum of a given Bell inequality is, in general, difficult to characterize. However, it is strictly contained in an easy-to-characterize set: the \emph{theta body} of a vertex-weighted induced subgraph (G,w) of the graph in which vertices represent the events and edges join mutually exclusive events. This implies that, for the cases where the quantum maximum and the maximum within the theta body (known as the Lovász theta number) of (G,w) coincide, self-testing can be demonstrated by just proving self-testability with the theta body of G. This graph-theoretic framework allows us to (i) recover the self-testability of several quantum correlations that are known to permit self-testing (like those violating the Clauser-Horne-Shimony-Holt (CHSH) and three-party Mermin Bell inequalities for projective measurements of arbitrary rank, and chained Bell inequalities for rank-one projective measurements), (ii) prove the self-testability of quantum correlations that were not known using existing self-testing techniques (e.g., those violating the Abner Shimony Bell inequality for rank-one projective measurements). Additionally, the analysis of the chained Bell inequalities gives us a closed-form expression of the Lovász theta number for a family of well-studied graphs known as the Möbius ladders, which might be of independent interest in the community of discrete mathematics.
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 Self-testing is a promising approach to certifying quantum states or measurements. Originally, it relied solely on the outcome statistics of the measurements involved in a device-independent (DI) setup. Extra physical assumptions about the system make the setup semi-DI. In the latter approach, we consider a prepare-and-measure scenario in which the dimension of the mediating particle is assumed to be two. In a setup involving four (three) preparations and three (two) projective measurements in addition to the target, we exemplify how to self-test any four- (three-) outcome extremal positive operator-valued measure using a linear witness. One of our constructions also achieves self-testing of any number of states with the help of as many projective measurements as the dimensionality of the space spanned by the corresponding Bloch vectors. These constructions are conjectured to be minimal in terms of the number of preparations and measurements required. In addition, we implement one of our prepare-and-measure constructionson IBM and IonQ quantum processors and certify the existence of a complex qubit Hilbert space based on the data obtained from these experiments.