Related papers: The Complexity of the Separable Hamiltonian Proble…
The relation between certain Hamiltonians, known as dual, or partner Hamiltonians, under the transformation $x{\rightarrow}\bar{x}^{\bar{\alpha}}$ has long been used as a method of simplifying spectral problems in quantum mechanics. This…
It has been shown by Kitaev that the 5-local Hamiltonian problem is QMA-complete. Here we reduce the locality of the problem by showing that 3-local Hamiltonian is already QMA-complete.
For quantum systems with competing potentials, the conventional perturbation theory often yields an asymptotic series and the subsequent numerical outcome becomes uncertain. To tackle such kind of problems, we develop a general solution…
The problem 2-LOCAL HAMILTONIAN has been shown to be complete for the quantum computational class QMA, see quant-ph/0406180. In this paper we show that this important problem remains QMA-complete when the interactions of the 2-local…
The local Hamiltonian problem consists of estimating the ground-state energy (given by the minimum eigenvalue) of a local quantum Hamiltonian. First, we show the existence of a good product-state approximation for the ground-state energy of…
We study 'Merlinized' versions of the recently defined Guided Local Hamiltonian problem, which we call 'Guidable Local Hamiltonian' problems. Unlike their guided counterparts, these problems do not have a guiding state provided as a part of…
The problem of finding superintegrable Hamiltonians and their integrals of motion can be reduced to solving a series of compatibility equations that result from the overdetermination of the commutator or Poisson bracket relations. The…
We study the complexity of the Local Hamiltonian Problem (denoted as LH-MIN) in the special case when a Hamiltonian obeys conditions of the Perron-Frobenius theorem: all off-diagonal matrix elements in the standard basis are real and…
We show that finding the lowest eigenvalue of a 3-local symmetric stochastic matrix is QMA-complete. We also show that finding the highest energy of a stoquastic Hamiltonian is QMA-complete and that adiabatic quantum computation using…
We present a new way of encoding a quantum computation into a 3-local Hamiltonian. Our construction is novel in that it does not include any terms that induce legal-illegal clock transitions. Therefore, the weights of the terms in the…
In this manuscript, we deal with a class of fractional non-local problems involving a singular term and vanishing potential of the form: \begin{eqnarray*} \begin{gathered} \left\{\begin{array}{llll} \mathcal{L}^{s_{1}, s_{2}}_{p(\mathrm{x},…
A frustration-free local Hamiltonian has the property that its ground state minimises the energy of all local terms simultaneously. In general, even deciding whether a Hamiltonian is frustration-free is a hard task, as it is closely related…
We study the computational complexity of 2-local Hamiltonian problems generated by a positive-weight symmetric interaction term, encompassing many canonical problems in statistical mechanics and optimization. We show these problems belong…
There are few exactly solvable potentials in quantum mechanics for which the completeness relation of the energy eigenstates can be explicitly verified. In this article, we give an elementary proof that the set of bound (discrete) states…
Quantum state discrimination is one of the most fundamental problems studied in quantum information theory. Applications range from channel coding to metrology and cryptography. In this work, we introduce a new variant of this task: Local…
By application of a straightforward variational procedure we derive a simple, analytic upper bound on the ground-state energy eigenvalue of a semirelativistic Hamiltonian for (one or two) spinless particles which experience some…
We study several problems related to properties of non-negative matrices that arise at the boundary between quantum and classical probabilistic computation. Our results are twofold. First, we identify a large class of quantum Hamiltonians…
We study the problem of Hamiltonian sparsification: given a parameter $\varepsilon \in (0,1)$ and an $n$-qubit Hamiltonian $H$ which is the sum of $r$-local positive semi-definite (PSD) terms $H_1, \dots H_m$, our goal is to compute a…
We study the local indistinguishability problem of quantum states. By introducing an easily calculated quantity, non-commutativity, we present an criterion which is both necessary and sufficient for the local indistinguishability of a…
We show the 2-Local Stoquastic Hamiltonian problem on a 2D square qubit lattice is StoqMA-complete. We achieve this by extending the spatially sparse circuit construction of Oliveira and Terhal, as well as the perturbative gadgets of…