QUANT-PHMLOct 2, 2017

Learning hard quantum distributions with variational autoencoders

arXiv:1710.00725v291 citations
Originality Incremental advance
AI Analysis

This work addresses the problem of efficiently simulating quantum systems for physicists and quantum computing researchers, offering a novel method that could aid in characterizing states for near-term quantum hardware, though it is incremental as it builds on prior machine learning approaches like restricted Boltzmann machines.

The authors tackled the challenge of representing hard-to-sample quantum many-body states by introducing variational autoencoders as a new neural network-based representation, achieving good compression for provably hard quantum states while showing no benefit for random states.

Studying general quantum many-body systems is one of the major challenges in modern physics because it requires an amount of computational resources that scales exponentially with the size of the system.Simulating the evolution of a state, or even storing its description, rapidly becomes intractable for exact classical algorithms. Recently, machine learning techniques, in the form of restricted Boltzmann machines, have been proposed as a way to efficiently represent certain quantum states with applications in state tomography and ground state estimation. Here, we introduce a new representation of states based on variational autoencoders. Variational autoencoders are a type of generative model in the form of a neural network. We probe the power of this representation by encoding probability distributions associated with states from different classes. Our simulations show that deep networks give a better representation for states that are hard to sample from, while providing no benefit for random states. This suggests that the probability distributions associated to hard quantum states might have a compositional structure that can be exploited by layered neural networks. Specifically, we consider the learnability of a class of quantum states introduced by Fefferman and Umans. Such states are provably hard to sample for classical computers, but not for quantum ones, under plausible computational complexity assumptions. The good level of compression achieved for hard states suggests these methods can be suitable for characterising states of the size expected in first generation quantum hardware.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes