Related papers: A complexity phase transition at the EPR Hamiltoni…
Recently it was shown that the so-called guided local Hamiltonian problem -- estimating the smallest eigenvalue of a $k$-local Hamiltonian when provided with a description of a quantum state ('guiding state') that is guaranteed to have…
An effective Hamiltonian describing interaction between generic "fast" and a "slow" systems is obtained in the strong interaction limit. The result is applied for studying the effect of quantum phase transition as a bifurcation of the…
A central result in the study of Quantum Hamiltonian Complexity is that the k-Local hamiltonian problem is QMA-complete. In that problem, we must decide if the lowest eigenvalue of a Hamiltonian is bounded below some value, or above…
We study the complexity of a class of problems involving satisfying constraints which remain the same under translations in one or more spatial directions. In this paper, we show hardness of a classical tiling problem on an N x N…
We consider a family of generalized Rokhsar-Kivelson (RK) Hamiltonians, which are reverse-engineered to have an arbitrary edge-weighted superposition of dimer coverings as their exact ground state at the RK point. We focus on a quantum…
We study a non-interacting quantum particle, moving on a one-dimensional lattice, which is subjected to repetitive measurements. We investigate the consequence when such motion is interrupted and restarted from the same initial…
If a Hamiltonian is PT symmetric, there are two possibilities: Either the eigenvalues are entirely real, in which case the Hamiltonian is said to be in an unbroken-PT-symmetric phase, or else the eigenvalues are partly real and partly…
For any quantum algorithm given by a path in the space of unitary operators we define the computational complexity as the typical computational time associated with the path. This time is defined using a quantum time estimator associated…
Many-body fermionic quantum calculations performed on analog quantum computers are restricted by the presence of k-local terms, which represent interactions among more than two qubits. These originate from the fermion-to-qubit mapping…
$\ell_1$ optimization is a well known heuristic often employed for solving various forms of sparse linear problems. In this paper we look at its a variant that we refer to as the \emph{partial} $\ell_1$ and discuss its mathematical…
A translation-invariant gapped local Hamiltonian is in the trivial phase if it can be connected to a completely decoupled Hamiltonian with a smooth path of translation-invariant gapped local Hamiltonians. For the ground state of such a…
This paper concerns a first-order algorithmic technique for a class of optimal control problems defined on switched-mode hybrid systems. The salient feature of the algorithm is that it avoids the computation of Fr\'echet or G\^ateaux…
We present a theoretical investigation of dynamical quantum phase transitions (QPTs) in a periodically driven $\Lambda$-type three-level system (3LS) embedded in a double-mode cavity, described by a three-level Jaynes-Cumming (3L-JC)…
Excited state quantum phase transitions (ESQPTs) are generalizations of quantum phase transitions (QPTs) to excited levels. They are associated with local divergences in the density of states. Here, we investigate how the presence of an…
We investigate the second quantization form of the entanglement Hamiltonian (EH) of various subregions for the ground-state of several interacting lattice fermions and spin models. The relation between the EH and the model Hamiltonian…
Classical hardness-of-sampling results are largely established for random quantum circuits, whereas analog simulators natively realize time evolutions under geometrically local Hamiltonians. Does a typical such Hamiltonian already yield…
The canonical problem for the class Quantum Merlin-Arthur (QMA) is that of estimating ground state energies of local Hamiltonians. Perhaps surprisingly, [Ambainis, CCC 2014] showed that the related, but arguably more natural, problem of…
In this paper the local iterative Lie-Schwinger block-diagonalization method, introduced in [FP], [DFPR1], and [DFPR2] for quantum chains, is extended to higher-dimensional quantum lattice systems with Hamiltonians that can be written as…
We consider the simulation of the dynamics of one nonlocal Hamiltonian by another, allowing arbitrary local resources but no entanglement nor classical communication. We characterize notions of simulation, and proceed to focus on…
We introduce an iterative method to search for time-optimal Hamiltonians that drive a quantum system between two arbitrary, and in general mixed, quantum states. The method is based on the idea of progressively improving the efficiency of…