Geometric Control For Analysing the Quantum Speed Limit and the Physical Limitations of Computers

Benjamin Russell

Published Feb 1, 2015• 0 citations

Abstract

This thesis studies the role of Finsler geometry in quantum time optimal control of systems with constrained control field power and other constraints. The systems considered are all finite dimensional systems with pure states. A Finsler metric is constructed such that its geodesics are the time optimal trajectories for the quantum time evolution operator on the special unitary group. This metric is shown to be right invariant. The geodesic equation, in the form of an Euler-Poincar\\'{e} equation is found. It is also shown that the geodesic lengths of this same metric equal the optimal times for implementing any desired quantum gate. In a special case, where all are control fields are equally constrained, the desired geodesics are found in closed form. The results obtained are discussed in the general context of natural computation.

Related papers

Zermelo navigation and a speed limit to quantum information processing

Benjamin Russell, Susan Stepney

We use a specific geometric method to determine speed limits for 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.

arXiv:1310.6731Physical Review AJul 2, 201472 citations

APPLICATIONS OF FINSLER GEOMETRY TO SPEED LIMITS TO QUANTUM INFORMATION PROCESSING

Benjamin Russell, Susan Stepney

We are interested in fundamental limits to computation imposed by physical constraints. In particular, the physical laws of motion constrain the speed at which a computer can transition between well-defined states. Here, we discuss speed limits in the context of quantum computing. We review some relevant parts of the theory of Finsler metrics on Lie groups and homogeneous spaces such as the special unitary groups and complex projective spaces. We show how these constructions can be applied to analysing the limit to the speed of quantum information processing operations in constrained quantum systems with finite dimensional Hilbert spaces of states. We demonstrate the approach applied to a spin chain system.

International Journal of Foundations of Computer ScienceJun 1, 201415 citations

Zermelo navigation in the quantum brachistochrone

Benjamin Russell, Susan Stepney

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 . We also consider a generalization 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. for any given value of . 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–Poincaré 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.

arXiv:1409.2055Journal of Physics A Mathematical and TheoreticalFeb 23, 201550 citations

How fast can a quantum gate be? Exact speed limits from geometry

Hunter Nelson, Edwin Barnes

The speed of quantum evolution is limited under finite energy resources. While most quantum speed limits (QSLs) are formulated in terms of quantum states, they can be extended to the evolution operator itself, and thus impose fundamental limits on how quickly logical gate operations can be implemented on a quantum computer. Here, we derive a general, tight QSL that holds for any unitary evolution under the constraint that the spectral width of the Hamiltonian is bounded. We apply this result to obtain QSLs for several standard quantum gates, including Hadamard, CNOT, and Toffoli gates, finding that the QSL can vary significantly across different gates, including ones with the same entangling power. These findings can be understood geometrically using the Space Curve Quantum Control formalism, which maps unitary evolution to space curves in Euclidean space. In this formalism, the problem of finding QSLs is recast as the problem of finding minimal-length curves obeying a curvature bound. We find that time-optimal gates map to helices of varying dimensions, and that QSLs can be understood from the perspective of a bottleneck principle in which the operator that evolves the slowest governs the minimal gate time.

quant-pharXiv:2604.23031Apr 28, 20260 citations

The Geometry of Speed Limiting Resources in Physical Models of Computation

Benjamin Russell, Susan Stepney

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 [Formula: see text]. 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.

arXiv:1611.09220International Journal of Foundations of Computer ScienceJun 1, 20177 citations

A Geometrical Derivation of a Family of Quantum Speed Limit Results

Benjamin Russell, Susan Stepney

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.

arXiv:1410.3209Oct 13, 20144 citations