Local Hamiltonian Problem with succinct ground state is MA-Complete

• URL: http://arxiv.org/abs/2309.10155v2
• Date: Mon, 19 Feb 2024 04:56:48 GMT
• Title: Local Hamiltonian Problem with succinct ground state is MA-Complete
• Authors: Jiaqing Jiang
• Abstract summary: Finding the ground energy of a quantum system is a fundamental problem in condensed matter physics and quantum chemistry. Existing classical algorithms for tackling this problem often assume that the ground state has a succinct classical description. We study the complexity of the local Hamiltonian problem with succinct ground state and prove it is MA-Complete.
• Score: 0.788657961743755
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Finding the ground energy of a quantum system is a fundamental problem in condensed matter physics and quantum chemistry. Existing classical algorithms for tackling this problem often assume that the ground state has a succinct classical description, i.e. a poly-size classical circuit for computing the amplitude. Notable examples of succinct states encompass matrix product states, contractible projected entangled pair states, and states that can be represented by classical neural networks. We study the complexity of the local Hamiltonian problem with succinct ground state. We prove this problem is MA-Complete. The Hamiltonian we consider is general and might not be stoquastic. The MA verification protocol is based on the fixed node quantum Monte Carlo method, particularly the variant of the continuous-time Markov chain introduced by Bravyi et.al. [BCGL22]. Based on our work, we also introduce a notion of strong guided states, and conjecture that the local Hamiltonian problem with strong guided state is MA-Complete, which will be in contrast with the QCMA-Complete result of the local Hamiltonian problem with standard guided states [WFC23,GLG22].

Related papers

• On the hardness of learning ground state entanglement of geometrically local Hamiltonians [2.6034750171634107]
  Characterizing the entanglement structure of ground states of local Hamiltonians is a fundamental problem in quantum information. In particular we show this problem is roughly factoring-hard in 1D, and LWE-hard in 2D. Our work suggests that the problem of learning so-called "gapless" phases of matter might be intractable.
  arXiv  Detail & Related papers  (2024-11-07T01:16:15Z)
• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• Complexity of geometrically local stoquastic Hamiltonians [1.474723404975345]
  The QMA-completeness of the local Hamiltonian problem is a landmark result of the field of Hamiltonian complexity. We show that both the two- and one-dimensional geometrically local analogues remain MA-hard with high enough qudit dimension.
  arXiv  Detail & Related papers  (2024-07-22T09:27:25Z)
• Guidable Local Hamiltonian Problems with Implications to Heuristic Ansätze State Preparation and the Quantum PCP Conjecture [0.0]
  We study 'Merlinized' versions of the recently defined Guided Local Hamiltonian problem. These problems do not have a guiding state provided as a part of the input, but merely come with the promise that one exists. We show that guidable local Hamiltonian problems for both classes of guiding states are $mathsfQCMA$-complete in the inverse-polynomial precision setting.
  arXiv  Detail & Related papers  (2023-02-22T19:00:00Z)
• Sparse random Hamiltonians are quantumly easy [105.6788971265845]
  A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state. Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
  arXiv  Detail & Related papers  (2023-02-07T10:57:36Z)
• Theory of Quantum Generative Learning Models with Maximum Mean Discrepancy [67.02951777522547]
  We study learnability of quantum circuit Born machines (QCBMs) and quantum generative adversarial networks (QGANs) We first analyze the generalization ability of QCBMs and identify their superiorities when the quantum devices can directly access the target distribution. Next, we prove how the generalization error bound of QGANs depends on the employed Ansatz, the number of qudits, and input states.
  arXiv  Detail & Related papers  (2022-05-10T08:05:59Z)
• Average-case Speedup for Product Formulas [69.68937033275746]
  Product formulas, or Trotterization, are the oldest and still remain an appealing method to simulate quantum systems. We prove that the Trotter error exhibits a qualitatively better scaling for the vast majority of input states. Our results open doors to the study of quantum algorithms in the average case.
  arXiv  Detail & Related papers  (2021-11-09T18:49:48Z)
• Stoquasticity in circuit QED [78.980148137396]
  We show that scalable sign-problem free path integral Monte Carlo simulations can typically be performed for such systems. We corroborate the recent finding that an effective, non-stoquastic qubit Hamiltonian can emerge in a system of capacitively coupled flux qubits.
  arXiv  Detail & Related papers  (2020-11-02T16:41:28Z)
• Quantum-optimal-control-inspired ansatz for variational quantum algorithms [105.54048699217668]
  A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form. Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries. This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
  arXiv  Detail & Related papers  (2020-08-03T18:00:05Z)
• Excited state search using quantum annealing [0.0]
  We propose the QA scheme to search arbitrary excited states of the problem Hamiltonian. In our scheme, an $n$-th excited state of the trivial Hamiltonian is initially prepared and is adiabatically changed into an $n$-th excited state of the target Hamiltonian.
  arXiv  Detail & Related papers  (2020-02-28T09:44:18Z)
• Pinned QMA: The power of fixing a few qubits in proofs [0.6299766708197883]
  We show that pinning a single qubit via often repeated measurements results in universal quantum computation already with commuting and stoquastic Hamiltonians. We hence identify a comprehensive picture of the computational power of pinning, reminiscent of the power of the one clean qubit model.
  arXiv  Detail & Related papers  (2020-01-10T19:20:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.