Related papers: Programmable Superpositions of Ising Configuration…
Positioned between crystalline solids and liquids, disordered many-particle systems which are stealthy and hyperuniform represent new states of matter that are endowed with novel physical and thermodynamic properties. Such stealthy and…
Non-deterministic polynomial-time (NP) problems are ubiquitous in almost every field of study. Recently, all-optical approaches have been explored for solving classic NP problems based on the spin-glass Ising Hamiltonian. However, obtaining…
We formulate a new geometrical string on the euclidean lattice. It is possible to find such spin systems with local interaction which reproduce the same surface dynamics.In the three-dimensional case this spin system is a usual Ising…
Dynamical Ising machines achieve accelerated solving of complex combinatorial optimization problems by remapping the convergence to the ground state of the classical spin networks to the evolution of specially constructed continuous…
A shortcut to an adiabatic scheme is proposed for preparing a massive object in a macroscopic spatial superposition state. In this scheme we propose to employ counterdiabatic driving to maintain the system in the ground state of its…
The scaling of fluctuations in the distribution of ground-state energies or costs with the system size N for Ising spin glasses is considered using an extensive set of simulations with the Extremal Optimization heuristic across a range of…
We demonstrate through two case studies, one on the p-spin interaction model and the other on the random K-satisfiability problem, that a heterogeneity transition occurs to the ground-state configuration space of a random…
One-flip stable configurations of an Ising-model on a random graph with fluctuating connectivity are examined. In order to perform the quenched average of the number of stable configurations we introduce a global order-parameter function…
Ising machines, which are dynamical systems designed to operate in a parallel and iterative manner, have emerged as a new paradigm for solving combinatorial optimization problems. Despite computational advantages, the quality of solutions…
We analyze a scheme for preparation of magnetically ordered states of two-component bosonic atoms in optical lattices. We compute the dynamics during adiabatic and optimized time-dependent ramps to produce ground states of effective spin…
We provide Ising formulations for many NP-complete and NP-hard problems, including all of Karp's 21 NP-complete problems. This collects and extends mappings to the Ising model from partitioning, covering and satisfiability. In each case,…
We realize a driven-dissipative Ising spin glass using cavity QED in a novel ``4/7" multimode geometry. Gases of ultracold atoms trapped within the cavity by optical tweezers serve as effective spins. They are coupled via randomly signed,…
Engineered dissipation offers a promising route to prepare correlated quantum many-body states that are otherwise difficult to access using purely unitary protocols. However, creating superpositions of multiple many-body eigenstates with…
Low-temperature spin dynamics can become trapped in long-lived patterns shaped by the geometry of the interaction network. Here we introduce Chladni states: spin configurations obtained by binarizing the eigenmodes of the interaction…
Statistical spin dynamics plays a key role to understand the working principle for novel optical Ising machines. Here we propose the gauge transformations for spatial photonic Ising machine, where a single spatial phase modulator…
Many hard combinatorial problems can be mapped onto Ising models, which replicate the behavior of classical spins. Recent advances in probabilistic computers are characterized by parallelization and the introduction of novel hardware…
We study a single two-level system coupled resonantly to an oscillator mode or a large spin. By adiabatically turning on a linear driving term on the oscillator or the spin, the eigenstates of the system change character and its ground…
A promising paradigm of quantum computing for achieving practical quantum advantages is quantum annealing or quantum approximate optimization algorithm, where the classical problems are encoded in Ising interactions. However, it is…
We are able to perform the duality transformation of the spin system which was found before as a lattice realization of the string with linear action. In four and higher dimensions this spin system can be described in terms of a…
Simulating a network of Ising spins with physical systems is now emerging as a promising approach for solving mathematically intractable problems. Here we report a large-scale network of artificial spins based on degenerate optical…