Extreme Quantum Advantage when Simulating Classical Systems with Long-Range Interaction

• Published in: Scientific reports Vol. 7; no. 1; pp. 6735 - 11
• Main Authors: Aghamohammadi, Cina, Mahoney, John R, Crutchfield, James P
• Format: Journal Article
• Language: English
• Published: England Nature Publishing Group 27.07.2017; Nature Publishing Group UK; Nature Portfolio
• Subjects: Algorithms; Markov chains; Phase transitions; Quantum computing; Simulation; Stochastic models; Stochasticity
• ISSN: 2045-2322; 2045-2322
• DOI: 10.1038/s41598-017-04928-7

Classical stochastic processes can be generated by quantum simulators instead of the more standard classical ones, such as hidden Markov models. One reason for using quantum simulators has recently come to the fore: they generally require less memory than their classical counterparts. Here, we examine this quantum 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 quantum simulator requires only finite memory. Thus, quantum systems can very efficiently simulate strongly coupled one-dimensional classical spin systems.