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â€¦ (More)

We show tight upper and lower bounds for switching lemmas obtained by the action of random p-restrictions on boolean functions that can be expressed as decision trees in which every vertex is at aâ€¦ (More)

Dynamic Complexity (as introduced by Patnaik and Immerman [13]) tries to express how hard it is to update the solution to a problem when the input is changed slightly. It considers the changesâ€¦ (More)

Definition 1. A language L âˆˆ BQP if there exists a classical polynomial time algorithm A that maps inputs x âˆˆ {0, 1}âˆ— to quantum circuits Cx on n = poly(|x|) qubits, where the circuit is considered aâ€¦ (More)

We study the variant of the k-local hamiltonian problem which is a natural generalization of k-CSPs, in which the hamiltonian terms all commute. More specifically, we consider a hamiltonian H = âˆ‘i Hiâ€¦ (More)