Toward the first quantum simulation with quantum speedup

From MaRDI portal
Publication:4967461

DOI10.1073/PNAS.1801723115zbMATH Open1415.68107arXiv1711.10980OpenAlexW2775106578WikidataQ61604336 ScholiaQ61604336MaRDI QIDQ4967461FDOQ4967461


Authors: Andrew M. Childs, Dmitri Maslov, Yunseong Nam, Neil J. Ross, Yuan Su Edit this on Wikidata


Publication date: 3 July 2019

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Abstract: With quantum computers of significant size now on the horizon, we should understand how to best exploit their initially limited abilities. To this end, we aim to identify a practical problem that is beyond the reach of current classical computers, but that requires the fewest resources for a quantum computer. We consider quantum simulation of spin systems, which could be applied to understand condensed matter phenomena. We synthesize explicit circuits for three leading quantum simulation algorithms, employing diverse techniques to tighten error bounds and optimize circuit implementations. Quantum signal processing appears to be preferred among algorithms with rigorous performance guarantees, whereas higher-order product formulas prevail if empirical error estimates suffice. Our circuits are orders of magnitude smaller than those for the simplest classically-infeasible instances of factoring and quantum chemistry.


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




Recommendations




Cited In (39)





This page was built for publication: Toward the first quantum simulation with quantum speedup

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