相关论文: Simulating Arbitrary Pair-Interactions by a Given …
The spin--network quantum simulator model, which essentially encodes the (quantum deformed) SU(2) Racah--Wigner tensor algebra, is particularly suitable to address problems arising in low dimensional topology and group theory. In this…
We report on recent advances in rule-based graph programming, which allow us to match the time complexity of some fundamental imperative graph algorithms. In general, achieving the time complexity of graph algorithms implemented in…
Based on the standard many-fermion field theory, the authors construct models describing ultracold fermions in a 1D optical lattices by implementing a mode expansion of the fermionic field operator where modes, in addition to space…
Line-narrowing by periodic modulation of nuclear spin interaction Hamiltonians is the central element of various experimental techniques in NMR spectroscopy. In this study, we present a theoretical formulation of coherent averaging to…
This article is devoted to propose some lower and upper bounds for the coupled-tasks scheduling problem in presence of compatibility constraints according to classical complexity hypothesis ($\mathcal{P} \neq \mathcal{NP}$,…
In this paper we present a unifying geometric and compositional framework for modeling complex physical network dynamics as port-Hamiltonian systems on open graphs. Basic idea is to associate with the incidence matrix of the graph a Dirac…
We consider a network of n spin 1/2 systems which are pairwise interacting via Ising interaction and are controlled by the same electro-magnetic control field. Such a system presents symmetries since the Hamiltonian is unchanged if we…
We propose a simple realization of a quantum simulator of the Riemann-Hurwitz (RH) \zeta\ function based on a truncation of its Dirichlet representation. We synthesize a nearest-neighbour-interaction Hamiltonian, satisfying the property…
We study the computational complexity of Feedback Vertex Set on subclasses of Hamiltonian graphs. In particular, we consider Hamiltonian graphs that are regular or are planar and regular. Moreover, we study the less known class of…
In this paper we present the first deterministic polynomial time algorithm for determining the existence of a Hamiltonian cycle and finding a Hamiltonian cycle in general graphs. Our algorithm can also solve the Hamiltonian path problem in…
Recent advances in analog and digital quantum-simulation platforms have enabled exploration of the spectrum of entanglement Hamiltonians via variational algorithms. In this work we analyze the convergence properties of the variationally…
A fundamental axiom of quantum mechanics requires the Hamiltonians to be Hermitian which guarantees real eigen-energies and probability conservation. However, a class of non-Hermitian Hamiltonians with Parity-Time ($\mathcal{PT}$) symmetry…
We develop a new method that allows us to map models of interacting fermions onto bosonic models describing collective excitations in an arbitrary dimension. This mapping becomes exact in the thermodynamic continuous time limit. The boson…
We consider random translation-invariant frustration-free quantum spin Hamiltonians on $\mathbb Z^D$ in which the nearest-neighbor interaction in every direction is randomly sampled and then distributed across the lattice. Our main result…
Finding Hamitonian Cycles in square grid graphs is a well studied and important questions. More recent work has extended these results to triangular and hexagonal grids, as well as further restricted versions. In this paper, we examine a…
We study necessary conditions for the efficient simulation of both bipartite and multipartite Hamiltonians, which are independent of the eigenvalues and based on the algebraic-geometric invariants introduced in [1-2]. Our results indicate…
We construct a family of integrable vertex model based on the typical four-dimensional representations of the quantum group deformation of the Lie superalgebra $sl(2|1)$. Upon alternation of such a representation with its dual this model…
We propose and analyze an approach to realize quantum computation and simulation using fermionic particles under quantum gas microscopes. Our work is inspired by a recent experimental demonstration of large-scale quantum registers, where…
Density functional theory maps an interacting Hamiltonian onto the Kohn-Sham Hamiltonian, an explicitly free model with identical local fermion densities. Using the interaction distance, the minimum distance between the ground state of the…
We present a novel graph-theoretic approach to simplifying generic many-body Hamiltonians. Our primary result introduces a recursive twin-collapse algorithm, leveraging the identification and elimination of symmetric vertex pairs (twins),…