Related papers: An LLT-type algorithm for computing higher-level c…
Recently, large language models (LLMs) have shown surprising performance in task-specific workloads as well as general tasks with the given prompts. However, to achieve unprecedented performance, recent LLMs use billions to trillions of…
The LogQ algorithm encodes Quadratic Unconstrained Binary Optimization (QUBO) problems with exponentially fewer qubits than the Quantum Approximate Optimization Algorithm (QAOA). The advantages of conventional LogQ are accompanied by a…
A classification of the simple highest weight bounded modules of the queer Lie superalgebras q(n) is obtained. To achieve this classification we introduce a new combinatorial tool - the star action. Our result leads in particular to a…
Solving linear systems is at the foundation of many algorithms. Recently, quantum linear system algorithms (QLSAs) have attracted great attention since they converge to a solution exponentially faster than classical algorithms in terms of…
We apply numerical optimization and linear algebra algorithms for classical computers to the problem of automatically synthesizing algorithms for quantum computers. Using our framework, we apply several common techniques from these…
In this paper we propose a procedure for robust estimation in the context of generalized linear models based on the maximum Lq-likelihood method. Alongside this, an estimation algorithm that represents a natural extension of the usual…
Presented here is a matrix inversion method utilizing quantum searching algorithm. In this method, huge Hilbert space as a whole spanned by myriad of eigen states is searched and evaluated efficiently by sequential reduction in dimension…
We present a quantum algorithm for estimating the matrix determinant based on quantum spectral sampling. The algorithm estimates the logarithm of the determinant of an $n \times n$ positive sparse matrix to an accuracy $\epsilon$ in time…
The notion of linear finite transducer (LFT) plays a crucial role in some cryptographic systems. In this paper we present a way to get an approximate value, by random sampling, for the number of non-equivalent injective LFTs. By introducing…
A theoretical model of computation is proposed based on Lorentz quantum mechanics. Besides the standard qubits, this model has an additional bit, which we call hyperbolic bit (or hybit in short). A set of basic logical gates are constructed…
We study the efficiency of algorithms simulating a system evolving with Hamiltonian $H=\sum_{j=1}^m H_j$. We consider high order splitting methods that play a key role in quantum Hamiltonian simulation. We obtain upper bounds on the number…
Improving the efficiency of inference in Large Language Models (LLMs) is a critical area of research. Post-training Quantization (PTQ) is a popular technique, but it often faces challenges at low-bit levels, particularly in downstream…
We show that coefficients in unicellular LLT polynomials are evaluations of Hecke algebra traces at Kazhdan-Lusztig basis elements. We express these in terms of traditional trace bases, induction, and Kazhdan-Lusztig R-polynomials.
Classical programming languages cannot model essential elements of complex systems such as true random number generation. This paper develops a formal programming language called the lambda-q calculus that addresses the fundamental…
We present a fast version of the algorithm of Lascoux, Leclerc, and Thibon for the lower global crystal base for the Fock representation of quantum affine sl_n. We also show that the coefficients of the lower global crystal base coincide…
We consider $U_{q}(\mathfrak{gl}_{n})$, the quantum group of type $A$ for $|q| = 1$, $q$ generic. We provide formulas for signature characters of irreducible finite-dimensional highest weight modules and Verma modules. In both cases, the…
Efficient deployment of large language models (LLMs) requires extreme quantization, forcing a critical trade-off between low-bit efficiency and performance. Residual binarization enables hardware-friendly, matmul-free inference by stacking…
An algorithm is presented for the efficient and accurate computation of the coefficients of the characteristic polynomial of a general square matrix. The algorithm is especially suited for the evaluation of canonical traces in determinant…
We relate the canonical basis of the Fock space representation of the quantum affine algebra $U_q(\widehat{\mathfrak{gl}}_{n})$, as defined by Leclerc and Thibon, to the canonical basis of its restriction to $U_q(\mathfrak{sl}_{n})$,…
In this note we review the spinon basis for the integrable highest weight modules of sl2^ at levels k\geq1, and give the corresponding character formula. We show that our spinon basis is intimately related to the basis proposed by Foda et…