arXiv subjects

Lyle Noakes

Publications and source records attributed to Lyle Noakes.

At least 19 recordsLinked to original sources

arXiv2026

From Block-encoding to Generalized Quantum Signal Processing: Principles, Algorithms and Applications

Modern quantum algorithms are increasingly formulated as coherent procedures for implementing polynomial transformations of operators and singular values. This perspective provides a powerful and unifying language for quantum algorithm design, connecting a wide range of distinct problems through five closely related key tools: block-encoding, qubitization, QSP, QSVT and GQSP. Block-encoding embeds non-unitary matrices into larger unitaries; qubitization converts block-encodings into structured operators; QSP, QSVT and GQSP enable polynomial transformations with near-optimal query complexity. Together, these techniques form a general toolkit for transforming matrix functions into implementable quantum circuits. This paper develops these techniques from first principles as a unified framework for constructing quantum algorithms. We apply this framework to representative applications to highlight design principles and demonstrate how distinct algorithms can be constructed from a unified sequence of operator transformations. A central contribution is a systematic decision workflow for selecting the appropriate approach according to the operator structure and the desired transformation polynomial. This perspective clarifies when direct GQSP or through qubitization, or Laurent expansion, or QSVT is most appropriate. We organize algorithmic design into an end-to-end pipeline: identifying the target matrix function, constructing an appropriate block-encoding, determining the relevant spectral domain, designing a polynomial or Laurent-polynomial approximation, synthesizing the phase factors, and translating the transformation into an executable quantum circuit. By applying this unified framework to example applications, we showcase a practical methodology for reasoning, designing, and implementing quantum algorithms based on polynomial transformations.

quant-ph↗

arXiv2025

Napoleonic Constructions in the Hyperbolic Plane

In the Euclidean setting, Napoleon's Theorem states that if one constructs an equilateral triangle on either the outside or the inside of each side of a given triangle and then connects the barycenters of those three new triangles, the resulting triangle happens to be equilateral. The case of spherical triangles has been recently shown to be different: on the sphere, besides equilateral triangles, a necessary and sufficient condition for a given triangle to enjoy the above Napoleonic property is that its congruence class should lie on a suitable surface (namely, an ellipsoid in suitable coordinates). In this article we show that the hyperbolic case is significantly different from both the Euclidean and the spherical setting. Specifically, we establish here that the hyperbolic plane does not admit any Napoleonic triangle, except the equilateral ones. Furthermore, we prove that iterated Napoleonization of any triangle causes it to become smaller and smaller, more and more equilateral and converge to a single point in the limit.

math.AP↗

arXiv2024

Curves of Minimax Spirality

We study the problem of finding curves of minimum pointwise-maximum arc-length derivative of curvature, here simply called curves of minimax spirality, among planar curves of fixed length with prescribed endpoints and tangents at the endpoints. We consider the case when simple bounds (constraints) are also imposed on the curvature along the curve. The curvature at the endpoints may or may not be specified. We prove via optimal control theory that the optimal curve is some concatenation of Euler spiral arcs, circular arcs, and straight line segments. When the curvature is not constrained (or when the curvature constraint does not become active), an optimal curve is only made up of a concatenation of Euler spiral arcs, unless the oriented endpoints lie in a line segment or a circular arc of the prescribed length, in which case the whole curve is either a straight line segment or a circular arc segment, respectively. We propose numerical methods and illustrate these methods and the results by means of three example problems of finding such curves.

math.OC↗

arXiv2024

Analysis of the Non-variational Quantum Walk-based Optimisation Algorithm

This paper introduces in detail a non-variational quantum algorithm designed to solve a wide range of combinatorial optimisation problems, including constrained problems and problems with non-binary variables. The algorithm returns optimal and near-optimal solutions from repeated preparation and measurement of an amplified state. The amplified state is prepared via repeated application of two unitaries; one which phase-shifts solution states dependent on objective function values, and the other which mixes phase-shifted probability amplitudes via a continuous-time quantum walk (CTQW) on a problem-specific mixing graph. The general interference process responsible for amplifying optimal solutions is derived in part from statistical analysis of objective function values as distributed over the mixing graph. The algorithm's versatility is demonstrated through its application to various problems: weighted maxcut, k-means clustering, quadratic assignment, maximum independent set and capacitated facility location. In all cases, efficient circuit implementations of the CTQWs are discussed. A penalty function approach for constrained problems is also introduced, including a method for optimising the penalty function. For each of the considered problems, the algorithm's performance is simulated for a randomly generated problem instance, and in each case, the amplified state produces a globally optimal solution within a small number of iterations.

quant-ph↗

arXiv2024

Curves of Minimax Curvature

