Talks

I will introduce a tool to construct self-testing Bell inequalities from the stabiliser formalism and present two applications in the framework of device-independent certification protocols. Firstly, I will show how the method allows to derive Bell inequalities maximally violated by the family of multi-qubit graph states and suited for their robust self-testing. Secondly, I will present how the same method allows to introduce the first examples of subspace self-testing, a form of certification that the measured quantum state belongs to a given quantum error correction code subspace, which remarkably includes also mixed states.

In recent years, there has been growing interest in cosmological first-order phase transitions in view of gravitational wave observations with space interferometers such as LISA. However, there is only limited understanding on the bubble dynamics and the gravitational wave signals arising from ultra-supercooled transitions (in which the released energy dominates the plasma energy, i.e., near-vacuum transitions), due to the highly relativistic nature of the transition.

In this talk, I introduce some approaches to understand the dynamics and the gravitational wave signals of ultra-supercooled first-order phase transitions:

(1) These transitions proceed with the propagation and collision of highly relativistic fluid profiles involving shock waves. I introduce an approach to construct an effective description of the propagation of such relativistic profiles (1905.00899).

(2) I present an approach to extend the existing model of gravitational wave production and calculate the gravitational wave signals analytically (1707.03111).

We investigate the precession of the spin of the smaller black hole in binary black hole simulations. By considering a sequence of binaries at higher mass ratios, we approach the limit of geodetic precession of a test spin. This precession is corrected by the ``self-torque'' due to the smaller black hole's own spacetime curvature. We find that the spins undergo spin nutations which are not described in conventional descriptions of spin precession, an effect that has been noticed previously in simulations. These nutations arise because the spins are not measured in a frame where the smaller hole is stationary. We develop a simple model for these frame nutations, extract the instantaneous spin precession rate, and compare our results to PN and extreme-mass-ratio approximations for the self-torque.
 

We often say that quantum mechanics allows to calculate the probability of future events. In fact, quantum mechanics does not discriminate between predicting the future or postdicting the past. I will present the results of a recent work by Rovelli, Donà and me, where we address the apparent tension between the time symmetry of elementary quantum mechanics and the intrinsic time orientation of the formulations of quantum theory used in the quantum information and foundations communities. Additionally, I will sketch a way to think time symmetrically about causality in quantum theory by using the new notion of a causal-inferential theory recently proposed by Schimd, Selby and Spekkens.

Aaronson and Ambainis (2009) and Chailloux (2018) showed that fully symmetric (partial) functions do not admit exponential quantum query speedups. This raises a natural question: how symmetric must a function be before it cannot exhibit a large quantum speedup? In this work, we prove that hypergraph symmetries in the adjacency matrix model allow at most a polynomial separation between randomized and quantum query complexities. We also show that, remarkably, permutation groups constructed out of these symmetries are essentially the only permutation groups that prevent super-polynomial quantum speedups. We prove this by fully characterizing the primitive permutation groups that allow super-polynomial quantum speedups. In contrast, in the adjacency list model for bounded-degree graphs (where graph symmetry is manifested differently), we exhibit a property testing problem that shows an exponential quantum speedup. These results resolve open questions posed by Ambainis, Childs, and Liu (2010) and Montanaro and de Wolf (2013). Based on: arxiv:2006.12760

In recent years, it has become increasingly well-known that nearly all the major no-go theorems in quantum foundations can be circumvented by violating a single assumption: the hidden variables (that determine the outcomes) are uncorrelated with the measurement settings. A hidden-variable theory that violates this assumption can be local, separable, non-contextual and have an epistemic quantum state. Such a theory would be particularly well-suited to relativistic contexts. Are such theories actually feasible? In this talk, we discuss some results on the two physical options to violate this assumption: superdeterminism and retrocausality. 

Developing an intuitive criticism by Bell, we show that superdeterministic models are conspiratorial in a mathematically well-defined sense in two separate ways. In the first approach, we use the concept of quantum nonequilibrium to show that superdeterministic models require finetuning so that the measurement statistics do not depend on the details of how the measurement settings are chosen. In the second approach, we show (without using quantum non-equilibrium) that an arbitrarily large amount of superdeterministic correlation is needed for such models to be consistent. Along the way, we discuss an apparent paradox involving nonlocal signalling in a local superdeterministic model. 

Next, we use retrocausality to build a local, separable, psi-epistemic hidden-variable model of Bell correlations with pilot-waves in physical space. We generalise the model to describe a relativistic Bell scenario where one of the wings experiences time-dilation effects. We show, by discussing the difficulties faced by other hidden-variable approaches in describing this scenario, that the relativistic properties of the model play an important role here (otherwise ornamental in the standard Bell scenario). We also discuss the technical difficulties in applying quantum field theory to recover the model's predictions.

The Event Horizon Telescope is a global effort to construct an
Earth-sized virtual radio telescope array, with the goal to make pictures and
movies of two nearby supermassive black holes. A detailed theoretical
understanding of black hole accretion is now crucial to interpret these
observations. I will review our current efforts to model polarimetric
properties of light produced in synchrotron processes in plasma falling
towards the event horizon. The numerical models are based on general
relativistic magnetohydrodynamics simulations so they are capable of capturing
the complex dynamics of magnetic fields and their interactions with plasma. It is now
important to understand the polarized radiative transfer in these simulations
to correctly predict the observational signatures of the events at the event
horizon scales where the accretion disk and jet are connected.

In this talk, I will discuss two problems: quantum data compression
and quantum causal order discovery, both for multipartite quantum
systems. For data compression, we model finitely correlated states as
tensor networks, and design quantum compression algorithms. We first
establish an upper bound on the amount of memory needed to store an
arbitrary state from a given state family. The bound is determined by
the minimum cut of a suitable flow network, and is related to the flow
of information from the manifold of parameters that specify the states
to the physical systems in which the states are embodied. We then
provide a compression algorithm for general state families, and show
that the algorithm runs in polynomial time for matrix product states.

For quantum causal order discovery, we develop the first efficient
quantum causal order discovery algorithm with polynomial black-box
queries with respect to the number of systems. We model the causal
order with quantum combs, and our algorithm outputs the order of
inputs and outputs that the given process is compatible with. Our
method guarantees a polynomial running time for quantum combs with a
low Kraus rank, namely processes with low noise and little information
loss. For special cases where the causal order can be inferred from
local observations, we also propose algorithms that have lower query
complexity and only require local state preparation and local
measurements. Our results will provide efficient ways to detect and
optimize available transmission paths in quantum communication
networks, as well as methods to verify quantum circuits and to
discover the latent structure of multipartite quantum systems.