Related papers: Computing the Degenerate Ground Space of Gapped Sp…
Resolving degenerate quantum eigenspaces - including topologically ordered ground states and frustrated magnets - requires preparing high-fidelity states that span every direction of the target manifold. Existing variational and projective…
I suggest and examine artificial material which has exponentially degenerate vacuum state. The corresponding Hamiltonian contains only exotic four-spin interaction term. Each vacuum state is realized as a particular spin configuration…
The DMRG method is very effective at finding ground states of 1D quantum systems in practice, but it is a heuristic method, and there is no known proof for when it works. In this paper we describe an efficient classical algorithm which…
Using the matrix product formalism, we define a multi-parameter family of spin models on one dimensional chains, with nearest and next-nearest neighbor anti-ferromagnetic interaction for which exact analytical expressions can be found for…
We obtain the first polynomial-time algorithm for exact tensor completion that improves over the bound implied by reduction to matrix completion. The algorithm recovers an unknown 3-tensor with $r$ incoherent, orthogonal components in…
We consider the nonlinear integer programming problem of minimizing a quadratic function over the integer points in variable dimension satisfying a system of linear inequalities. We show that when the Graver basis of the matrix defining the…
Let V be a smooth equidimensional quasi-affine variety of dimension r over the complex numbers $C$ and let $F$ be a $(p\times s)$-matrix of coordinate functions of $C[V]$, where $s\ge p+r$. The pair $(V,F)$ determines a vector bundle $E$ of…
The Jordan--Wigner transformation plays an important role in spin models. However, the non-locality of the transformation implies that a periodic chain of $N$ spins is not mapped to a periodic or an anti-periodic chain of lattice fermions.…
Sampling all ground states of a Hamiltonian with equal probability is a desired feature of a sampling algorithm, but recent studies indicate that common variants of transverse field quantum annealing sample the ground state subspace…
We study the performance of the D-Wave 2X quantum annealing machine on systems with well-controlled ground-state degeneracy. While obtaining the ground state of a spin-glass benchmark instance represents a difficult task, the gold standard…
In this paper, we present a sharp analysis for a class of alternating projected gradient descent algorithms which are used to solve the covariate adjusted precision matrix estimation problem in the high-dimensional setting. We demonstrate…
In recent years, several algorithms, which approximate matrix decomposition, have been developed. These algorithms are based on metric conservation features for linear spaces of random projection types. We show that an i.i.d sub-Gaussian…
We prove the existence of gapped quantum Hamiltonians whose ground states exhibit an infinite entanglement length, as opposed to their finite correlation length. Using the concept of entanglement swapping, the localizable entanglement is…
In this paper we present the first deterministic polynomial time algorithm for determining the existence of a Hamiltonian cycle and finding a Hamiltonian cycle in general graphs. Our algorithm can also solve the Hamiltonian path problem in…
Dipolar interactions are crucial in the modeling of many complex magnetic systems, such as the pyrochlores and artificial spin systems. Remarkably, many classical dipolar coupled spin systems exhibit a continuous ground-state degeneracy,…
The "folding algorithm"\cite{fold1} is a matrix product state algorithm for simulating quantum systems that involves a spatial evolution of a matrix product state. Hence, the computational effort of this algorithm is controlled by the…
We design a sublinear-time approximation algorithm for quadratic function minimization problems with a better error bound than the previous algorithm by Hayashi and Yoshida (NIPS'16). Our approximation algorithm can be modified to handle…
We study the task of smoothing a circuit, i.e., ensuring that all children of a plus-gate mention the same variables. Circuits serve as the building blocks of state-of-the-art inference algorithms on discrete probabilistic graphical models…
Degeneracies in the energy spectra of physical systems are commonly considered to be either of accidental character or induced by symmetries of the Hamiltonian. We develop an approach to explain degeneracies by tracing them back to…
We study multi-hadron systems with a single heavy quark (charm or bottom) in the limit of heavy quark mass. The spin degeneracy of the states with quantum numbers $(j+1/2)^{P}$ and $(j-1/2)^{P}$ for $j \neq 0$, known in a normal hadron, can…