Related papers: A polynomial-time algorithm for ground states of s…
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 (LHP). It is shown that the LHP for TIM…
We design two variational algorithms to optimize specific 2-local Hamiltonians defined on graphs. Our algorithms are inspired by the Quantum Approximate Optimization Algorithm. We develop formulae to analyze the energy achieved by these…
We prove that the entanglement entropy of any state evolved under an arbitrary $1/r^{\alpha}$ long-range-interacting D-dimensional lattice spin Hamiltonian cannot change faster than a rate proportional to the boundary area for any…
Considering the worst-case scenario, junction tree algorithm remains the most general solution for exact MAP inference with polynomial run-time guarantees. Unfortunately, its main tractability assumption requires the treewidth of a…
A right [left] locally testable language S is a language with the property that for some non negative integer k two words u and v in alphabet S are equal in the semi group if (1) the prefix and suffix of the words of length k coincide, (2)…
Motivated by alignment of correlated sparse random graphs, we introduce a hypothesis testing problem of deciding whether or not two random trees are correlated. We obtain sufficient conditions under which this testing is impossible or…
We elaborate on the principle that for gapped quantum spin systems with local interaction "local perturbations [in the Hamiltonian] perturb locally [the ground state]". This principle was established in [Bachmann et al. 2012], relying on…
We study unfrustrated spin Hamiltonians that consist of commuting tensor products of Pauli matrices. Assuming translation-invariance, a family of Hamiltonians that belong to the same phase of matter is described by a map between modules…
Motivated by the study of area laws for the entanglement entropy of gapped ground states of quantum spin systems and their stability, we prove that the unitary cocycle generated by a local time-dependent Hamiltonian can be approximated, for…
We present an efficient algorithm to reduce the size of nondeterministic tree automata, while retaining their language. It is based on new transition pruning techniques, and quotienting of the state space w.r.t. suitable equivalences. It…
We study an effective Hamiltonian generating time evolution of states on intermediate time scales in the strong-coupling limit of the spin-1/2 XXZ model. To leading order, it describes an integrable model with local interactions. We solve…
We show that any short-range Hamiltonian with a gap between the ground and excited states can be written as a sum of local operators, such that the ground state is an approximate eigenvector of each operator separately. We then show that…
We consider random translation-invariant frustration-free quantum spin Hamiltonians on $\mathbb Z^D$ in which the nearest-neighbor interaction in every direction is randomly sampled and then distributed across the lattice. Our main result…
Known mappings that encode fermionic modes into a bosonic qubit system are non-local transformations. In this paper we establish that this must necessarily be the case, if the locality graph is complex enough (for example for regular 2$d$…
Tensor network states are for good reasons believed to capture ground states of gapped local Hamiltonians arising in the condensed matter context, states which are in turn expected to satisfy an entanglement area law. However, the…
We give a new proof of the Skeletal Lemma, which is the main technical tool in our paper on Hamilton cycles in line graphs [T. Kaiser and P. Vr\'ana, Hamilton cycles in 5-connected line graphs, European J. Combin. 33 (2012), 924-947]. It…
The problem 2-LOCAL HAMILTONIAN has been shown to be complete for the quantum computational class QMA, see quant-ph/0406180. In this paper we show that this important problem remains QMA-complete when the interactions of the 2-local…
Given a directed graph $G$ on $n$ vertices with a special vertex $s$, the directed minimum degree spanning tree problem requires computing a incoming spanning tree rooted at $s$ whose maximum tree in-degree is the smallest among all such…
We identify a large class of quantum many-body systems that can be solved exactly: natural frustration-free spin-1/2 nearest-neighbor Hamiltonians on arbitrary lattices. We show that the entire ground state manifold of such models can be…
We show how the area law for the entanglement entropy may be violated by free fermions on a lattice and look for conditions leading to the emergence of a volume law. We give an explicit construction of the states with maximal entanglement…