We consider the problem of finding curves of minimum pointwise-maximum curvature, i.e., curves of minimax curvature, among planar curves of fixed length with prescribed endpoints and tangents at the endpoints. We reformulate the problem in terms of optimal control and use the maximum principle, as well as some geometrical arguments, to produce a classification of the types of solutions. Using the classification, we devise a numerical method which reduces the infinite-dimensional optimization problem to a finite-dimensional problem with just six variables. The solution types, together with some further observations on optimality, are illustrated via numerical examples.

math.OC↗

arXiv2024

Non-variational Quantum Combinatorial Optimisation

This paper introduces a non-variational quantum algorithm designed to solve a wide range of combinatorial optimisation problems, including constrained and non-binary problems. The algorithm leverages an engineered interference process achieved through repeated application of two unitaries; one inducing phase-shifts dependent on objective function values, and the other mixing phase-shifted probability amplitudes via a continuous-time quantum walk (CTQW) on a problem-specific graph. The algorithm's versatility is demonstrated through its application to various problems, namely those for which solutions are characterised by either a vector of binary variables, a vector of non-binary integer variables, or permutations (a vector of integer variables without repetition). An efficient quantum circuit implementation of the CTQW for each of these problem types is also discussed. A penalty function approach for constrained problems is also introduced, including a method for optimising the penalty function. The algorithm's performance is demonstrated through numerical simulation for randomly generated instances of the following problems (and problem sizes): weighted maxcut (18 vertices), maximum independent set (18 vertices), k-means clustering (12 datapoints, 3 clusters), capacitated facility location (12 customers, 3 facility locations), and the quadratic assignment problem (9 locations). For each problem instance, the algorithm finds a globally optimal solution with a small number of iterations.

quant-ph↗

arXiv2024

Napoleonic triangles on the sphere

As is well-known, numerical experiments show that Napoleon's Theorem for planar triangles does not extend to a similar statement for triangles on the unit sphere $S^2$. Spherical triangles for which an extension of Napoleon's Theorem holds are called ``Napoleonic'', and until now the only known examples have been equilateral. In this paper we determine all Napoleonic spherical triangles, including a class corresponding to points on a 2-dimensional ellipsoid, whose Napoleonisations are all congruent. Other new classes of examples are also found, according to different versions of Napoleon's Theorem for the sphere. The classification follows from successive simplifications of a complicated original algebraic condition, exploiting geometric symmetries and algebraic factorisations.

math.AP↗

arXiv2023

Rigidity of Travelling Times for Strictly Convex Obstacles in Riemannian Manifolds

Let $K$ and $L$ be two disjoint unions of strictly convex obstacles contained within a Riemannian manifold with boundary $S$ of dimension $m\geq 2$. The sets of travelling times $\mathcal{T}_K$ and $\mathcal{T}_L$ of $K$ and $L$, respectively, are composed of triples $(x,y,t)\in\partial S\times\partial S\times\mathbb{R}^+$ where $t$ is the length of a billiard trajectory with endpoints $x$ and $y$ that reflects elastically on $K$ (or $L$ for $(x,y,t)\in\mathcal{T}_L$). It has been shown (arXiv:2309.11141) that (under some natural curvature bounds on $S$) if $\mathcal{T}_K=\mathcal{T}_L$ and $K$ and $L$ were equivalent up to tangency then $K = L$. In this paper we remove this requirement for $K$ and $L$, and show that if $\mathcal{T}_K = \mathcal{T}_L$ then $K = L$ whenever $m\geq 3$.

math.DG↗

arXiv2023

Uniqueness of Obstacles in Riemannian Manifolds from Travelling Times

Suppose that $K$ and $L$ are two disjoint unions of strictly convex obstacles with the same set of travelling times, contained in an $n$-dimensional Riemannian manifold $M$ (where $n\geq2$). Under some natural curvature conditions on $M$, and provided that no geodesic intersects more than two components in $K$ or $L$, we show that $K = L$.

math.DG↗

arXiv2023

Recovering Obstacles from their Travelling Times

Noakes and Stoyanov (2021) introduced a method of recovering strictly convex planar obstacles from their set of travelling times. We provide an extension of this construction for obstacles on Riemannian surfaces under some general curvature conditions. It is required that no smooth geodesic intersect more than two obstacles.

math.DG↗

arXiv2020

Convex Obstacles from Travelling Times

A construction is given for the recovery of a disjoint union of strictly convex smooth planar obstacles from travelling-time information. The obstacles are required to be such that no Euclidean line meets more than two of them.

math.DS↗

arXiv2020

Travelling Times in Scattering by Obstacles in Curved Space

