Related papers: Simulating Arbitrary Pair-Interactions by a Given …
A generalised extraction procedure for magnetic interactions using effective Hamiltonians is presented that is applicable to systems with more than two sites featuring local spins $S_i \geq 1$. To this end, closed, non-recursive expressions…
Light-matter interfaces are pivotal for quantum computation and communication. While typically analyzed using single-mode or open-quantum-system approximations, these models often neglect multi-mode field states and light-matter…
We construct commuting transfer matrices for models describing the interaction between a single quantum spin and a single bosonic mode using the quantum inverse scattering framework. The transfer matrices are obtained from certain…
Because of the significant increase in size and complexity of the networks, the distributed computation of eigenvalues and eigenvectors of graph matrices has become very challenging and yet it remains as important as before. In this paper…
We present a systematic method to expand the quantum complexity of interacting theory in series of coupling constant. The complexity is evaluated by the operator approach in which the transformation matrix between the second quantization…
So-called separation automata are in the core of several recently invented quasi-polynomial time algorithms for parity games. An explicit $q$-state separation automaton implies an algorithm for parity games with running time polynomial in…
Controlling the interaction graph between spins or qubits in a quantum simulator allows user-controlled tailoring of native interactions to achieve a target Hamiltonian. The flexibility of engineering long-ranged phonon-mediated spin-spin…
We propose a robust approach to spin squeezing with local interactions that approaches the Heisenberg limit of phase sensitivity. To generate the requisite entanglement, we generalize the paradigmatic two-axis countertwisting Hamiltonian --…
Understanding the quantum dynamics of spin defects and their coherence properties requires accurate modeling of spin-spin interaction in solids and molecules, for example by using spin Hamiltonians with parameters obtained from…
Although a universal quantum computer is still far from reach, the tremendous advances in controllable quantum devices, in particular with solid-state systems, make it possible to physically implement "quantum simulators". Quantum…
Decoupling the interactions in a spin network governed by a pair-interaction Hamiltonian is a well-studied problem. Combinatorial schemes for decoupling and for manipulating the couplings of Hamiltonians have been developed which use…
Photonic Ising Machines constitute an emergent new paradigm of computation, geared towards tackling combinatorial optimization problems that can be reduced to the problem of finding the ground state of an Ising model. Spatial Photonic Ising…
We study the problem of simulating the time evolution of a lattice Hamiltonian, where the qubits are laid out on a lattice and the Hamiltonian only includes geometrically local interactions (i.e., a qubit may only interact with qubits in…
We study Hamiltonicity in graphs obtained as the union of a deterministic $n$-vertex graph $H$ with linear degrees and a $d$-dimensional random geometric graph $G^d(n,r)$, for any $d\geq1$. We obtain an asymptotically optimal bound on the…
A model Hamiltonian that exhibits asymptotic freedom and a bound state, is used to show on example that similarity renormalization group procedure can be tuned to improve convergence of perturbative derivation of effective Hamiltonians,…
The construction of two-qubit gates appropriate for universal quantum computation is of enormous importance to quantum information processing. Building such gates is dependent on accurate knowledge of the interaction dynamics between two…
We first prove a one-to-one correspondence between finding Hamiltonian cycles in a cubic planar graphs and finding trees with specific properties in dual graphs. Using this information, we construct an exact algorithm for finding…
We consider the communication complexity of finding an approximate maximum matching in a graph in a multi-party message-passing communication model. The maximum matching problem is one of the most fundamental graph combinatorial problems,…
We present a proposal for the realization of entanglement Hamiltonians in one-dimensional critical spin systems with strongly interacting cold atoms. Our approach is based on the notion that the entanglement spectrum of such systems can be…
We prove that translationally invariant Hamiltonians of a chain of $n$ qubits with nearest-neighbour interactions have two seemingly contradictory features. Firstly in the limit $n\rightarrow\infty$ we show that any translationally…