Quantum Monte Carlo simulation of a particular class of non-stoquastic Hamiltonians in quantum annealing
Quantum annealing is a generic solver of the optimization problem that uses fictitious quantum fluctuation. Its simulation in classical computing is often performed using the quantum Monte Carlo simulation via the Suzuki--Trotter decomposition. However, the negative sign problem sometimes emerges in the simulation of quantum annealing with an elaborate driver Hamiltonian, since it belongs to a class of non-stoquastic Hamiltonians. In the present study, we propose an alternative way to avoid the negative sign problem involved in a particular class of the non-stoquastic Hamiltonians. To check the validity of the method, we demonstrate our method by applying it to a simple problem that includes the anti-ferromagnetic XX interaction, which is a typical instance of the non-stoquastic Hamiltonians.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Recommender Engine for Continuous Time Quantum Monte Carlo Methods
Recommender systems play an essential role in the modern business world. They recommend favorable items like books, movies, and search queries to users based on their past preferences. Applying similar ideas and techniqu…
Recommendation SystemsMachine-Learning Study using Improved Correlation Configuration and Application to Quantum Monte Carlo Simulation
We use the Fortuin-Kasteleyn representation based improved estimator of the correlation configuration as an alternative to the ordinary correlation configuration in the machine-learning study of the phase classification …
BIG-bench Machine LearningClassificationGeneral ClassificationConditional Born machine for Monte Carlo event generation
Generative modeling is a promising task for near-term quantum devices, which can use the stochastic nature of quantum measurements as a random source. So called Born machines are purely quantum models and promise to gene…
Stochastic Security as a Performance Metric for Quantum-enhanced Generative AI
Motivated by applications of quantum computers in Gibbs sampling from continuous real-valued functions, we ask whether such algorithms can provide practical advantages for machine learning models trained on classical dat…
Adversarial RobustnessAntithetic Riemannian Manifold And Quantum-Inspired Hamiltonian Monte Carlo
Markov Chain Monte Carlo inference of target posterior distributions in machine learning is predominately conducted via Hamiltonian Monte Carlo and its variants. This is due to Hamiltonian Monte Carlo based samplers abil…