Quantum-inspired memory-enhanced stochastic algorithms
arXiv:1906.00263
Abstract
Stochastic models are highly relevant tools in science, engineering, and society. Recent work suggests emerging quantum computing technologies can substantially decrease the memory requirements for simulating stochastic models. Here we show that some of these recent quantum memory-enhanced algorithms can be either implemented or approximated classically. In other words, we show that it is possible to develop quantum-inspired classical algorithms that require much less memory than the best classical algorithms known to date. Being classical, such algorithms could be implemented in state-of-the-art high-performance computers, which could potentially enhance the study of large-scale complex systems. Furthermore, since memory is the main bottleneck limiting the performance of classical supercomputers in one of the most promising avenues to demonstrate quantum 'supremacy', we expect adaptations of these ideas may potentially further raise the bar for near-term quantum computers to reach such a milestone.
arXiv commentMain text: 13 pages & 4 figures + SI: 8 pages & 3 figures. 37 references. Basic example in Sec. III B 2 implemented in https://github.com/quantumself/quantum-inspired-sampling.git --- this was recently implemented with quantum technologies by Ghafari et al. (see arXiv:1812.04251)
References in corpus (11)
- Characterizing Quantum Supremacy in Near-Term Devices
- Computational Mechanics: Pattern and Prediction, Structure and Simplicity
- Stochastic Climate Theory and Modelling
- Quantum-inspired algorithms in practice
- Occam's Quantum Razor: How Quantum Mechanics can reduce the complexity of classical models
- Statistical Complexity of Simple 1D Spin Systems
- A practical, unitary simulator for non-Markovian complex processes
- Experimental quantum processing enhancement in modelling stochastic processes
- Optimal stochastic modelling with unitary quantum dynamics
- Quantum Inspired Training for Boltzmann Machines
- How Quantum is the Speedup in Adiabatic Unstructured Search?