Related papers: Exact Spin Elimination in Ising Hamiltonians and E…
We study the problem of determining the Hamiltonian of a fully connected Ising Spin Glass of $N$ units from a set of measurements, whose sizes needs to be ${\cal O}(N^2)$ bits. The student-teacher scenario, used to study learning in…
Ising machines (IMs) are specialized devices designed to efficiently solve combinatorial optimization problems (COPs). They consist of artificial spins that evolve towards a low-energy configuration representing a problem's solution. Most…
Determining properties of ground states of spin Hamiltonians remains a topic of central relevance connecting disciplines of mathematical, theoretical and applied physics. In the last few decades, ground state properties of physical systems…
Simulation of quantum systems is notoriously challenging for classical computers, while quantum hardware is naturally well-suited for this task. However, the imperfections of contemporary quantum systems poses a considerable challenge in…
Implementing the time evolution under a desired target Hamiltonian is critical for various applications in quantum science. Due to the exponential increase in the number of parameters with system size and experimental imperfections, this…
Recently, spatial photonic Ising machines (SPIM) have been demonstrated to compute the minima of Hamiltonians for large-scale spin systems. Here we propose to implement an antiferromagnetic model through optoelectronic correlation computing…
We initiate a research program for the systematic investigation of quantum superintegrable systems involving the interaction of two non-relativistic particles with spin $1/2$ moving in the three-dimensional Euclidean space. In this paper,…
We propose a time-independent Hamiltonian protocol for the reversal of qubit ordering in a chain of $N$ spins. Our protocol has an easily implementable nearest-neighbor, transverse-field Ising model Hamiltonian with time-independent,…
What is the simplest Hamiltonian which can implement quantum computation without requiring any control operations during the computation process? In a previous paper we have constructed a 10-local finite-range interaction among qubits on a…
We show that the two dimensional Ising model is complete, in the sense that the partition function of any lattice model on any graph is equal to the partition function of the 2D Ising model with complex coupling. The latter model has all…
Ising machines (IM) are physics-inspired alternatives to von Neumann architectures for solving hard optimization tasks. By mapping binary variables to coupled Ising spins, IMs can naturally solve unconstrained combinatorial optimization…
We present a methodology for generating Ising Hamiltonians of tunable complexity and with a priori known ground states based on a decomposition of the model graph into edge-disjoint subgraphs. The idea is illustrated with a spin-glass model…
The presence of symmetries, be they discrete or continuous, in a physical system typically leads to a reduction in the problem to be solved. Here we report that neither translational invariance nor rotational invariance reduce the…
Precise control of quantum systems is of fundamental importance for quantum device engineering, such as is needed in the fields of quantum information processing, high-resolution spectroscopy and quantum metrology. When scaling up the…
Feature selection is of great importance in Machine Learning, where it can be used to reduce the dimensionality of classification, ranking and prediction problems. The removal of redundant and noisy features can improve both the accuracy…
Ising machines -- special-purpose hardware for heuristically solving Ising optimization problems -- based on probabilistic bits (p-bits) have been established as a promising alternative to heuristic optimization algorithms run on…
We present a new technique for efficiently simulating (in polynomial time) a class of one-dimensional (1D) dissipative spin chains that, when mapped to fermions, have quadratic Hamiltonians, with the only nonlinearity coming from…
We discuss classical algorithms for approximating the largest eigenvalue of quantum spin and fermionic Hamiltonians based on semidefinite programming relaxation methods. First, we consider traceless $2$-local Hamiltonians $H$ describing a…
Commuting Hamiltonians lie at the boundary between classical constraint satisfaction and quantum many-body physics, exhibiting rich quantum structure while remaining more tractable than general noncommuting models. In contrast, physical…
We propose a scheme to engineer an effective spin Hamiltonian starting from a system of electrons confined in micro-Penning traps. By means of appropriate sequences of electromagnetic pulses, alternated to periods of free evolution, we…