SearcharxivSearch

arXiv subjects

Paul Knott

Publications and source records attributed to Paul Knott.

6 recordsLinked to original sources

Evaluating the Robustness of Collaborative Agents

In order for agents trained by deep reinforcement learning to work alongside humans in realistic settings, we will need to ensure that the agents are \emph{robust}. Since the real world is very diverse, and human behavior often changes in response to agent deployment, the agent will likely encounter novel situations that have never been seen during training. This results in an evaluation challenge: if we cannot rely on the average training or validation reward as a metric, then how can we effectively evaluate robustness? We take inspiration from the practice of \emph{unit testing} in software engineering. Specifically, we suggest that when designing AI agents that collaborate with humans, designers should search for potential edge cases in \emph{possible partner behavior} and \emph{possible states encountered}, and write tests which check that the behavior of the agent in these edge cases is reasonable. We apply this methodology to build a suite of unit tests for the Overcooked-AI environment, and use this test suite to evaluate three proposals for improving robustness. We find that the test suite provides significant insight into the effects of these proposals that were generally not revealed by looking solely at the average validation reward.

cs.LG

Non-asymptotic analysis of quantum metrology protocols beyond the Cramér-Rao bound

Many results in the quantum metrology literature use the Cramér-Rao bound and the Fisher information to compare different quantum estimation strategies. However, there are several assumptions that go into the construction of these tools, and these limitations are sometimes not taken into account. While a strategy that utilises this method can considerably simplify the problem and is valid asymptotically, to have a rigorous and fair comparison we need to adopt a more general approach. In this work we use a methodology based on Bayesian inference to understand what happens when the Cramér-Rao bound is not valid. In particular we quantify the impact of these restrictions on the overall performance of a wide range of schemes including those commonly employed for the estimation of optical phases. We calculate the number of observations and the minimum prior knowledge that are needed such that the Cramér-Rao bound is a valid approximation. Since these requirements are state-dependent, the usual conclusions that can be drawn from the standard methods do not always hold when the analysis is more carefully performed. These results have important implications for the analysis of theory and experiments in quantum metrology.

quant-ph

A blueprint for a simultaneous test of quantum mechanics and general relativity in a space-based quantum optics experiment

In this paper we propose an experiment designed to observe a general-relativistic effect on single photon interference. The experiment consists of a folded Mach-Zehnder interferometer, with the arms distributed between a single Earth orbiter and a ground station. By compensating for other degrees of freedom and the motion of the orbiter, this setup aims to detect the influence of general relativistic time dilation on a spatially superposed single photon. The proposal details a payload to measure the required effect, along with an extensive feasibility analysis given current technological capabilities.

astro-ph.IM

Sampling generalized cat states with linear optics is probably hard

Boson-sampling has been presented as a simplified model for linear optical quantum computing. In the boson-sampling model, Fock states are passed through a linear optics network and sampled via number-resolved photodetection. It has been shown that this sampling problem likely cannot be efficiently classically simulated. This raises the question as to whether there are other quantum states of light for which the equivalent sampling problem is also computationally hard. We present evidence, without using a full complexity proof, that a very broad class of quantum states of light --- arbitrary superpositions of two or more coherent states --- when evolved via passive linear optics and sampled with number-resolved photodetection, likely implements a classically hard sampling problem.

quant-ph

Robust entanglement-based magnetic field sensor beyond the standard quantum limit

Recently, there have been significant developments in entanglement-based quantum metrology. However, entanglement is fragile against experimental imperfections, and quantum sensing to beat the standard quantum limit in scaling has not yet been achieved in realistic systems. Here, we show that it is possible to overcome such restrictions so that one can sense a magnetic field with an accuracy beyond the standard quantum limit even under the effect of decoherence, by using a realistic entangled state that can be easily created even with current technology. Our scheme could pave the way for the realizations of practical entanglement-based magnetic field sensors.

quant-ph

Coined quantum walks on percolation graphs

Quantum walks, both discrete (coined) and continuous time, form the basis of several quantum algorithms and have been used to model processes such as transport in spin chains and quantum chemistry. The enhanced spreading and mixing properties of quantum walks compared with their classical counterparts have been well-studied on regular structures and also shown to be sensitive to defects and imperfections in the lattice. As a simple example of a disordered system, we consider percolation lattices, in which edges or sites are randomly missing, interrupting the progress of the quantum walk. We use numerical simulation to study the properties of coined quantum walks on these percolation lattices in one and two dimensions. In one dimension (the line) we introduce a simple notion of quantum tunneling and determine how this affects the properties of the quantum walk as it spreads. On two-dimensional percolation lattices, we show how the spreading rate varies from linear in the number of steps down to zero, as the percolation probability decreases to the critical point. This provides an example of fractional scaling in quantum walk dynamics.

quant-ph