Related papers: The Computational Complexity of Quantum Determinan…
A useful finite-dimensional matrix representation of the derivative of periodic functions is obtained by using some elementary facts of trigonometric interpolation. This NxN matrix becomes a projection of the angular derivative into…
This article surveys quantum computational complexity, with a focus on three fundamental notions: polynomial-time quantum computations, the efficient verification of quantum proofs, and quantum interactive proof systems. Properties of…
We define formally decohered quantum computers (using density matrices), and present a simulation of them by a probabalistic classical Turing Machine. We study the slowdown of the simulation for two cases: (1) sequential quantum computers,…
Computational models typically assume that operations are applied in a fixed sequential order. In recent years several works have looked at relaxing this assumption, considering computations without any fixed causal structure and showing…
As a particular one parameter deformation of the quantum determinant, we introduce a quantum $\alpha$-determinant and study the $\mathcal{U}_q(\mathfrak{gl}_n)$-cyclic module generated by it: We show that the multiplicity of each…
Several kinds of q-orthogonal polynomials with |q|=1 are constructed as the main parts of the eigenfunctions of new solvable discrete quantum mechanical systems. Their orthogonality weight functions consist of quantum dilogarithm functions,…
Principal component analysis is an important dimension reduction technique in machine learning. In [S. Lloyd, M. Mohseni and P. Rebentrost, Nature Physics 10, 631-633, (2014)], a quantum algorithm to implement principal component analysis…
A degree one element of the Orlik-Solomon algebra of a hyperplane arrangement defines a cochain complex known as the Aomoto complex. The Aomoto complex can be considerd as the ``linear approximation'' of the twisted cochain complex with…
We construct a quantum-inspired classical algorithm for computing the permanent of Hermitian positive semidefinite matrices, by exploiting a connection between these mathematical structures and the boson sampling model. Specifically, the…
We initiate a systematic study of pseudo-deterministic quantum algorithms. These are quantum algorithms that, for any input, output a canonical solution with high probability. Focusing on the query complexity model, our main contributions…
We study the computational complexity of certain integrable quantum theories in 1+1 dimensions. We formalize a model of quantum computation based on these theories. In this model, distinguishable particles start out with known momenta and…
We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…
We show that there exists a universal quantum Turing machine (UQTM) that can simulate every other QTM until the other QTM has halted and then halt itself with probability one. This extends work by Bernstein and Vazirani who have shown that…
Quantum computing is powerful because unitary operators describing the time-evolution of a quantum system have exponential size in terms of the number of qubits present in the system. We develop a new "Singular value transformation"…
We consider the algebra of N x N matrices as a reduced quantum plane on which a finite-dimensional quantum group H acts. This quantum group is a quotient of U_q(sl(2,C)), q being an N-th root of unity. Most of the time we shall take N=3; in…
A polynomial-time algorithm for computing the permanent in any field of characteristic 3 is presented in this article. The principal objects utilized for that purpose are the Cauchy and Vandermonde matrices, the discriminant function and…
We unconditionally prove that it is NP-hard to compute a constant multiplicative approximation to the QUANTUM MAX-CUT problem on an unweighted graph of constant bounded degree. The proof works in two stages: first we demonstrate a generic…
The dynamical structure factor is one of the experimental quantities crucial in scrutinizing the validity of the microscopic description of strongly correlated systems. However, despite its long-standing importance, it is exceedingly…
In this paper, we introduce an $N\times N$ matrix $\epsilon^{a\bar{b}}$ in the quantum groups $SU_{q}(N)$ to transform the conjugate representation into the standard form so that we are able to compute the explicit forms of the important…
Quantum computing is usually associated with discrete quantum states and physical quantities possessing discrete eigenvalue spectrum. However, quantum computing in general is any computation accomplished by the exploitation of quantum…