Message-passing algorithm of quantum annealing with nonstoquastic Hamiltonian

01/21/2019
by   Masayuki Ohzeki, et al.
0

Quantum annealing (QA) is a generic method for solving optimization problems using fictitious quantum fluctuation. The current device performing QA involves controlling the transverse field; it is classically simulatable by using the standard technique for mapping the quantum spin systems to the classical ones. In this sense, the current system for QA is not powerful despite utilizing quantum fluctuation. Hence, we developed a system with a time-dependent Hamiltonian consisting of a combination of the formulated Ising model and the "driver" Hamiltonian with only quantum fluctuation. In the previous study, for a fully connected spin model, quantum fluctuation can be addressed in a relatively simple way. We proved that the fully connected antiferromagnetic interaction can be transformed into a fluctuating transverse field and is thus classically simulatable at sufficiently low temperatures. Using the fluctuating transverse field, we established several ways to simulate part of the nonstoquastic Hamiltonian on classical computers. We formulated a message-passing algorithm in the present study. This algorithm is capable of assessing the performance of QA with part of the nonstoquastic Hamiltonian having a large number of spins. In other words, we developed a different approach for simulating the nonstoquastic Hamiltonian without using the quantum Monte Carlo technique. Our results were validated by comparison to the results obtained by the replica method.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/05/2021

Essentiality of the Non-stoquastic Hamiltonians and Driver Graph Design in Quantum Optimization Annealing

One of the distinct features of quantum mechanics is that the probabilit...
research
08/10/2023

Test Case Minimization with Quantum Annealers

Quantum annealers are specialized quantum computers for solving combinat...
research
05/19/2013

Quantum Annealing for Dirichlet Process Mixture Models with Applications to Network Clustering

We developed a new quantum annealing (QA) algorithm for Dirichlet proces...
research
02/13/2020

Breaking limitation of quantum annealer in solving optimization problems under constraints

Quantum annealing is a generic solver for optimization problems that use...
research
05/10/2022

FastHare: Fast Hamiltonian Reduction for Large-scale Quantum Annealing

Quantum annealing (QA) that encodes optimization problems into Hamiltoni...
research
06/22/2020

Constructing Driver Hamiltonians for Several Linear Constraints

Recent advances in the field of adiabatic quantum computing and the clos...
research
06/22/2018

Physics-inspired optimization for constraint-satisfaction problems using a digital annealer

The Fujitsu Digital Annealer is designed to solve fully-connected quadra...

Please sign up or login with your details

Forgot password? Click here to reset