Related papers: A complex analogue of Toda's Theorem
Complexity theory can be viewed as the study of the relationship between computation and applications, understood the former as complexity classes and the latter as problems. Completeness results are clearly central to that view. Many…
Recently a great deal of attention has focused on quantum computation following a sequence of results suggesting that quantum computers are more powerful than classical probabilistic computers. Following Shor's result that factoring and the…
A key result in a 2004 paper by S. Arkhipov, R. Bezrukavnikov, and V. Ginzburg (ABG) gives an equivalence of the bounded derived category of finite dimensional modules for the principal block of a Lusztig quantum algebra at an $\ell^{th}$…
Jaeger, Vertigan, and Welsh [15] proved a dichotomy for the complexity of evaluating the Tutte polynomial at fixed points: The evaluation is #P-hard almost everywhere, and the remaining points admit polynomial-time algorithms. Dell,…
Multivariate orthogonal polynomials in $D$ real dimensions are considered from the perspective of the Cholesky factorization of a moment matrix. The approach allows for the construction of corresponding multivariate orthogonal polynomials,…
The problem to be solved in this paper is to construct a general method of proving whether a certain set is p-computable or not. The method is based on a polynomial analogue of the classical Gandhi's fixed point theorem. The classical…
The distinguishing result of this paper is a $\mathbf{P}$-time enumerable partition of all the potential perfect matchings in a bipartite graph. This partition is a set of equivalence classes induced by the missing edges in the potential…
We give a direct proof of an important result of Solynin which says that the Poincar\'e metric is a strongly submultiplicative domain function. This result is then used to define a new capacity for compact subsets of the complex plane…
Specifying a computational problem requires fixing encodings for input and output: encoding graphs as adjacency matrices, characters as integers, integers as bit strings, and vice versa. For such discrete data, the actual encoding is…
Using the matrix-resolvent method and a formula of the second-named author on the $n$-point function for a KP tau-function, we show that the tau-function of an arbitrary solution to the Toda lattice hierarchy is a KP tau-function. We then…
We study descriptive complexity of counting complexity classes in the range from #P to #$\cdot$NP. A corollary of Fagin's characterization of NP by existential second-order logic is that #P can be logically described as the class of…
We show that ESO universal Horn logic (existential second logic where the first order part is a universal Horn formula) is insufficient to capture P, the class of problems decidable in polynomial time. This statement is true in the presence…
In this article, I provide significant mathematical evidence in support of the existence of short-time approximations of any polynomial order for the computation of density matrices of physical systems described by arbitrarily smooth and…
We study the complexity of satisfiability problems in probabilistic and causal reasoning. Given random variables $X_1, X_2,\ldots$ over finite domains, the basic terms are probabilities of propositional formulas over atomic events $X_i =…
Partition functions, also known as homomorphism functions, form a rich family of graph invariants that contain combinatorial invariants such as the number of k-colourings or the number of independent sets of a graph and also the partition…
Capretta's delay monad can be used to model partial computations, but it has the "wrong" notion of built-in equality, strong bisimilarity. An alternative is to quotient the delay monad by the "right" notion of equality, weak bisimilarity.…
In this article we introduce a new complexity class called PQMA_log(2). Informally, this is the class of languages for which membership has a logarithmic-size quantum proof with perfect completeness and soundness which is polynomially close…
Quantum algorithms for topological data analysis (TDA) seem to provide an exponential advantage over the best classical approach while remaining immune to dequantization procedures and the data-loading problem. In this paper, we give…
We study the relative complexity of equivalence relations and preorders from computability theory and complexity theory. Given binary relations $R, S$, a componentwise reducibility is defined by $ R\le S \iff \ex f \, \forall x, y \, [xRy…
A $q$-analogue of the tau function of the modified KP hierarchy is defined by a change of independent variables. This tau function satisfies a system of bilinear $q$-difference equations. These bilinear equations are translated to the…