Related papers: A polynomial-time algorithm for ground states of s…
Phylogenetic networks are leaf-labelled directed acyclic graphs that are used to describe non-treelike evolutionary histories and are thus a generalization of phylogenetic trees. The hybridization number of a phylogenetic network is the sum…
Over the past 30 years numerous algorithms have been designed for symmetry breaking problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge-coloring. For most problems the best randomized algorithm is at least…
We present a general procedure for constructing lattices of qubits with a Hamiltonian composed of nearest-neighbour two-body interactions such that the ground state encodes a cluster state. We give specific details for lattices in one-,…
We establish a general scaling law for the entanglement of a large class of ground states and dynamically evolving states of quantum spin chains: we show that the geometric entropy of a distinguished block saturates, and hence follows an…
It is well-known that entanglement entropy in field theory at its ground state is dominated by an area law term, presenting a similarity to the entropy of black holes. It is interesting to investigate whether this similarity can be extended…
We investigate of the relationship between the entanglement and subsystem Hamiltonians in the perturbative regime of strong coupling between subsystems. One of the two conditions that guarantees the proportionality between these…
An exponential deformation of a 1D critical Hamiltonian, with couplings falling on a length scale $h^{-1}$, gives rise to ground states whose entanglement entropy follows a volume law, i.e. the area law is violated maximally. The ground…
The Subtree Isomorphism problem asks whether a given tree is contained in another given tree. The problem is of fundamental importance and has been studied since the 1960s. For some variants, e.g., ordered trees, near-linear time algorithms…
Our main result is a full classification, for every connected graph $H$, of the computational complexity of Steiner Forest on $H$-subgraph-free graphs. To obtain this dichotomy, we establish the following new algorithmic, hardness, and…
We study the scaling of entanglement in low-energy states of quantum many-body models on lattices of arbitrary dimensions. We allow for unbounded Hamiltonians such that systems with bosonic degrees of freedom are included. We show that if…
A rectangular layout $\mathcal{L}$ is a rectangle partitioned into disjoint smaller rectangles so that no four smaller rectangles meet at the same point. Rectangular layouts were originally used as floorplans in VLSI design to represent…
Recent results on the stability of the spectral gap under general perturbations for frustration-free Hamiltonians, have motivated the following question: Does the entanglement entropy of quantum states that are connected to states…
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our dynamic-programming algorithms for general and…
It has remained an open question for some time whether, given a set of not necessarily binary (i.e. "nonbinary") trees T on a set of taxa X, it is possible to determine in time f(r).poly(m) whether there exists a phylogenetic network that…
We introduce a class of exactly solvable SO(n) symmetric Hamiltonians with matrix product ground states. For an odd $n\geq 3$ case, the ground state is a translational invariant Haldane gap spin liquid state; while for an even $n\geq 4$…
In this paper we present the first deterministic polynomial time algorithm for determining the existence of a Hamiltonian cycle and finding a Hamiltonian cycle in general graphs. Our algorithm can also solve the Hamiltonian path problem in…
We consider general locally-interacting arbitrary-dimensional lattice spin systems that are gapped for any system size. We show under reasonable conditions that nondegenerate ground states of such systems obey the entanglement area law. In…
Topologically constrained genome-like polymers often double-fold into tree-like configurations, which can be modelled on the level of folded (ring) polymers or on the level of the underlying random trees. For both descriptions, we have…
The "folding algorithm"\cite{fold1} is a matrix product state algorithm for simulating quantum systems that involves a spatial evolution of a matrix product state. Hence, the computational effort of this algorithm is controlled by the…
The Minimum Linear Arrangement problem (MLA) consists of finding a mapping $\pi$ from vertices of a graph to distinct integers that minimizes $\sum_{\{u,v\}\in E}|\pi(u) - \pi(v)|$. In that setting, vertices are often assumed to lie on a…