Searcharxiv⌕ Search

arXiv subjects

Susan Stepney

Publications and source records attributed to Susan Stepney.

29 records · Page 2Linked to original sources
arXiv2019

A Substrate-Independent Framework to Characterise Reservoir Computers

The Reservoir Computing (RC) framework states that any non-linear, input-driven dynamical system (the reservoir) exhibiting properties such as a fading memory and input separability can be trained to perform computational tasks. This broad inclusion of systems has led to many new physical substrates for RC. Properties essential for reservoirs to compute are tuned through reconfiguration of the substrate, such as change in virtual topology or physical morphology. As a result, each substrate possesses a unique `quality' -- obtained through reconfiguration -- to realise different reservoirs for different tasks. Here we describe an experimental framework to characterise the quality of potentially any substrate for RC. Our framework reveals that a definition of quality is not only useful to compare substrates, but can help map the non-trivial relationship between properties and task performance. In the wider context, the framework offers a greater understanding as to what makes a dynamical system compute, helping improve the design of future substrates for RC.

cs.ET↗
arXiv2019

Visualising high-dimensional state spaces with "Tuple Plots"

Complex systems are described with high-dimensional data that is hard to visualise. Inselberg's parallel coordinates are one representation technique for visualising high-dimensional data. Here we generalise Inselberg's approach, and use it for visualising trajectories through high dimensional state spaces. We introduce two geometric projections of parallel coordinate representations -- 'plan tuple plots' and 'side tuple plots' -- and demonstrate a link between state space and ordinary space representations. We provide examples from many domains to illustrate use of the approach, including Cellular Automata, Random Boolean Networks, coupled logistic maps, reservoir computing, search algorithms, Turing Machines, and flocking.

physics.data-an↗
arXiv2017

Computability and Complexity of Unconventional Computing Devices

We discuss some claims that certain UCOMP devices can perform hypercomputation (compute Turing-uncomputable functions) or perform super-Turing computation (solve NP-complete problems in polynomial time). We discover that all these claims rely on the provision of one or more unphysical resources.

cs.ET↗
arXiv2016

The Geometry of Speed Limiting Resources in Physical Models of Computation

We study the maximum speed of quantum computation and how it is affected by limitations on physical resources. We show how the resulting concepts generalize to a broader class of physical models of computation within dynamical systems and introduce a specific algebraic structure representing these speed limits. We derive a family of quantum speed limit results in resource-constrained quantum systems with pure states and a finite dimensional state space, by using a geometric method based on right invariant action functionals on $SU(N)$. We show that when the action functional is bi-invariant, the minimum time for implementing any quantum gate using a potentially time-dependent Hamiltonian is equal to the minimum time when using a constant Hamiltonian, thus constant Hamiltonians are time optimal for these constraints. We give an explicit formula for the time in these cases, in terms of the resource constraint. We show how our method produces a rich family of speed limit results, of which the generalized Margolus--Levitin theorem and the Mandelstam--Tamm inequality are special cases. We discuss the broader context of geometric approaches to speed limits in physical computation, including the way geometric approaches to quantum speed limits are a model for physical speed limits to computation arising from a limited resource.

quant-ph↗
arXiv2015

Zermelo Navigation in the Quantum Brachistochrone

We analyse the optimal times for implementing unitary quantum gates in a constrained finite dimensional controlled quantum system. The family of constraints studied is that the permitted set of (time dependent) Hamiltonians is the unit ball of a norm induced by an inner product on su(n). We also consider a generalisation of this to arbitrary norms. We construct a Randers metric, by applying a theorem of Shen on Zermelo navigation, the geodesics of which are the time optimal trajectories compatible with the prescribed constraint. We determine all geodesics and the corresponding time optimal Hamiltonian for a specific constraint on the control i.e. k (Tr(Hc(t)^2) = 1 for any given value of k > 0. Some of the results of Carlini et. al. are re-derived using alternative methods. A first order system of differential equations for the optimal Hamiltonian is obtained and shown to be of the form of the Euler Poincare equations. We illustrate that this method can form a methodology for determining which physical substrates are effective at supporting the implementation of fast quantum computation.

quant-ph↗
arXiv2014

A Geometrical Derivation of a Family of Quantum Speed Limit Results

We derive a family of quantum speed limit results in time independent systems with pure states and a finite dimensional state space, by using a geometric method based on right invariant action functionals on SU(N). The method relates speed limits for implementing quantum gates to bounds on orthogonality times. We reproduce the known result of the Margolus-Levitin theorem, and a known generalisation of the Margolis-Levitin theorem, as special cases of our method, which produces a rich family of other similar speed limit formulas corresponding to positive homogeneous functions on su(n). We discuss the general relationship between speed limits for controlling a quantum state and a system's time evolution operator.

quant-ph↗
arXiv2014

When does a physical system compute?

Computing is a high-level process of a physical system. Recent interest in non-standard computing systems, including quantum and biological computers, has brought this physical basis of computing to the forefront. There has been, however, no consensus on how to tell if a given physical system is acting as a computer or not; leading to confusion over novel computational devices, and even claims that every physical event is a computation. In this paper we introduce a formal framework that can be used to determine whether or not a physical system is performing a computation. We demonstrate how the abstract computational level interacts with the physical device level, drawing the comparison with the use of mathematical models to represent physical objects in experimental science. This powerful formulation allows a precise description of the similarities between experiments, computation, simulation, and technology, leading to our central conclusion: physical computing is the use of a physical system to predict the outcome of an abstract evolution. We give conditions that must be satisfied in order for computation to be occurring, and illustrate these with a range of non-standard computing scenarios. The framework also covers broader computing contexts, where there is no obvious human computer user. We define the critical notion of a 'computational entity', and show the role this plays in defining when computing is taking place in physical systems.

cs.ET↗
arXiv2014

Zermelo Navigation and a Speed Limit to Quantum Information Processing

We use a specific geometric method to determine speed limits to the implementation of quantum gates in controlled quantum systems that have a specific class of constrained control functions. We achieve this by applying a recent theorem of Shen, which provides a connection between time optimal navigation on Riemannian manifolds and the geodesics of a certain Finsler metric of Randers type. We use the lengths of these geodesics to derive the optimal implementation times (under the assumption of constant control fields) for an arbitrary quantum operation (on a finite dimensional Hilbert space), and explicitly calculate the result for the case of a controlled single spin system in a magnetic field, and a swap gate in a Heisenberg spin chain.

quant-ph↗
arXiv2012

A Framework for Heterotic Computing

Computational devices combining two or more different parts, one controlling the operation of the other, for example, derive their power from the interaction, in addition to the capabilities of the parts. Non-classical computation has tended to consider only single computational models: neural, analog, quantum, chemical, biological, neglecting to account for the contribution from the experimental controls. In this position paper, we propose a framework suitable for analysing combined computational models, from abstract theory to practical programming tools. Focusing on the simplest example of one system controlled by another through a sequence of operations in which only one system is active at a time, the output from one system becomes the input to the other for the next step, and vice versa. We outline the categorical machinery required for handling diverse computational systems in such combinations, with their interactions explicitly accounted for. Drawing on prior work in refinement and retrenchment, we suggest an appropriate framework for developing programming tools from the categorical framework. We place this work in the context of two contrasting concepts of "efficiency": theoretical comparisons to determine the relative computational power do not always reflect the practical comparison of real resources for a finite-sized computational task, especially when the inputs include (approximations of) real numbers. Finally we outline the limitations of our simple model, and identify some of the extensions that will be required to treat more complex interacting computational systems.

cs.ET↗
arXiv2009

Highly entangled multi-qubit states with simple algebraic structure

Recent works by Brown et al and Borras et al have explored numerical optimisation procedures to search for highly entangled multi-qubit states according to some computationally tractable entanglement measure. We present an alternative scheme based upon the idea of searching for states having not only high entanglement but also simple algebraic structure. We report results for 4, 5, 6, 7 and 8 qubits discovered by this approach, showing that many of such states do exist. In particular, we find a maximally entangled 6-qubit state with an algebraic structure simpler than the best results known so far. For the case of 7, we discover states with high, but not maximum, entanglement and simple structure, as well as other desirable properties. Some preliminary results are shown for the case of 8 qubits.

quant-ph↗