Related papers: Quantum Algorithms for the Jones Polynomial
Understanding and improving generalization capabilities is crucial for both classical and quantum machine learning (QML). Recent studies have revealed shortcomings in current generalization theories, particularly those relying on uniform…
The efficient implementation of matrix arithmetic operations underpins the speedups of many quantum algorithms. We develop a suite of methods to perform matrix arithmetics -- with the result encoded in the off-diagonal blocks of a…
Arnoldi method and conjugate gradient method are important classical iteration methods in solving linear systems and estimating eigenvalues. Their efficiency often affected by the high dimension of the space, where quantum computer can play…
We introduce an algorithm to compute the rational torsion subgroup of the Jacobian of a hyperelliptic curve of genus 3 over the rationals. We apply a Magma implementation of our algorithm to a database of curves with low discriminant due to…
We describe the inclusive Racah matrices for the first non-(anti)symmetric rectangular representation R=[2,2] for quantum groups U_q(sl_N). Most of them have sizes 2, 3, and 4 and are fully described by the eigenvalue hypothesis. Of two 6x6…
Machine learning has achieved dramatic success over the past decade, with applications ranging from face recognition to natural language processing. Meanwhile, rapid progress has been made in the field of quantum computation including…
In this paper, a quantum algorithm based on gaussian process regression model is proposed. The proposed quantum algorithm consists of three sub-algorithms. One is the first quantum subalgorithm to efficiently generate mean predictor. The…
The $J$-matrix method is extended to difference and $q$-difference operators and is applied to several explicit differential, difference, $q$-difference and second order Askey-Wilson type operators. The spectrum and the spectral measures…
Let $k$ be a finite field, and $L$ be a $q$-linearized polynomial defined over $k$ of $q$-degree $r$ ($L=\sum^r_{i=0}a_iZ^{q^i}$, with $a_i\in k$). This paper provides an algorithm to compute a characteristic polynomial of $L$ over a large…
Quantum computers can execute algorithms that sometimes dramatically outperform classical computation. Undoubtedly the best-known example of this is Shor's discovery of an efficient quantum algorithm for factoring integers, whereas the same…
In this paper, we discuss new results related to the generalized discrete $q$-Hermite II polynomials $ \tilde h_{n,\alpha}(x;q)$, introduced by Mezlini et al. in 2014. Our aim is to give a continuous orthogonality relation, a $q$-integral…
We present a quantum algorithm that additively approximates the value of a tensor network to a certain scale. When combined with existing results, this provides a complete problem for quantum computation. The result is a simple new way of…
This paper considers fast algorithms for operations on linearized polynomials. We propose a new multiplication algorithm for skew polynomials (a generalization of linearized polynomials) which has sub-quadratic complexity in the polynomial…
We propose an algorithm for determining the irreducible polynomials over finite fields, based on the use of the companion matrix of polynomials and the generalized Jordan normal form of square matrices.
We calculate convergent 3-loop Feynman diagrams containing a single massive loop equipped with twist $\tau =2$ local operator insertions corresponding to spin $N$. They contribute to the massive operator matrix elements in QCD describing…
The generalization of the Jaynes-Cummings (GJC) Model is proposed. In this model, the electromagnetic radiation is described by a Hamiltonian generalizing the harmonic oscillator to take into account some nonlinear effects which can occurs…
In this paper we prove a unified model for $U_q(sl(2))$ quantum invariants through intersections of embedded Lagrangians in configuration spaces. More specifically, we construct a {\em state sum of Lagrangian intersections in the…
In 2013, Clader, Jacobs, and Sprouse developed a quantum computing algorithm that solves electromagnetic scattering problems exponentially faster than the best known classical algorithm for that problem. We examine this quantum algorithm's…
An adiabatic cyclic evolution of control parameters of a quantum system ends up with a holonomic operation on the system, determined entirely by the geometry in the parameter space. The operation is given either by a simple phase factor (a…
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…