相关论文: Optimization in random field Ising models by quant…
We introduce transverse ferromagnetic interactions, in addition to a simple transverse field, to quantum annealing of the random-field Ising model to accelerate convergence toward the target ground state. The conventional approach using…
The random field Ising model in three dimensions with Gaussian random fields is studied at zero temperature for system sizes up to 60^3. For each realization of the normalized random fields, the strength of the random field, Delta and a…
In this paper we show quantum fluctuation effect of fully frustrated Ising spin systems. Quantum annealing has been expected to be an efficient method to find ground state of optimization problems. However it is not clear when to use the…
We compare the ground state of the random-field Ising model with Gaussian distributed random fields, with its non-equilibrium hysteretic counterpart, the demagnetized state. This is a low energy state obtained by a sequence of slow magnetic…
A large class of optimisation problems can be mapped to the Ising model where all details are encoded in the coupling of spins. The task of the original mathematical optimisation is then equivalent to finding the ground state of the…
The rotational and fine structure of open-shell molecules in a $\Sigma$ electronic state gives rise to crossings between Zeeman states of different parity. These crossings become avoided in the presence of an electric field. We propose an…
Quantum annealing is a promising algorithm for solving combinatorial optimization problems. It searches for the ground state of the Ising model, which corresponds to the optimal solution of a given combinatorial optimization problem. The…
We derive a generic bound on the rate of decrease of transverse field for quantum annealing to converge to the ground state of a generic Ising model when quantum annealing is formulated as an infinite-time process. Our theorem is based on a…
Quantum annealing is an innovative idea and method for avoiding the increase of the calculation cost of the combinatorial optimization problem. Since the combinatorial optimization problems are ubiquitous, quantum annealing machine with…
Quantum annealing method has been widely attracted attention in statistical physics and information science since it is expected to be a powerful method to obtain the best solution of optimization problem as well as simulated annealing. The…
The ability to evaluate the outcomes of quantum annealers is essential for such devices to be used in complex computational tasks. We introduce a statistical test of the quality of Ising-based annealers' output based on the data only,…
The success of a quantum annealing algorithm requires a polynomial scaling of the energy gap. Recently it was shown that a two-dimensional transverse-field Ising model on a square lattice with nearest-neighbor $\pm J$ random coupling has a…
We use superconducting qubit quantum annealing devices to determine the ground state of Ising models with algebraically decaying competing long-range interactions in the thermodynamic limit. This is enabled by a unit-cell-based optimization…
We find the ground-state energy of the Ising model using the Cascaded Variational Quantum Eigensolver (CVQE) algorithm with the Guided-Sampling Ansatz (GSA) using up to 63 qubits on a quantum computer. We study a heavy-hex lattice to match…
Traditional simulated annealing utilizes thermal fluctuations for convergence in optimization problems. Quantum tunneling provides a different mechanism for moving between states, with the potential for reduced time scales. We compare…
We explore the role of entanglement in adiabatic quantum optimization by performing approximate simulations of the real-time evolution of a quantum system while limiting the amount of entanglement. To classically simulate the time evolution…
We discuss quantum annealing of the two-dimensional transverse-field Ising model on a D-Wave device, encoded on $L \times L$ lattices with $L \le 32$. Analyzing the residual energy and deviation from maximal magnetization in the final…
The presence of a bias field, encoding some information about the target state, can enhance the performance of quantum optimization methods. Here we investigate the effect of such a bias field on the outcome of quantum annealing sampling,…
Quantum optimization algorithms offer a promising route to finding the ground states of target Hamiltonians on near-term quantum devices. None the less, it remains necessary to limit the evolution time and circuit depth as much as possible,…
Ant colony optimization (ACO) leverages the parameter $\alpha$ to modulate the decision function's sensitivity to pheromone levels, balancing the exploration of diverse solutions with the exploitation of promising areas. Identifying the…