Related papers: Quantum Hamiltonian complexity and the detectabili…
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…
We consider simulating an $n$-qubit Hamiltonian with nearest-neighbor interactions evolving for time $t$ on a quantum computer. We show that this simulation has gate complexity $(nt)^{1+o(1)}$ using product formulas, a straightforward…
We consider the quantum complexity of computing Schatten $p$-norms and related quantities, and find that the problem of estimating these quantities is closely related to the one clean qubit model of computation. We show that the problem of…
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.…
Independent studies by different authors have proposed that classicality may be induced in quantum objects by cosmological constraints presented by an expanding universe of finite extent in space-time. Cosmological effects on a quantum…
We study the complexity of local Hamiltonians in which the terms pairwise commute. Commuting local Hamiltonians (CLHs) provide a way to study the role of non-commutativity in the complexity of quantum systems and touch on many fundamental…
We revisit the question of the relation between entanglement, entropy, and area for harmonic lattice Hamiltonians corresponding to discrete versions of real free Klein-Gordon fields. For the ground state of the d-dimensional cubic harmonic…
Knabe's theorem lower bounds the spectral gap of a one dimensional frustration-free local hamiltonian in terms of the local spectral gaps of finite regions. It also provides a local spectral gap threshold for hamiltonians that are gapless…
Gauge theories with general covariance are particularly reluctant to quantization. We discuss the example of the Hamiltonian formulation of the relativistic point particle that, despite its apparent simplicity, is of crucial importance…
We consider the relationship between correlations and entanglement in gapped quantum systems, with application to matrix product state representations. We prove that there exist gapped one-dimensional local Hamiltonians such that the…
Here we present a problem related to the local Hamiltonian problem (identifying whether the ground state energy falls within one of two ranges) which is restricted to being translationally invariant. We prove that for problems with a fixed…
Open quantum systems are ubiquitous in the physical sciences, with widespread applications in the areas of chemistry, condensed matter physics, material science, optics, and many more. Not surprisingly, there is significant interest in…
We study a parameterized version of the local Hamiltonian problem, called the weighted local Hamiltonian problem, where the relevant quantum states are superpositions of computational basis states of Hamming weight $k$. The Hamming weight…
It is known that three fundamental questions regarding local Hamiltonians -- approximating the ground state energy (the Local Hamiltonian problem), simulating local measurements on the ground space (APX-SIM), and deciding if the low energy…
The state overlap, quantified via $\tr[\rho \sigma]$, is a metric widely used to assess the closeness between two quantum states $\rho$ and $\sigma$. Although global state overlap alone does not directly capture entanglement properties, we…
Analog quantum simulations---simulations of one Hamiltonian by another---is one of the major goals in the noisy intermediate-scale quantum computation (NISQ) era, and has many applications in quantum complexity. We initiate the rigorous…
Many-body localization was proven under realistic assumptions by constructing a quasi-local unitary rotation that diagonalizes the Hamiltonian (Imbrie, 2016). A natural generalization is to consider all unitaries that have a similar…
Quantum circuit complexity is a fundamental concept whose importance permeates quantum information, computation, many-body physics and high-energy physics. While extensively studied in closed systems, its characterization and behaviors in…
We present a Hamiltonian quantum computation scheme universal for quantum computation (BQP). Our Hamiltonian is a sum of a polynomial number (in the number of gates L in the quantum circuit) of time-independent, constant-norm, 2-local…
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…