arXiv subjects

Alastair A. Abbott

Publications and source records attributed to Alastair A. Abbott.

At least 37 records · Page 2Linked to original sources

arXiv2021

Experimental Quantum Communication Enhancement by Superposing Trajectories

In quantum communication networks, wires represent well-defined trajectories along which quantum systems are transmitted. In spite of this, trajectories can be used as a quantum control to govern the order of different noisy communication channels, and such a control has been shown to enable the transmission of information even when quantum communication protocols through well-defined trajectories fail. This result has motivated further investigations on the role of the superposition of trajectories in enhancing communication, which revealed that the use of quantum control of parallel communication channels, or of channels in series with quantum-controlled operations, can also lead to communication advantages. Building upon these findings, here we experimentally and numerically compare different ways in which two trajectories through a pair of noisy channels can be superposed. We observe that, within the framework of quantum interferometry, the use of channels in series with quantum-controlled operations generally yields the largest advantages. Our results contribute to clarify the nature of these advantages in experimental quantum-optical scenarios, and showcase the benefit of an extension of the quantum communication paradigm in which both the information exchanged and the trajectory of the information carriers are quantum.

quant-ph↗

arXiv2020

Communication through coherent control of quantum channels

A completely depolarising quantum channel always outputs a fully mixed state and thus cannot transmit any information. In a recent Letter [D. Ebler et al., Phys. Rev. Lett. 120, 120502 (2018)], it was however shown that if a quantum state passes through two such channels in a quantum superposition of different orders - a setup known as the "quantum switch" - then information can nevertheless be transmitted through the channels. Here, we show that a similar effect can be obtained when one coherently controls between sending a target system through one of two identical depolarising channels. Whereas it is tempting to attribute this effect in the quantum switch to the indefinite causal order between the channels, causal indefiniteness plays no role in this new scenario. This raises questions about its role in the corresponding effect in the quantum switch. We study this new scenario in detail and we see that, when quantum channels are controlled coherently, information about their specific implementation is accessible in the output state of the joint control-target system. This allows two different implementations of what is usually considered to be the same channel to therefore be differentiated. More generally, we find that to completely describe the action of a coherently controlled quantum channel, one needs to specify not only a description of the channel (e.g., in terms of Kraus operators), but an additional "transformation matrix" depending on its implementation.

quant-ph↗

arXiv2020

Quantification of quantum dynamics with input-output games

Recent developments surrounding resource theories have shown that any quantum state or measurement resource, with respect to a convex (and compact) set of resourceless objects, provides an advantage in a tailored subchannel or state discrimination task, respectively. Here we show that an analogous, more general result is also true in the case of dynamical quantum resources, i.e., channels and instruments. In the scenario we consider, the tasks associated to a resource are input-output games. The advantage a resource provides in these games is naturally quantified by a generalized robustness measure. We illustrate our approach by applying it to a broad collection of examples, including classical and measure-and-prepare channels, measurement and channel incompatibility, LOCC operations, and steering, as well as discussing its applicability to other resources in, e.g., quantum thermodynamics. We finish by showing that our approach generalizes to higher-order dynamics where it can be used, for example, to witness causal properties of supermaps.

quant-ph↗

arXiv2020

De-quantisation of the Quantum Fourier Transform

The quantum Fourier transform (QFT) plays an important role in many known quantum algorithms such as Shor's algorithm for prime factorisation. In this paper we show that the QFT algorithm can, on a restricted set of input states, be de-quantised into a classical algorithm which is both more efficient and simpler than the quantum algorithm. By working directly with the algorithm instead of the circuit, we develop a simple classical version of the quantum basis-state algorithm. We formulate conditions for a separable state to remain separable after the QFT is performed, and use these conditions to extend the de-quantised algorithm to work on all such states without loss of efficiency. Our technique highlights the linearity of quantum mechanics as the fundamental feature accounting for the difference between quantum and de-quantised algorithms, and that it is this linearity which makes the QFT such a useful tool in quantum computation.

quant-ph↗

arXiv2020

Von Neumann Normalisation of a Quantum Random Number Generator

