Related papers: Complexity of Supersymmetric Systems and the Cohom…
The interplay between symmetry and topological properties plays a very important role in modern physics. In the past decade, the concept of symmetry-enriched topological (SET) phases was proposed and their classifications have been…
Topological data analysis has emerged as a powerful tool for analyzing large-scale data. An abstract simplicial complex, in principle, can be built from data points, and by using tools from homology, topological features could be…
We study a model for itinerant, strongly interacting fermions where a judicious tuning of the interactions leads to a supersymmetric Hamiltonian. On the triangular lattice this model is known to exhibit a property called superfrustration,…
Computation of homology or cohomology is intrinsically a problem of high combinatorial complexity. Recently we proposed a new efficient algorithm for computing cohomologies of Lie algebras and superalgebras. This algorithm is based on…
The complexity of the commuting local Hamiltonians (CLH) problem still remains a mystery after two decades of research of quantum Hamiltonian complexity; it is only known to be contained in NP for few low parameters. Of particular interest…
Parity-time ($PT$)-symmetric Hamiltonians exhibit non-unitary dynamical evolution while maintaining real spectra, and offer unique approaches to quantum sensing and entanglement generation. Here we present a method for simulating the…
In this paper we study a hierarchical supersymmetric model for a class of gapless, three-dimensional, weakly disordered quantum systems, displaying pointlike Fermi surface and conical intersections of the energy bands in the absence of…
We establish a connection between ground states of local quantum Hamiltonians and thermal states of classical spin systems. For any discrete classical statistical mechanical model in any spatial dimension, we find an associated quantum…
Models of disorder with a direction (constant imaginary vector-potential) are considered. These non-Hermitian models can appear as a result of computation for models of statistical physics using transfer matrix technique or describe…
Quantum PCP conjecture is one of the most influential open problems in quantum complexity theory, which states that approximating the ground state energy for a sparse local Hamiltonian upto a constant is QMA-complete. However, even though…
We construct fixed point lattice models for group supercohomology symmetry protected topological (SPT) phases of fermions in 2+1D. A key feature of our approach is to construct finite depth circuits of local unitaries that explicitly build…
We describe an algorithm that computes the ground state energy and correlation functions for 2-local Hamiltonians in which interactions between qubits are weak compared to single-qubit terms. The running time of the algorithm is polynomial…
Topological data analysis (TDA) has become an attractive area for the application of quantum computing. Recent advances have uncovered many interesting connections between the two fields. On one hand, complexity theoretic results show that…
We make use of the Quantum Hamilton-Jacobi (QHJ) theory to investigate conditional quasi-solvability of the quantum symmetric top subject to combined electric fields (symmetric top pendulum). We derive the conditions of quasi-solvability of…
Harnessing the full power of nascent quantum processors requires the efficient management of a limited number of quantum bits with finite lifetime. Hybrid algorithms leveraging classical resources have demonstrated promising initial results…
For any particular class of graphs, algorithms for computational problems restricted to the class often rely on structural properties that depend on the specific problem at hand. This begs the question if a large set of such results can be…
In this paper we introduce the concept of characteristic number that are proven to be useful in the study of the combinatorics of graph cohomology. We claim that it is a good combinatorial counterpart for geometric Betti numbers. We then…
Supersymmetric models are grounded in the intriguing concept of a hypothetical symmetry that relates bosonic and fermionic particles. This symmetry has profound implications, offering valuable extensions to the Standard Model of particle…
We study when block-coupled regular graphs can realize prescribed complex quantum-like bit states as exact synchronized eigenstates. Two regular subgraphs $G_A$ and $G_B$ supply normalized all-ones eigenvectors $V_A$ and $V_B$, and…
A frustration-free local Hamiltonian has the property that its ground state minimises the energy of all local terms simultaneously. In general, even deciding whether a Hamiltonian is frustration-free is a hard task, as it is closely related…