Artículo
Graph-theoretic approach for self-testing in Bell scenarios
Autor/es | Bharti, Kishor
Ray, Maharshi Xu, Zhen Peng Hayashi, Masahito Kwek, Leong Chuan Cabello Quintero, Adán |
Departamento | Universidad de Sevilla. Departamento de Física Aplicada II |
Fecha de publicación | 2022-09-26 |
Fecha de depósito | 2023-04-20 |
Publicado en |
|
Resumen | Self-testing is a technology to certify states and measurements using only the statistics of the experiment. Self-testing is possible if some extremal points in the set BQ of quantum correlations for a Bell experiment are ... Self-testing is a technology to certify states and measurements using only the statistics of the experiment. Self-testing is possible if some extremal points in the set BQ of quantum correlations for a Bell experiment are achieved, up to isometries, with specific states and measurements. However, BQ is difficult to characterize, so it is also difficult to prove whether or not a given matrix of quantum correlations allows for self-testing. Here, we show how some tools from graph theory can help to address this problem. We observe that BQ is strictly contained in an easy-to-characterize set associated with a graph, (G). Therefore, whenever the optimum over BQ and the optimum over (G) coincide, self-testing can be demonstrated by simply proving self-testability with (G). Interestingly, these maxima coincide for the quantum correlations that maximally violate many families of Bell-like inequalities. Therefore, we can apply this approach to prove the self-testability of many quantum correlations, including some that are not previously known to allow for self-testing. In addition, this approach connects self-testing to some open problems in discrete mathematics. We use this connection to prove a conjecture [M. Araújo et al., Phys. Rev. A, 88, 022118 (2013)] about the closed-form expression of the Lovász theta number for a family of graphs called the Möbius ladders. Although there are a few remaining issues (e.g., in some cases, the proof requires the assumption that measurements are of rank 1), this approach provides an alternative method to self-testing and draws interesting connections between quantum mechanics and discrete mathematics. |
Cita | Bharti, K., Ray, M., Xu, Z.P., Hayashi, M., Kwek, L.C. y Cabello Quintero, A. (2022). Graph-theoretic approach for self-testing in Bell scenarios. PRX Quantum, 3 (030344). https://doi.org/10.1103/PRXQuantum.3.030344. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Graph-theoretic approach for ... | 1.814Mb | [PDF] | Ver/ | |