In this paper we study von Neumann un-biasing normalisation for ideal and real quantum random number generators, operating on finite strings or infinite bit sequences. In the ideal cases one can obtain the desired un-biasing. This relies critically on the independence of the source, a notion we rigorously define for our model. In real cases, affected by imperfections in measurement and hardware, one cannot achieve a true un-biasing, but, if the bias "drifts sufficiently slowly", the result can be arbitrarily close to un-biasing. For infinite sequences, normalisation can both increase or decrease the (algorithmic) randomness of the generated sequences. A successful application of von Neumann normalisation---in fact, any un-biasing transformation---does exactly what it promises, un-biasing, one (among infinitely many) symptoms of randomness; it will not produce "true" randomness.

cs.IT↗

arXiv2019

Anomalous Weak Values Without Post-Selection

A weak measurement performed on a pre- and post-selected quantum system can result in an average value that lies outside of the observable's spectrum. This effect, usually referred to as an "anomalous weak value", is generally believed to be possible only when a non-trivial post-selection is performed, i.e., when only a particular subset of the data is considered. Here we show, however, that this is not the case in general: in scenarios in which several weak measurements are sequentially performed, an anomalous weak value can be obtained without post-selection, i.e., without discarding any data. We discuss several questions that this raises about the subtle relation between weak values and pointer positions for sequential weak measurements. Finally, we consider some implications of our results for the problem of distinguishing different causal structures.

quant-ph↗

arXiv2019

The entropic approach to causal correlations

The existence of a global causal order between events places constraints on the correlations that parties may share. Such "causal correlations" have been the focus of recent attention, driven by the realization that some extensions of quantum mechanics may violate so-called causal inequalities. In this paper we study causal correlations from an entropic perspective, and we show how to use this framework to derive entropic causal inequalities. We consider two different ways to derive such inequalities. Firstly, we consider a method based on the causal Bayesian networks describing the causal relations between the parties. In contrast to the Bell-nonlocality scenario, where this method has previously been shown to be ineffective, we show that it leads to several interesting entropic causal inequalities. Secondly, we consider an alternative method based on counterfactual variables that has previously been used to derive entropic Bell inequalities. We compare the inequalities obtained via these two methods and discuss their violation by noncausal correlations. As an application of our approach, we derive bounds on the quantity of information - which is more naturally expressed in the entropic framework - that parties can communicate when operating in a definite causal order.

quant-ph↗

arXiv2019

A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing

Despite rapid recent progress towards the development of quantum computers capable of providing computational advantages over classical computers, it seems likely that such computers will, initially at least, be required to run in a hybrid quantum-classical regime. This realisation has led to interest in hybrid quantum-classical algorithms allowing, for example, quantum computers to solve large problems despite having very limited numbers of qubits. Here we propose a hybrid paradigm for quantum annealers with the goal of mitigating a different limitation of such devices: the need to embed problem instances within the (often highly restricted) connectivity graph of the annealer. This embedding process can be costly to perform and may destroy any computational speedup. In order to solve many practical problems, it is moreover necessary to perform many, often related, such embeddings. We will show how, for such problems, a raw speedup that is negated by the embedding time can nonetheless be exploited to give a real speedup. As a proof-of-concept example we present an in-depth case study of a simple problem based on the maximum weight independent set problem. Although we do not observe a quantum speedup experimentally, the advantage of the hybrid approach is robustly verified, showing how a potential quantum speedup may be exploited and encouraging further efforts to apply the approach to problems of more practical interest.

cs.DS↗

arXiv2019

Experimental test of an entropic measurement uncertainty relation for arbitrary qubit observables

A tight information-theoretic measurement uncertainty relation is experimentally tested with neutron spin-1/2 qubits. The noise associated to the measurement of an observable is defined via conditional Shannon entropies and a tradeoff relation between the noises for two arbitrary spin observables is demonstrated. The optimal bound of this tradeoff is experimentally obtained for various non-commuting spin observables. For some of these observables this lower bound can be reached with projective measurements, but we observe that, in other cases, the tradeoff is only saturated by general quantum measurements (i.e., positive-operator valued measures), as predicted theoretically.

quant-ph↗

arXiv2019