We consider travelling times of billiard trajectories in the exterior of an obstacle K on a two-dimensional Riemannian manifold M. We prove that given two obstacles with almost the same travelling times, the generalised geodesic flows on the non-trapping parts of their respective phase-spaces will have a time-preserving conjugacy. Moreover, if M has non-positive sectional curvature we prove that if K and L are two obstacles with strictly convex boundaries and almost the same travelling times then K and L are identical.

math.DG↗

arXiv2019

Rigidity of MHD equilibria to smooth incompressible ideal motion near resonant surfaces

In ideal MHD, the magnetic flux is advected by the plasma motion, freezing flux-surfaces into the flow. An MHD equilibrium is reached when the flow relaxes and force balance is achieved. We ask what classes of MHD equilibria can be accessed from a given initial state via smooth incompressible ideal motion. It is found that certain boundary displacements are formally not supported. This follows from yet another investigation of the Hahm--Kulsrud--Taylor (HKT) problem, which highlights the resonant behaviour near a rational layer formed by a set of degenerate critical points in the flux-function. When trying to retain the mirror symmetry of the flux-function with respect to the resonant layer, the vector field that generates the volume-preserving diffeomorphism vanishes at the identity to all order in the time-like path parameter.

physics.plasm-ph↗

arXiv2019

Gauge freedom in magnetostatics and the effect on helicity in toroidal volumes

Magnetostatics defines a class of boundary value problems in which the topology of the domain plays a subtle role. For example, representability of a divergence-free field as the curl of a vector potential comes about because of homological considerations. With this in mind, we study gauge-freedom in magnetostatics and its effect on the comparison between magnetic configurations through key quantities such as the magnetic helicity. For this, we apply the Hodge decomposition of $k$-forms on compact orientable Riemaniann manifolds with smooth boundary, as well as de Rham cohomology, to the representation of magnetic fields through potential $1$-forms in toroidal volumes. An advantage of the homological approach is the recovery of classical results without explicit coordinates and assumptions about the fields on the exterior of the domain. In particular, a detailed construction of a minimal gauge and a formal proof of relative helicity formulae are presented.

physics.plasm-ph↗

arXiv2018

Non-planar elasticae as optimal curves for the magnetic axis of stellarators

The problem of finding an optimal curve for the target magnetic axis of a stellarator is addressed. Euler-Lagrange equations are derived for finite length three-dimensional curves that extremise their bending energy while yielding fixed integrated torsion. The obvious translational and rotational symmetry is exploited to express solutions in a preferred cylindrical coordinate system in terms of elliptic Jacobi functions. These solution curves, which, up to similarity transformations, depend on three dimensionless parameters, do not necessarily close. Two closure conditions are obtained for the vertical and toroidal displacement (the radial coordinate being trivially periodic) to yield a countably infinite set of one-parameter families of closed non-planar curves. The behaviour of the integrated torsion (Twist of the Frenet frame), the Linking of the Frenet frame and the Writhe of the solution curves is studied in light of the \Calugareanu theorem. A refreshed interpretation of Mercier's formula for the on-axis rotational transform of stellarator magnetic field-lines is proposed.

physics.plasm-ph↗

arXiv2018

Lens Rigidity in Scattering by Unions of Strictly Convex Bodies in $\R^2$

It was proved in \cite{NS1} that obstacles $K$ in $\R^d$ that are finite disjoint unions of strictly convex domains with $C^3$ boundaries are uniquely determined by the travelling times of billiard trajectories in their exteriors and also by their so called scattering length spectra. However the case $d = 2$ is not properly covered in \cite{NS1}. In the present paper we give a separate different proof of the same result in the case $d = 2$.

math.DS↗

arXiv2018

Second Order Spiral Splines

Second order spiral splines are $C^2$ unit-speed planar curves that can be used to interpolate a list $Y$ of $n+1$ points in $\R ^2$ at times specified in some list $T$, where $n\geq 2$. Asymptotic methods are used to develop a fast algorithm, based on a pair of tridiagonal linear systems and standard software. The algorithm constructs a second order spiral spline interpolant for data that is convex and sufficiently finely sampled.

math.NA↗

arXiv2017

Sub-Riemannian cubics in SU(2)

Sub-Riemannian cubics are a generalisation of Riemannian cubics to a sub-Riemannian manifold. Cubics are curves which minimise the integral of the norm squared of the covariant acceleration. Sub-Riemannian cubics are cubics which are restricted to move in a horizontal subspace of the tangent space. When the sub-Riemannian manifold is also a Lie group, sub-Riemannian cubics correspond to what we call a sub-Riemannian Lie quadratic in the Lie algebra. The present article studies sub-Riemannian Lie quadratics in the case of $\mathfrak{su}(2)$, focusing on the long term dynamics.

math.DG↗