HackerPapers

arXiv:2005.03791quant-ph

The Power of Adiabatic Quantum Computation with No Sign Problem

M. B. Hastings

HN submission. Found in a submission link or body. Submitters do not count as commenters in the main ranking; a submission is not an endorsement.

Abstract

We show a superpolynomial oracle separation between the power of adiabatic quantum computation with no sign problem and the power of classical computation.

arXiv comments
22 pages, 2 figures; v2 final version in Quantum
Journal reference
Quantum 5, 597 (2021)
DOI
doi:10.22331/q-2021-12-06-597
Subjects
quant-phQuantum Physics

On Hacker News

No comments linking this paper were found in the collected sources. Found in 1 HN submission from May 2020 to May 2020. Open submission discussions.

Comments linking this paper, per year.

Discussed in comments0 threads

No comments linking this paper were found in the collected sources. Open submission discussions.

Submitted to Hacker News

Connected through shared HN threads, not inferred similarity or a recommendation.