arXiv research

Quantum theory constructs a group and skein module for knot complements.

Proves a conjecture about Lagrangian intersections using new theory.

M. Khovanov and L. Rozansky gave a categorification of the HOMFLY-PT polynomial. This study is a generalization of the Khovanov-Rozansky homology. We define a homology associated to the quantum $(sl_n,\land V_n)$ link invariant, where $\land V_n$ is the set of the fundamental representations of the quantum group of $sl…

We want to construct a homological link invariant whose Euler characteristic is MOY polynomial as Khovanov and Rozansky constructed a categorification of HOMFLY polynomial. The present paper gives the first step to construct a categorification of MOY polynomial. For the essential colored planar diagrams with additional…

Reverse annealing boosts quantum matrix factorization performance.

This article gives matrix factorizations for the trivalent diagrams and double line appearing in $\mathfrak{sl}_n$ quantum link invariant. These matrix factorizations reconstruct Khovanov-Rozansky homology. And we show that the Euler characteristic of the matrix factorization for a double loop equals the quantum dimens…

Quantum codes with optimal distance and dimension for n-dimensional space.

Quantum algorithms improve regret bounds for bandits with knapsacks.

Quantum assets are priced using a new theorem, extending classical asset pricing.

Quantum memory limits set by relativity theory.

New MCMC method speeds up quantum physics simulations by a factor of 100.

The paper shows deep connections between exotic smoothings of a small R^4 (the spacetime), the leaf space of codimension-1 foliations (related to noncommutative algebras) and quantization. At first we relate a small exotic R^4 to codimension-1 foliations of the 3-sphere unique up to foliated cobordisms and characterize…

Quantum ELMs use a quantum reservoir to learn from data, with limits on expressivity and scalability.

This work presents a novel fundamental algorithm for for defining and training Neural Networks in Quantum Information based on time evolution and the Hamiltonian. Classical Neural Network algorithms (ANN) are computationally expensive. For example, in image classification, representing an image pixel by pixel using cla…

Fundamental weight systems identified as quantum states.

Constructs manifolds from quantum codes with novel geometric properties.

This research connects quantum spectra of flag bundles to prime factorization of integers.

Quantum MC simulations generate financial risk distributions efficiently.

This paper investigates the relationship between algebraic quantum field theories and factorization algebras on globally hyperbolic Lorentzian manifolds. Functorial constructions that map between these two types of theories in both directions are developed under certain natural hypotheses, including suitable variants o…

Study of quantum decorated character stacks and their quantizations.

We study the representation theory of the quantum Teichmueller space when going to infinity in the classical Teichmueller space. The geometric ingredients are the extension of Thurston's shear coordinates to the augmented Teichmueller space and the study of the Weil-Petersson Poisson structure for this extension. The r…

Quantum computers can enhance spectral methods in machine learning.

Quantum method generates unbiased samples from discrete graphical models.

This paper reviews quantum machine learning from NISQ to fault tolerance.

Quantum Ridgelet Transform speeds up neural network learning.

Quantum GAN improves volatility modeling in finance.

Quantum annealing solves matrix factorization for large datasets.

In this article we model a financial derivative price as an observable on the market state function. We apply geometric techniques to integrating the Heisenberg Equation of Motion. We illustrate how the non-commutative nature of the model introduces quantum interference effects that can act as either a drag or a boost …

Khovanov homology helps create quantum error-correcting codes.

Tensor-network techniques have enjoyed outstanding success in physics, and have recently attracted attention in machine learning, both as a tool for the formulation of new learning algorithms and for enhancing the mathematical understanding of existing methods. Inspired by these developments, and the natural correspond…

Using Seifert fibered three-manifold examples of Boileau and Zieschang, we demonstrate that the Reshetikhin-Turaev quantum invariants may be used to provide a sharp lower bound on the Heegaard genus which is strictly larger than the rank of the fundamental group.

We study the projected gradient descent method on low-rank matrix problems with a strongly convex objective. We use the Burer-Monteiro factorization approach to implicitly enforce low-rankness; such factorization introduces non-convexity in the objective. We focus on constraint sets that include both positive semi-defi…

In this paper, we establish a link between quantum stochastic processes, and nonlocal diffusions. We demonstrate how the non-commutative Black-Scholes equation of Accardi & Boukas (Luigi Accardi, Andreas Boukas, 'The Quantum Black-Scholes Equation', Jun 2007, available at arXiv:0706.1300v1) can be written in integral f…

"Thick" or "microformal" morphisms of supermanifolds generalize ordinary maps. They were discovered as a tool for homotopy algebras. Namely, the corresponding pullbacks provide $L_{\infty}$-morphisms for $S_{\infty}$ or Batalin--Vilkovisky algebras. It was clear from the start that constructions used for thick morphism…

We present a generally covariant approach to quantum mechanics in which generalized positions, momenta and time variables are treated as coordinates on a fundamental "phase-spacetime." We show that this covariant starting point makes quantization into a purely geometric flatness condition. This makes quantum mechanics …

This tutorial introduces quantum computing for financial portfolio optimization.

We consider colored operads and their actions on categories. As a special example we construct a cobordism category with a colored operad action arising from oriented planar arc diagrams. This is used to construct an invariant of oriented tangle diagrams with values in the homotopy category attached to the cobordism ca…

We investigate how the choice of decision makers can be varied under the presence of risk and uncertainty. Our analysis is based on the approach we have previously applied to individual decision makers, which we now generalize to the case of decision makers that are members of a society. The approach employs the mathem…

New method uses quantum computing to process classical data efficiently.

This paper discusses the construction of a generalized Alexander polynomial for virtual knots and links, and the reformulation of this invariant as a quantum link invariant. The algebraic background for the generalized Alexander module is formulated in terms of the biquandle, a generalization of the quandle of David Jo…

A basic question in the theory of fault-tolerant quantum computation is to understand the fundamental resource costs for performing a universal logical set of gates on encoded qubits to arbitrary accuracy. Here we consider qubits encoded with constant space overhead (i.e. finite encoding rate) in the limit of arbitrari…

Rank concepts help explain deep learning's effectiveness.

In this paper, we study the bound states of quantum layers. We prove that for the quantum layer built over a parabolic manifold which is not totally geodesic, if the second fundamantal form decays sufficiently fast, then the bound states exist. In the 2d case, we prove that the quantum layer over a convex surface whose…

We unveil the geometric nature of the multiplet of fundamental fermions in the Standard Model of fundamental particles as a noncommutative analogue of de Rham forms on the internal finite quantum space.

QBC uses quantum computers to speed up Bayesian computation.

MPE framework proves universal approximation for quantum data distribution.

In the quantum Teichmuller theory, based on Penner coordinates, the mapping class groups of punctured surfaces are represented projectively. The case of a genus three surface with one puncture is worked out explicitly. The projective factor is calculated. It is given by the exponential of the Liouville central charge.

Defines a map connecting 3d-index and skein module.