Prof Vlatko Vedral FInstP

Abstract:

A paramount topic in quantum foundations, rooted in the study of the Einstein-Podolsky-Rosen (EPR) paradox and Bell inequalities, is that of characterizing quantum theory in terms of the spacelike correlations it allows. Here, we show that to focus only on spacelike correlations is not enough: we explicitly construct a toy model theory that, while not contradicting classical and quantum theories at the level of spacelike correlations, still displays an anomalous behavior in its timelike correlations. We call this anomaly, quantified in terms of a specific communication game, the "hypersignaling" phenomena. We hence conclude that the "principle of quantumness," if it exists, cannot be found in spacelike correlations alone: nontrivial constraints need to be imposed also on timelike correlations, in order to exclude hypersignaling theories.

Abstract:

We consider the problem of characterizing the set of input-output correlations that can be generated by an arbitrarily given quantum measurement. Our main result is to provide a closed-form, full characterization of such a set for any qubit measurement, and to discuss its geometrical interpretation. As applications, we further specify our results to the cases of real and complex symmetric, informationally complete measurements and mutually unbiased bases of a qubit, in the presence of isotropic noise. Our results provide the optimal device-independent tests of quantum measurements.

Abstract:

Many organisms capitalize on their ability to predict the environment to maximize available free energy and reinvest this energy to create new complex structures. This functionality relies on the manipulation of patterns-temporally ordered sequences of data. Here, we propose a framework to describe pattern manipulators-devices that convert thermodynamic work to patterns or vice versa-and use them to build a "pattern engine" that facilitates a thermodynamic cycle of pattern creation and consumption. We show that the least heat dissipation is achieved by the provably simplest devices, the ones that exhibit desired operational behavior while maintaining the least internal memory. We derive the ultimate limits of this heat dissipation and show that it is generally nonzero and connected with the pattern's intrinsic crypticity-a complexity theoretic quantity that captures the puzzling difference between the amount of information the pattern's past behavior reveals about its future and the amount one needs to communicate about this past to optimally predict the future.