Quantum Foundations

In quantum theory, the no-information-without-disturbance and no-free-information principles express that those observables that do not disturb the measurement of another observable and those that can be measured jointly with any other observable must be trivial, i.e., coin tossing observables. We show that in the framework of general probabilistic theories these principles do not hold in general. In this way, we obtain characterizations of the probabilistic theories where these principles hold and we show that the two principles are not equivalent.  

I will review recent and ongoing developments in path integral optimization and path integral complexity in 2d CFTs. After, I will discuss the connection with geometric approach to circuit complexity and point out several open problems.

What does it mean for quantum state to be genuinely fully multipartite? Some would say, whenever the state cannot be decomposed as a mixture of states each of which has no entanglement across some partition. I'll argue that this partition-centric thinking is ill-suited for the task of assessing the connectivity of the network required to realize the state. I'll introduce a network-centric perspective for classifying multipartite entanglement, and it's natural device-independent counterpart, namely a network-centric perspective for classifying multipartite nonclassicality of correlations. Time permitting, we can then explore semidefinite programming (SDP) algorithms for convex optimization over k-partite-entangled states and k-partite-nonlocal correlations relative to the network-centric classification. Joint work with Denis Rosset and others. We will compare the new quantum-inflation techniques to the classical inflation of arXiv:1609.00672. I'll share a few results made possible by these SDPs, while being openly critical about some disappointing apparent limitations.

Violations of Bell inequalities have traditionally been used to refute a local-realistic description of the world. Not surprisingly, under the assumption that the world is quantum, they can be used to certify quantum devices. What is surprising is that in some cases this characterisation turns out to be (almost) complete, i.e.~we can determine (almost) everything about the devices and this phenomenon is known as self-testing of quantum systems. Although the first self- testing results can be traced back to the works of Tsirelson published in the 80's, the topic has remained largely unknown until the seminal work of Mayers and Yao in 1998. It has received further exposure with the advent of device-independent quantum cryptography to which it is closely connected. In this talk I will give a brief introduction to the topic of self-testing and discuss some recent developments, e.g.~robust self-testing, weak self-testing, self-testing of entangled measurements, self-testing of high-dimensional systems or self-testing in prepare-and-measure scenarios.

Studying the usefulness of resources can be formalized via the framework of a resource theory. However, the complete answer to the question whether a certain resource is more useful than another one is often hard to find in many of the numerous applications of the framework. Approximate answers can be found by identifying so-called monotones—measures of "resourcefulness". I will present several generic constructions of monotones, of which many monotones known in the literature are concrete examples of. These constructions provide a way to relate monotones in different resource theories, thus enabling for the translation of results between them.

In general relativity, the picture of space–time assigns an ideal clock to each world line. Being ideal, gravitational effects due to these clocks are ignored and the flow of time according to one clock is not affected by the presence of clocks along nearby world lines. However, if time is defined operationally, as a pointer position of a physical clock that obeys the principles of general relativity and quantum mechanics, such a picture is, at most, a convenient fiction. Specifically, we show that the general relativistic mass–energy equivalence implies gravitational interaction between the clocks, whereas the quantum mechanical superposition of energy eigenstates leads to a nonfixed metric background. Based only on the assumption that both principles hold in this situation, we show that the clocks necessarily get entangled through time dilation effect, which eventually leads to a loss of coherence of a single clock. Hence, the time as measured by a single clock is not well defined. However, the general relativistic notion of time is recovered in the classical limit of clocks.

Convex optimization, linear and semidefinite programming in particular, has been a standard tool in quantum information theory, giving certificates of local and quantum correlations, contextuality, and more. Increasingly, similar methods are making headways in quantum many-body physics, giving lower bounds -- and thus certificates -- on the ground state energy. The disadvantage of such methods is that they do not scale well to large system sizes, whether those systems are multiparty Bell scenarios or lattice models of numerous sites. Machine
learning is entering the field as the latest buzzword. While it provides a more scalable alternative to convex programming and enables forming new conjectures, the outcome of learning methods remains uncertified. In this talk, I introduce the most important paradigms in machine learning for quantum information theory, give an overview of some earlier work in the field, argue for the importance of certifiable predictions of learning algorithms, and present some of our preliminary results.