One dimensional semiconductor systems with strong spin-orbit interaction are both of fundamental interest and have potential applications to topological quantum computing. Applying a magnetic field can open a spin gap, a pre-requisite for Majorana zero modes. The spin gap is predicted to manifest as a field dependent dip on the first 1D conductance plateau.
View Article and Find Full Text PDFWe consider versions of the grasshopper problem (Goulko & Kent 2017 , 20170494) on the circle and the sphere, which are relevant to Bell inequalities. For a circle of circumference 2, we show that for unconstrained lawns of any length and arbitrary jump lengths, the supremum of the probability for the grasshopper's jump to stay on the lawn is one. For antipodal lawns, which by definition contain precisely one of each pair of opposite points and have length , we show this is true except when the jump length is of the form (/) with , coprime and odd.
View Article and Find Full Text PDFNumerical (and experimental) data analysis often requires the restoration of a smooth function from a set of sampled integrals over finite bins. We present the bin hierarchy method that efficiently computes the maximally smooth function from the sampled integrals using essentially all the information contained in the data. We perform extensive tests with different classes of functions and levels of data quality, including Monte Carlo data suffering from a severe sign problem and physical data for the Green's function of the Fröhlich polaron.
View Article and Find Full Text PDFWe introduce and physically motivate the following problem in geometric combinatorics, originally inspired by analysing Bell inequalities. A grasshopper lands at a random point on a planar lawn of area 1. It then jumps once, a fixed distance , in a random direction.
View Article and Find Full Text PDF