Related papers: The Complexity of Stoquastic Sparse Hamiltonians
Random constraint satisfaction problems can exhibit a phase where the number of constraints per variable $\alpha$ makes the system solvable in theory on the one hand, but also makes the search for a solution hard, meaning that common…
In this paper, we show that the concept of sigma-convergence associated to stochastic processes can tackle the homogenization of stochastic partial differential equations. In this regard, the homogenization problem for a stochastic…
It has been shown by Kitaev that the 5-local Hamiltonian problem is QMA-complete. Here we reduce the locality of the problem by showing that 3-local Hamiltonian is already QMA-complete.
A broad range of quantum optimisation problems can be phrased as the question whether a specific system has a ground state at zero energy, i.e.\ whether its Hamiltonian is frustration free. Frustration-free Hamiltonians, in turn, play a…
We study the entanglement Hamiltonian for finite intervals in infinite quantum chains for two different free-particle systems: coupled harmonic oscillators and fermionic hopping models with dimerization. Working in the ground state, the…
In [ABM07], Abdulla et al. introduced the concept of decisiveness, an interesting tool for lifting good properties of finite Markov chains to denumerable ones. Later, this concept was extended to more general stochastic transition systems…
Given two finite abstract simplicial complexes A and B, one can define a new simplicial complex on the set of simplicial maps from A to B. After adding two technicalities, we call this complex Homsc(A, B). We prove the following dichotomy:…
As a model problem for the study of chaotic Hamiltonian systems, we look for the effects of a long-tail distribution of recurrence times on a fixed Hamiltonian dynamics. We follow Stanislavsky's approach of Hamiltonian formalism for…
Sparse linear regression is a central problem in high-dimensional statistics. We study the correlated random design setting, where the covariates are drawn from a multivariate Gaussian $N(0,\Sigma)$, and we seek an estimator with small…
The quantum k-Local Hamiltonian problem is a natural generalization of classical constraint satisfaction problems (k-CSP) and is complete for QMA, a quantum analog of NP. Although the complexity of k-Local Hamiltonian problems has been well…
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…
Sparse inversion and classification problems are ubiquitous in modern data science and imaging. They are often formulated as non-smooth minimisation problems. In sparse inversion, we minimise, e.g., the sum of a data fidelity term and an…
Characterizing time-periodic Hamiltonians is pivotal for validating and controlling driven quantum platforms, yet prevailing and unadjusted reconstruction methods demand dense time-domain sampling and heavy post-processing. We introduce a…
We formulate a systematic algorithm for constructing a whole class of Hermitian position-dependent-mass Hamiltonians which, to lowest order of perturbation theory, allow a description in terms of PT-symmetric Hamiltonians. The method is…
Previously, all known variants of the Quantum Satisfiability (QSAT) problem, i.e. deciding whether a $k$-local ($k$-body) Hamiltonian is frustration-free, could be classified as being either in $\mathsf{P}$; or complete for $\mathsf{NP}$,…
We study a class of Hamilton-Jacobi partial differential equations in the space of probability measures. In the first part of this paper, we prove comparison principles (implying uniqueness) for this class. In the second part, we establish…
We study the qualitative homogenization of second order viscous Hamilton-Jacobi equations in space-time stationary ergodic random environments. Assuming that the Hamiltonian is convex and superquadratic in the momentum variable (gradient)…
In recent years, many difficulties appeared when taking into account the inherent stochastic behavior of neurons and voltage-dependent ion channels in Hodgking-Huxley type models. In particular, an open problem for a stochastic model of…
We present an algorithm for sparse Hamiltonian simulation whose complexity is optimal (up to log factors) as a function of all parameters of interest. Previous algorithms had optimal or near-optimal scaling in some parameters at the cost of…
In this work we introduce a theory of stochastic integration with respect to general cylindrical semimartingales defined on a locally convex space $\Phi$. Our construction of the stochastic integral is based on the theory of tensor products…