Iterative classical superadiabatic algorithm for combinatorial optimization

DOI10.1088/1751-8121/AB83C7OpenAlexW3101392453MaRDI QIDQ5869986FDOQ5869986

Authors: Takuya Hatomura 

Publication date: 13 January 2023

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.08707

Recommendations

• Different adiabatic quantum optimization algorithms for the NP-complete exact cover and 3SAT problems
• The complexity of the quantum adiabatic algorithm
• Quantum optimization
• Combinatorial optimization by simulating adiabatic bifurcations in nonlinear Hamiltonian systems
• The quantum adiabatic optimization algorithm and local minima

zbMATH Keywords

classical modelshortcuts to adiabaticityquantum adiabatic algorithms

Mathematics Subject Classification ID

Statistical mechanics, structure of matter (82-XX) Quantum theory (81-XX)

Cites Work

• A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem
• Colloquium: Quantum annealing and analog quantum computation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Transitionless quantum driving

This page was built for publication: Iterative classical superadiabatic algorithm for combinatorial optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5869986)