Quantum Physics

In this talk I will discuss recently-identified classes of quantum correlations that go beyond nonlocal classical hidden-variable models equipped with communication. First, in the bipartite scenario, I will focus on so-called instrumental causal networks, which are a primal tool in causal inference. There, I will show that it is possible to “fake” classical causal influences with quantum common causes, in a formal sense quantified by the average causal effect (ACE). Furthermore, I will show that it is possible to violate instrumental inequalities with quantum resources, both in the device-independent and in the 1-sided device-independent settings. Second, in the multipartite setting, I will present a causal hierarchy of multipartite nonlocality. I will make special emphasis on quantum correlations in the upper classes of the hierarchy that define stronger forms of genuinely multipartite quantum non-locality than those previously known. The seminar will touch upon concepts like Bell nonlocality and quantum steering as well as Bayesian nets and causal inference.

Adiabatic quantum computation (AQC) is a method for performing universal quantum computation in the ground state of a slowly evolving local Hamiltonian, and in an ideal setting AQC is known to capture all of the computational power of the  quantum circuit model.  However, despite having an inherent robustness to noise as a result of the adiabatic theorem and the spectral gap of the Hamiltonian, it has been a longstanding theoretical challenge to show that fault-tolerant AQC can in principle be performed below some fixed noise threshold.  There are many aspects to this challenge, including the difficulty of adapting known ideas from circuit model fault-tolerance as well as the need to develop an error model that is appropriately tailored for open system AQC.  In this talk I will introduce a scheme for combining Feynman-Kitaev history state Hamiltonians with topological quantum error correction, in order to show that universal quantum computation can be encoded not only in the ground state but also in the finite temperature Gibbs state of a local Hamiltonian.  Using only local interactions with bounded strength and a polynomial overhead in the number of qubits, the scheme is intended to serve as a proof of principle that universal AQC can be performed at non-zero temperature, and also to further our understanding of the complexity of highly entangled quantum systems in thermal equilibrium.

The entanglement properties of random quantum states or dynamics are important to the study of a broad spectrum of disciplines of physics, ranging from quantum information to high energy and many-body physics. This work investigates the interplay between the degrees of entanglement and randomness in pure states and unitary channels, by employing tools from random matrix theory, representation theory, combinatorics, Weingarten calculus etc. We reveal strong connections between designs (distributions of states or unitaries that match certain moments of the uniform Haar measure) and generalized entropies (entropic functions that depend on certain powers of the density operator), by showing that Renyi entanglement entropies averaged over designs of the same order are almost maximal. This strengthens the celebrated Page's theorem. Moreover, we find that designs of an order that is logarithmic in the dimension maximize all Renyi entanglement entropies, and so are completely random in terms of the entanglement spectrum. Our results relate the behaviors of Renyi entanglement entropies to the complexity beyond scrambling/thermalization/chaos in terms of the degree of randomness, and suggest a generalization of the fast scrambling conjecture.  (Refs: 1703.08104, 1709.04313)

(1) Entanglement-enhanced quantum sensing: parameter estimation and hypothesis testing.
(2) Security from entanglement: quantum key distribution.
(3) Entanglement enhanced communication: channel capacity and additivity issues.
(4) Some open problems.

We discuss some applications of a result on the convex combination of the quantum states (that we refer to as convex-split technique) and its variants. In the framework of Quantum Resource theory, we provide an operational way of characterizing the amount of resource in a given quantum state, for a large class of resource theories. Our results use the convex-split technique in the achievability proof, with a matching converse in the one-shot setting.  Building upon the ideas involved in this achievability proof, we show how the technique (and its close counterpart of position-based decoding) can lead to a large family of entanglement-assisted protocols for quantum communication. We sketch close connections between these protocols and the port-based teleportation scheme of Ishizaka and Hiroshima [Phys. Rev. Lett. 101, 240501]. We exploit these connections to obtain a new protocol for entanglement assisted point to point quantum channel coding in the asymptotic and i.i.d. setting, with the rate of entanglement cost and achievable communication matching that of Bennett et. al. [IEEE Trans. Inf. Theory, 48, 2002].  Based on the works arXiv:1410.3031,  arXiv:1708.00381,   arXiv:1702.01940.

