Related papers: A strong-weak coupling duality between two perturb…
We consider the Ising model for two interacting groups of spins embedded in an Erd\"{o}s-R\'{e}nyi random graph. The critical properties of the system are investigated by means of extensive Monte Carlo simulations. Our results evidence the…
We study the robustness of a generalized Kitaev's toric code with Z_N degrees of freedom in the presence of local perturbations. For N=2, this model reduces to the conventional toric code in a uniform magnetic field. A quantitative analysis…
The richness of many complex systems stems from the interactions among their components. The higher-order nature of these interactions, involving many units at once, and their temporal dynamics constitute crucial properties that shape the…
We show that a class of exactly solvable quantum Ising models, including the transverse-field Ising model and anisotropic XY model, can be characterized as the loops in a two-dimensional auxiliary space. The transverse-field Ising model…
The 2-block intersection graph (2-BIG) of a twofold triple system (TTS) is the graph whose vertex set is composed of the blocks of the TTS and two vertices are joined by an edge if the corresponding blocks intersect in exactly two elements.…
Graph structure of quantum spin networks plays an essential role in applying quantum annealing (QA). The Ising model is the typical choice to describe the interactions between the spins in the networks. Here, we explore the interplay of…
Characterization of qubit couplings in many-body quantum systems is essential for benchmarking quantum computation and simulation. We propose a tomographic measurement scheme to determine all the coupling terms in a general many-body…
We analyze the Hilbert space connectivity of the $L$ site PXP-model by constructing the Hamiltonian matrices via a Gray code numbering of basis states. The matrices are all formed out of a single Hamiltonian-path backbone and entries on…
The dynamical conductivity of interacting multiband electronic systems derived in Ref.[1] is shown to be consistent with the general form of the Ward identity. Using the semiphenomenological form of this conductivity formula, we have…
We consider the problem of learning the structure of ferromagnetic Ising models Markov on sparse Erdos-Renyi random graph. We propose simple local algorithms and analyze their performance in the regime of correlation decay. We prove that an…
Rydberg-atom quantum simulators are of keen interest because of their possibilities towards high-dimensional qubit architectures. Here we report three-dimensional conformation spectra of quantum-Ising Hamiltonian systems with programmed…
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…
It is well known that an exponentially localized Hamiltonian must be gapless if its ground state has algebraic correlations. We show that even certain exponentially decaying correlations can imply gaplessness. This is exemplified by the…
We derive simplified Faddeev type equations for the three particle T-matrix which are valid in the Hubbard model where only electrons with opposite spins interact. Using the approximation of dynamical mean field theory these equations are…
We investigate classes of interacting systems that allow for a mapping to disordered noninteracting systems. As we show, such a mapping is possible for interacting systems with a suppressed density of states at the chemical potential,…
Growth of graphene on monolayer transition-metal dichalcogenides presents opening on band gap and giant spin-orbit coupling which paves the way to achieve a useful hybrid structure for electronics and spintronics applications. Increase of…
We explore the effectiveness of variational quantum circuits in simulating the ground states of quantum many-body Hamiltonians. We show that generic high-depth circuits, performing a sequence of layer unitaries of the same form, can…
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by solving instances of the HSP. A common feature of the…
The identification of parameters in the Hamiltonian that describes complex many-body quantum systems is generally a very hard task. Recent attention has focused on such problems of Hamiltonian tomography for networks constructed with…
In the field of monitored quantum circuits, it has remained an open question whether finite-time protocols for preparing long-range entangled states lead to phases of matter which are stable to gate imperfections, which can convert…