Searcharxiv⌕ Search

arXiv subjects

Gabriel Pereira Alves

Publications and source records attributed to Gabriel Pereira Alves.

3 recordsLinked to original sources

Machine learning meets the CHSH scenario

In this work, we perform a comprehensive study of the machine learning (ML) methods for the purpose of characterising the quantum set of correlations. As our main focus is on assessing the usefulness and effectiveness of the ML approach, we focus exclusively on the CHSH scenario, both the 4-dimensional variant, for which an analytical solution is known, and the 8-dimensional variant, for which no analytical solution is known, but numerical approaches are relatively well understood. We consider a wide selection of approaches, ranging from simple data science models to dense neural networks. The two classes of models that perform well are support vector machines and dense neural networks, and they are the main focus of this work. We conclude that while it is relatively easy to achieve good performance on average, it is hard to train a model that performs well on the "hard" cases, i.e., points in the vicinity of the boundary of the quantum set. Sadly, these are precisely the cases which are interesting from the academic point of view. In order to improve performance on hard cases one must, especially for the 8-dimensional problem, resort to a tailored choice of training data, which means that we are implicitly feeding our intuition and biases into the model. We feel that this is an important and often overlooked aspect of applying ML models to academic problems, where data generation or data selection is performed according to some implicit subjective criteria. In this way, it is possible to unconsciously steer our model, so that it exhibits features that we are interested in seeing. Hence, special care must be taken while determining whether ML methods can be considered objective and unbiased in the context of academic problems.

quant-ph↗

Biased Random Access Codes

A random access code (RAC) is a communication task in which the sender encodes a random message into a shorter one to be decoded by the receiver so that a randomly chosen character of the original message is recovered with some probability. Both the message and the character to be recovered are assumed to be uniformly distributed. In this paper, we extend this protocol by allowing more general distributions of these inputs, which alters the encoding and decoding strategies optimizing the protocol performance, with either classical or quantum resources. We approach the problem of optimizing the performance of these biased RACs with both numerical and analytical tools. On the numerical front, we present algorithms that allow a numerical evaluation of the optimal performance over both classical and quantum strategies and provide a Python package designed to implement them, called RAC-tools. We then use this numerical tool to investigate single-parameter families of biased RACs in the $n^2 \mapsto 1$ and $2^d \mapsto 1$ scenarios. For RACs in the $n^2 \mapsto 1$ scenario, we derive a general upper bound for the cases in which the inputs are not correlated, which coincides with the quantum value for $n=2$ and, in some cases for $n=3$. Moreover, it is shown that attaining this upper bound self-tests pairs or triples of rank-1 projective measurements, respectively. An analogous upper bound is derived for the value of RACs in the $2^d \mapsto 1$ scenario, which is shown to be always attainable using mutually unbiased measurements if the distribution of input strings is unbiased.

quant-ph↗

Optimality of any pair of incompatible rank-one projective measurements for some non-trivial Bell inequality

Bell non-locality represents one of the most striking departures of quantum mechanics from classical physics. It shows that correlations between space-like separated systems allowed by quantum mechanics are stronger than those present in any classical theory. In a recent work [Sci. Adv. 7, eabc3847 (2021)], a family of Bell functionals tailored to mutually unbiased bases (MUBs) is proposed. For these functionals, the maximal quantum violation is achieved if the two measurements performed by one of the parties are constructed out of MUBs of a fixed dimension. Here, we generalize this construction to an arbitrary incompatible pair of rank-one projective measurements. By constructing a new family of Bell functionals, we show that for any such pair there exists a Bell inequality that is maximally violated by this pair. Moreover, when investigating the robustness of these violations to noise, we demonstrate that the realization which is most robust to noise is not generated by MUBs.

quant-ph↗