English
Related papers

Related papers: The Complexity of the Separable Hamiltonian Proble…

200 papers

Previously, all known variants of the Quantum Satisfiability (QSAT) problem, i.e. deciding whether a $k$-local ($k$-body) Hamiltonian is frustration-free, could be classified as being either in $\mathsf{P}$; or complete for $\mathsf{NP}$,…

Quantum Physics · Physics 2025-06-10 Ricardo Rivera Cardoso , Alex Meiburg , Daniel Nagaj

It is known that three fundamental questions regarding local Hamiltonians -- approximating the ground state energy (the Local Hamiltonian problem), simulating local measurements on the ground space (APX-SIM), and deciding if the low energy…

Quantum Physics · Physics 2024-09-02 James D. Watson , Johannes Bausch , Sevag Gharibian

In this work, we study a variant of the local Hamiltonian problem where we restrict to Hamiltonians that live on a lattice and are invariant under translations and rotations of the lattice. In the one-dimensional case this problem is known…

Quantum Physics · Physics 2025-09-03 Jon Nelson , Daniel Gottesman

In this note we present two natural restrictions of the local Hamiltonian problem which are BQP-complete under Karp reduction. Restrictions complete for QCMA, QMA_1, and MA were demonstrated previously.

Quantum Physics · Physics 2007-12-28 Peter C. Richter

We show that the NP complete problems MAX CUT and INDEPENDENT SET can be formulated as the 2-local Hamiltonian problem as defined by Kitaev. He introduced the quantum complexity class BQNP as the quantum analog of NP, and showed that the…

Quantum Physics · Physics 2007-05-23 Pawel Wocjan , Thomas Beth

In this work we consider the ground space connectivity problem for commuting local Hamiltonians. The ground space connectivity problem asks whether it is possible to go from one (efficiently preparable) state to another by applying a…

Computational Complexity · Computer Science 2017-07-17 David Gosset , Jenish C. Mehta , Thomas Vidick

There are two fundamental problems studied by the theory of hamiltonian integrable systems: integration of equations of motion, and construction of action-angle variables. The third problem, however, should be added to the list: separation…

High Energy Physics - Theory · Physics 2009-10-22 E. K. Sklyanin

A quantum constraint problem is a frustration-free Hamiltonian problem: given a collection of local operators, is there a state that is in the ground state of each operator simultaneously? It has previously been shown that these problems…

Quantum Physics · Physics 2021-07-22 Alex Meiburg

Recently it was shown that the so-called guided local Hamiltonian problem -- estimating the smallest eigenvalue of a $k$-local Hamiltonian when provided with a description of a quantum state ('guiding state') that is guaranteed to have…

Quantum Physics · Physics 2024-02-08 Chris Cade , Marten Folkertsma , Jordi Weggemans

We present a new perturbation theory for quantum mechanical energy eigenstates when the potential equals the sum of two localized, but not necessarily weak potentials $V_{1}(\vec{r})$ and $V_{2}(\vec{r})$, with the distance $L$ between the…

Quantum Physics · Physics 2007-05-23 Seok Kim , Choonkyu Lee

Quantum chemistry has been viewed as one of the potential early applications of quantum computing. Two techniques have been proposed for electronic structure calculations: (i) the variational quantum eigensolver and (ii) the…

Quantum Physics · Physics 2021-04-19 Christina Daniel , Diksha Dhawan , Dominika Zgid , James K. Freericks

We examine the problem of determining whether a multi-qubit two-local Hamiltonian can be made stoquastic by single-qubit unitary transformations. We prove that when such a Hamiltonian contains one-local terms, then this task can be NP-hard.…

Quantum Physics · Physics 2020-04-07 Joel Klassen , Milad Marvian , Stephen Piddock , Marios Ioannou , Itay Hen , Barbara Terhal

All Hamiltonian complexity results to date have been proven by constructing a local Hamiltonian whose ground state -- or at least some low-energy state -- is a "computational history state", encoding a quantum computation as a superposition…

Quantum Physics · Physics 2018-10-16 Carlos E. González-Guillén , Toby S. Cubitt

We study the complexity of QMA proof systems with inverse exponentially small promise gap. We show that this class can be exactly characterized by PSPACE, the class of problems solvable with a polynomial amount of memory. As applications we…

Quantum Physics · Physics 2016-01-11 Bill Fefferman , Cedric Lin

The study of ground state energies of local Hamiltonians has played a fundamental role in quantum complexity theory. In this paper, we take a new direction by introducing the physically motivated notion of "ground state connectivity" of…

Quantum Physics · Physics 2019-01-08 Sevag Gharibian , Jamie Sikora

A Hamiltonian is said to be quasi-exactly solvable (QES) if some of the energy levels and the corresponding eigenfunctions can be calculated exactly and in closed form. An entirely new class of QES Hamiltonians having sextic polynomial…

Quantum Physics · Physics 2009-11-11 Carl M. Bender , Maria Monou

A broad range of quantum optimisation problems can be phrased as the question whether a specific system has a ground state at zero energy, i.e.\ whether its Hamiltonian is frustration free. Frustration-free Hamiltonians, in turn, play a…

Quantum Physics · Physics 2016-07-12 Or Sattath , Siddhardh C. Morampudi , Christopher R. Laumann , Roderich Moessner

Given a Hamiltonian that is a sum of commuting few-body terms, the commuting Hamiltonian problem is to determine if there exists a quantum state that is the simultaneous eigenstate of all of these terms that minimizes each term…

Quantum Physics · Physics 2012-03-20 Jijiang Yan , Dave Bacon

Clarifying the relation between the whole and its parts is crucial for many problems in science. In quantum mechanics, this question manifests itself in the quantum marginal problem, which asks whether there is a global pure quantum state…

Quantum Physics · Physics 2021-02-18 Xiao-Dong Yu , Timo Simnacher , Nikolai Wyderka , H. Chau Nguyen , Otfried Gühne

We introduce the quantum complexity class FQMA. This class describes the complexity of generating a quantum state that serves as a witness for a given QMA problem. In a certain sense, FQMA is the quantum analogue of FNP (function problems…

Quantum Physics · Physics 2007-05-23 Dominik Janzing , Pawel Wocjan , Thomas Beth