Related papers: Exact Spin Elimination in Ising Hamiltonians and E…
We apply a quantum adiabatic evolution algorithm to a combinatorial optimization problem where the cost function depends entirely on the of the number of unit bits in a n-bit string (Hamming weight). The solution of the optimization problem…
We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions…
Hamiltonian Truncation Effective Theory is a framework that aims to improve the results of Hamiltonian truncation in a systematic, order-by-order fashion using Effective Field Theory methodology. The result is a truncated effective…
A systematic search for superintegrable quantum Hamiltonians describing the interaction between two particles with spin 0 and 1/2, is performed. We restrict to integrals of motion that are first-order (matrix) polynomials in the components…
Here we first discuss briefly the quantum annealing technique. We then study the quantum annealing of Sherrington-Kirkpatrick spin glass model with the tuning of both transverse and longitudinal fields. Both the fields are time-dependent…
A pivotal task for quantum computing is to speed up solving problems that are both classically intractable and practically valuable. Among these, combinatorial optimization problems have attracted tremendous attention due to their broad…
We develop a classical bit-flip correction method to mitigate measurement errors on quantum computers. This method can be applied to any operator, any number of qubits, and any realistic bit-flip probability. We first demonstrate the…
Using the Trace Minimization Algorithm, we carried out an exact calculation of entanglement in a 19-site two-dimensional transverse Ising model. This model consists of a set of localized spin-1/2 particles in a two dimensional triangular…
We propose a hybrid quantum-classical algorithm to compute approximate solutions of binary combinatorial problems. We employ a shallow-depth quantum circuit to implement a unitary and Hermitian operator that block-encodes the weighted…
We search for short-range Hamiltonians of finite spin-1 kagome systems, maximizing the overlaps with lattice Moore-Read states. Our starting point is an exact, long-range parent Hamiltonian for such a state on a finite plane, obtained from…
One of the long standing problems in quantum chemistry had been the inability to exploit full spatial and spin symmetry of an electronic Hamiltonian belonging to a non-Abelian point group. Here we present a general technique which can…
We derive an effective spin Hamiltonian for the one-dimensional half-filled Alternating Hubbard model in the limit of strong on-site repulsion. We show that the effective Hamiltonian is a spin $S=1/2$ Heisenberg chain with asymmetric…
A quadrillion dimensional Hilbert space hosted by a quantum processor with over 50 physical qubits has been expected to be powerful enough to perform computational tasks ranging from simulations of many-body physics to complex financial…
Quantum and classical physics can be used for mathematical computations that are hard to tackle by conventional electronics. Very recently, optical Ising machines have been demonstrated for computing the minima of spin Hamiltonians, paving…
Recent years have seen significant advances in quantum/quantum-inspired technologies capable of approximately searching for the ground state of Ising spin Hamiltonians. The promise of leveraging such technologies to accelerate the solution…
The coherent Ising machine (CIM) enables efficient sampling of low-lying energy states of the Ising Hamiltonian with all-to-all connectivity by encoding the spins in the amplitudes of pulsed modes in an optical parametric oscillator (OPO).…
We present a hybrid classical/quantum algorithm for efficiently solving the eigenvalue problem of many-particle Hamiltonians on quantum computers with limited resources by splitting the workload between classical and quantum processors.…
The past decade has seen the emergence of Ising machines targeting hard combinatorial optimization problems by minimizing the Ising Hamiltonian with spins represented by continuous dynamical variables. However, capabilities of these…
We present an exact analytical solution for the one-dimensional Ising model in the presence of an external magnetic field applied periodically to every $k$-th site. The problem is handled using the symmetrized transfer matrix approach, we…
We propose a detailed analysis of datasets generated from simulations of two-dimensional quantum spin systems using the quantum Ising model at absolute zero temperature. Our focus is on examining how fundamental physical properties, energy,…