Related papers: Commuting Local Hamiltonians on Expanders, Locally…
We prove that if a sequence of pairs of smooth commuting Hamiltonians converge in the $C^0$ topology to a pair of smooth Hamiltonians, these commute. This allows us define the notion of commuting continuous Hamiltonians. As an application…
Recent advances in the field of adiabatic quantum computing and the closely related field of quantum annealers has centered around using more advanced and novel Hamiltonian representations to solve optimization problems. One of these…
We investigate the computational complexity of the Local Hamiltonian (LH) problem and the approximation of the Quantum Partition Function (QPF), two central problems in quantum many-body physics and quantum complexity theory. Both problems…
We consider whether or not Hamiltonians which are sums of commuting projectors have "trivial" ground states which can be constructed by a local quantum circuit of bounded depth and range acting on a product state. While the toric code only…
We examine the problem of determining if a 2-local Hamiltonian is stoquastic by local basis changes. We analyze this problem for two-qubit Hamiltonians, presenting some basic tools and giving a concrete example where using unitaries beyond…
A central problem in quantum computing is to identify computational tasks which can be solved substantially faster on a quantum computer than on any classical computer. By studying the hardest such tasks, known as BQP-complete problems, we…
A quantum-mechanical Hamiltonian with a gravitational potential is derived in the framework of local times. This Hamiltonian is the one used by E. H. Lieb (Bull. Amer. Math. Soc. 22(1990), 1-49) in his explanation of stability and…
We propose a natural application of Quantum Linear Systems Problem (QLSP) solvers such as the HHL algorithm to efficiently prepare highly excited interior eigenstates of physical Hamiltonians in a variational and targeted manner. This is…
Protecting quantum information from the detrimental effects of decoherence and lack of precise quantum control is a central challenge that must be overcome if a large robust quantum computer is to be constructed. The traditional approach to…
We have proved new estimates for the coherent control errors of quantum circuits used in quantum computing. These estimates essentially take into account the commutator properties of the Hamiltonians and are based on the formulas of the…
Physical constraints make it challenging to implement and control many-body interactions. For this reason, designing quantum information processes with Hamiltonians consisting of only one- and two-local terms is a worthwhile challenge.…
We elucidate the distinction between global and termwise stoquasticity for local Hamiltonians and prove several complexity results. We show that the stoquastic local Hamiltonian problem is $\textbf{StoqMA}$-complete even for globally…
We prove that 2-Local Hamiltonian (2-LH) with Low Complexity problem is QCMA-complete by combining the results from the QMA-completeness[4] of 2-LH and QCMA-completeness of 3-LH with Low Complexity[6]. The idea is straightforward. It has…
We show that bulk quantities localized on a minimal surface homologous to a boundary region correspond in the CFT to operators that commute with the modular Hamiltonian associated with the boundary region. If two such minimal surfaces…
By incorporating the concept of locality into quantum information theory, quantum locally recoverable codes (qLRCs) have been proposed, motivated by their potential applications in large-scale quantum data storage and their relevance to…
We study the computational complexity of the Guided Local Hamiltonian problem: given a local Hamiltonian $H$ together with a classical description of a guiding state that has non-negligible overlap with the ground state of $H$, estimate the…
Local non-Hermitian (NH) quantum systems generically exhibit breakdown of Lieb-Robinson (LR) bounds, motivating study of whether new locality measures might shed light not seen by existing measures. In this paper we extend the standard…
Recently, several claims have been made that certain fundamental problems of distributed computing, including Leader Election and Distributed Consensus, begin to admit feasible and efficient solutions when the model of distributed…
The (tolerant) Hamiltonian locality testing problem, introduced in [Bluhm, Caro,Oufkir `24], is to determine whether a Hamiltonian $H$ is $\varepsilon_1$-close to being $k$-local (i.e. can be written as the sum of weight-$k$ Pauli…
We propose a framework for the connection between local symmetries of discrete Hamiltonians and the design of compact localized states. Such compact localized states are used for the creation of tunable, local symmetry-induced bound states…