activity
20112026
most citedGenerating 3 qubit quantum circuits with neural networks

24 citations · 58 across the 26 of their papers we have counts for

collaborators
Showing math.DGShow all

9 papers · 1 filter

math.DG2023

Rigidity of Travelling Times for Strictly Convex Obstacles in Riemannian Manifolds

Tal Gurfinkel, Lyle Noakes, Luchezar Stoyanov

Let and be two disjoint unions of strictly convex obstacles contained within a Riemannian manifold with boundary of dimension . The sets of travelling times $\…

math.DG2023

Uniqueness of Obstacles in Riemannian Manifolds from Travelling Times

Tal Gurfinkel, Lyle Noakes, Luchezar Stoyanov

Suppose that and are two disjoint unions of strictly convex obstacles with the same set of travelling times, contained in an -dimensional Riemannian manifold (where…

math.DG2023

Recovering Obstacles from their Travelling Times

Tal Gurfinkel, Lyle Noakes, Luchezar Stoyanov

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 o…

math.DG2020★ 3 cited

Travelling Times in Scattering by Obstacles in Curved Space

Tal Gurfinkel, Lyle Noakes, Luchezar Stoyanov

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…

math.DG2017

Sub-Riemannian cubics in SU(2)

Michael Swaddle, Lyle Noakes

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 acc…

math.DG2013★ 5 cited

Relative Geodesics in the Special Euclidean Group

Darryl D. Holm, Lyle Noakes, Joris Vankerschaver

We propose a notion of distance between two parametrized planar curves, called their discrepancy, and defined intuitively as the minimal amount of deformation needed to deform the…