Related papers: The Complexity of Stoquastic Sparse Hamiltonians
The ground state energy and the free energy of Quantum Local Hamiltonians are fundamental quantities in quantum many-body physics, however, it is QMA-Hard to estimate them in general. In this paper, we develop new techniques to find…
A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. For this task, there is a well-studied quantum algorithm that performs quantum phase estimation on an initial trial state that…
We show that the two-dimensional (2D) local Hamiltonian problem with the constraint that the ground state obeys area laws is QMA-complete. We also prove similar results in 2D translation-invariant systems and for the 3D Heisenberg and…
The complexity of the commuting local Hamiltonians (CLH) problem still remains a mystery after two decades of research of quantum Hamiltonian complexity; it is only known to be contained in NP for few low parameters. Of particular interest…
In this paper we prove the first result of Nekhoroshev stability for steep Hamiltonians in H\"older class. Our new approach combines the classical theory of normal forms in analytic category with an improved smoothing procedure to…
We perturb with an additive Gaussian white noise the Hamiltonian system associated to a cubic anharmonic oscillator. The stochastic system is assumed to start from initial conditions that guarantee the existence of a periodic solution for…
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…
A stochastic dynamics framework for the study of complex systems is presented.
The stochastic scenario of relaxation in the complex systems is presented. It is based on a general probabilistic formalism of limit theorems. The nonexponential relaxation is shown to result from the asymptotic self-similar properties in…
We show how to find the physical Langevin equation describing the trajectories of particles undergoing collisionless stochastic acceleration. These stochastic differential equations retain not only one-, but two-particle statistics, and…
This paper investigates the cost of solving systems of sparse polynomial equations by homotopy continuation. First, a space of systems of $n$-variate polynomial equations is specified through $n$ monomial bases. The natural locus for the…
We prove existence and uniqueness of the solution of a stochastic shell--model. The equation is driven by an infinite dimensional fractional Brownian--motion with Hurst--parameter $H\in (1/2,1)$, and contains a non--trivial coefficient in…
Weighted automata over the nonnegative reals form a fundamental model for quantitative languages. We show that, up to scaling, this model collapses to probabilistic automata. Concretely, we prove that every weighted automaton whose…
We give a classical $1/(qk+1)$-approximation for the maximum eigenvalue of a $k$-sparse fermionic Hamiltonian with strictly $q$-local terms, as well as a $1/(4k+1)$-approximation when the Hamiltonian has both $2$-local and $4$-local terms.…
This paper presents a complete symplectic classification of $A_k$ Hamiltonians on $\mathbb R^2$, in the analytic and smooth categories. Precisely, consider the pair $(H, \omega)$ consisting of a Hamiltonian and a symplectic structure on…
We consider the specified stochastic homogenization of first order evolutive Hamilton-Jacobi equations on a very simple junction, i.e the real line with a junction at the origin. Far from the origin, we assume that the considered…
We study the well-posedness of an infinite-dimensional Hamilton-Jacobi equation posed on the set of non-negative measures and with a monotonic non-linearity. Our results will be used in a companion work to propose a conjecture and prove…
We study a stochastic Hamiltonian system of $N$ particles with many particles interacting through a potential whose range is large in comparison with the typical distance between neighbouring particles. It is shown that the empirical…
Models can be simple for different reasons: because they yield a simple and computationally efficient interpretation of a generic dataset (e.g. in terms of pairwise dependences) - as in statistical learning - or because they capture the…
QMA (Quantum Merlin-Arthur) is the quantum analogue of the class NP. There are a few QMA-complete problems, most notably the ``Local Hamiltonian'' problem introduced by Kitaev. In this dissertation we show some new QMA-complete problems.…