Related papers: Complexity of Supersymmetric Systems and the Cohom…
We study a $1$D supersymmetric (SUSY) hard-core fermion model first proposed by Fendley, Schoutens, and de Boer [Phys. Rev. Lett. 90, 120402 (2003)]. We focus on the full Hilbert space instead of a restricted subspace. Exact diagonalization…
The problem of building supersymmetry in the quantum mechanics of two Coulombian centers of force is analyzed. It is shown that there are essentially two ways of proceeding. The spectral problems of the SUSY (scalar) Hamiltonians are quite…
We introduce several new quantum algorithms for estimating homological invariants, specifically Betti numbers and persistent Betti numbers, of a simplicial complex given via a structured classical input. At the core of our algorithm lies…
Despite having an unnatural definition, $\mathsf{StoqMA}$ plays a central role in Hamiltonian complexity, e.g., in the classification theorem of the complexity of Hamiltonians by Cubitt and Montanaro (SICOMP 2016). Moreover, it lies between…
Computing the ground-state energy of interacting electron (fermion) problems has recently been shown to be hard for QMA, a quantum analogue of the complexity class NP. Fermionic problems are usually hard, a phenomenon widely attributed to…
In this paper we analyze the ground state phase diagram of a class of fermionic Hamiltonians by looking at the fidelity of ground states corresponding to slightly different Hamiltonian parameters. The Hamiltonians under investigation can be…
In recent years, great success has been achieved on the classification of symmetry-protected topological (SPT) phases for interacting fermion systems by using generalized cohomology theory. However, the explicit calculation of generalized…
Generating large, non-trivial quantum chemistry test problems with known ground-state solutions remains a core challenge for benchmarking electronic structure methods. Inspired by planted-solution techniques from combinatorial optimization,…
We describe a method that allows for a practical application of the theory of pseudo-Hermitian operators to PT-symmetric systems defined on a complex contour. We apply this method to study the Hamiltonians $H=p^2+x^2(ix)^\nu$ with…
In this paper we revisit the problem of finding hidden symmetries in quantum mechanical systems. Our interest in this problem was renewed by nontrivial degeneracies of a simple spin Hamiltonian used to model spin relaxation in alkali-metal…
Exactly solvable models are essential in physics. For many-body spin-1/2 systems, an important class of such models consists of those that can be mapped to free fermions hopping on a graph. We provide a complete characterization of models…
A novel family of exactly solvable quantum systems on curved space is presented. The family is the quantum version of the classical Perlick family, which comprises all maximally superintegrable 3-dimensional Hamiltonian systems with…
We study several problems related to properties of non-negative matrices that arise at the boundary between quantum and classical probabilistic computation. Our results are twofold. First, we identify a large class of quantum Hamiltonians…
We investigate the phenomenon of disorder-free localisation in quantum systems with global permutation symmetry. We use permutation group theory to systematically construct permutation symmetric many-fermion Hamiltonians and interpret them…
We propose how to compute the complexity of operators generated by Hamiltonians in quantum field theory (QFT) and quantum mechanics (QM). The Hamiltonians in QFT/QM and quantum circuit have a few essential differences, for which we…
The local Hamiltonian problem consists of estimating the ground-state energy (given by the minimum eigenvalue) of a local quantum Hamiltonian. First, we show the existence of a good product-state approximation for the ground-state energy of…
We consider the optimization problem (ground energy search) for fermionic Hamiltonians with classical interactions. This QMA-hard problem is motivated by the Coulomb electron-electron interaction being diagonal in the position basis, a…
We prove that 2-Local Hamiltonian (2-LH) with Low Complexity problem is QCMA-complete by combining the results from the QMA-completeness[4] of 2-LH and QCMA-completeness of 3-LH with Low Complexity[6]. The idea is straightforward. It has…
Problems based on the structure of graphs -- for example finding cliques, independent sets, or colourings -- are of fundamental importance in classical complexity. Defining well-formulated decision problems for quantum graphs, which are an…
The correct Hamiltonian for an extended Hubbard model with quantum group symmetry as introduced by A. Montorsi and M. Rasetti is derived for a D-dimensional lattice. It is shown that the superconducting SUq(2) holds as a true quantum…