相关论文: The Computational Complexity of Rules for the Char…
Finding a Hadamard matrix (H-matrix) among the set of all binary matrices of corresponding order is a hard problem, which potentially can be solved by quantum computing. We propose a method to formulate the Hamiltonian of finding H-matrix…
Regular expressions constitute a fundamental notion in formal language theory and are frequently used in computer science to define search patterns. A classic algorithm for these problems constructs and simulates a non-deterministic finite…
Atomic congestion games are a classic topic in network design, routing, and algorithmic game theory, and are capable of modeling congestion and flow optimization tasks in various application areas. While both the price of anarchy for such…
In Monoidal Computer I, we introduced a categorical model of computation where the formal reasoning about computability was supported by the simple and popular diagrammatic language of string diagrams. In the present paper, we refine and…
The Kauffman bracket skein algebra of a surface is a generalization of the Jones polynomial invariant for links and plays a principal role in the Witten-Reshetikhin- Turaev topological quantum field theory. However, the multiplicative…
This is the sequel exposition following [1]. The framework quotient algebra partition is rephrased in the language of the s-representation. Thanks to this language, a quotient algebra partition of the simplest form is established under a…
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether $S$ is a semigroup or has an identity element. If S is a monoid, we want to…
Central to near-term quantum machine learning is the use of hybrid quantum-classical algorithms. This paper develops a formal framework for describing these algorithms in terms of string diagrams: a key step towards integrating these hybrid…
Recent results by Harrow et. al. and by Ta-Shma, suggest that quantum computers may have an exponential advantage in solving a wealth of linear algebraic problems, over classical algorithms. Building on the quantum intuition of these…
Normalized irreducible characters of the symmetric group S(n) can be understood as zonal spherical functions of the Gelfand pair $(S(n)\times S(n),\Diag S(n))$. They form an orthogonal basis in the space of the functions on the group S(n)…
Given a reference computer, Kolmogorov complexity is a well defined function on all binary strings. In the standard approach, however, only the asymptotic properties of such functions are considered because they do not depend on the…
This is a continuation of arXiv:0903.0398 [math.RT]. Let g be a simple Lie algebra. In this note, we provide simple formulae for the index of sl(2)-subalgebras in the classical Lie algebras and a new formula for the index of the principal…
We count points over a finite field on wild character varieties of Riemann surfaces for singularities with regular semisimple leading term. The new feature in our counting formulas is the appearance of characters of Yokonuma-Hecke algebras.…
We present a quantum algorithm which identifies with certainty a hidden subgroup of an arbitrary finite group G in only a polynomial (in log |G|) number of calls to the oracle. This is exponentially better than the best classical algorithm.…
Query complexity is a common tool for comparing quantum and classical computation, and it has produced many examples of how quantum algorithms differ from classical ones. Here we investigate in detail the role that oracles play for the…
In this note we provide a concise report on the complexity of the causal ordering problem, originally introduced by Simon to reason about causal dependencies implicit in systems of mathematical equations. We show that Simon's classical…
Open sets are central to mathematics, especially analysis and topology, in ways few notions are. In most, if not all, computational approaches to mathematics, open sets are only studied indirectly via their 'codes' or 'representations'. In…
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not…
The problem of efficient multiplication of large numbers has been a long-standing challenge in classical computation and has been extensively studied for centuries. It appears that the existing classical algorithms are close to their…
The derivation of the Hardy-Ramanujan-Rademacher formula for the number of partitions of $n$ is reviewed. Next, the steps for finding analogous formulas for certain restricted classes of partitions or overpartiitons is examined, bearing in…