Related papers: Quantum Algorithms for Representation-Theoretic Mu…
We describe a simple formalism for generating classes of quantum circuits that are classically efficiently simulatable and show that the efficient simulation of Clifford circuits (Gottesman-Knill theorem) and of matchgate circuits…
A recent breakthrough by Ambainis, Balodis, Iraids, Kokainis, Pr\=usis and Vihrovs (SODA'19) showed how to construct faster quantum algorithms for the Traveling Salesman Problem and a few other NP-hard problems by combining in a novel way…
We argue that the complex numbers are an irreducible object of quantum probability. This can be seen in the measurements of geometric phases that have no classical probabilistic analogue. Having complex phases as primitive ingredient…
We investigate quantum inspired algorithms to compute physical observables of quantum many-body systems at finite energies. They are based on the quantum algorithms proposed in [Lu et al. PRX Quantum 2, 020321 (2021)], which use the quantum…
Quantum algorithms can deliver asymptotic speedups over their classical counterparts. However, there are few cases where a substantial quantum speedup has been worked out in detail for reasonably-sized problems, when compared with the best…
Associated to a finite measure on the real line with finite moments are recurrence coefficients in a three-term formula for orthogonal polynomials with respect to this measure. These recurrence coefficients are frequently inputs to modern…
We show that a separation between the class of all problems that can efficiently be solved on a quantum computer and those solvable using probabilistic classical algorithms in polynomial time implies the generalized contextuality of quantum…
We give a new Jacobi--Trudi-type formula for characters of finite-dimensional irreducible representations in type $C_n$ using characters of the fundamental representations and non-intersecting lattice paths. We give equivalent determinant…
The Kostka semigroup consists of pairs of partitions with at most r parts that have positive Kostka coefficient. For this semigroup, Hilbert basis membership is an NP-complete problem. We introduce KGR graphs and conservative subtrees,…
We study the Kronecker coefficients $g_{\lambda, \mu, \nu}$ via a formula that was described by Mishna, Rosas, and Sundaram, in which the coefficients are expressed as a signed sum of vector partition function evaluations. In particular, we…
We present quantum algorithms for the estimation of n-time correlation functions, the local and non-local density of states, and dynamical linear response functions. These algorithms are all based on block-encodings - a versatile technique…
We propose an approach for quantifying a quantum circuit's quantumness as a means to understand the nature of quantum algorithmic speedups. Since quantum gates that do not preserve the computational basis are necessary for achieving quantum…
We apply lattice point counting methods to compute the multiplicities in the plethysm of $GL(n)$. Our approach gives insight into the asymptotic growth of the plethysm and makes the problem amenable to computer algebra. We prove an old…
Recursive blocked algorithms have proven to be highly efficient at the numerical solution of the Sylvester matrix equation and its generalizations. In this work, we show that these algorithms extend in a seamless fashion to…
Quantum algorithms have been widely studied in the context of combinatorial optimization problems. While this endeavor can often analytically and practically achieve quadratic speedups, theoretical and numeric studies remain limited,…
A quantum system at equilibrium is represented by a corresponding classical system, chosen to reproduce the thermodynamic and structural properties. The objective is to develop a means for exploiting strong coupling classical methods (e.g.,…
Determining the relationship between composite systems and their subsystems is a fundamental problem in quantum physics. In this paper we consider the spectra of a bipartite quantum state and its two marginal states. To each spectrum we can…
These notes present an introduction to an analytic version of deformation quantization. The central point is to study algebras of physical observables and their irreducible representations. In classical mechanics one deals with real Poisson…
The classical simulation of quantum systems typically requires exponential resources. Recently, the introduction of a machine learning-based wavefunction ansatz has led to the ability to solve the quantum many-body problem in regimes that…
Krentel [J. Comput. System. Sci., 36, pp.490--509] presented a framework for an NP optimization problem that searches an optimal value among exponentially-many outcomes of polynomial-time computations. This paper expands his framework to a…