Related papers: Commuting Local Hamiltonians Beyond 2D
An important task in quantum physics is the estimation of local quantities for ground states of local Hamiltonians. Recently, [Ambainis, CCC 2014] defined the complexity class P^QMA[log], and motivated its study by showing that the physical…
We provide a complete quantization for the Gowdy model with local rotational symmetry in vacuum. We start with a redefinition of the classical constraint algebra such that the Hamiltonian constraint has a vanishing Poisson bracket with…
The Local Hamiltonian problem is the problem of estimating the least eigenvalue of a local Hamiltonian, and is complete for the class QMA. The 1D problem on a chain of qubits has heuristics which work well, while the 13-state qudit case has…
In this work, we study a variant of the local Hamiltonian problem where we restrict to Hamiltonians that live on a lattice and are invariant under translations and rotations of the lattice. In the one-dimensional case this problem is known…
Traditional quantum physics solves ground states for a given Hamiltonian, while quantum information science asks for the existence and construction of certain Hamiltonians for given ground states. In practical situations, one would be…
We analyze Hamiltonians linear in the time variable for which the multistate Landau-Zener problem is known to have an exact solution. We show that they either belong to families of mutually commuting Hamiltonians polynomial in time or…
The main result of this paper is a convexity theorem for momentum mappings of certain hamiltonian actions of noncompact semisimple Lie groups. The image is required to fall within a certain open subset D of the (dual of the) Lie algebra,…
Much prior work has been done on designing computational geometry algorithms that handle input degeneracies, data imprecision, and arithmetic round-off errors. We take a new approach, inspired by the noisy sorting literature, and study…
This paper proposes Hamiltonian Learning, a novel unified framework for learning with neural networks "over time", i.e., from a possibly infinite stream of data, in an online manner, without having access to future information. Existing…
As time passes, once simple quantum states tend to become more complex. For strongly coupled k-local Hamiltonians, this growth of computational complexity has been conjectured to follow a distinctive and universal pattern. In this paper we…
Can the properties of the thermodynamic limit of a many-body quantum system be extrapolated by analysing a sequence of finite-size cases? We present a model for which such an approach gives completely misleading results: a translationally…
The study of quantum circuits composed of commuting gates is particularly useful to understand the delicate boundary between quantum and classical computation. Indeed, while being a restricted class, commuting circuits exhibit genuine…
Lattice surgery with two-dimensional quantum error correcting codes is among the leading schemes for fault-tolerant quantum computation, motivated by superconducting hardware architectures. In conventional lattice surgery compilation…
We prove the existence of a new structure on the first Galois cohomology of generic families of symplectic self-dual $p$-adic representations of $G_{\mathbb{Q}_p}$ of rank two (a local sign decomposition): a functorial decomposition into…
The aim of this paper is to give new insights about families of integrable systems lifting a Hamiltonian $S^1$-space. Specifically, we study one-parameter families $(M^4,\omega,F_t=(J,H_t))_{0 \leq t \leq 1}$ of systems with a fixed…
The aim of the present article is to construct quadratically integrable three dimensional systems in non-vanishing magnetic fields which possess so-called non-subgroup type integrals. The presence of such integrals means that the system…
We study the computational complexity of 2-local Hamiltonian problems generated by a positive-weight symmetric interaction term, encompassing many canonical problems in statistical mechanics and optimization. We show these problems belong…
The Variational Quantum Eigensolver approach to the electronic structure problem on a quantum computer involves measurement of the Hamiltonian expectation value. Formally, quantum mechanics allows one to measure all mutually commuting or…
Quantum simulations of lattice gauge theories for the foreseeable future will be hampered by limited resources. The historical success of improved lattice actions in classical simulations strongly suggests that Hamiltonians with improved…
Valiant-Vazirani showed in 1985 [VV85] that solving NP with the promise that "yes" instances have only one witness is powerful enough to solve the entire NP class (under randomized reductions). We are interested in extending this result to…