On the definition and characterisation of multipartite causal (non)separability

The concept of causal nonseparability has been recently introduced, in opposition to that of causal separability, to qualify physical processes that locally abide by the laws of quantum theory, but cannot be embedded in a well-defined global causal structure. While the definition is unambiguous in the bipartite case, its generalisation to the multipartite case is not so straightforward. Two seemingly different generalisations have been proposed, one for a restricted tripartite scenario and one for the general multipartite case. Here we compare the two, showing that they are in fact inequivalent. We propose our own definition of causal (non)separability for the general case, which---although a priori subtly different---turns out to be equivalent to the concept of "extensible causal (non)separability" introduced before, and which we argue is a more natural definition for general multipartite scenarios. We then derive necessary, as well as sufficient conditions to characterise causally (non)separable processes in practice. These allow one to devise practical tests, by generalising the tool of witnesses of causal nonseparability.

quant-ph↗

arXiv2018

Experimentally Probing the Algorithmic Randomness and Incomputability of Quantum Randomness

The advantages of quantum random number generators (QRNGs) over pseudo-random number generators (PRNGs) are normally attributed to the nature of quantum measurements. This is often seen as implying the superiority of the sequences of bits themselves generated by QRNGs, despite the absence of empirical tests supporting this. Nonetheless, one may expect sequences of bits generated by QRNGs to have properties that pseudo-random sequences do not; indeed, pseudo-random sequences are necessarily computable, a highly nontypical property of sequences. In this paper, we discuss the differences between QRNGs and PRNGs and the challenges involved in certifying the quality of QRNGs theoretically and testing their output experimentally. While QRNGs are often tested with standard suites of statistical tests, such tests are designed for PRNGs and only verify statistical properties of a QRNG, but are insensitive to many supposed advantages of QRNGs. We discuss the ability to test the incomputability and algorithmic complexity of QRNGs. While such properties cannot be directly verified with certainty, we show how one can construct indirect tests that may provide evidence for the incomputability of QRNGs. We use these tests to compare various PRNGs to a QRNG, based on superconducting transmon qutrits and certified by the Kochen-Specker Theorem, to see whether such evidence can be found in practice. While our tests fail to observe a strong advantage of the quantum random sequences due to algorithmic properties, the results are nonetheless informative: some of the test results are ambiguous and require further study, while others highlight difficulties that can guide the development of future tests of algorithmic randomness and incomputability.

quant-ph↗

arXiv2018

A Hybrid Quantum-Classical Paradigm to Mitigate Embedding Costs in Quantum Annealing---Abridged Version

Quantum annealing has shown significant potential as an approach to near-term quantum computing. Despite promising progress towards obtaining a quantum speedup, quantum annealers are limited by the need to embed problem instances within the (often highly restricted) connectivity graph of the annealer. This embedding can be costly to perform and may destroy any computational speedup. Here we present a hybrid quantum-classical paradigm to help mitigate this limitation, and show how a raw speedup that is negated by the embedding time can nonetheless be exploited in certain circumstances. We illustrate this approach with initial results on a proof-of-concept implementation of an algorithm for the dynamically weighted maximum independent set problem.

cs.DS↗

arXiv2018

Semi-device-independent characterisation of multipartite entangled states and measurements

The semi-device-independent framework allows one to draw conclusions about properties of an unknown quantum system under weak assumptions. Here we present a semi-device-independent scheme for the characterisation of multipartite entanglement based around a game played by several isolated parties whose devices are uncharacterised beyond an assumption about the dimension of their Hilbert spaces. Our scheme can certify that an $n$-partite high-dimensional quantum state features genuine multipartite entanglement. Moreover, the scheme can certify that a joint measurement on $n$ subsystems is entangled, and provides a lower bound on the number of entangled measurement operators. These tests are strongly robust to noise, and even optimal for certain classes of states and measurements, as we demonstrate with illustrative examples. Notably, our scheme allows for the certification of many entangled states admitting a local model, which therefore cannot violate any Bell inequality.

quant-ph↗

arXiv2017

Genuinely Multipartite Noncausality

