Related papers: Hermitian Matrix Definiteness from Quantum Phase E…
The matrix completion problem aims to reconstruct a low-rank matrix based on a revealed set of possibly noisy entries. Prior works consider completing the entire matrix with generalization error guarantees. However, the completion accuracy…
This study considers quadrature-based algorithms to compute $A^\alpha \boldsymbol{b}$, the action of a real power of a Hermitian positive-definite matrix $A$ on a vector $ \boldsymbol{b}$. In these algorithms, the computation of an integral…
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…
Quantum phase estimation is a central primitive in quantum algorithms and sensing, where performance is governed by the sensitivity of measurement signals to the target parameter. While existing methods have developed increasingly…
The logarithm-determinant is an widely-present operation in many areas of physics and computer science. Derivatives of the logarithm-determinant compute physically relevant quantities in statistical physics models, quantum field theories,…
It is well known that the unitary evolution of a closed $M-$level quantum system can be generated by a non-Hermitian Hamiltonian $H$ with real spectrum. Its Hermiticity can be restored via an amended inner-product metric $\Theta$. In…
We classify automorphisms on quantum chains, allowing both spin and fermionic degrees of freedom, that are moreover equivariant with respect to a local symmetry action of a finite symmetry group $G$. The classification is up to equivalence…
In the fermion loop formulation the contributions to the partition function naturally separate into topological equivalence classes with a definite sign. This separation forms the basis for an efficient fermion simulation algorithm using a…
Implementing polynomial functions of Hermitian matrices on quantum hardware is a foundational task in quantum computing, critical for accurate Hamiltonian simulation, quantum linear system solving, high-fidelity state preparation, machine…
Modeling low energy eigenstates of fermionic systems can provide insight into chemical reactions and material properties and is one of the most anticipated applications of quantum computing. We present three techniques for reducing the cost…
We consider the problem of classification of points sampled from an unknown probability measure on a Euclidean space. We study the question of querying the class label at a very small number of judiciously chosen points so as to be able to…
Non-hermitian quantum graphs possessing real (i.e., in principle, observable) spectra are studied via their discretization. The discretized Hamiltonians are assigned, constructively, an elementary pseudometric and/or a more complicated…
Gradient-based solvers risk convergence to local optima, leading to incorrect researcher inference. Heuristic-based algorithms are able to ``break free" of these local optima to eventually converge to the true global optimum. However, given…
We represent low dimensional quantum mechanical Hamiltonians by moderately sized finite matrices that reproduce the lowest O(10) boundstate energies and wave functions to machine precision. The method extends also to Hamiltonians that are…
We propose a numerical method, based on the shift-and-invert power iteration, that answers whether a symmetric matrix is positive definite ("yes") or not ("no"). Our method uses randomization. But, it returns the correct answer with high…
We devise a method that reduces the problem of classifying systems of forms and linear mappings to the problem of classifying systems of linear mappings. Canonical matrices of (i) bilinear or sesquilinear forms, (ii) pairs of symmetric,…
This paper is concerned with the phase estimation algorithm in quantum computing algorithms, especially the scenarios where (1) the input vector is not an eigenvector; (2) the unitary operator is not exactly implemented; (3) random…
Given a collection $\{\lambda_1, \dots, \lambda_n\} $ of real numbers, there is a canonical probability distribution on the set of real symmetric or complex Hermitian matrices with eigenvalues $\lambda_1,\ldots,\lambda_n$. In this paper, we…
We introduce $\hat{H}$-eigenvalue for $2m$-th order $n$-dimensional complex tensors. Then we determine several checkable inclusion sets for $\hat{H}$-eigenvalues and derive some criterions for the Hermitian positive definiteness…
In the context of the factorization method, we investigate the pseudo- Hermitian coherent states and its Hermitian counterpart coherent states under the generalized quantum condition in the framework of a position-dependent mass. By…