Related papers: Exact Spin Elimination in Ising Hamiltonians and E…
We describe an efficient approximation algorithm for evaluating the ground-state energy of the classical Ising Hamiltonian with linear terms on an arbitrary planar graph. The running time of the algorithm grows linearly with the number of…
Classical or quantum physical systems can simulate the Ising Hamiltonian for large-scale optimization and machine learning. However, devices such as quantum annealers and coherent Ising machines suffer an exponential drop in the probability…
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…
An algebraic method has been developed which allows one to engineer several energy levels including the low-energy subspace of interacting spin systems. By introducing ancillary qubits, this approach allows k-body interactions to be…
We consider here the problem of a "giant spin", with spin quantum number S>>1, interacting with a set of microscopic spins. Interactions between the microscopic spins are ignored. This model describes the low-energy properties of magnetic…
We present a numerical method based on real-space renormalization that outputs the exact ground space of "frustration-free" Hamiltonians. The complexity of our method is polynomial in the degeneracy of the ground spaces of the Hamiltonians…
We propose a method for Hamiltonian engineering in quantum information processing architectures that requires no local control, but only relies on collective qubit rotations and field gradients. The technique achieves a spatial modulation…
The reliable simulation of spin models is of critical importance to tackle complex optimization problems that are intractable on conventional computing machines. The recently introduced hyperspin machine, which is a network of linearly and…
Spatial photonic Ising machines offer a novel optical platform for optimization and spin-model simulation, but existing diffraction-based schemes rely on auxiliary spins or multiplexing to encode high-rank couplings and external fields,…
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…
Hamiltonian truncation is a non-perturbative numerical method for calculating observables of a quantum field theory. The starting point for this method is to truncate the interacting Hamiltonian to a finite-dimensional space of states…
We present a systematic derivation of effective lattice spin Hamiltonians derived from a rotationally invariant multi-orbital Hubbard model including a term ensuring Hund's rule coupling. The Hamiltonians are derived down-folding the…
Ising formulations are widely utilized to solve combinatorial optimization problems, and a variety of quantum or semiconductor-based hardware has recently been made available. In combinatorial optimization problems, the existence of local…
For spins chains to be useful for quantum information processing tasks, the interaction between the spin chain and its environment generally needs to be suppressed. In this paper, we propose the use of strong static and oscillating control…
We investigate the minimization of Ising Hamiltonians, comparing the performance of gain-based computing paradigms based on the dynamics of semi-classical soft-spin models with quantum annealing. We systematically analyze how the energy…
Recently, several platforms were proposed and demonstrated a proof-of-principle for finding the global minimum of the spin Hamiltonians such as the Ising and XY models using gain-dissipative quantum and classical systems. The implementation…
The Markov decision process is the mathematical formalization underlying the modern field of reinforcement learning when transition and reward functions are unknown. We derive a pseudo-Boolean cost function that is equivalent to a K-spin…
It has been established that local lattice spin Hamiltonians can be used for universal adiabatic quantum computation. However, the 2-local model Hamiltonians used in these proofs are general and hence do not limit the types of interactions…
The problem 2-LOCAL HAMILTONIAN has been shown to be complete for the quantum computational class QMA, see quant-ph/0406180. In this paper we show that this important problem remains QMA-complete when the interactions of the 2-local…
We present an exact simulation of a one-dimensional transverse Ising spin chain with a quantum computer. We construct an efficient quantum circuit that diagonalizes the Ising Hamiltonian and allows to obtain all eigenstates of the model by…