• Corpus ID: 117200662

The Local Consistency Problem for Stoquastic and 1-D Quantum Systems

  title={The Local Consistency Problem for Stoquastic and 1-D Quantum Systems},
  author={Yi-Kai Liu},
  journal={arXiv: Quantum Physics},
  • Yi-Kai Liu
  • Published 10 December 2007
  • Physics
  • arXiv: Quantum Physics
The Local Hamiltonian problem (finding the ground state energy of a quantum system) is known to be QMA-complete. The Local Consistency problem (deciding whether descriptions of small pieces of a quantum system are consistent) is also known to be QMA-complete. Here we consider special cases of Local Hamiltonian, for ``stoquastic'' and 1-dimensional systems, that seem to be strictly easier than QMA. We show that there exist analogous special cases of Local Consistency, that have equivalent… 

Quantum-Merlin-Arthur-complete problems for stoquastic Hamiltonians and Markov matrices

We show that finding the lowest eigenvalue of a 3-local symmetric stochastic matrix is Quantum-Merlin-Arthur-complete (QMA-complete). We also show that finding the highest energy of a stoquastic

Approximation, Proof Systems, and Correlations in a Quantum World

A polynomial-time (classical) approximation algorithm for dense instances of the canonical QMA-complete quantum constraint satisfaction problem, the local Hamiltonian problem, and two novel schemes for quantifying non-classicality are proposed.

Local Hamiltonians in quantum computation

In this thesis, I investigate aspects of local Hamiltonians in quantum computing. First, I focus on the Adiabatic Quantum Computing model, based on evolution with a time dependent Hamiltonian. I show

Complexity of Stoquastic Frustration-Free Hamiltonians

The Cook-Levin theorem proving NP-completeness of the satisfiability problem is generalized to the complexity class MA (Merlin-Arthur games)—a probabilistic analogue of NP.

Monte Carlo simulation of stoquastic Hamiltonians

A formalized version of this problem called Guided Stoquastic Hamiltonian is shown to be complete for the complexity class MA (a probabilistic analogue of NP) and the ground state and thermal equilibrium properties of the ferromagnetic TIM can be simulated in polynomial time on a classical Probabilistic computer.

Institute for Quantum Information Quantum Algorithms and Quantum Complexity

The primary goal of the Institute for Quantum Information is to carry out and facilitate research in quantum information science, which covers five broad areas: quantum algorithms that achieve speedups relative to classical algorithms, and limits on such algorithms.

Hamiltonian complexity

  • T. Osborne
  • Physics
    Reports on progress in physics. Physical Society
  • 2012
The foundational results, guiding problems, and future directions of this emergent field known as Hamiltonian complexity are reviewed.



The Complexity of the Local Hamiltonian Problem

This paper settles the question and shows that the 2-LOCAL HAMILTONIAN problem is QMA-complete, and demonstrates that adiabatic computation with two-local interactions on qubits is equivalent to standard quantum computation.

The complexity of quantum spin systems on a two-dimensional square lattice

It is obtained that quantum adiabatic computation using 2-local interactions restricted to a 2-D square lattice is equivalent to the circuitmodel of quantum computation.

Quantum-Merlin-Arthur-complete translationally invariant Hamiltonian problem and the complexity of finding ground-state energies in physical systems

Here we present a problem related to the local Hamiltonian problem (identifying whether the ground-state energy falls within one of two ranges) which is restricted to being translationally invariant.

The Complexity of Quantum Systems on a One-dimensional Chain

We prove that adiabatic computation is equivalent to standard quantum computation even when the adiabatic quantum system is restricted to be a set of particles on a one-dimensional chain. We give a

The complexity of the consistency and N-representability problems for quantum states - eScholarship

Quantum mechanics has important consequences for machines that store and manipulate information. In particular, quantum computers might be more powerful than classical computers; examples of this

The complexity of stoquastic local Hamiltonian problems

It is proved that LH-MIN for stoquastic Hamiltonians belongs to the complexity class AM -- a probabilistic version of NP with two rounds of communication between the prover and the verifier, and that any problem solved by adiabatic quantum computation using stoquian Hamiltonians is in PostBPP.

Quantum Computation by Adiabatic Evolution

We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that

The Power of Quantum Systems on a Line

The proof of the QMA-completeness result requires an additional idea beyond the usual techniques in the area: Some illegal configurations cannot be ruled out by local checks, and are instead ruled out because they would, in the future, evolve into a state which can be seen locally to be illegal.

Consistency of Local Density Matrices Is QMA-Complete

It is shown that deciding the consistency of local density matrices is QMA-complete (where QMA is the quantum analogue of NP), which gives an interesting example of a hard problem in QMA.

Realizable Hamiltonians for Universal Adiabatic Quantum Computers

It has been established that local lattice spin Hamiltonians can be used for universal adiabatic quantum computation. However, the two-local model Hamiltonians used in these proofs are general and