Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,657 papers · 148 categories

Trend · papers per month

5331,0651,5982,130 · Jun 202019922001200920172026
48 results for Ising anyons

We show that the "geometric models of matter" approach proposed by the first author can be used to construct models of anyon quasiparticles with fractional quantum numbers, using 4-dimensional edge-cone orbifold geometries with orbifold singularities along embedded 2-dimensional surfaces. The anyon states arise through…

2016-11-12abs ↗pdf ↗

We classify all unitary modular tensor categories (UMTCs) of rank 4\leq 4. There are a total of 70 UMTCs of rank 4\leq 4 (Note that some authors would have counted as 35 MTCs.) In our convention there are two trivial unitary MTCs distinguished by the modular SS matrix S=(±1)S=(\pm1). Each such UMTC can be obtained from …

2007-12-09abs ↗pdf ↗

The theory of quantum computation can be constructed from the abstract study of anyonic systems. In mathematical terms, these are unitary topological modular functors. They underlie the Jones polynomial and arise in Witten-Chern-Simons theory. The braiding and fusion of anyonic excitations in quantum Hall electron liqu…

2001-01-04abs ↗pdf ↗

Abstract: Mapping 3-manifold bordisms to topological orders and domain walls.

problem Mapping spin 3-manifolds to topological orders and their domain walls.
method Defining topological orders from torsion elements in H1(N)H_1(N), linking form, and quadratic refinement. Extending to spin bordisms and domain walls.
result Constructing domain walls between topological orders from spin bordisms.

Topological quantum computation with Fibonacci anyons relies on the possibility of efficiently generating unitary transformations upon pseudoparticles braiding. The crucial fact that such set of braids has a dense image in the unitary operations space is well known; in addition, the Solovay-Kitaev algorithm allows to a…

2008-01-18abs ↗pdf ↗

Fibonacci anyons are attractive for use in topological quantum computation because any unitary transformation of their state space can be approximated arbitrarily accurately by braiding. However there is no known braid that entangles two qubits without leaving the space spanned by the two qubits. In other words, there …

2018-02-03abs ↗pdf ↗

Novel M-theory approach classifies topological phases of matter.

problem Classifying and understanding topological phases of matter.
method Establishing a correspondence between (2+1)d topological field theories and non-hyperbolic 3-manifolds, identifying topological phases from internal wrapped 3-manifolds.
result Paves a new route toward the classification of topological phases of matter, including fermionic and non-unitary phases.

In quantum computation, series of quantum gates have to be arranged in a predefined sequence that led to a quantum circuit in order to solve a particular problem. What if the sequence of quantum gates is known but both the problem to be solved and the outcome of the so defined quantum circuit remain in the shadow? This…

2015-06-27abs ↗pdf ↗

We prove that any smooth Riemannian manifold of non-negative scalar curvature and with a strictly mean convex and compact boundary component can be (C^2) extended beyond the component to have non-negative scalar curvature and to enjoy anyone of the following three types of (new) boundary: strictly convex, totally geode…

2012-09-20abs ↗pdf ↗

A surprising image of the stock market arises if the price time series of all Dow Jones Industrial Average stock components are represented in one chart at once. The chart evolves into a braid representation of the stock market by taking into account only the crossing of stocks and fixing a convention defining overcros…

2014-06-13abs ↗pdf ↗

This survey of some of the more topological aspects of the placement problem for complex curves in complex surfaces was originally published in L'Enseignement Mathematique 29 (1983). The present LaTeXed redaction corrects several typographical errors without, I hope, introducing new ones; some minor emendations and ref…

2001-06-08abs ↗pdf ↗

In classic fair division problems such as cake cutting and rent division, envy-freeness requires that each individual (weakly) prefer his allocation to anyone else's. On a conceptual level, we argue that envy-freeness also provides a compelling notion of fairness for classification tasks. Our technical focus is the gen…

2018-09-23abs ↗pdf ↗

Morpheo is a transparent and secure machine learning platform collecting and analysing large datasets. It aims at building state-of-the art prediction models in various fields where data are sensitive. Indeed, it offers strong privacy of data and algorithm, by preventing anyone to read the data, apart from the owner an…

2017-04-17abs ↗pdf ↗

This is an introduction to the subject of the differential topology of the space of smooth loops in a finite dimensional manifold. It began as the background notes to a series of seminars given at NTNU and subsequently at Sheffield. I am posting them in the hope that they will be useful to people wishing to know a litt…

2005-10-05abs ↗pdf ↗

This tutorial introduces a new and powerful set of techniques variously called "neural machine translation" or "neural sequence-to-sequence models". These techniques have been used in a number of tasks regarding the handling of human language, and can be a powerful tool in the toolbox of anyone who wants to model seque…

