Related papers: Commuting Local Hamiltonians Beyond 2D
While LDPC codes have been demonstrated with desirable error correcting properties, this has come at a cost of diverging from the geometrical constraints of many hardware platforms. Viewing codes as the groundspace of a Hamiltonian, we…
K-Theory for hermitian symmetric spaces of non-compact type, as developed recently by the authors, allows to put Cartan's classification into a homological perspective. We apply this method to the case of inductive limits of finite…
In this paper, some of formulations of Hamilton-Jacobi equations for Hamiltonian system and regular reduced Hamiltonian systems are given. At first, an important lemma is proved, and it is a modification for the corresponding result of…
Determining if an input undirected graph is Hamiltonian, i.e., if it has a cycle that visits every vertex exactly once, is one of the most famous NP-complete problems. We consider the following generalization of Hamiltonian cycles: for a…
We study families of dynamical maps generated from interactions with varying degrees of symmetry. For a family of time-independent Hamiltonians, we demonstrate the relationship between symmetry, strong-coupling, perfect entanglers,…
We prove that every injective Matrix Product State is the unique ground state of a simple hopping theory. We start by studying the low energy spectrum of parent Hamiltonians of injective Matrix Product States in a particular long range and…
Proximity graphs have been studied for several decades, motivated by applications in computational geometry, geography, data mining, and many other fields. However, the computational complexity of classic graph problems on proximity graphs…
We consider the problems of testing and learning an unknown $n$-qubit Hamiltonian $H$ from queries to its evolution operator $e^{-iHt}$ under the normalized Frobenius norm. We prove: 1. Local Hamiltonians: We give a tolerant testing…
Reasoning about the physical world requires models that are endowed with the right inductive biases to learn the underlying dynamics. Recent works improve generalization for predicting trajectories by learning the Hamiltonian or Lagrangian…
Current and near-term quantum hardware is constrained by limited qubit counts, circuit depth, and the high cost of repeated measurements. We address these challenges for solid state Hamiltonians by introducing a logarithmic-qubit encoding…
The nature of randomness and complexity growth in systems governed by unitary dynamics is a fundamental question in quantum many-body physics. This problem has motivated the study of models such as local random circuits and their…
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…
The link between 3D spaces with (in general, non-constant) curvature and quantum deformations is presented. It is shown how the non-standard deformation of a sl(2) Poisson coalgebra generates a family of integrable Hamiltonians that…
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…
Quantum algorithms for electronic-structure simulations are actively being developed, yet many hybrid quantum-classical approaches are bottlenecked by the measurement overhead associated with large molecular Hamiltonians. Here we introduce…
We revisit the minimum-link path problem: Given a polyhedral domain and two points in it, connect the points by a polygonal path with minimum number of edges. We consider settings where the vertices and/or the edges of the path are…
The presence of symmetries, be they discrete or continuous, in a physical system typically leads to a reduction in the problem to be solved. Here we report that neither translational invariance nor rotational invariance reduce the…
In this paper, we consider a renormalization group perspective on the quantum dynamics of a particle moving in the Euclidean $\mathbb{R}^N$ space through the complex landscape provided by a disordered Hamiltonian of type $2+p$. We focus on…
Transport in Hamiltonian systems with weak chaotic perturbations has been much studied in the past. In this paper, we introduce a new class of problems: transport in Hamiltonian systems with slowly changing phase space structure that are…
A new characterization of Hamiltonian graphs using f-cutset matrix is proposed. Based on this new characterization, a new exact polynomial time algorithm for the traveling salesman problem (TSP) is developed. We then define the so-called…