We will discuss recent trapping and cooling experiments with optically levitated nanoparticles [1]. We will report on the cooling of all translational motional degrees of freedom of a single trapped silica particle to 1mK simultaneously at vacuum of 10-5 mbar using a parabolic mirror. We will further report on the squeezing of a thermal motional state of the trapped particle by rapid switching of the trap frequency [2]. 

We will further discuss ideas to experimentally test quantum mechanics by means of collapse models [3] by both matter-wave interferometry [4] and non-interferometric methods [5]. While first experimental bounds by non-interferometric tests have been achieved during the last year by a number of different experiments according to our idea [4], we at Southampton work on setting up the Nanoparticle Talbot Interferometer (NaTalI) to test the quantum superposition principle directly for one million atomic mass unit (amu) particles.

We will further discuss some ideas to probe the interplay between quantum mechanics and gravity by such levitated optomechanics experiments. One idea is to seek experimental evidence about the fundamentally quantum or classical nature of gravity by using the torsional motion of a non-spherical trapped particle [6], while a second idea is to test the effect of the gravity related shift of energy levels of the mechanical harmonic oscillator, which is predicted by semi-classical gravity (Schroedinger-Newton equation) [7] or thirdly try to pick up entanglement mediated by gravity [8].

From a quantum information perspective, we will study universal features of chaotic quantum systems. Recent progress has made evident that quantifying chaos is a useful way to gain insight into strongly-coupled field theories, quantum many-body systems, as well as the quantum nature of black holes. We will derive relations between different diagnostics of chaos and scrambling (OTOCs, spectral functions, and frame potentials) and define a quantity to capture the onset of a random matrix description. We will review and use tools from quantum information and random matrix theory, but our goal will be to understand strongly-interacting systems.

We discuss the role of contextuality within quantum fluctuation theorems, in the light of a recent no-go result by Perarnau et al. We show that any fluctuation theorem reproducing the two-point measurement scheme for classical states either admits a notion of work quasi-probability or fails to describe protocols exhibiting contextuality.

Conversely, we describe a protocol that smoothly interpolates between the two-point measurement work distribution for projective measurements and Allahverdyan's work quasi-probability for weak measurements, and show that the negativity of the latter is a direct signature of contextuality.

Quantum error correction -- originally invented for quantum computing -- has proven itself useful in a variety of non-computational physical systems, as the ideas of QEC are broadly applicable. In this talk, I'll mention a few examples of error correction in the wild, including the recent discovery that the AdS/CFT correspondence implements quantum error correction.  We will then study the hypothesis that any local bulk operator in AdS can be reconstructed using only a causally disconnected subregion of the CFT.  This hypothesis has been proven under the assumption that error correction in AdS/CFT is exact, but this assumption is not expected to be true.  Fortunately, recent advances in the theory of approximate quantum error correction have emerged.  We will review these results on recoverability and approximate quantum error correction, as well as AdS/CFT and the so-called entanglement wedge reconstruction hypothesis.  We will then prove the entanglement wedge hypothesis robustly and find an explicit formula for reconstructed bulk operators.  If time permits, we will explore a generalization of the theory of universal recovery channels to the case of finite-dimensional von Neumann algebras.

Conventional quantum processes are described by quantum circuits, that represent evolutions of states of systems from input to output. In this seminar we consider transformations of an input circuit to an output circuit, which then represent the transformation of quantum evolutions. At this level, all the processes complying to admissibility conditions have in principle a physical realization scheme. The construction of a hierarchy of transformations of transformations, however, can proceed arbitrarily far, and in the higher orders one encounters admissible functions that have indefinite causal structures. These give rise to questions about possible realization schemes. Still, many of the maps in the hierarchy can be proved to have a realistic physical interpretation. In order to study the hierarchy, we introduce a simple rule for constructing new types of maps from known ones, and show how the tensor product can be rephrased in terms of the new rule. We use the hierarchy of types to introduce a partial order, which allows us to prove properties of maps by induction. We will then use induction proofs to discuss the characterisation of mathematically admissible maps at every level. We show an important structural result for a subclass of higher-order maps, and we conclude with the open question of their physical achievability.