Related papers: A construction of Combinatorial NLTS
We present a non-perturbative framework for deriving effective Hamiltonians that describe low-energy excitations in quantum many-body systems. The method combines block diagonalization based on the Cederbaum--Schirmer--Meyer transformation…
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 show how Carrollian symmetries become important in the construction of one-dimensional fermionic systems with all flat-band spectra from first principles. The key ingredient of this construction is the identification of Compact Localised…
This work explores the use of a tree tensor network ansatz to simulate the ground state of a local Hamiltonian on a two-dimensional lattice. By exploiting the entropic area law, the tree tensor network ansatz seems to produce quasi-exact…
Hamiltonian simulation on quantum computers is strongly constrained by gate counts, motivating techniques to reduce circuit depths. While tensor networks are natural competitors to quantum computers, we instead leverage them to support…
Dualities are hidden symmetries that map seemingly unrelated physical systems onto each other. The goal of this work is to systematically construct families of Hamiltonians endowed with a given duality and to provide a universal description…
We prove that every injective Matrix Product State is the unique ground state of a simple hopping theory. We start by studying the low energy spectrum of parent Hamiltonians of injective Matrix Product States in a particular long range and…
Accurate simulations of the Hubbard model are crucial to understanding strongly correlated phenomena, where small energy differences between competing orders demand high numerical precision. In this work, Neural Quantum States are used to…
Modeling of conservative systems with neural networks is an area of active research. A popular approach is to use Hamiltonian neural networks (HNNs) which rely on the assumptions that a conservative system is described with Hamilton's…
The problem of construction of a quantum master equation for a system of sites weakly coupled to each other and to one or more reservoirs (open quantum network) is considered. Microscopic derivation of a quantum master equation requires a…
The practical application of quantum technologies to chemical problems faces significant challenges, particularly in the treatment of realistic basis sets and the accurate inclusion of electron correlation effects. A direct approach to…
Understanding the entanglement structure of local Hamiltonian ground spaces is a physically motivated problem, with applications ranging from tensor network design to quantum error-correcting codes. To this end, we study the complexity of…
Correlated many-body problems ubiquitously appear in various fields of physics such as condensed matter physics, nuclear physics, and statistical physics. However, due to the interplay of the large number of degrees of freedom, it is…
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…
Exponential random graph theory is the complex network analog of the canonical ensemble theory from statistical physics. While it has been particularly successful in modeling networks with specified degree distributions, a naive model of a…
We show that ground states of unfrustrated quantum spin-1/2 systems on general lattices satisfy an entanglement area law, provided that the Hamiltonian can be decomposed into nearest-neighbor interaction terms which have entangled excited…
We show that quantum systems of extended objects naturally give rise to a large class of exotic phases - namely topological phases. These phases occur when the extended objects, called ``string-nets'', become highly fluctuating and…
We study the family of Hamiltonians which corresponds to the adjacency operators on a percolation graph. We characterise the set of energies which are almost surely eigenvalues with finitely supported eigenfunctions. This set of energies is…
For disordered harmonic oscillator systems over the $d$-dimensional lattice, we consider the problem of finding the bipartite entanglement of the uniform ensemble of the energy eigenstates associated with a particular number of modes. Such…
We describe the combinatorics of equilibria and steady states of neurons in threshold-linear networks that satisfy Dale's law. The combinatorial code of a Dale network is characterized in terms of two conditions: (i) a condition on the…