Related papers: 2-Local Hamiltonian with Low Complexity is QCMA

In this work we investigate the computational complexity of the pure consistency of local density matrices (PureCLDM) and pure N-representability (Pure-N-Representability; analog of PureCLDM for bosonic or fermionic systems) problems. In…

The entanglement Hamiltonian (EH) provides the most comprehensive characterization of bipartite entanglement in many-body quantum systems. Ground states of local Hamiltonians inherit this locality, resulting in EHs that are dominated by…

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…

We introduce two numerical conjugacy invariants for dynamical systems -- the complexity and weak complexity indices -- which are well-suited for the study of "completely integrable" Hamiltonian systems. These invariants can be seen as "slow…

A constituent parton picture of hadrons with logarithmic confinement naturally arises in weak coupling light-front QCD. Confinement provides a mass gap that allows the constituent picture to emerge. The effective renormalized Hamiltonian is…

We present some new persistence results for the non-periodic two-component Camassa-Holm (2CH) system in weighted $L_p$ spaces. Working with moderate weight functions that are commonly used in time-frequency analysis, the paper generalizes…

A general method based on the polynomial deformations of the Lie algebra sl(2,R) is proposed in order to exhibit the quasi-exactly solvability of specific Hamiltonians implied by quantum physical models. This method using the…

We prove that every finite, commutative automorphic loop is solvable. We also prove that every finite, automorphic 2-loop is solvable. The main idea of the proof is to associate a simple Lie algebra of characteristic 2 to a hypothetical…

We propose a Lax equation for the non-linear sigma model which leads directly to the conserved local charges of the system. We show that the system has two infinite sets of such conserved charges following from the Lax equation, much like…

Using geometrical approach exposed in arXiv:math/0304245 and arXiv:nlin/0511012, we explore the Camassa-Holm equation (both in its initial scalar form, and in the form of 2x2-system). We describe Hamiltonian and symplectic structures,…

We consider the problem of learning local quantum Hamiltonians given copies of their Gibbs state at a known inverse temperature, following Haah et al. [2108.04842] and Bakshi et al. [arXiv:2310.02243]. Our main technical contribution is a…

We study linear equations in combinatorial Laplacians of $k$-dimensional simplicial complexes ($k$-complexes), a natural generalization of graph Laplacians. Combinatorial Laplacians play a crucial role in homology and are a central tool in…

In this paper we explore the general conditions in order that a 2-dimensional natural Hamiltonian system possess a second invariant which is a polynomial in the momenta and is therefore Liouville integrable. We examine the possibility that…

Hamiltonian Monodromy is the simplest topological obstruction to the existence of global action-angle coordinates in a completely integrable system. We show that this property can be studied in a neighborhood of a focus-focus singularity by…

Quantum k-SAT (the problem of determining whether a k-local Hamiltonian is frustration-free) is known to be QMA_1-complete for k >= 3, and hence likely hard for quantum computers to solve. Building on a classical result of Alon and Shapira,…

After a brief survey of the definition and the properties of Lambda-symmetries in the general context of dynamical systems, the notion of "Lambda-constant of motion'' for Hamiltonian equations is introduced. If the Hamiltonian problem is…

Hamiltonian simulation is a central application of quantum computing, with significant potential in modeling physical systems and solving complex optimization problems. Existing compilers for such simulations typically focus on low-level…

We show that the Guided Local Hamiltonian problem for stoquastic Hamiltonians is (promise) BPP-hard. The Guided Local Hamiltonian problem extends the Local Hamiltonian problem by incorporating an additional input known as a guiding state,…

We prove a query complexity lower bound for $\mathsf{QMA}$ protocols that solve approximate counting: estimating the size of a set given a membership oracle. This gives rise to an oracle $A$ such that $\mathsf{SBP}^A \not\subset…

Local Hamiltonians with topological quantum order exhibit highly entangled ground states that cannot be prepared by shallow quantum circuits. Here, we show that this property may extend to all low-energy states in the presence of an on-site…