Related papers: Global optimization of spin Hamiltonians with gain…
Oscillator Ising machines (OIMs) represent an exemplar case of using physics-inspired non-linear dynamical systems to solve computationally challenging combinatorial optimization problems (COPs). The computational performance of such…
We present a protocol to selectively decouple, recouple, and engineer effective couplings in mesoscopic dipolar spin networks. In particular, we develop a versatile protocol that relies upon magic angle spinning to perform Hamiltonian…
Differentiable simulation is a promising toolkit for fast gradient-based policy optimization and system identification. However, existing approaches to differentiable simulation have largely tackled scenarios where obtaining smooth…
We establish efficient algorithms for weakly-interacting quantum spin systems at arbitrary temperature. In particular, we obtain a fully polynomial-time approximation scheme for the partition function and an efficient approximate sampling…
This paper proposes an algorithmic technique for a class of optimal control problems where it is easy to compute a pointwise minimizer of the Hamiltonian associated with every applied control. The algorithm operates in the space of relaxed…
We explore the potential of spatial-photonic Ising machines (SPIMs) to address computationally intensive Ising problems that employ low-rank and circulant coupling matrices. Our results indicate that the performance of SPIMs is critically…
This report is concerned with the efficiency of numerical methods for simulating quantum spin systems, with the aim to implement an improved method for simulation of a time-dependent Hamiltonian that displays chirped pulses at a high…
We propose a method to obtain an improved Hamiltonian (action) for the Ising universality class in three dimensions. The improved Hamiltonian has suppressed leading corrections to scaling. It is obtained by tuning models with two coupling…
The theory of spin models intersects with condensed matter physics, complex systems, graph theory, combinatorial optimization, computational complexity and neural networks. Many ensuing applications rely on the fact that complicated spin…
Interacting spins in quantum magnet can cooperate and exhibit exotic states like the quantum spin liquid. To explore the materialization of such intriguing states, the determination of effective spin Hamiltonian of the quantum magnet is…
We explore a case example of networks of classical electronic oscillators evolving towards the solution of complex optimization problems. We show that when driven into subharmonic response, a network of such nonlinear electrical resonators…
We study Bosonic representation of spin Ising model with the application of simulating two level systems using continuous variable quantum processors. We decompose the time evolution of spin systems into a sequence of continuous variable…
Many-body entangled systems, in particular topologically ordered spin systems proposed as resources for quantum information processing tasks, often involve highly non-local interaction terms. While one may approximate such systems through…
The Ising model provides a natural mapping for many computationally hard combinatorial optimization problems (COPs). Consequently, dynamical system-inspired computing models and hardware platforms that minimize the Ising Hamiltonian, have…
We describe a simple quantum algorithm to simulate time-dependent Hamiltonian, extending the methodology of quantum signal processing. The framework achieves optimal scaling up to some factor with respect to other parameters, and nearly…
We propose an efficient quantum algorithm for simulating the dynamics of general Hamiltonian systems. Our technique is based on a power series expansion of the time-evolution operator in its off-diagonal terms. The expansion decouples the…
Optimization tasks are crucial in statistical machine learning. Recently, there has been great interest in leveraging tools from dynamical systems to derive accelerated and robust optimization methods via suitable discretizations of…
Recent technological developments have focused the interest of the quantum computing community on investigating how near-term devices could outperform classical computers for practical applications. A central question that remains open is…
We propose a method for obtaining effective classical Hamiltonians \cal H for many-body quantum spin systems with large spins. This method uses the coherent-state representation of the partition function Z and the cumulant expansion in…
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…