(Sub)Exponential advantage of adiabatic Quantum computation with no sign problem

DOI10.1145/3406325.3451060arXiv2011.09495OpenAlexW3167544365WikidataQ130910727 ScholiaQ130910727MaRDI QIDQ6065259

Matthew B. Hastings, Umesh V. Vazirani, András Pal Gilyén

Publication date: 14 November 2023

Published in: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

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

zbMATH Keywords

quantum walkadiabatic quantum computationstoquasticglued-treessign-problem-freesparse Hamiltonianwelded-trees

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Why adiabatic quantum annealing is unlikely to yield speed-up

This page was built for publication: (Sub)Exponential advantage of adiabatic Quantum computation with no sign problem