Quantum Physics

The Leggett-Garg (LG) inequalities were introduced, as a temporal parallel of the Bell inequalities, to test macroscopic realism -- the view that a macroscopic system evolving in time possesses definite properties which can be determined without disturbing the future or past state. The talk will begin with a review of the LG framework. Unlike the Bell inequalities, the original LG inequalities are only a necessary condition for macrorealism, and are therefore not a decisive test. I argue, for the case of measurements of a single dichotomic variable Q, that when the original four three-time LG inequalities are augmented with a set of twelve two-time inequalities also of the LG form, Fine's theorem applies and these augmented conditions are then both necessary and sufficient [1]. A comparison is carried out with the alternative necessary and sufficient conditions for macrorealism  based on no-signaling in time conditions which ensure that all probabilities for Q at one and two times are independent of whether earlier or intermediate measurements are made. I argue that the two tests differ in their implementation of the key requirement of non-invasive measurability so are testing different notions of macrorealism, and these notions are elucidated.  I also describe some alternative protocols which achieve non-invasiveness, one involving continuous measurement of the velocity conjugate to Q [2], which was recently implemented in an experiment at IQC, the other involving a modification of the standard ideal negative measurement protocol [3].

[1] J.J.Halliwell, Phys Rev A96, 012121 (2017); A93, 022123 (2016); arxiv:1811.10408.

[2]  J.J.Halliwell, Phys. Rev. A94, 052114 (2016).

[3] J.J.Halliwell, Phys. Rev. A99, 022119 (2019).

The theory of statistical comparison was formulated (chiefly by David Blackwell in the 1950s) in order to extend the theory of majorization to objects beyond probability distributions, like multivariate statistical models and stochastic transitions, and has played an important role in mathematical statistics ever since. The central concept in statistical comparison is the so-called "information ordering," according to which information need not always be a totally ordered quantity, but often takes on a multi-faceted form whose content may vary depending on its use. In this talk, after reviewing the basic ideas of statistical comparison with an emphasis on their operational character, I will discuss various generalizations to quantum theory (and beyond). I will then argue that quantum statistical comparison provides a natural framework, somehow complementary to semi-definite programming, to study quantum resource theories, with explicit examples given by the resource theories of quantum nonlocality, quantum communication, and quantum thermodynamics.

We study correlations in fermionic systems with long-range interactions in thermal equilibrium. We prove an upper-bound on the correlation decay between anti-commut-ing operators based on long-range Lieb-Robinson type bounds. Our result shows that correlations between such operators in fermionic long-range systems of spatial dimension $D$ with at most two-site interactions decaying algebraically with the distance with an exponent $\alpha \geq 2\,D$, decay at least algebraically with an exponent arbitrarily close to $\alpha$. Our bound is asymptotically tight, which we demonstrate by numerically analysing density-density correlations in a 1D quadratic (free, exactly solvable) model, the Kitaev chain with long-range interactions. Away from the quantum critical point correlations in this model are found to decay asymptotically as slowly as our bound permits.

Group representations are ubiquitous in quantum information theory. Many important states or channels are invariant under particular symmetries: for example depolarizing channels, Werner states, isotropic states, GHZ states. Accordingly, computations involving those objects can be simplified by invoking the symmetries of the problem. For that purpose, we need to know which irreducible representations appear in the problem, and how. Decomposing a representation is a hard problem; however, we can cheat and use numerical techniques to approximate the change of basis matrix -- and even recover exact results.

Recently, a new formulation of quantum mechanics was suggested which is based on the evolution of classical particles, provided with a sign, rather than standard wave functions. This allows several advantages over other approaches: from a theoretical perspective, it offers a more intuitive framework while, from a numerical point of view, it allows the simulation of complex systems with relatively small computational resources. In this talk, I will first go through the tenets of this new approach. In particular, I will focus on the derivation of such theory and the peculiar view it provides in the passage from the quantum to the classical regime. Then, I will discuss the various applications which have been performed so far, especially for systems of Fermions. Finally, a list of possible future works will be presented and discussed.

In this talk I will set out two new contributions to the study of operational tasks in a relativistic quantum setting. First, I will present a generalisation of the task known as ‘summoning,’ in which an unknown quantum state is supplied to an agent and must be returned at a specified point when a corresponding call is made. I will show that when this task is generalised to allow for more than one call to be made, an apparent paradox arises: the extra freedom makes it strictly harder to complete the task. Second, I will describe a quantum generalisation of the classic cryptographic task known as ‘zero-knowledge-proving.’ I will show that there exists no perfectly secure quantum relativistic protocol for this task, and I will then set out a protocol which is conjectured to be close to optimal in security for this task. These results have practical applications for distributed quantum computing and cryptography and also interesting implications for our understanding of relativistic quantum information and its localisation in spacetime.

From arXiv: 1806.04937, with Carlo Sparaciari, Carlo Maria Scandolo, Philippe Faist and Jonathan Oppenheim

We extend the tools of quantum resource theories to scenarios in which multiple quantities (or resources) are present, and their interplay governs the evolution of the physical systems. We derive conditions for the interconversion of these resources, which generalise the first law of thermodynamics. We study reversibility conditions for multi-resource theories, and find that the relative entropy distances from the invariant sets of the theory play a fundamental role in the quantification of the resources. The first law for general multi-resource theories is a single relation which links the change in the properties of the system during a state transformation and the weighted sum of the resources exchanged. In fact, this law can be seen as relating the change in the relative entropy from different sets of states. In contrast to typical single-resource theories, the notion of free states and invariant sets of states become distinct in light of multiple constraints. Additionally, generalisations of the Helmholtz free energy, and of adiabatic and isothermal transformations, emerge. 

The precise relationship between post-selected classical and 
post-selected quantum computation is an open problem in complexity 
theory. Post-selection has proven to be a useful tool in uncovering some 
of the differences between quantum and classical theories, in 
foundations and elsewhere. This is no less true in the area of 
computational complexity -- quantum computations augmented with 
post-selection are thought to be vastly more powerful than their 
classical counterparts. However, the precise reasons why this might be 
the case are not well understood, and no rigorous separations between 
the two have been found. In this talk, I will consider the difference in 
computational power of classical and quantum post-selection in the 
computational query complexity setting.

We define post-selected classical query algorithms, and relate them to 
rational approximations of Boolean functions; in particular, by showing 
that the post-selected classical query complexity of a Boolean function 
is equal to the minimal degree of a rational function with nonnegative 
coefficients that approximates it (up to a factor of two). For 
post-selected quantum query algorithms, a similar relationship was shown 
by Mahadev and de Wolf, where the rational approximations are allowed to 
have negative coefficients. Using our characterisation, we find an 
exponentially large separation between post-selected classical query 
complexity and post-selected quantum query complexity, by proving a 
lower bound on the degree of rational approximations to the Majority 
function.