The study of correlations with no definite causal order has revealed a rich structure emerging when more than two parties are involved. This motivates the consideration of multipartite "noncausal" correlations that cannot be realised even if noncausal resources are made available to a smaller number of parties. Here we formalise this notion: genuinely N-partite noncausal correlations are those that cannot be produced by grouping N parties into two or more subsets, where a causal order between the subsets exists. We prove that such correlations can be characterised as lying outside a polytope, whose vertices correspond to deterministic strategies and whose facets define what we call "2-causal" inequalities. We show that genuinely multipartite noncausal correlations arise within the process matrix formalism, where quantum mechanics holds locally but no global causal structure is assumed, although for some inequalities no violation was found. We further introduce two refined definitions that allow one to quantify, in different ways, to what extent noncausal correlations correspond to a genuinely multipartite resource.

quant-ph↗

arXiv2016

Noise and Disturbance of Qubit Measurements: An Information-Theoretic Characterisation

Information-theoretic definitions for the noise associated with a quantum measurement and the corresponding disturbance to the state of the system have recently been introduced [F. Buscemi et al., Phys. Rev. Lett. 112, 050401 (2014)]. These definitions are invariant under relabelling of measurement outcomes, and lend themselves readily to the formulation of state-independent uncertainty relations both for the joint estimate of observables (noise-noise relations) and the noise-disturbance tradeoff. Here we derive such relations for incompatible qubit observables, which we prove to be tight in the case of joint estimates, and present progress towards fully characterising the noise-disturbance tradeoff. In doing so, we show that the set of obtainable noise-noise values for such observables is convex, whereas the conjectured form for the set of obtainable noise-disturbance values is not. Furthermore, projective measurements are not optimal with respect to the joint-measurement noise or noise-disturbance tradeoffs. Interestingly, it seems that four-outcome measurements are needed in the former case, whereas three-outcome measurements are optimal in the latter.

quant-ph↗

arXiv2016

Multipartite Causal Correlations: Polytopes and Inequalities

We consider the most general correlations that can be obtained by a group of parties whose causal relations are well-defined, although possibly probabilistic and dependent on past parties' operations. We show that, for any fixed number of parties and inputs and outputs for each party, the set of such correlations forms a convex polytope, whose vertices correspond to deterministic strategies, and whose (nontrivial) facets define so-called causal inequalities. We completely characterize the simplest tripartite polytope in terms of its facet inequalities, propose generalizations of some inequalities to scenarios with more parties, and show that our tripartite inequalities can be violated within the process matrix formalism, where quantum mechanics is locally valid but no global causal structure is assumed.

quant-ph↗

arXiv2016

Proceedings of the 7th International Workshop on Physics and Computation

This volume constitutes the proceedings of the 7th International Workshop on Physics and Computation (PC 2016). The workshop was held on the 14th of July 2016 in Manchester, UK, as a satellite workshop to UCNC 2016, the 15th International Conference on Unconventional Computation and Natural Computation. The goal of the workshop series is to bring together researches working on the interaction between physics and the theory of computation. This intrinsically interdisciplinary domain of research strives to go beyond the traditional use of mathematics as a tool to model and understand the behaviour of physical systems. Instead, it looks to the the theory of computation and information to provide new insights into physical systems and processes, and, in turn, how these insights can lead to new methods, models and notation of computation and new approaches to computational and mathematical problems. Topics falling into this category at the interface of physics and computation that are within the scope of the conference include, amongst many others, the axiomatisation of physics, hypercomputation, the role of information in physical systems, quantum information, randomness in physics, theories of measurement, and the philosophy of physics and computation.

cs.ET↗

arXiv2016

Tight state-independent uncertainty relations for qubits

The well-known Robertson-Schrödinger uncertainty relations have state-dependent lower bounds which are trivial for certain states. We present a general approach to deriving tight state-independent uncertainty relations for qubit measurements that completely characterise the obtainable uncertainty values. This approach can give such relations for any number of observables, and we do so explicitly for arbitrary pairs and triples of qubit measurements. We show how these relations can be transformed into equivalent tight entropic uncertainty relations. More generally, they can be expressed in terms of any measure of uncertainty that can be written as a function of the expectation value of the observable for a given state.

quant-ph↗