2017-03-05abs ↗pdf ↗

Once one knows that singularities occur, one naturally wonders what the singularities are like. For minimal varieties the first answer, already known to Federer-Fleming in 1959, is that they weakly resemble cones. For mean curvature flow, by the combined work of Huisken, Ilmanen, and White, singularities weakly resembl…

2013-12-14abs ↗pdf ↗

We apply the geometric-topology surgery theory on spacetime manifolds to study the constraints of quantum statistics data in 2+1 and 3+1 spacetime dimensions. First, we introduce the fusion data for worldline and worldsheet operators capable creating anyon excitations of particles and strings, well-defined in gapped st…

2016-02-18abs ↗pdf ↗

This paper uses natural language processing to create the first machine-coded democracy index, which I call Automated Democracy Scores (ADS). The ADS are based on 42 million news articles from 6,043 different sources and cover all independent countries in the 1993-2012 period. Unlike the democracy indices we have today…

2015-02-22abs ↗pdf ↗

StableLM 2 1.6B is a new language model series with detailed evaluations and performance metrics.

problem Improving language models with smaller sizes and better performance.
method Detailed data and training procedure for StableLM 2 1.6B, including zero- and few-shot benchmarks and multilingual evaluations.
result StableLM 2 1.6B is the state-of-the-art open model under 2B parameters.

One of the apparent advantages of quantum computers over their classical counterparts is their ability to efficiently contract tensor networks. In this article, we study some implications of this fact in the case of topological tensor networks. The graph underlying these networks is given by the triangulation of a mani…

2011-08-27abs ↗pdf ↗

We formulate one methodology to put a value or price on knowledge using well accepted techniques from finance. We provide justifications for these finance principles based on the limitations of the physical world we live in. We start with the intuition for our method to value knowledge and then formalize this idea with…

2019-08-01abs ↗pdf ↗

Standard economic theory makes an allowance for the agency problem, but not the compounding of moral hazard in the presence of informational opacity, particularly in what concerns high-impact events in fat tailed domains (under slow convergence for the law of large numbers). Nor did it look at exposure as a filter that…

2013-08-05abs ↗pdf ↗

The UCR Time Series Archive - introduced in 2002, has become an important resource in the time series data mining community, with at least one thousand published papers making use of at least one data set from the archive. The original incarnation of the archive had sixteen data sets but since that time, it has gone th…

2018-10-17abs ↗pdf ↗

We develop a Chern character map for twisted equivariant non-abelian cohomology.

problem Understanding non-abelian cohomology theories and their applications.
method General construction of the Chern character map for twisted equivariant non-abelian cohomology.
result Illustrated the construction by computing the equivariant Sullivan model of Cohomotopy.

An elementary family of local Hamiltonians H,¸,=1,2,3,ldotsH_{\c ,\ell}, \ell = 1,2,3, ldots, is described for a 22-dimensional quantum mechanical system of spin =1/2={1/2} particles. On the torus, the ground state space G,G_{\circ,\ell} is (log)(\log) extensively degenerate but should collapse under łłperturbation" to an anyonic syste…

2001-10-09abs ↗pdf ↗

3D topological order linked to Seifert manifolds and gauge groups.

problem Classifying 3D topological orders using Seifert manifolds and gauge groups.
method Correspondence between topological order, Seifert manifolds, and ADE gauge groups.
result Construction of modular fusion categories from Seifert manifolds and gauge groups.

Today's proliferation of powerful facial recognition systems poses a real threat to personal privacy. As Clearview.ai demonstrated, anyone can canvas the Internet for data and train highly accurate facial recognition models of individuals without their knowledge. We need tools to protect ourselves from potential misuse…

2020-02-19abs ↗pdf ↗

To formulate the universal constraints of quantum statistics data of generic long-range entangled quantum systems, we introduce the geometric-topology surgery theory on spacetime manifolds where quantum systems reside, cutting and gluing the associated quantum amplitudes, specifically in 2+1 and 3+1 spacetime dimension…

2019-01-31abs ↗pdf ↗

This book is a graduate-level introduction to probabilistic programming. It not only provides a thorough background for anyone wishing to use a probabilistic programming system, but also introduces the techniques needed to design and build these systems. It is aimed at people who have an undergraduate-level understandi…

2018-09-27abs ↗pdf ↗

Neural differential equations combine deep learning and differential equations for modeling complex systems.

problem Modeling complex systems with high capacity and efficiency.
method Combining neural networks and differential equations, focusing on neural ordinary, controlled, and stochastic differential equations.
result NDEs offer high-capacity function approximation, strong priors, and handle irregular data efficiently.