Zero-Energy Problems for Supersymmetric Hamiltonians on a Chain Are $\mathrm{QMA}_1$-Complete

• URL: http://arxiv.org/abs/2608.29333v2
• Date: Tue, 01 Sep 2026 10:01:16 GMT
• Title: Zero-Energy Problems for Supersymmetric Hamiltonians on a Chain Are $\mathrm{QMA}_1$-Complete
• Abstract summary: We study exact zero modes of supersymmetric quantum systems whose interactions are arranged on a one-dimensional chain.<n>The construction gives an explicit inverse-polynomial lower bound on the ground energy of every reduced NO instance, separating it from zero.
• Score: 2.4344882758650743
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study exact zero modes of supersymmetric quantum systems whose interactions are arranged on a one-dimensional chain. For Hermitian supercharges, deciding whether a zero mode exists is $\mathrm{QMA}_1$-complete, and the hard instances are geometrically local on a chain. We also classify an explicitly encoded nilpotent $\mathcal{N}=2$ formulation: its exact-zero problem is $\mathrm{QMA}_1$-complete, including the restriction in which the associated Hamiltonian is local on a chain. Both classifications use a verification theorem for simultaneous sparse linear constraints and the same one-dimensional frustration-free Hamiltonian construction. The construction gives an explicit inverse-polynomial lower bound on the ground energy of every reduced NO instance, separating it from zero.

Related papers

• Perfect State Transfer from a Localised Two-Excitation State to a Dicke State via Static Spin-Network Hamiltonians [0.0]
  I construct a family of time-independent, symmetric-preserving spin Hamiltonians that realises perfect state transfer.<n>The construction exploits an $S_N-2$ permutation symmetry acting on the initially unoccupied spins.<n>For every $N ge 4$ an odd $n$ can be chosen large enough that a real root with $z -2$ exists.
  arXiv  Detail & Related papers  (2026-09-09T03:06:14Z)
• The pseudo-quantum representation of finite reversible Markov chains [0.0]
  We re-encodes a finite continuous-time Markov chain with $M$ states as a complex-orthogonal flow on a doubled space of dimension $2M$.<n>The chain and the quantum system are therefore not two analogous models but two restrictions of one entire representation.
  arXiv  Detail & Related papers  (2026-08-02T14:04:10Z)
• Polynomial Initial-State Jumps and Christoffel Transforms in Krylov Complexity [0.0]
  State Krylov, or spread, complexity is a property of a pair $(H,ketK)$ rather than of Hamiltonian alone.<n>We derive exact finite sums for individual amplitudes and projected Christoffel-Darboux kernels for cumulative probabilities and spread complexity.
  arXiv  Detail & Related papers  (2026-07-06T16:37:39Z)
• A QUBO Formulation for Nowhere-Zero $k$-Flows [0.3908906925636173]
  Nowhere-zero flows are related to Tutte's $5$-flow conjecture and appear in many contexts in graph theory.<n>We provide an encoding of nowhere-zero flows as a QUBO Hamiltonian and prove the correctness of the construction.
  arXiv  Detail & Related papers  (2026-06-27T01:59:01Z)
• The Collapse of Unentangled Stoquastic Merlin-Arthur Proof Systems [46.657699628769336]
  Entanglement and interference are among the most fundamental properties of quantum mechanics.<n>We prove that entanglement gives no additional power to stoquastic verification.
  arXiv  Detail & Related papers  (2026-05-15T17:52:33Z)
• Near-Optimal Clustering in Mixture of Markov Chains [74.3828414695655]
  We study the problem of clustering $T$ trajectories of length $H$, each generated by one of $K$ unknown ergodic Markov chains over a finite state space of size $S$.<n>We derive an instance-dependent, high-probability lower bound on the clustering error rate, governed by the weighted KL divergence between the transition kernels of the chains.<n>We then present a novel two-stage clustering algorithm.
  arXiv  Detail & Related papers  (2025-06-02T05:10:40Z)
• Hamiltonian simulation for low-energy states with optimal time dependence [45.02537589779136]
  We consider the task of simulating time evolution under a Hamiltonian $H$ within its low-energy subspace. We present a quantum algorithm that uses $O(tsqrtlambdaGamma + sqrtlambda/Gammalog (1/epsilon))$ queries to the block-encoding for any $Gamma$.
  arXiv  Detail & Related papers  (2024-04-04T17:58:01Z)
• Rigorous derivation of the Efimov effect in a simple model [68.8204255655161]
  We consider a system of three identical bosons in $mathbbR3$ with two-body zero-range interactions and a three-body hard-core repulsion of a given radius $a>0$.
  arXiv  Detail & Related papers  (2023-06-21T10:11:28Z)
• Systematics of quasi-Hermitian representations of non-Hermitian quantum models [0.0]
  This paper introduces and describes a set of constructive returns of the description to one of the correct and eligible physical Hilbert spaces $cal R_N(0)$. In the extreme of the theory the construction is currently well known and involves solely the inner product metric $Theta=Theta(H)$. At $j=N$ the inner-product metric remains trivial and only the Hamiltonian must be Hermitized, $H to mathfrakh = Omega,H,Omega-1=mathfrak
  arXiv  Detail & Related papers  (2022-12-07T20:10:58Z)
• Some Remarks on the Regularized Hamiltonian for Three Bosons with Contact Interactions [77.34726150561087]
  We discuss some properties of a model Hamiltonian for a system of three bosons interacting via zero-range forces in three dimensions. In particular, starting from a suitable quadratic form $Q$, the self-adjoint and bounded from below Hamiltonian $mathcal H$ can be constructed. We show that the threshold value $gamma_c$ is optimal, in the sense that the quadratic form $Q$ is unbounded from below if $gammagamma_c$.
  arXiv  Detail & Related papers  (2022-07-01T10:01:14Z)
• Scars from protected zero modes and beyond in $U(1)$ quantum link and quantum dimer models [0.0]
  We show anomalous high-energy eigenstates, or many-body scars, in $U(1)$ quantum link and quantum dimer models on square and rectangular lattices. We classify different types of scars for $|lambda| lesssim mathcalO(1)$ both at zero and finite winding number sectors.
  arXiv  Detail & Related papers  (2022-02-07T19:00:13Z)
• A lower bound on the space overhead of fault-tolerant quantum computation [51.723084600243716]
  The threshold theorem is a fundamental result in the theory of fault-tolerant quantum computation. We prove an exponential upper bound on the maximal length of fault-tolerant quantum computation with amplitude noise.
  arXiv  Detail & Related papers  (2022-01-31T22:19:49Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.