本頁只刊出中文翻譯與中文說明；英文原文請見下方原文連結。
原文連結
論文資訊
- 類型：已發表論文
- 日期：2017-07-21
摘要
Classical 隨機 processes can be generated by 量子 simulators instead of the more standard classical ones, such as hidden 馬可夫 models. One reason for using 量子 simulators has recently come to the fore: they generally require less memory than their classical counterparts. Here, we examine this 量子 advantage for strongly coupled spin systems-in particular, the Dyson one-dimensional Ising spin chain with variable interaction length. We find that the advantage scales with both interaction range and temperature, growing without bound as interaction range increases. In particular, simulating Dyson's original spin chain with the most memory-efficient classical algorithm known requires infinite memory, while a 量子 simulator requires only finite memory. Thus, 量子 systems can very efficiently simulate strongl
※ 此為已發表論文，全文需透過期刊付費取得