相关论文: Hamiltonians whose low-energy states require $\Ome…
Estimating the ground state energy of a local Hamiltonian is a central problem in quantum chemistry. In order to further investigate its complexity and the potential of quantum algorithms for quantum chemistry, Gharibian and Le Gall (STOC…
We consider the problem of testing whether an unknown $n$-qubit quantum state $|\psi\rangle$ is a stabilizer state, with only single-copy access. We give an algorithm solving this problem using $O(n)$ copies, and conversely prove that…
We construct classical algorithms computing an approximation of the ground state energy of an arbitrary $k$-local Hamiltonian acting on $n$ qubits. We first consider the setting where a good ``guiding state'' is available, which is the main…
We present a new perturbation theory for quantum mechanical energy eigenstates when the potential equals the sum of two localized, but not necessarily weak potentials $V_{1}(\vec{r})$ and $V_{2}(\vec{r})$, with the distance $L$ between the…
Quantum energy teleportation (QET) has been proposed to overcome the restrictions of strong local passivity (SLP) and to facilitate energy transfer in quantum systems. Traditionally, QET has only been considered under strict constraints,…
Quantum resources like entanglement and magic are essential for characterizing the complexity of quantum states. However, when the number of copies of quantum states and the computational time are limited by numbers polynomial in the system…
Quantum dynamics can be simulated on a quantum computer by exponentiating elementary terms from the Hamiltonian in a sequential manner. However, such an implementation of Trotter steps has gate complexity depending on the total Hamiltonian…
Preparing quantum thermal states on a quantum computer is in general a difficult task. We provide a procedure to prepare a thermal state on a quantum computer with a logarithmic depth circuit of local quantum channels assuming that the…
Quantum many-body scars are non-thermal eigenstates embedded in the spectra of otherwise non-integrable Hamiltonians. Paradigmatic examples often appear as quasiparticle towers of states, such as the maximally ferromagnetic spin-1/2 states,…
A key feature of ground states of gapped local 1D Hamiltonians is their relatively low entanglement --- they are well approximated by matrix product states (MPS) with bond dimension scaling polynomially in the length $N$ of the chain, while…
In this paper we address the question of the existence of a spectral gap in a class of local Hamiltonians. These Hamiltonians have the following properties: their ground states are known exactly; all equal-time correlation functions of…
Estimating the eigenstate properties of quantum systems is a long-standing, challenging problem for both classical and quantum computing. Existing universal quantum algorithms typically rely on ideal and efficient query models (e.g. time…
We define a general formulation of quantum PCPs, which captures adaptivity and multiple unentangled provers, and give a detailed construction of the quantum reduction to a local Hamiltonian with a constant promise gap. The reduction turns…
We provide an $\Omega(log(n))$ lower bound for the depth of any quantum circuit generating the unique groundstate of Kitaev's spherical code. No circuit-depth lower bound was known before on this code in the general case where the gates can…
In this thesis, I investigate aspects of local Hamiltonians in quantum computing. First, I focus on the Adiabatic Quantum Computing model, based on evolution with a time dependent Hamiltonian. I show that to succeed using AQC, the…
We analyze the error of approximating Gibbs states of local quantum spin Hamiltonians on lattices with Projected Entangled Pair States (PEPS) as a function of the bond dimension ($D$), temperature ($\beta^{-1}$), and system size ($N$).…
Quantum speed limit (QSL) is the lower bound on the time required for a state to evolve to a desired final state under a given Hamiltonian evolution. Three well-known QSLs exist Mandelstam-Tamm (MT), Margolus-Levitin (ML), and dual ML…
Understanding commuting local Hamiltonians (CLHs) is at the heart of many questions in quantum computational complexity and quantum physics: quantum error correcting codes, quantum NP, the PCP conjecture, topological order and more.
We present a simple quantum many-body system - a two-dimensional lattice of qubits with a Hamiltonian composed of nearest-neighbor two-body interactions - such that the ground state is a universal resource for quantum computation using…
Recently, Bravyi and K\"onig have shown that there is a tradeoff between fault-tolerantly implementable logical gates and geometric locality of stabilizer codes. They consider locality-preserving operations which are implemented by a…