Related papers: Treating the Independent Set Problem by 2D Ising I…
The Maximum Cut (Max-Cut) problem could be naturally expressed either in a Quadratic Unconstrained Binary Optimization (QUBO) formulation, or as an Ising model. It has long been known that the Maximum Independent Set (MIS) problem could…
In quantum information processing, one of the most useful interaction between qubits is the Ising type interaction. We propose a scheme to implement the exact Ising interaction through magnetic dipole-dipole interaction. Although magnetic…
We study a class of quantum two-dimensional models with complex potentials of specific form. They can be considered as the generalization of a recently studied model with quadratic interaction not amenable to conventional separation of…
We describe a path-integral approach for including nuclear quantum effects in non-adiabatic chemical dynamics simulations. For a general physical system with multiple electronic energy levels, a corresponding isomorphic Hamiltonian is…
We consider quantum systems consisting of a linear chain of n harmonic oscillators coupled by a nearest neighbour interaction of the form $-q_r q_{r+1}$ ($q_r$ refers to the position of the $r$th oscillator). In principle, such systems are…
Adiabatic transformation can be approximated as alternating unitary operators of a Hamiltonian and its parameter derivative as proposed in a gate-based approach to counterdiabatic driving (van Vreumingen, arXiv:2406.08064). In this paper,…
In the Graph Isomorphism problem two N-vertex graphs G and G' are given and the task is to determine whether there exists a permutation of the vertices of G that preserves adjacency and transforms G into G'. If yes, then G and G' are said…
We proposed the method that translates the 2-D CSP for minimizing the number of cuts to the Ising model. After that, we conducted computer experiments of the proposed model using the benchmark problem. From the above, the following results…
Farhi and others have introduced the notion of solving NP problems using adiabatic quantum com- puters. We discuss an application of this idea to the problem of integer factorization, together with a technique we call gluing which can be…
In this work, we consider a parameterized Ising model with long-range symmetric pairwise interactions on a network of spin $\frac{1}{2}$ particles. The system is designed with symmetric dynamics, allowing for the reduction of the state…
Significant efforts are being directed towards developing a quantum annealer capable of solving combinatorial optimization problems. The challenges are Hamiltonian programming and large-scale implementations. Here we report quantum…
Adiabatic Quantum Computing (AQC) is a relatively new subject in the world of quantum computing, let alone Physics. Inspiration for this project has come from recent controversy around D-Wave Systems in British Columbia, Canada, who claim…
We investigate theoretically systems of ions in segmented linear Paul traps for the quantum simulation of quantum spin models with tunable interactions. The scheme is entirely general and can be applied to the realization of arbitrary…
Variational methods have offered controllable and powerful tools for capturing many-body quantum physics for decades. The recent introduction of expressive neural network quantum states has enabled the accurate representation of a broad…
A number of many-body problems can be formulated using Hamiltonians that are quadratic in the creation and annihilation operators. Here, we show how such quadratic Hamiltonians can be efficiently estimated indirectly, employing very few…
The dilation method is a practical way to experimentally simulate non-Hermitian, especially $\cal PT$-symmetric quantum systems. However, the time-dependent dilation problem cannot be explicitly solved in general. In this paper, we present…
Recent work has shown that probabilistic models based on pairwise interactions-in the simplest case, the Ising model-provide surprisingly accurate descriptions of experiments on real biological networks ranging from neurons to genes.…
Quantum annealers can be used to solve many (possibly NP-hard) combinatorial optimization problems, by formulating them as quadratic unconstrained binary optimization (QUBO) problems or, equivalently, using the Ising formulation. In this…
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…
Spin models are the prime example of simplified manybody Hamiltonians used to model complex, real-world strongly correlated materials. However, despite their simplified character, their dynamics often cannot be simulated exactly on…