Improved Hardness Results for the Guided Local Hamiltonian Problem

@article{Gharibian2022ImprovedHR,
  title={Improved Hardness Results for the Guided Local Hamiltonian Problem},
  author={Sevag Gharibian and Ryunosuke Hayakawa and Franccois Le Gall and Tomoyuki Morimae},
  journal={ArXiv},
  year={2022},
  volume={abs/2207.10250}
}
Estimating the ground state energy of a local Hamiltonian is a central problem in quantum chemistry. In order to further investigate its complexity and the potential of quantum algorithms for quantum chemistry, Gharibian and Le Gall (STOC 2022) recently introduced the guided local Hamiltonian problem (GLH) , which is a variant of the local Hamiltonian problem where an approximation of a ground state (which is called a guiding state) is given as an additional input. Gharibian and Le Gall showed… 

Complexity of the Guided Local Hamiltonian Problem: Improved Parameters and Extension to Excited States

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

Parameterized Complexity of Weighted Local Hamiltonian Problems and the Quantum Exponential Time Hypothesis

We study a parameterized version of the local Hamiltonian problem, called the weighted local Hamiltonian problem, where the relevant quantum states are superpositions of computational basis states of

Spectral estimation for Hamiltonians: a comparison between classical imaginary-time evolution and quantum real-time evolution

We consider the task of spectral estimation of local quantum Hamiltonians. The spectral estimation is performed by estimating the oscillation frequencies or decay rates of signals representing the

References

SHOWING 1-10 OF 51 REFERENCES

Complexity of the Guided Local Hamiltonian Problem: Improved Parameters and Extension to Excited States

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

Near-optimal ground state preparation

A hybrid quantum-classical algorithm to estimate the ground energy, where the dependence of the number of queries to the initial state on the desired precision is exponentially improved compared to the current state-of-the-art algorithm proposed in [Ge et al. 2019].

Complexity Classification of Local Hamiltonian Problems

This work characterises the complexity of the k-local Hamiltonian problem for all 2-local qubit Hamiltonians and proves for the first time QMA-completeness of the Heisenberg and XY interactions in this setting.

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.

On Complexity of the Quantum Ising Model

We study complexity of several problems related to the Transverse field Ising Model (TIM). First, we consider the problem of estimating the ground state energy known as the Local Hamiltonian Problem

Strongly Universal Hamiltonian Simulators

A universal family of Hamiltonians can be used to simulate any local Hamiltonian by encoding its full spectrum as the low-energy subspace of a Hamiltonian from the family. Many spin-lattice model

Hardness of approximation for quantum problems

A quantum generalization of the polynomial hierarchy is defined, and it is shown that not only are there natural complete problems for the second level of this quantum hierarchy, but that these problems are in fact hard to approximate.

The complexity of antiferromagnetic interactions and 2D lattices

This work studies the natural special case of the Local Hamiltonian problem where the same 2-local interaction is applied across each pair of qubits, and proves StoqMA-completeness of the antiferromagnetic transverse field Ising model.

Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture

The hardness of classically simulating the QSVT is investigated, and it is proved that with inverse-polynomial precision, the same problem becomes BQP-complete.

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
...