Related papers: Complexity classification of local Hamiltonian pro…
We calculate the cosmological complexity under the framework of scalar curvature perturbations for a K-essence model with constant potential. In particular, the squeezed quantum states are defined by acting a two-mode squeezed operator…
A Boolean constraint satisfaction instance is a conjunction of constraint applications, where the allowed constraints are drawn from a fixed set B of Boolean functions. We consider the problem of determining whether two given constraint…
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…
Integrability is a cornerstone of classical mechanics, where it has a precise meaning. Extending this notion to quantum systems, however, remains subtle and unresolved. In particular, deciding whether a quantum Hamiltonian - viewed simply…
Complexity of a quantum analogue of the satisfiability problem is studied. Quantum k-SAT is a problem of verifying whether there exists n-qubit pure state such that its k-qubit reduced density matrices have support on prescribed subspaces.…
In the framework of polysymplectic Hamiltonian formalism, degenerate Lagrangian field systems are described as multi-Hamiltonian systems with Lagrangian constraints. The physically relevant case of degenerate quadratic Lagrangians is…
We propose a hybrid quantum-classical algorithm for approximating the ground state and ground state energy of a Hamiltonian. Once the Ansatz has been decided, the quantum part of the algorithm involves the calculation of two overlap…
We analyze a general family of position-dependent mass quantum Hamiltonians which are not self-adjoint and include, as particular cases, some Hamiltonians obtained in phenomenological approaches to condensed matter physics. We build a…
We solve the quantum mechanical problem of a charged particle on S^2 in the background of a magnetic monopole for both bosonic and supersymmetric cases by constructing Hilbert space and realizing the fundamental operators obeying…
Traditional approaches to energy-momentum localization led to reference frame dependent pseudotensors. The more modern idea is quasilocal energy-momentum. We take a Hamiltonian approach. The Hamiltonian boundary term gives not only the…
MA is a class of decision problems for which `yes'-instances have a proof that can be efficiently checked by a classical randomized algorithm. We prove that MA has a natural complete problem which we call the stoquastic k-SAT problem. This…
Within the framework of quantum mechanics working with one-dimensional, manifestly non-Hermitian Hamiltonians $H=T+V$ the traditional class of the exactly solvable models with local point interactions $V=V(x)$ is generalized. The…
The various roles of boundary terms in the gravitational Lagrangian and Hamiltonian are explored. A symplectic Hamiltonian-boundary-term approach is ideally suited for a large class of quasilocal energy-momentum expressions for general…
We review two approaches to the definition of the Hilbert space and evolution in mechanical theories with local time-reparametrization invariance, which are often used as toy models of quantum gravity. The first approach is based on the…
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…
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…
All Hamiltonian complexity results to date have been proven by constructing a local Hamiltonian whose ground state -- or at least some low-energy state -- is a "computational history state", encoding a quantum computation as a superposition…
We prove that estimating the ground state energy of a translationally-invariant, nearest-neighbour Hamiltonian on a 1D spin chain is QMAEXP-complete, even for systems of low local dimension (roughly 40). This is an improvement over the best…
The area law for entanglement entropy fundamentally reflects the complexity of quantum many-body systems, demonstrating ground states of local Hamiltonians to be represented with low computational complexity. While this principle is…
The derandomization of MA, the probabilistic version of NP, is a long standing open question. In this work, we connect this problem to a variant of another major problem: the quantum PCP conjecture. Our connection goes through the…